ACADEMIC REGULATIONS, COURSE STRUCTURE

AND
DETAILED SYLLABUS

B.Tech. R22
Regulation
COMPUTER SCIENCE & ENGINEERING (AI & ML) Under
CBCS

A Four-Year Regular Degree Program

(Applicable for the batches admitted from the Academic Year
2022 – 23) & A Three-Year Regular Degree Program under
Lateral Entry Scheme (LES) (Applicable for the batches
admitted from the Academic Year 2023 – 24)

E N G I N E E R I N G EN G I N E E R S
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
Ananthagiri (V&M), Kodad, Suryapet (Dist), Telangana (India).

ACADEMIC REGULATIONS (R22) FOR B.TECH REGULAR PROGRAM

UNDER CHOICE BASD CREDIT SYSTEM (CBCS)
WITH EFFECT FROM THE ACADEMIC YEAR 2022-23

(Effective for the students admitted into I year from the Academic Year 2022-23 and onwards)

1.0 Under-Graduate Degree Program in Engineering & Technology (UGP in E&T)

Anurag Engineering College (ANRK) offers a 4-year (8 semesters) Bachelor of

Technology (B.Tech.) degree program, under Choice Based Credit System
(CBCS) with effect from the academic year 2022-23.

2.0 Eligibility for Admission

2.1 Admission to the undergraduate (UG) program shall be made either on the
basis of the merit rank obtained by the qualified student in entrance test
conducted by the Telangana State Government (EAMCET) or the University
or on the basis of any other order of merit approved by the University,
subject to reservations as prescribed by the government from time to time.
2.2 The medium of instructions for the entire undergraduate program in
Engineering & Technology will be English only.

3.0 B.Tech. Program Structure

3.1 A student after securing admission shall complete the B.Tech. program in a
minimum period of four academic years (8 semesters), and a maximum
period of eight academic years (16 semesters) starting from the date of
commencement of first year first semester, failing which student shall
forfeit seat in B.Tech course. Each student shall secure 160 credits (with
CGPA≥ 5) required for the completion of the undergraduate program and
award of the B.Tech. degree.
3.2 UGC/ AICTE specified definitions/ descriptions are adopted appropriately for
various terms and abbreviations used in these academic regulations/
norms, which are listed below.
3.2.1 Semester Scheme

Each undergraduate program is of 4 academic years (8 semesters) with the

academic year divided into two semesters of 16 weeks of instructional days
ii
each and in each semester - ‘Continuous Internal Evaluation (CIE)’ and
‘Semester End Examination (SEE)’ under

iii
 Choice Based Credit System (CBCS) and Credit Based Semester
System(CBSS) indicated by UGC, and curriculum/course structure
suggested by AICTE are followed.
3.2.2 Credit Courses

All subjects/ courses are to be registered by the student in a semester to

earn credits which shall be assigned to each subject/ course in an L: T: P: C
(lecture periods: tutorial periods: practical periods: credits) structure based
on the following general pattern.
 One credit for one hour/ week/ semester for Theory/ Lecture (L)
courses or Tutorials.
 One credit for two hours/ week/ semester for Laboratory/ Practical
(P) courses. Courses like Environmental Science, Constitution of
India, Intellectual Property Rights, and Gender Sensitization Lab
are mandatory courses. These courses will not carry any credits.
3.2.3 Subject Course Classification

All subjects/ courses offered for the undergraduate program in E&T

(B.Tech. degree programs) are broadly classified as follows. The College
has followed almost all the guidelines issued by AICTE/UGC.

Broad Course Course

Group/ Course Description
S. No. Classification
Category
1 Includes Mathematics, Physics and
BS - Basic
Sciences Chemistry subjects
2 Foundation ES - Engineering
Courses Includes Fundamental Engineering
Sciences
Subjects
3 (FnC) HS - Humanities Includes subjects related to Humanities,
and Social Social Sciences and Management
Sciences
4 Core PC - Professional Includes core subjects related to the
Courses Core parent
(CoC) Discipline/department/ branch of
Engineering.
5 PE - Includes elective subjects related to the
Professional parent Discipline / department/ branch
Electiv of Engineering.
Electives
e
Elective subjects which include
Cours
6 OE - Open inter disciplinary subjects or
es Electives subjects in an area outside the

iv
 (EℓC) parent discipline/ department/
branch of Engineering.
7 Project Work B.Tech. Project or UG Project or UG
Major
Project or Project Stage I & II
Industry Training/
8 Internship/ Industry Training/ Internship/ Industry
Industry Oriented Oriented Mini-Project/ Mini-Project/
Mini project Skill Development Courses
Core /Mini-Project/Skill
Courses Development
courses
Seminar/ Colloquium based on core
9 Seminar contents related to parent discipline/
department/ branch of Engineering.
10 Minor - 1 or 2 Credit Courses (subset of HS)
Courses
Mandatory
11 - Mandatory Courses (non-credit)
Courses
(MC)

4.0 Course Registration

4.1 A ‘faculty advisor or Academic counselor’ shall be assigned to a group of 20

students, who will advise the students about the undergraduate program,
its course structure and curriculum, choice/option for subjects/ courses,
based on their competence, progress, pre- requisites and interest.
4.2 The academic section of the college invites ‘registration forms’ from
students before the beginning of the semester through ‘on-line
registration’, ensuring ‘date and time stamping’. The online registration
requests for any ‘current semester’ shall be completed before the commencement
of SEEs (Semester End Examinations) of the ‘preceding semester’.
4.3 A student can apply for on-line registration, only after obtaining the ‘written
approval’ from faculty advisor/counselor, which should be submitted to the
college academic section through the Head of the Department. A copy of it
shall be retained with the Head of the Department, Faculty Advisor/
Counselor and the student.
4.4 A student may be permitted to register for all the subjects/ courses in a
semester as specified in the course structure with maximum additional
subject(s)/course(s) limited to 6 Credits (any 2 elective subjects), based on
progress and SGPA/ CGPA, and completion of the ‘pre- requisites’ as indicated
for various subjects/ courses, in the department course structure and
syllabus contents.

v
4.5 Choice for ‘additional subjects/courses’, not more than any 2 elective subjects in
any Semester, must be clearly indicated, which needs the specific approval
and signature of the Faculty Advisor/Mentor/HOD.
4.6 If the student submits ambiguous choices or multiple options or erroneous
entries during online registration for the subject(s) / course(s) under a given/
specified course group/ category as listed in the course structure, only the
first mentioned subject/ course in that category will be taken into
consideration.
4.7 Subject/ course options exercised through on-line registration are final and
cannot be changed or inter-changed; further, alternate choices also will not
be considered. However, if the subject/ course that has already been listed
for registration by the Head of the Department in a semester could not be
offered due to any inevitable or unexpected reasons, then the student shall
be allowed to have alternate choice either for a new subject (subject to
offering of such a subject), or for another existing subject (subject to

vi
 availability of seats). Such alternate arrangements will be made by the
Head of the Department, with due notification and time-framed schedule,
within a week after the commencement of class-work for that semester.
4.8 Dropping of subjects/ courses may be permitted, only after obtaining prior
approval from the faculty advisor/ counselor ‘within a period of 15 days’
from the beginning of the current semester.
4.9 Open Electives: The students have to choose three Open Electives (OE-I, II &
III) from the list of Open Electives given by other departments. However,
the student can opt for an Open Elective subject offered by his own
(parent) department, if the student has not registered and not studied that
subject under any category (Professional Core, Professional Electives,
Mandatory Courses etc.) offered by parent department in any semester.
Open Elective subjects already studied should not repeat/should not match
with any category (Professional Core, Professional Electives, Mandatory
Courses etc.) of subjects even in the forthcoming semesters.
4.10 Professional Electives: The students have to choose six Professional Electives
(PE-I to VI) from the list of professional electives given.

5.0 Subjects/ courses to be offered

5.1 A subject/ course may be offered to the students, only if a minimum of 15

students opt for it.
5.2 More than one faculty member may offer the same subject (lab/ practical may be
included with the corresponding theory subject in the same semester) in
any semester. However, selection of choice for students will be based on -
‘first come first serve basis and CGPA criterion’ (i.e. the first focus shall be on
early on-line entry from the student for registration in that semester, and the
second focus, if needed, will be on CGPA of the student).
5.3 If more entries for registration of a subject come into picture, then the
Head of the Department concerned shall decide, whether or not to offer
such a subject/ course for two (or multiple) sections.
5.4 In case of options coming from students of other departments/ branches/
disciplines (not considering open electives), first priority shall be given to the
student of the ‘parent department’.

6.0 Attendance requirements:

6.1 A student shall be eligible to appear for the semester end examinations, if
the student acquires a minimum of 75% of attendance in aggregate of all
the subjects/ courses (including attendance in mandatory courses like
Environmental Science, Constitution of India, Intellectual Property Rights,
and Gender Sensitization) for that semester. Two periods of attendance for
each theory subject shall be considered, if the student appears for the
mid- term examination of that subject. This attendance should also be included in
the monthly attendance submitted to the Principal.

vii
6.2 Shortage of attendance in aggregate up to 10% (65% and above, and below
75%) in each semester may be condoned by the college academic
committee on genuine and valid grounds, based on the student’s
representation with supporting evidence.
6.3 A stipulated fee shall be payable for condoning of shortage of attendance.
6.4 Shortage of attendance below 65% in aggregate shall in NO case be condoned.
6.5 Students whose shortage of attendance is not condoned in any semester are not
eligible to take their end examinations of that semester. They get detained and their
registration for that semester shall stand cancelled, including all academic
credentials (internal marks etc.) of that semester. They will not be promoted to
the next semester. They may seek re- registration for all those subjects
registered in that semester in which the student is detained, by seeking re-
admission into that semester asand when offered; if there are any
professional electives and/ or open electives, the same may also be re-
registered if offered. However, if those electives are not offered in later
semesters, then alternate electives may be chosen from the same set of
elective subjects offered under that category.
6.6 A student fulfilling the attendance requirement in the present semester
shall not be eligible for readmission into the same class.

7.0 Academic Requirements

The following academic requirements have to be satisfied, in addition to

the attendance requirements mentioned in Item No. 6.
7.1 A student shall be deemed to have satisfied the academic requirements and
earned the
credits allotted to each subject/ course, if student secures not less than
35% (14 marks out of 40 marks) in the Continuous Internal Evaluation
(CIE), not less than 35% (21 marks out of 60 marks) in the semester end
examinations (SEE), and a minimum of 40% (40 marks out of 100 marks) in
the sum total of the CIE (Continuous Internal Evaluation) and SEE
(Semester End Examination) taken together; in terms of letter grades, this
implies securing ‘P’ grade or above in that subject/ course.
7.2 A student shall be deemed to have satisfied the academic requirements and
earned the
credits allotted to Real-time Research Project (or) Field Based Research
Project (or) Industry Oriented Mini Project (or) Internship (or) Seminar, if
the student secures not less than 40% marks (i.e. 40 out of 100 allotted
marks) in each of them. The student is deemed to have failed, if he (i) does
not submit a report on Industry Oriented Mini Project/Internship, or (ii) not
make a presentation of the same before the evaluation committee as per
schedule, or (iii) secures less than 40% marks in Real-time Research
Project (or) Field Based Research Project (or) Industry Oriented Mini
viii
 Project (or) Internship evaluations. A student may reappear once for each
of the above evaluations, when they are scheduled again; if the student fails
in such ‘one reappearance’ evaluation also, the student has to reappear for
the same in the next subsequent semester, as and when it is scheduled.

7.3 Promotion Rules

ix
 S. No. Promotion Conditions to be fulfilled
1 First year first semester Regular course of study of first year first
to first year second semester.
semester
(i) Regular course of study of first year
second semester.
First year second
(ii) Must have secured at least 20 credits out of
semester to Second
40 credits i.e., 50% credits up to first year second
year first semester
semester from all the relevant regular and
supplementary examinations, whether the
student takes those examinations or not.
3. Second year Regular course of study of second year first
first semester.
semester to Second
year
second semester
(i) Regular course of study of second year
second semester.
Second year second (ii) Must have secured at least 48 credits out of
semester to Third year 80 credits i.e., 60% credits up to second year second
first semester semester from all the relevant regular and
supplementary examinations, whether the
student takes those examinations or not.

Third year first semester

Regular course of study of third year first
to Third year second
semester.
semester
(i) Regular course of study of third year
second semester.
Third year second (ii) Must have secured at least 72 credits out of
semester to Fourth 120 credits i.e., 60% credits up to third year second
year first semester semester from all the relevant regular and
supplementary examinations, whether the
student takes those examinations or not.
Fourth year first semester
Regular course of study of fourth year
to Fourth year second
first semester.
semester

7.4 A student (i) shall register for all courses/subjects covering 160 credits as
specified and listed in the course structure, (ii) fulfills all the attendance
and academic requirements for 160 credits, (iii) earn all 160 credits by
securing SGPA 5.0 (in each semester), and CGPA ≥ 5 (at the end of 8
x
semesters), (iv) passes all the mandatory courses, to successfully complete the
undergraduate program. The performance of the student in these
160 credits shall be considered for the calculation of the final CGPA (at the
end of undergraduate program), and shall be indicated in the grade card /
marks memo of IV-

xi
 year II semester.
7.5 If a student registers for ‘extra subjects’ (in the parent department or other
departments/branches of Engg.) other than those listed subjects totaling to
160 credits as specified in the course structure of his department, the
performances in those ‘extra subjects’ (although evaluated and graded using
the same procedure as that of the required 160 credits) will not be
considered while calculating the SGPA and CGPA. For such ‘extra subjects’
registered, percentage of marks and letter grade alone will be indicated in
the grade card / marks memo as a performance measure, subject to
completion of the attendance and academic requirements as stated in
regulations Items6 and 7.1 – 7.4 above.
7.6 A student eligible to appear in the semester end examination for any
subject/ course, but absent from it or failed (thereby failing to secure ‘P’
grade or above) may reappear for that subject/ course in the
supplementary examination as and when conducted. In such cases, internal
marks (CIE) assessed earlier for that subject/ course will be carried over,
and added to
the marks to be obtained in the SEE supplementary examination for
evaluating performance in that subject.
7.7 A student detained in a semester due to shortage of attendance may be re-admitted
in the same semester in the next academic year for fulfillment of academic
requirements. The academic regulations under which a student has been re-
admitted shall be applicable. Further, no grade allotments or SGPA/
CGPA calculations will be done for the entire semester in which the
student has been detained.
7.8 A student detained due to lack of credits, shall be promoted to the next academic
year only after acquiring the required number of academic credits. The academic
regulations under which the student has been readmitted shall be
applicable to him.

8.0 Evaluation - Distribution and Weightage of Marks

8.1 The performance of a student in every subject/course (including practical’s
and Project Stage
- II) will be evaluated for 100 marks each, with 40 marks allotted for
CIE (Continuous Internal Evaluation) and 60 marks for SEE (Semester
End-Examination). The Project Stage – I will be evaluated for 100 marks
internally.
8.2 In CIE, for theory subjects, during a semester, there shall be two mid-term
examinations. Each Mid-Term examination consists of two parts i) Part – A
for 10 marks, ii) Part – B for 20 marks with a total duration of 2 hours as
follows:
1. Mid Term Examination for 30 marks:
a. Part - A : Objective/quiz paper for 10 marks.
xii
 The objective/quiz paper is set with multiple choice, fill-in the blanks
and match the following type of questions for a total of 10 marks.
b. Part - B : Descriptive paper for 20 marks.
The descriptive paper shall contain 6 full questions out of
which, the student has to answer 4 questions, each carrying 5
marks.

xiii
 The average of the two Mid Term Examinations shall be taken as the
final marks for Mid Term Examination (for 30 marks).
The remaining 10 marks of Continuous Internal Evaluation are distributed as:
2. Assignment for 5 marks. (Average of 2 Assignments each for 5 marks)
3. Subject Viva-Voce/PPT/Poster Presentation/ Case Study on a
topic in the concerned subject for 5 marks.
While the first mid-term examination shall be conducted on 50% of the
syllabus, the second mid-term examination shall be conducted on the
remaining 50% of the syllabus.
Five (5) marks are allocated for assignments (as specified by the subject
teacher concerned). The first assignment should be submitted before the
conduct of the first mid-term examination, and the second assignment
should be submitted before the conduct of the second mid-term
examination. The average of the two assignments shall be taken as the final
marks for assignment (for 5 marks).
Subject Viva-Voce/PPT/Poster Presentation/ Case Study on a topic in the
subject concerned for 5 marks before II Mid-Term Examination.
 The Student, in each subject, shall have to earn 35% of marks (i.e. 14
marks out of 40 marks) in CIE, 35% of marks (i.e. 21 marks out of 60)
in SEE and Overall 40% of marks (i.e. 40 marks out of 100 marks)
both CIE and SEE marks put together.
The student is eligible to write Semester End Examination of the concerned subject, if the
student scores ≥ 35% (14 marks) of 40 Continuous Internal Examination (CIE) marks.
In case, the student appears for Semester End Examination (SEE) of the concerned subject but
not scored minimum 35% of CIE marks (14 marks out of 40 internal marks), his
performance in that subject in SEE shall stand cancelled in spite of appearing the SEE. There is
NO Computer Based Test (CBT) for R22 regulations.
The details of the end semester question paper pattern are as follows:
8.2.1 The semester end examinations (SEE), for theory subjects, will be
conducted for 60marks consisting of two parts viz. i) Part- A for 10
marks, ii) Part - B for 50 marks.
 Part-A is a compulsory which consists of ten questions. Two questions
from each unit. Each question carries one mark.
 Part-B consists of five questions carrying 10 marks each. Each of these
questions is from each unit and may contain sub-questions. For
each question there will be an “either” “or” choice, which means that
there will be two questions from each unit and the student should answer
either of the two questions.
 The duration of Semester End Examination is 3 hours.
8.3 For practical subjects there shall be a Continuous Internal Evaluation (CIE)
during the semester for 40 marks and 60 marks for semester end
examination. Out of the 40 marks for internal evaluation:
xiv
1. A write-up on day-to-day experiment in the laboratory (in terms of
aim, components/procedure, expected outcome) which shall be
evaluated for 10 marks
2. 10 marks for viva-voce (or) tutorial (or) case study (or) application (or)
poster presentation of the course concerned.

xv
 3. Internal practical examination conducted by the laboratory teacher
concerned shall be evaluated for 10 marks.
4. The remaining 10 marks are for Laboratory Project, which consists of
the Design (or) Software / Hardware Model Presentation (or) App
Development (or) Prototype Presentation submission which shall be
evaluated after completion of laboratory course and before semester
end practical examination.
For Practical / laboratory subjects / courses, CIE marks will be considered
only if a student appear for the concerned MID Term Examination.
The practical SEE shall be conducted with an external examiner along with
the internal examiner. The external examiner shall be appointed by the
Principal from the panel of examiners recommended by Chairman, Board of
Studies / HoD of the respective branch / department.
In the Semester End Examination held for 3 hours, total 60 marks are
divided and allocated as shown below:
1. 10 marks for write-up
2. 15 for experiment/program
3. 15 for evaluation of results
4. 10 marks for presentation on another experiment/program in the
same laboratory course and
5. 10 marks for viva-voce on concerned laboratory course.

 The Student, in each subject, shall have to earn 35% of marks (i.e. 14
marks out of 40 marks) in CIE, 35% of marks (i.e. 21 marks out of
60) in SEE and Over all 40% of marks (i.e. 40 marks out of 100
marks) both CIE and SEE marks put together.
The student is eligible to write Semester End Examination of the concerned subject, if the
student scores ≥ 35% (14 marks) of 40 Continuous Internal Examination (CIE) marks. In case,
the student appears for Semester End Examination (SEE) of the concerned subject but not
scored minimum 35% of CIE marks (14 marks out of 40 internal marks), his performance in that
subject in SEE shall stand cancelled inspite of appearing the SEE.
8.4 The evaluation of courses having ONLY internal marks in I Year I Semester
and II Year II Semester is as follows:
1. I Year I Semester course (ex., Elements of CE/ME/EEE/ECE/CSE etc): The
internal evaluation is for 50 marks and it shall take place during I
Mid-Term examination and II Mid-Term examination. The average
marks of two Mid-Term examinations is the final for 50 marks.
Student shall have to earn 40%, i.e 20 marks out of 50 marks from
average of the two examinations. There shall be NO external
evaluation. The student is deemed to have failed, if he (i) is absent
as per schedule, or (ii) secures less than 40% marks in this course.

xvi
2. II Year II Semester Real-Time (or) Field-based Research Project course: The
internal evaluation is for 50 marks and it shall take place during I
Mid-Term examination and II Mid-Term examination. The average
marks of two Mid-Term examinations is the final for 50 marks.
Student shall have to earn 40%, i.e 20 marks out of 50

xvii
 marks from average of the two examinations. There shall be NO
external evaluation. The student is deemed to have failed, if he (i)
does not submit a report on the Project, or (ii) does not make a
presentation of the same before the internal committee as per
schedule, or
(ii) secures less than 40% marks in this course.
8.5 There shall be an Industry training (or) Internship (or) Industry oriented
Mini-project (or) Skill Development Courses (or) Paper presentation in
reputed journal (or) Industry Oriented Mini Project in collaboration with an
industry of their specialization. Students shall register for this immediately
after II-Year II Semester Examinations and pursue it during summer
vacation/semester break & during III Year without effecting regular course
work. Internship at reputed organization (or) Skill development courses (or)
Paper presentation in reputed journal (or) Industry Oriented Mini Project
shall be submitted in a report form and presented before the committee in
III-year II semester before end semester examination. It shall be evaluated
for 100 external marks. The committee consists of an External Examiner,
Head of the Department, Supervisor of the Industry Oriented Mini Project
(or) Internship etc, Internal Supervisor and a Senior Faculty Member of the
Department. There shall be NO internal marks for Industry Training (or)
Internship (or) Mini-Project (or) Skill Development Courses (or) Paper
Presentation in reputed journal (or) Industry Oriented Mini Project.
8.6 The UG project shall be initiated at the end of the IV Year I Semester and
the duration of the project work is one semester. The student must present
Project Stage – I during IV Year I Semester before II Mid examinations, in
consultation with his Supervisor, the title, objective and plan of action of
his Project work to the departmental committee for approval before
commencement of IV Year II Semester. Only after obtaining the approval of
the departmental committee, the student can start his project work.
8.7 UG project work shall be carried out in two stages: Project Stage – I for
approval of project before Mid-II examinations in IV Year I Semester and
Project Stage – II during IV Year II Semester. Student has to submit project
work report at the end of IV Year II Semester. The project shall be
evaluated for 100 marks before commencement of SEE Theory
examinations.
8.8 For Project Stage – I, the departmental committee consisting of Head of
the Department, project supervisor and a senior faculty member shall
approve the project work to begin before II Mid-Term examination of IV
Year I Semester. The student is deemed to be not eligible to register for the
Project work, if he does not submit a report on Project Stage
- I or does not make a presentation of the same before the evaluation

xvii
i
 committee as per schedule.
A student who has failed may reappear once for the above evaluation, when
it is scheduled again; if he fails in such ‘one reappearance’ evaluation also,
he has to reappear for the same in the next subsequent semester, as and
when it is scheduled.
8.9 For Project Stage – II, the external examiner shall evaluate the project
work for 60 marks and the internal project committee shall evaluate it for 40
marks. Out of 40 internal marks, the departmental committee consisting of
Head of the Department, Project Supervisor

xix
 and a Senior Faculty Member shall evaluate the project work for 20 marks
and Project Supervisor shall evaluate for 20 marks. The topics for Industry
Oriented Mini Project/ Internship/SDC etc. and the main Project shall be
different from the topic already taken. The student is deemed to have
failed, if he (i) does not submit a report on the Project, or (ii) does not make
a presentation of the same before the External Examiner as per schedule,
or (iii) secures less than 40% marks in the sum total of the CIE and SEE
taken together.
For conducting viva-voce of project, Principal / Chief Controller of
Examination selects an external examiner from the list of experts in the
relevant branch submitted by the BoS Chairperson / HoD.
A student who has failed, may reappear once for the above evaluation,
when it is scheduled again; if student fails in such ‘one reappearance’
evaluation also, he has to reappear for the same in the next subsequent
semester, as and when it is scheduled.
8.10 A student shall be given only one time chance to re-register for a maximum
of two subjects in a semester:
 If the internal marks secured by a student in the Continuous Internal
Evaluation marks for 40 (Sum of average of two mid-term
examinations consisting of Objective & descriptive parts, Average of
two Assignments & Subject Viva- voce/PPT/ Poster presentation/
Case Study on a topic in the concerned subject) are less than 35%
and failed in those subjects.
A student must re-register for the failed subject(s) for 40 marks within four
weeks of commencement of the classwork in next academic year.
In the event of the student taking this chance, his Continuous Internal
Evaluation marks for 40 and Semester End Examination marks for 60
obtained in the previous attempt stand cancelled.
8.11 For the subjects having design and / or drawing, (such as Engineering
Graphics, Engineering Drawing, Machine Drawing) and estimation, the
distribution shall be 40 marks for internal evaluation (20 marks for day-to-
day work and 20 marks for Internal Examinations) and 60 marks for
Semester End Examination. There shall be two midterm examinations in a
semester and the average of the two shall be considered for the award of
marks for midterm examinations. The 20 marks for day-to-day work shall
be considered only if the student attends the midterm examination when
conducted.
8.12 For subjects like Engineering Graphics/Engineering Drawing, the SEE shall
consist of five questions. For each question there will be an “either” “or”
choice, which means that there will be two questions from each unit and
the student should answer either of the two questions. Each question
xx
 carries 12 marks. There shall be no Part – A, and Part – B system.
8.13 For mandatory courses of, Gender Sensitization, Human Values and
Professional Ethics, Constitution of India and Intellectual Property Rights, a
student has to secure 40 marks out of 100 marks (i.e. 40% of the marks
allotted) in the Continuous Internal Evaluation for passing the
subject/course. These marks should also be processed along with the
internal marks of other subjects. There is no Semester End
Examination for mandatory

xxi
 courses.
8.14 No marks or letter grades shall be allotted for mandatory/non-credit
courses. Only Pass/Fail shall be indicated in Grade Card.

9.0 Grading Procedure

9.1 Grades will be awarded to indicate the performance of students in each

Theory Subject, Laboratory/Practicals/ Industry-Oriented Mini
Project/Internship/SDC and Project Stage. Based on the percentage of
marks obtained (Continuous Internal Evaluation plus Semester End
Examination, both taken together) as specified in item 8 above, a
corresponding letter grade shall be given.
9.2 As a measure of the performance of a student, a 10-point absolute grading
system using the following letter grades (as per UGC/AICTE guidelines) and
corresponding percentage of marks shall be followed:

% of Marks Secured in a Subject/Course Letter Grade

Grade Points
(Class Intervals) (UGC Guidelines)
O
Greater than or equal to 90% 10
(Outstanding)

80 and less than 90% A+ 9

(Excellent)
A
70 and less than 80% 8
(Very Good)

60 and less than 70% B+ 7

(Good)
B
50 and less than 60% 6
(Average)
P
40 and less than 50% 5
(Pass)
F
Below 40% 0
(FAI
L
)

Absent Ab 0

9.3 A student who has obtained an ‘F’ grade in any subject shall be deemed to
have ‘failed ‘and is required to reappear as a ‘supplementary student’ in the
semester end examination, as and when offered / conducted. In such cases,
internal marks in those subjects will remain the same as those obtained
earlier.
9.4 To a student who has not appeared for an examination in any subject, ‘Ab’
grade will be allocated in that subject, and he is deemed to have ‘Failed’. A
student will be required to reappear as a ‘supplementary student’ in the
semester end examination, as and when offered next. In this case also, the
xxii
 internal marks in those subjects will remain the same as those obtained
earlier.
9.5 A letter grade does not indicate any specific percentage of marks secured
by the student, but it indicates only the range of percentage of marks.

xxii
i
9.6 A student earns Grade Point (GP) in each subject/ course, on the basis of
the letter grade secured in that subject/ course. The corresponding ‘Credit
Points’ (CP) are computed by multiplying the grade point with credits for
that particular subject/ course.
Credit Points (CP) = Grade Point (GP) x Credits …. For a course
9.7 A student passes the subject/ course only when GP ≥ 5 (‘P’ grade or above).
9.8 The Semester Grade Point Average (SGPA) is calculated by dividing the
sum of credit points ( CP) secured from all subjects/ courses registered in a
semester, by the total number of credits registered during that semester.
SGPA is rounded off to two decimal places. SGPA is thus computed as

where ‘i’ is the subject indicator index (considering all subjects in a

semester), ‘N’ is the no. of subjects ‘registered’ for the semester (as
specifically required and listed under the course structure of the parent
department), Ci is the no. of credits allotted to the ith subject, and Gi
represents the grade points (GP) corresponding to the letter grade awarded
for that ith subject.
9.9 The Cumulative Grade Point Average (CGPA) is a measure of the overall
cumulative performance of a student in all semesters considered for
registration. The CGPA is the ratio of the total credit points secured by a
student in all registered courses (of 160) in all semesters, and the total
number of credits registered in all the semesters. CGPA is rounded off to
two decimal places. CGPA is thus computed from the I year II semester
onwards at the end of each semester as per the formula

where ‘M’ is the total no. of subjects (as specifically required and listed
under the course structure of the parent department) the student has
‘registered’ i.e., from the 1st semester onwards up to and inclusive of the 8th
semester, ‘j’ is the subject indicator index (takes into account all subjects
from 1 to 8 semesters), Cj is the no. of credits allotted to the jth subject,
and Gj represents the grade points (GP) corresponding to the letter grade
awarded for that jth subject. After registration and completion of I year I
semester, the SGPA of that semester itself may be taken as the CGPA, as
there are no cumulative effects.
Illustration of calculation of SGPA:

Course/ Subject Credits Letter Grade Grade Points Credit Points

xxi
v
 Course 1 4 A 8 4 x 8 = 32
Course 2 4 O 10 4 x 10 = 40
Course 3 4 P 5 4 x 5 = 20
Course 4 3 B 6 3 x 6 = 18
Course 5 3 A+ 9 3 x 9 = 27
Course 6 3 P 5 3 x 5 = 15
21 152

SGPA = 152/21 = 7.24

Illustration of Calculation of CGPA up to 3rd Semester:

Corresponding
Course/ Credits Letter Grade Credit Points
Semester Grade Point
Subject Title Allotted Secured (CP)
(GP)
I Course 1 3 A 8 24
I Course 2 3 O 10 30
I Course 3 3 B 6 18
I Course 4 4 A 8 32
I Course 5 3 A+ 9 27
I Course 6 4 P 5 20
II Course 7 4 B 6 24
II Course 8 4 A 8 32
II Course 9 3 P 5 15
II Course 10 3 O 10 30
II Course 11 3 B+ 7 21
II Course 12 4 B 6 24
II Course 13 4 A 8 32
II Course 14 3 O 10 30
III Course 15 2 A 8 16
III Course 16 1 P 5 5
III Course 17 4 O 10 40
III Course 18 3 B+ 7 21
III Course 19 4 B 6 24
III Course 20 4 A 8 32
III Course 21 3 B+ 7 21
Total Total Credit
69 518
Credits Points
CGPA = 518/69 = 7.51
The calculation process of CGPA illustrated above will be followed for each
subsequent semester until 8th semester. The CGPA obtained at the end of
8th semester will become the final CGPA secured for entire B.Tech.
program.
9.10 For merit ranking or comparison purposes or any other listing, only the
‘rounded off’
xxv
 values of the CGPAs will be used.
9.11 SGPA and CGPA of a semester will be mentioned in the semester
Memorandum of Grades if all subjects of that semester are passed in first
attempt. Otherwise the SGPA and CGPA shall be mentioned only on the
Memorandum of Grades in which sitting he passed his last exam in that
semester. However, mandatory courses will not be taken into

xxv
i
 consideration.
10.0 Passing Standards
10.1 A student shall be declared successful or ‘passed’ in a semester, if he
secures a GP ≥ 5 (‘P’ grade or above) in every subject/course in that
semester (i.e. when the student gets an SGPA
≥ 5.0 at the end of that particular semester); and he shall be declared
successful or ‘passed’ in the entire undergraduate program, only when gets
a CGPA ≥ 5.0 (‘P’ grade or above) for the award of the degree as required.
10.2 After the completion of each semester, a grade card or grade sheet shall be
issued to all the registered students of that semester, indicating the letter
grades and credits earned. It will show the details of the courses registered
(course code, title, no. of credits, grade earned, etc.) and credits earned.
There is NO exemption of credits in any case.

11.0 Declaration of results

11.1 Computation of SGPA and CGPA are done using the procedure listed in 9.6 to
9.9.
11.2 For final percentage of marks equivalent to the computed final CGPA,
the following formula may be used.
% of Marks = (final CGPA – 0.5) x 10
12.0 Award of Degree
12.1 A student who registers for all the specified subjects/ courses as listed in
the course structure and secures the required number of 160 credits (with
CGPA 5.0), within 8 academic years from the date of commencement of the
first academic year, shall be declared to have ‘qualified’ for the award of
B.Tech. degree in the branch of Engineering selected at the time of
admission.
12.2 A student who qualifies for the award of the degree as listed in item 12.1
shall be placed in the following classes.
12.3 A student with final CGPA (at the end of the undergraduate program) ≥
8.00, and
fulfilling the following conditions - shall be placed in ‘First Class with Distinction’.
However, he
(i) Should have passed all the subjects/courses in ‘First Appearance’ within the
first 4

academic years (or 8 sequential semesters) from the date of

commencement of first year first semester.
(ii) Should not have been detained or prevented from writing the
semester end examinations in any semester due to shortage of
attendance or any other reason.
A student not fulfilling any of the above conditions with final CGPA ≥ 8.0
shall be placed in
xxv
ii
 ‘First Class’.
12.4 Students with final CGPA (at the end of the undergraduate program) 7.0
but < 8.00 shall be placed in ‘First Class’.
12.5 Students with final CGPA (at the end of the undergraduate program) 6.00 but
< 7.00,

xxv
iii
 shall be placed in ‘Second Class’.
12.6 All other students who qualify for the award of the degree (as per item
12.1), with finalCGPA (at the end of the undergraduate program) 5.00
but < 6, shall be placed in ‘pass class’.
12.7 A student with final CGPA (at the end of the undergraduate program)
< 5.00 will not be eligible for the award of the degree.
12.8 Students fulfilling the conditions listed under item 12.3 alone will be
eligible for award of ‘Gold Medal’.
12.9 Award of 2-Year B.Tech. Diploma Certificate
1. A student is awarded 2-Year UG Diploma Certificate in the concerned
engineering branch on completion of all the academic requirements
and earned all the 80 credits (within 4 years from the date of
admission) up to B.Tech. II Year II Semester, if the student want to
exit the 4-Year B.Tech. program and requests for the 2 -Year B. Tech. (UG)
Diploma Certificate.
2. The student once opted and awarded 2-Year UG Diploma Certificate, the
student will be permitted to join in B. Tech. III Year I Semester and
continue for completion of remaining years of study for 4-Year B.
Tech. Degree ONLY in the next academic year along with next batch
students. However, if any student wishes to continue the study after opting for exit,
he/she should register for the subjects/courses in III Year I Semester before
commencement of classwork for that semester.
3. The students, who exit the 4-Year B. Tech. program after II Year of study and wish to re-
join the B.Tech. program, must submit the 2 -Year B. Tech. (UG) Diploma Certificate
awarded to him, subject to the eligibility for completion of Course/Degree.
4. A student may be permitted to take one year break after completion
of II Year II Semester or B. Tech. III Year II Semester (with university
/ College permission through the principal of the college well in
advance) and can re-enter the course in next Academic Year in the same
college and complete the course on fulfilling all the academic
credentials within a stipulated duration i.e. double the duration of
the course (Ex. within 8 Years for 4-Year program).

13.0 Withholding of results

13.1 If the student has not paid the fees to the College / University at any
stage, or has dues pending due to any reason whatsoever, or if any case of
indiscipline is pending, the result of
the student may be withheld, and the student will not be allowed to go into
the next higher semester. The award or issue of the degree may also be
withheld in such cases.

xxi
x
14.0 Transitory Regulations
A. For students detained due to shortage of attendance:
1. A Student who has been detained in I year I Semester of R18
Regulations due to lack of attendance, shall be permitted to join
I year I Semester of R22

xxx
 Regulations and he is required to complete the study of
B.Tech. program within the stipulated period of eight academic
years from the date of first admission in I Year I Semester.
2. A student who has been detained in any semester of II, III
and IV years of R18 regulations for want of attendance, shall
be permitted to join the corresponding semester of R22
Regulations and is required to complete the study of B.Tech.
within the stipulated period of eight academic years from the
date of first admission in I Year. The R22 Academic
Regulations under which a student has been readmitted shall
be applicable to that student from that semester. See rule (C)
for further Transitory Regulations.
B. For students detained due to shortage of credits:
3. A student of R18 Regulations who has been detained due to
lack of credits, shallbe promoted to the next semester of R22
Regulations only after acquiring the required number of credits
as per the corresponding regulations of his/her first admission.
The total credits required are 160 including both R18 & R22
regulations. The student is required to complete the study of
B.Tech. within the stipulated period of eight academic years
from the year of first admission. The R22 Academic
Regulations are applicable to a student from the year of
readmission. See rule (C) for further Transitory Regulations.
C. For readmitted students in R22 Regulations:
4. A student who has failed in any subject under any
regulation has to pass those subjects in the same
regulations.
5. The maximum credits that a student acquires for the
award of degree, shall be the sum of the total number of
credits secured in all the regulations of his/her study
including R22 Regulations. There is NO exemption of credits in
any case.
6. If a student is readmitted to R22 Regulations and has
any subject with 80% of syllabus common with his/her
previous regulations, that particular subject in R22
Regulations will be substituted by another subject to be
suggested by the concerned BoS and approved by CAC.
Note: If a student readmitted to R22 Regulations and has not studied any
subjects/topics in his/her earlier regulations of study which is prerequisite
for further subjects in R22 Regulations, the College Principal shall conduct
remedial classes to cover those subjects/topics for the benefit of the

xxx
i
 students.

15.0 Student Transfers

15.1 There shall be no branch transfers after the completion of admission process.
15.2 The students seeking transfer to ANRK from various other
Universities/institutions have to pass the failed subjects which are
equivalent to the subjects of JNTUH, and also pass

xxx
ii
 the subjects of JNTUH which the students have not studied at the earlier
institution. Further, though the students have passed some of the subjects
at the earlier institutions, if the same subjects are prescribed in different
semesters of JNTUH, the students have to study those subjects in JNTUH
in spite of the fact that those subjects are repeated.
15.3 The transferred students from other Universities/Institutions to JNTUH
affiliated colleges who are on rolls are to be provided one chance to write
the CBT (for internal marks) in the equivalent subject(s) as per the clearance
letter issued by the University.
15.4 The autonomous affiliated colleges have to provide one chance to write the
internal examinations in the equivalent subject(s) to the students transferred
from other universities/institutions to JNTUH autonomous affiliated colleges
who are on rolls, as per the clearance (equivalence) letter issued by the
University.

16.0 Scope
16.1 The academic regulations should be read as a whole, for the purpose of any
interpretation.
16.2 In case of any doubt or ambiguity in the interpretation of the above rules,
the decision of the Vice-Chancellor is final.
16.3 The University may change or amend the academic regulations, course
structure or syllabi at any time, and the changes or amendments made shall
be applicable to all students with effect from the dates notified by the
University authorities.
16.4 Where the words “he”, “him”, “his”, occur in the regulations, they
include “she”, “her”, “hers”.
****

xxx
iii
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
Ananthagiri (V&M), Kodad, Suryapet (Dist), Telangana (India).
ACADEMIC REGULATIONS (R22) (CBCS) FOR B.TECH (LATERAL ENTRY
SCHEME) FROM THE ACADEMIC YEAR 2023-24

1. Eligibility for the award of B.Tech Degree (LES)

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

S. No Promotion Conditions to be fulfilled

1 Second year first Regular course of study of second year
semester to second year first semester.
second semester
2 Second year second (i) Regular course of study of second
semester to third year year second semester.
first semester (ii) Must have secured at least 24 credits
out of 40 credits i.e., 60% credits up to
second year second semester from all the
relevant regular and supplementary
examinations, whether the student takes
those examinations or not.
3 Third year first semester Regula cours of stud of thir yea firs
to third year second r e y d r t
semester semest
er.
4 Third year second (i) Regular course of study of third year
semester to fourth year second semester.
first semester (ii) Must have secured at least 48 credits
out of
80 credits i.e., 60% credits up to third
year second semester f r o m all the
relevant regular and
supplementary examinations, whether

xx
xiv
 the student takes those examinations or
not.
5 Fourth year first semester Regular course of study of fourth year
to fourth year second first semester.
semester
6. All the other regulations as applicable to B. Tech. 4-year degree course (Regular)
will hold good for B. Tech. (Lateral Entry Scheme).
7. LES students are not eligible for 2-Year B. Tech. Diploma Certificate.
****

xx
xv
 Malpractices Rules
Disciplinary Action For / Improper Conduct in Examinations
Nature of Malpractices/Improper Punishment
conduct
If the student:
Possesses or keeps accessible in Expulsion from the examination hall
examination hall, any paper, and cancellation of the performance in
note book, programmable that subject only.
calculators, cell phones, pager,
palm computers or any other
form of material concerned with
1. (a) or related to the subject of the
examination (theory or practical)
in which student is appearing
but has not made use of
(material shall include any marks
on the body of the student which
can be used as an aid in
the subject of the examination).
Gives assistance or guidance or Expulsion from the examination hall
receives it from any other and cancellation of the performance in
(b) student orally or by any other that subject only of all the students
body language methods or involved. In case of an outsider, he
communicates through cell will be handed over to the police and
phones with any student or a case is registered against him.
persons in or outside the
exam hall in respect of any
matter.
2. Has copied in the examination Expulsion from the examination hall
hall from any paper, book, and cancellation of the performance in
programmable calculators, that subject and all other subjects the
palm computers or any other student has already appeared
form of material relevant to the including practical examinations and
subject of the examination project work and shall not be permitted
(theory or practical) in which to appear for the remaining
the student is appearing. examinations of the
subjects of that semester/year.
3. Impersonates any other The student who has impersonated
student in shall be expelled from examination
connection with the hall. The student is also debarred and
examination. forfeits the seat. The performance of
the original student who has been
impersonated, shall be cancelled in all
the subjects of the examination
xx
xvi
 (including practicals and project work)
already appeared and shall not be
allowed to appear for examinations of
the remaining subjects of that
semester/year. The
student is also debarred for two
consecutive
semesters from class work and all
SEE. The continuation of the course
by the student is subject to the
academic regulations in connection
with forfeiture of seat. If the imposter
is an outsider, he will be handed over
to the police and a case is registered
against him.
4. Smuggles in the answer book or Expulsion from the examination hall
additional sheet or takes out or and cancellation of performance in
arranges to send out the that subject and all the other subjects
question paper during the the student has already appeared
examination or answer book or including practical examinations and
additional sheet, during or after project work and shall not be
the examination. permitted for the remaining
examinations of the subjects of that
semester/year. The student is also
debarred for two consecutive
semesters from class work and all
SEE. The continuation of the course
by the student is subject to the
academic regulations in
connection with forfeiture of seat.
Uses objectionable, abusive or
offensive language in the answer

xx
xvi
 Refuses to obey the orders of the
Chief In case of students of the college, they
Controller of Examinations / shall be expelled from examination
Controller of Examinations / halls and cancellation of their
Additional Controller of performance in that subject and all
Examinations other subjects the student(s) has (have)
/ Observer / any officer on already appeared and shall not be
duty or
permitted to appear for the remaining
misbehaves or creates
disturbance of examinations of the subjects of that
any kind in and around semester/year. The students also are
the debarred and forfeit their seats. In
6. examination hall or organizes a case of outsiders, they will be handed
walk over to the police and a police case is
out or instigates others to walk registered against them.
out, or
threatens the officer-in charge
or any
person on duty in or outside
the
examination hall of any injury
to his
person or to any of his
relations
whether by words, either
spoken or
written or by signs or by
visible
representation, assaults the
officer-in-
charge, or any person on duty
in or
outside the examination hall or
any of
his relations, or indulges in any
other
act of misconduct or mischief
which
result in damage to or
destruction of
property in the examination
hall or
any part of
the college campus or
engages in any
other act which in the opinion of
the officer on duty amounts to
use of unfair means or
misconduct or has the tendency
to disrupt the orderly conduct
of the

xx
xvi
 examination.
7. Leaves the exam hall taking
Expulsion from the examination hall
away answer script or
and cancellation of performance in
intentionally tears off the script
that subject and all the other subjects
or any part thereof inside or
the student has already appeared
outside the examination hall.
including practical examinations and
project work and shall not be
permitted for the remaining
examinations of the subjects of that
semester/year. The student is also
debarred for two consecutive
semesters from class work and all
SEE. The continuation of the course
by the student is subject to the
academic regulations
in connection with forfeiture of seat.

8. Possesses any lethal weapon or

Expulsion from the examination hall
firearm in the examination hall.
and cancellation of the performance in
that subject and all other subjects the
student has already appeared
including practical examinations and
project work and shall not be
permitted for the remaining
examinations of the subjects of that
semester/year. The student is also
debarred and
forfeits the seat.
9. If student of the college, who is Expulsion from the examination hall
not a student for the particular and cancellation of the performance in
examination or any person not that subject and all other subjects the
connected with the college student has already appeared
indulges in any malpractice or including practical examinations and
improper conduct mentioned in project work and shall not be
clause 6 to 8. permitted for the remaining
examinations of the subjects of that
semester/year. The student is also
debarred and forfeits the seat.

Person(s) who do not belong to the

college will be handed over to the
police and, a police case
will be registered against them.
10. Comes in a drunken condition to Expulsion from the examination hall
the examination hall. and cancellation of the performance in
that subject and all other subjects the
xx
xix
 student has already appeared for
including practical examinations and
project work and shall not be
permitted for the remaining
examinations of the subjects of
that semester/year.
11. Copying detected on the basis of
Cancellation of the performance in
internal evidence, such as,
that subject and all other subjects the
during valuation or during
student has appeared for including
special scrutiny.
practical examinations and project
work of that semester/year
examinations.
12. If any malpractice is detected
which is not covered in the
above clauses 1 to
11 shall be reported to the
CAC / University for further
action to award a
suitable punishment.

*****

xl
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
Computer Science & Engineering (AI & ML)
R 22
I YEAR I SEMESTER COURSE STRUCTURE
S. Course Internal External Total
Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 MA101BS Matrices and Calculus BS 3 1 0 4 40 60 100

2 CH102BS Engineering Chemistry BS 3 1 0 4 40 60 100

3 CS103ES Programming for Problem Solving ES 3 0 0 3 40 60 100

4 EE104ES Basic Electrical Engineering ES 2 0 0 2 40 60 100

5 EG105ES Computer Aided Engineering ES 1 0 4 3 40 60 100

Graphics
Elements of Computer Science &
6 CS106ES ES 0 0 2 1 50 - 50
Engineering
7 CH107BS Engineering Chemistry Laboratory BS 0 0 2 1 40 60 100

8 EE108ES Basic Electrical Engineering Lab ES 0 0 2 1 40 60 100

9 Programming for Problem Solving ES 0 0 2 1 40 60 100

CS109ES
Laboratory
10 HS110MC Constitution of India MC 0 0 2 0 100* - -

Total 12 2 14 20 370 480 850

T - Tutorial P - Practical L- Lectures C- Credits

I YEAR II SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Code Course Title Cat L T P Credits Marks Marks Marks
No.
Ordinary Differential Equations and
1 MA201BS Vector Calculus BS 3 1 0 4 40 60 100

2 AP202BS Applied Physics BS 3 1 0 4 40 60 100

3 ME203ES Engineering Workshop ES 0 1 3 2.5 40 60 100

4 EN204HS English for Skill Enhancement HS 2 0 0 2 40 60 100

5 EC205ES Electronic Devices and Circuits ES 2 0 0 2 40 60 100

6 AP206BS Applied Physics Laboratory BS 0 0 3 1.5 40 60 100

7 CS207ES Python Programming Laboratory ES 0 1 2 2 40 60 100

English Language and
8 EN208HS Communication Skills Laboratory HS 0 0 2 1 40 60 100

9 CS209ES IT Workshop ES 0 0 2 1 40 60 100

10 ES210MC Environmental Science MC 0 0 2 0 100* - -

Total 10 4 14 20 360 540 900

T - Tutorial P - Practical L- Lectures C- Credits

1
II YEAR I SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 PS301BS Probability and Statistics BS 3 0 0 3 40 60 100

2 CS303PC Data Structures PC 3 0 0 3 40 60 100

3 CS304PC Computer Organization and ES 3 0 0 3 40 60 100

Architecture

4 AM305PC Software Engineering PC 3 0 0 3 40 60 100

5 AM306PC Operating Systems PC 3 0 0 3 40 60 100

6 CS306PC Data Structures Laboratory PC 0 0 3 1.5 40 60 100

7 AM307PC Operating Systems Laboratory PC 0 0 3 1.5 40 60 100

8 AM308PC Software Engineering Laboratory PC 0 0 2 1 40 60 100

9 HS309M Gender Sensitization MC 0 0 2 0 100* - -

C
Skill Development Course (Node
10 AM310P JS/ React JS/ Django) PC 0 0 2 1 40 60 100
C

Total 15 0 12 20 360 540 900

T - Tutorial P - Practical L- Lectures C- Credits

II YEAR II SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 CS402PC Discrete Mathematics PC 3 0 0 3 40 60 100

2 AM403P Automata Theory and Compiler PC 3 0 0 3 40 60 100

C Design

3 CS404PC Database Management Systems PC 3 0 0 3 40 60 100

4 AM405P Introduction to Artificial PC 3 0 0 3 40 60 100

C Intelligence
Object Oriented Programming
5 AM406P PC 3 0 0 3 40 60 100
through Java
C

6 Database Management Systems PC 0 0 2 1 40 60 100

CS407PC Laboratory

7 AM408P Java Programming Laboratory PC 0 0 2 1 40 60 100

C
Real-time Research Project/
8 CS408P PW 0 0 4 2 50 - 50
Societal Related Project
W

9 HS411M Intellectual Property Rights MC 3 0 0 0 100* - -

C
Skill Development Course
10 AM412P (Prolog/ Lisp/ Pyswip) PC 0 0 2 1 40 60 100

2
 C

Total 18 0 10 20 370 480 850

T - Tutorial P - Practical L- Lectures C- Credits

3
III YEAR I SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 CS501PC Design and Analysis of Algorithms PC 3 1 0 4 40 60 100

2 CS502PC Computer Networks PC 3 0 0 3 40 60 100

3 AM503PC Machine Learning PC 3 0 0 3 40 60 100

Business Economics &

4 BF504HS Financial Analysis HS 3 0 0 3 40 60 100

5 PROFESSIONAL ELECTIVE - I PE 3 0 0 3 40 60 100

6 Machine Learning Laboratory PC 0 0 3 1.5 40 60 100

AM505P
C

7 Computer Networks Laboratory PC 0 0 3 1.5 40 60 100

CS504P
C
Skill Development Course (UI
8 CS507P PC 0 0 2 1 40 60 100
Design- Flutter)
C

Total 15 1 8 20 320 480 800

T - Tutorial P - Practical L- Lectures C- Credits

III YEAR II SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 Knowledge Representation and PC 3 0 0 3 40 60 100

AM601P Reasoning
C
2 AM602PC Data Analytics PC 3 0 0 3 40 60 100

3 AM603PC Natural Language Processing PC 3 0 0 3 40 60 100

4 PROFESSIONAL ELECTIVE – II PE 3 0 0 3 40 60 100

5 OPEN ELECTIVE – I OE 3 0 0 3 40 60 100

6 AM604PC Natural Language Processing PC 0 0 2 1 40 60 100

Laboratory
7 AM605PC Data Analytics Laboratory PC 0 0 2 1 40 60 100
Advanced English Communication HS 0
8 AE606HS 0 2 1 40 60 100
Skills Lab
Industrial Oriented Mini Project/
9 AM607P Internship 0 4 2 - 100 100
PW 0
W
10 Environmental Science#
- -
MC 3 0 0 0 100*
Total 18 0 10 20 320 580 900
T - Tutorial P - Practical L- Lectures C- Credits

4
IV YEAR I SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 AM701P Deep Learning PC 3 0 0 3 40 60 100

C

2 AM702PC Nature Inspired Computing PC 2 0 0 2 40 60 100

3 PROFESSIONAL ELECTIVE – PE 3 0 0 3 40 60 100

III

4 PROFESSIONAL ELECTIVE – PE 3 0 0 3 40 60 100

IV

5 OPEN ELECTIVE – II OE 3 0 0 3 40 60 100

6 AM703PC Professional Practice, Law & PC 0 0 4 2 40 60 100

Ethics

7 Professional Elective - III Lab PC 0 0 2 1 40 60 100

AM704PC
8 Project Stage – I PC 0 0 6 3 100 - 100

Total 14 0 12 20 380 420 800

T - Tutorial P - Practical L- Lectures C- Credits

IV YEAR II SEMESTER COURSE STRUCTURE

S. Course Internal External Total

Course Title Cat L T P Credits
No. Code Marks Marks Marks

1 Professional Elective - V PE 3 0 0 3 40 60 100

Professional Elective – VI PE 3 0 0 3 40 60 100

3 OPEN ELECTIVE – III OE 3 0 0 3 40 60 100

4 AM801PC Project Stage-II including PC 0 0 22 11 40 60 100

Seminar

Total 9 0 22 20 160 240 400

T - Tutorial P - Practical L- Lectures C- Credits

# Environmental Science in III Yr II Sem Should be Registered by Lateral Entry students Only
* Mandatory Courses Marks are not considered in Total Marks

5
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
Computer Science & Engineering (AI & ML)

PROFESSIONAL ELECTIVE - I:

1 Graph Theory
AM511PE
2 Introduction to Data Science
AM512PE
3 Web Programming
AM513PE
4 Image Processing
EC514PE
5 AM515PE Computer Graphics

PROFESSIONAL ELECTIVE - II:

1 AM621PE Software Testing Methodologies

2 AM622PE Information Retrieval Systems

3 AM623PE Pattern Recognition

4 AM624PE Distributed Computing

5 AM625PE Data Warehousing and Business Intelligence

PROFESSIONAL ELECTIVE - III:

AM731PE
1 Internet of Things
AM732PE
2 Data Mining
AM733PE
3 MERN Stack Development
AM734PE
4 Mobile Application Development
AM735PE
5 Cloud Computing

PROFESSIONAL ELECTIVE - III LABORATORY:

AM711PE
1 Internet of Things Laboratory
AM712PE
2 Data Mining Laboratory
AM713PE
3 MERN Stack Development Laboratory
AM714PE
4 Mobile Application Development
Laboratory
AM715PE
5 Cloud Computing Laboratory

PROFESSIONAL ELECTIVE - IV:

1
AM741PE
Quantum Computing
6
 2 AM742PE Expert Systems

3 AM743PE Semantic Web

4 AM744PE Game Theory

5 AM745PE Mobile Computing

PROFESSIONAL ELECTIVE - V:

1 AM851PE Social Media Analytics

2 AM852PE Federated Machine Learning

3 AM853PE Augmented Reality & Virtual Reality

4 AM854PE Cyber Security

AM855PE Ad-hoc & Sensor Networks
5

PROFESSIONAL ELECTIVE - VI:

1 AM861PE Speech and Video Processing

2 AM862PE Reinforcement Learning

3 AM863PE Randomized Algorithms

4
AM864PE Cognitive Computing

5 AM865PE Conversational AI

OPEN ELECTIVE - I:

S.No. Course Code Name of the Course Offering Department

1 CE611OE Disaster Preparedness & Planning Management
2 CE612OE Building Management Systems
Civil Engineering
3 CE613OE Environmental Impact Assessment
4 CE614OE Hydrogeology
5 EE611OE Renewable Energy Sources
Electrical and Electronics
6 EE612OE Fundamental of Electric Vehicles Engineering

7 ME611OE Basic Mechanical Engineering

Mechanical Engineering
8 ME612OE Power Plant Engineering
9 EC611OE Fundamentals of Internet of Things
Electronics &
10 EC612OE Principles of Signal Processing Communication

11 EC613OE Digital Electronics for Engineering Engineering

12 CS611OE Data Structures

Computer Science
13 CS612OE Database Management Systems & Engineering

14 IT611OE Java Programming Information Technology

15 IT612OE Software Engineering

16 AM611OE Fundamentals of AI
7
 Computer Science &
17 AM612OE Machine Learning Basics Engineering (AI&ML)

OPEN ELECTIVE - II:

S.No. Course Code Name of the Course Offering Department

1 CE721OE Remote Sensing & Geographical Information
Systems
2 CE722OE Sustainable Infrastructure Development Civil Engineering
3 CE723OE Solid Waste Management
4 CE724OE Smart Cities

5 EE721OE Utilization of Electric Energy

Electrical and
6 EE722OE Energy Storage Systems Electronics
Engineering
7 ME721OE Quantitative Analysis for Business Decisions
Mechanical
8 ME722OE Industrial Engineering &Management Engineering
9 EC721OE Electronic Sensors
Electronics &
10 EC722OE Electronics for Health Care Communicati
on
11 EC723OE Telecommunications for Society
Engineering
12 CS721OE Operating Systems
Computer Science
13 CS722OE Computer Networks & Engineering

14 IT721OE Full Stack development

Information
15 IT722OE Scripting Languages Technology
16 AM721OE Introduction to Natural Language Processing
Computer Science
17 AM722OE AI Applications & Engineering
(AI&ML)

OPEN ELECTIVE - III:

S.No. Course Code Name of the Course Offering Department

1 CE831OE
Energy Efficient Buildings
2 CE832OE Multi Criterion Decision Making CIVIL
3 CE833OE Environmental Pollution
4 EE831OE Charging Infrastructure for Electric Vehicles
5 EE832OE EEE
Reliability Engineering
6 ME831OE
Elements of Electric and Hybrid Vehicles.
7 ME832OE MECH
Entrepreneurship Development
8 EC831OE
Measuring Instruments
9 EC832OE
Communication Technologies ECE
10 EC833OE
Fundamentals of Social Networks
11 CS831OE Algorithms Design and Analysis
12 CS832OE CSE
Data Analytics
13 IT831OE
Big Data Technologies
14 IT832OE IT
DevOps
8
15 AM831OE
Chatbots
16 AM832OE CSE-AI&ML
Evolutionary Computing

9
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
Computer Science & Engineering (AI&ML)

PROGRAM EDUCATIONAL OBJECTIVES

PEO1: Graduates will have broad scientific and engineering knowledge to

formulate,
analyze and resolve engineering issues in real world.
PEO2: Graduates will have the skills they need for a successful career in AI
and related
fields that meet the needs of the country and businesses
PEO3: Graduates will function effectively in workplace with demonstrable
attributes like leadership, lifelong learning, and teamwork in order to
meet the requirements of
society.

PROGRAM SPECIFIC OUTCOMES

PSO1:
Understand, design and implement the concepts of Artificial Intelligence
and Machine Learning to build intelligent models and systems that are
cost effective and meeting industry 4.0 standards with ethical values.

PSO2: Ability to apply technical knowledge and usage of modern

tools related to AI & ML for solving real world problems.

10
 PROGRAM OUTCOMES
At the end of the program, Graduates will be able to:

PO 1. Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution
of complex engineering problems.
PO 2. 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.
PO 3. 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.
PO 4. 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.
PO 5. Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modelling to
complex engineering activities with an understanding of the limitations.

PO 6. 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.
PO 7. Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and
demonstrate the knowledge of, and need for sustainable development.
PO 8. Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
PO 9. Individual and team work: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
PO 10. 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.
PO 11. 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.
PO 12. 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.

11
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(MA101BS) MATRICES AND CALCULUS

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-1-0-4

Prerequisite: Mathematical Knowledge at pre-university level

Course Objectives:
The objectives of this course are to provide:

 Types of matrices and their properties. Concept of a rank of the matrix and
applying this concept to know the consistency and solving the system of linear
equations.
 Concept of Eigen values and eigenvectors and to reduce the quadratic form to
canonical form.
 Geometrical approach to the mean value theorems and their application to the
mathematical problems. Evaluation of surface areas and volumes of revolutions of
curves. Evaluation of improper integrals using Beta and Gamma functions.
 Partial differentiation, concept of total derivative
 Finding maxima and minima of function of two and three variables. Evaluation of
multiple integrals and their applications
UNIT-I

Matrices
Rank of a matrix by Echelon form and Normal form, Inverse of Non-singular matrices by
Gauss- Jordan method, System of linear equations: Solving system of Homogeneous and
Non- Homogeneous equations by Gauss elimination method and Gauss Jordan method.
UNIT-II

Eigen values and Eigen vectors

Linear Transformation and Orthogonal Transformation: Eigen values, Eigenvectors and

their properties, Diagonalization of a matrix, Cayley-Hamilton Theorem (without proof),
finding inverse and power of a matrix by Cayley-Hamilton Theorem, Quadratic forms and
Nature of the Quadratic Forms, Reduction of Quadratic form to canonical forms by
Orthogonal Transformation.
UNIT-III

Calculus

Mean value theorems: Rolle’s Theorem, Lagrange’s Mean value theorem with their
12
Geometrical Interpretation and applications, Cauchy’s Mean Value Theorem, Taylor’s
Series. Definition of Improper Integral: Beta and Gamma functions and their
applications.

13
UNIT-IV

Multivariable Calculus (Partial Differentiation and applications)

Definitions of Limit and continuity.Partial Differentiation: Euler’s Theorem, Total

derivative, Jacobian, Functional dependence & independence. Applications: Maxima and
minima of functions of two variables and three variables using method of Lagrange
multipliers.

UNIT-V

Multivariable Calculus (Integration)

Evaluation of Double Integrals (Cartesian and polar coordinates), change of order of

integration (only Cartesian form), Evaluation of Triple Integrals: Change of variables
(Cartesian to polar) for double and (Cartesian to Spherical and Cylindrical polar
coordinates) for triple integrals. Areas (by double integrals) and volumes (by double and
triple integrals)

Text books:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010.
2. R.K. Jain and S.R.K. Iyengar, Advanced Engineering Mathematics, Narosa
Publications, 5th Editon, 2016.

Reference books:
1. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,
2006.
2. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry,
9thEdition, Pearson, Reprint,2002.
3. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications, Reprint, 2008.

4. H. K. Dass and Er. Rajnish Verma, Higher Engineering Mathematics, S

Chand and CompanyLimited, New Delhi.

Course Outcomes:
After the completion of the course, the student will be able to
1. Write the matrix representation of a set of linear equations and to analyze
the solution of the system of equations
2. Find the Eigen values and Eigen vectors of the matrix and discuss the nature of the
quadratic form.
3. Discuss the applications of mean value theorems to the mathematical problems,
Evaluation of improper integrals using Beta and Gamma functions.
4. Examine the extreme of functions of two variables with/ without constraints.
5. Analyze the convergence of sequence and series.
14
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H H L H M L H

CO-2 H H H L H M L H

CO-3 M M M M L M

CO-4 M M M L L M

CO-5 M M L M L M

H-HIGH M-MODERATE L-LOW

15
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CH102BS) ENGINEERING CHEMISTRY

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-1-0-4

Course Objectives:
The objectives of this course is to provide:
 To bring adaptability to new developments in Engineering Chemistry and to
acquire the skills required to become a perfect engineer.
 To include the importance of water in industrial usage, fundamental aspects
of battery chemistry, and significance of corrosion - it’s control to protect the
structures.
 To impart the basic knowledge of atomic, molecular and electronic
modifications which makes the student to understand the technology based on
them.
 To acquire required knowledge about engineering materials like cement, smart
materials and Lubricants.
UNIT-I: Water and its treatment :
Introduction to hardness of water – Estimation of hardness of water by complex metric
method and related numerical problems. Potable water and its specifications - Steps
involved in the treatment of potable water - Disinfection of potable water by
chlorination and break - point chlorination. DE fluoridation - Determination of F- ion
by ion- selective electrode method.
Boiler Troubles: Sludges, Scales and caustic embrittlement, Internal treatment of Boiler feed
water
- Calgon conditioning - Phosphate conditioning - Colloidal conditioning, External
treatment methods - Softening of water by ion- exchange process. Desalination of
Brackish water - Reverse osmosis.
UNIT-II: Battery Chemistry & Corrosion :
Introduction - Classification of batteries-primary (Leclanche cell) and secondary
(Lead-acid), and reserve batteries with example. Construction, working and
applications of Zn-air and Lithium-ion battery. Applications of Li-ion battery to
electrical vehicles.
Fuel Cells- Differences between battery and a fuel cell, Construction and applications of
Methanol
Oxygen fuel cell and Solid oxide fuel cell. Solar cells - Introduction and applications of
16
Solar cells.
Corrosion: Causes and effects of corrosion–theories of chemical and electrochemical
corrosion
–mechanism of electrochemical corrosion, Types of corrosion: Galvanic, water-line
and pitting corrosion. Factors affecting rate of corrosion: Nature of metal-Galvanic
series, purity of metal, Nature of corrosion product, Nature of environment-Effect of
temperature, Effect of PH, Humidity, Corrosion control methods- Cathodic protection
– Sacrificial anode & impressed current methods.

17
UNIT-III: Polymeric materials:
Definition – Classification of polymers with examples – Types of polymerizations –
Addition and condensation p ol y m er i zat i o n with examples –
Nylon 6:6, Terylene Plastics:
Definition and characteristics- thermoplastic and thermosetting plastics, Preparation,
Properties and engineering applications of PVC, Bakelite and Teflon.
Rubbers: Natural rubber and its vulcanization.
Synthetic Rubbers- Characteristics–preparation–properties and applications of Buna-S, Butyl
and Thiokol rubber.
Conducting polymers: Characteristics and Classification with examples-
mechanism of conduction in trans- poly acetylene and applications of conducting
polymers.
Biodegradable polymers: Concept and advantages – Poly lactic acid and poly vinyl
alcohol and their applications
UNIT-IV: Molecular structure:
Introduction, Concept of atomic and molecular orbitals, LCAO, Molecular orbitals of
di atomic molecules, Molecular orbital energy level diagrams of diatomic molecules
(B2, C2, N2, O2 and F2). Pi-molecular orbitals of ethylene and butadiene.
Crystal field theory (CFT)
Crystal field theory, Crystal field splitting patterns of transition metal ion d- orbital-
tetrahedral, octahedral and square planar geometries.
UNIT-V: Engineering Materials:
Cement: Portland cement, its composition, setting and
hardening. Smart materials and their engineering applications
Shape memory materials- Poly L- Lactic acid. Thermo response materials- Poly acryl
amides and Poly vinyl amides
Lubricants: Classification of lubricants with examples-characteristics of a good lubricant
- mechanism of lubrication (thick film, thin film and extreme pressure)- properties of
lubricants: viscosity, cloud point, pour point, flash point and fire point.

Text Books:
1. Engineering Chemistry by P.C. Jain and M. Jain, Dhanpat rai Publishing Company,2010
2. Text book of Engineering Chemistry by Jaya Shree Anireddy, Wiley Publications.
3. Engineering Chemistry by Rama Devi, VenkataRamana Reddy
and Rath, Cengage learning,2016
4. A text book of Engineering Chemistry by M. Tirumala
Chary, E.Laxminarayana and K. Shashikala, Pearson
Publications, 2021.
18
 Reference Books:
1. Engineering Chemistry by Shikha Agarwal, Cambridge University Press, Delhi(2015)
2. Engineering Chemistry by Shashi Chawla, Dhanpatrai and Company (P) Ltd. Delhi(2011)

Course Outcomes:
After the completion of the course, the student will be able to
1. Understand the basic properties of water and its usage in domestic and industrial
purposes.
2. Acquire the basic knowledge of electrochemical procedures related
to corrosion and its control.
3. Learn the fundamentals and general properties of polymers and other engineering
materials.
4. Apply the knowledge of atomic, molecular and electronic changes related to
conductivity
5. Apply the knowledge of engineering materials in daily life.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M H M M L H M M

CO-2 M M H H H H H M

CO-3 H M H H M M

CO-4 L M L L M

CO-5 M H H H M L M M

H-HIGH M-MODERATE L-LOW

19
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS103ES) PROGRAMMING FOR PROBLEM SOLVING

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0-0-3
Course Objectives:
The objectives of this course is to provide:

 To understand the various steps in program development.

 To learn the syntax and semantics of the C programming language.

 To learn the usage of structured programming approaches in solving problems.

 Develop Skills for analyzing solutions.

 To introduce various techniques for representation of the data in the real world
UNIT - I: Introduction to Programming

Compilers, compiling and executing a program.

Representation of Algorithm - Algorithms for finding roots of a quadratic equations,

finding minimum and maximum numbers of a given set, finding if a number is prime
number Flowchart/Pseudocode with examples, Program design and structured
programming
Introduction to C Programming Language: variables (with data types and space
requirements), Syntax and Logical Errors in compilation, object and executable code,
Operators, expressions and precedence, Expression evaluation, Storage classes (auto,
extern, static and register), type conversion, The main method and command line
arguments Bitwise operations: Bitwise AND, OR, XOR and NOT operators
Conditional Branching and Loops: Writing and evaluation of conditionals and consequent
branching with if, if-else, switch-case, ternary operator, go to, Iteration with for, while,
do- while loops
I/O: Simple input and output with scanf and printf, formatted I/O, Introduction to stdin,
stdout and stderr. Command line arguments
UNIT - II: Arrays, Strings, Structures and Pointers:

Arrays: one and two dimensional arrays, creating, accessing and manipulating elements
of arrays Strings: Introduction to strings, handling strings as array of characters, basic
string functions available in C (strlen, strcat, strcpy, strstr etc.), arrays of strings
Structures: Defining structures, initializing structures, unions, Array of structures
Pointers: Idea of pointers, Defining pointers, Pointers to Arrays and Structures, Use of

20
Pointers in self- referential structures, usage of self-referential structures in linked list (no
implementation) Enumeration data type

21
UNIT – III: Preprocessor and File handling in C:

Preprocessor: Commonly used Preprocessor commands like include, define, undef, if,
ifdef, ifndef Files: Text and Binary files, Creating and Reading and writing text and
binary files, appending data to existing files, Writing and reading structures using binary
files, Random access using fseek, ftell and rewind functions
UNIT - IV: Function and Dynamic Memory Allocation:

Functions: Designing structured programs, declaring a function, Signature of a function,

Parameters and return type of a function, passing parameters to functions, call by value,
Passing arrays to functions, passing pointers to functions, idea of call by reference,
Some C standard functions and libraries
Recursion: Simple programs, such as Finding Factorial, Fibonacci series etc., Limitations
of Recursive functions Dynamic memory allocation: Allocating and freeing memory,
Allocating memory for arrays of different data types
UNIT –V:
Searching and Sorting:
Basic searching in an array of elements (linear and binary search techniques), Basic
algorithms to sort array of elements (Bubble, Insertion and Selection sort algorithms),
Basic concept of order of complexity through the example programs

Text Books:
1. Jeri R. Hanly and Elliot B.Koffman, Problem solving and Program Design in C
7th Edition, Pearson
2. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage
Learning, (3rd Edition)

Reference Books:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language,
Prentice Hall of India
2. E. Balagurusamy, Computer fundamentals and C, 2nd Edition, McGraw-Hill

3. Yashavant Kanetkar, Let Us C, 18th Edition, BPB

4. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression)

5. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.

6. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition

7. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill

22
 Course Outcomes:
After the completion of the course, the student will be able to

1. Design algorithms, flowcharts and programs involving decision and iteration

structures.

2. Analyze the concepts of arrays, strings and structures for real world problems.

3. Apply various file handling techniques for better data management.

4. Apply the concept code reusability using Functions.

5. Implement various searching and sorting Techniques.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M L L H L

CO-2 L M M H H L

CO-3 L M M H M L

CO-4 L M M M M L

CO-5 L M H H M L

H-HIGH M-MODERATE L-LOW

23
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE104ES) BASIC ELECTRICAL ENGINEERING

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

2-0-0-2

Prerequisites: Basic Knowledge on Integration, Differentiation, Laplace Transforms

and Intermediate Physics.

Course Objectives:
 To introduce the concept of DC circuits and its components.

 To impart the knowledge of AC circuits, Phasor algebra related to alternating quantities

 To introduce the concept of principle of operation of transformer.

 To understand the knowledge about DC machines and Induction motors.

 To import the knowledge of various electrical installation and the concept of power,
power factor and its improvement.
UNIT-I:
D.C. Circuits: Electrical circuit elements (R, L and C), voltage and current sources, Ohm’s
Law, KVL & KCL, analysis of simple circuits with dc excitation. Superposition, Thevenin
and Norton Theorems. Time-domain analysis of first-order RL and RC circuits.
UNIT-II:

A.C. Circuits: Representation of sinusoidal waveforms, peak and rms values, phasor
representation, real power, reactive power, apparent power, power factor, Analysis of
single-phase ac circuits consisting of R, L, C, RL, RC, RLC combinations (series only),
resonance in series R-L- C circuit. Three-phase balanced circuits, voltage and current
relations in star and delta connections.
UNIT-III:

Transformers: Ideal and practical transformer, equivalent circuit, losses in transformers, OC&SC
test on transformers, regulation and efficiency. Condition for maximum efficiency and
applications.
UNIT-IV:

Electrical Machines: Construction and working principle of dc machine, performance

characteristics of dc shunt machine. Generation of rotating magnetic field, Construction
and working of a three-phase induction motor, Significance of torque-slip characteristics.

24
Single-phase induction motor, Construction and working. Construction and working of
synchronous generator.

25
UNIT-V:

Electrical Installations: Components of LT Switchgear: Switch Fuse Unit (SFU), MCB,

Types of Wires and Cables, Earthing. Types of Batteries, Important Characteristics for
Batteries. Elementary calculations for energy consumption, power factor improvement
and battery backup.

Text Books:
1. D.P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill,
4th Edition, 2019.
2. MS Naidu and S Kamakshaiah, “Basic Electrical Engineering”, Tata
McGraw Hill, 2nd Edition, 2008.

Reference Books:
1. P. Ramana, M. Suryakalavathi, G.T. Chandrasheker, “Basic Electrical
Engineering”, S. Chand, 2nd Edition, 2019.
2. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009

3. M. S. Sukhija, T. K. Nagsarkar, “Basic Electrical and Electronics Engineering”,

Oxford, 1st Edition, 2012.
4. Abhijit Chakrabarthi, Sudipta Debnath, Chandan Kumar Chanda,
“Basic Electrical Engineering”, 2nd Edition, McGraw Hill, 2021.
5. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press,
2011.

6. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.

7. V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the importance of DC circuits and analyze theorems.
2. Understand the concept of AC circuits and resonance.
3. Concept of principle of operation of transformer and efficiency of single phase
transformer.
4. Analyze the performance of DC machines and Induction motors.
5. Demonstrate the importance of electrical installation and the concept of power,
power factor and its improvement.

26
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H M H M M H H M

CO-2 H M H M M H H M

CO-3 M H H M M L M H

CO-4 M H M M M M L M H

CO-5 L M M L H H L H H

H-HIGH M-MODERATE L-LOW

27
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EG105ES) COMPUTER AIDED ENGINEERING GRAPHICS

I Year B.Tech. CSE (AI & ML)-I Sem L-T-P-C

1-0-4-3

Course Objectives:
The objectives of this course is to provide:
 To develop the ability of visualization of different objects through technical drawings.
 To impart knowledge about standard principles of orthographic projection of objects
 To draw the regular solids and sectional views of the objects.
 To development the right regular solids surfaces of solids.
 To draw Isometric views and modern engineering tools like Auto Cad software
necessary for engineering practice

UNIT – I:
Introduction to Engineering Graphics: Principles of Engineering Graphics and their
Significance, Scales – Plain & Diagonal, Conic Sections including the Rectangular
Hyperbola – General method only. Cycloid, Epicycloid and Hypocycloid, Introduction
to Computer aided drafting – views, commands and conics
UNIT- II:

Orthographic Projections: Principles of Orthographic Projections – Conventions –

Projections of Points and Lines, Projections of Plane regular geometric figures.
Computer aided orthographic projections – points, lines and planes
UNIT – III:

Projections of Regular Solids Sections or Sectional views of Right Regular Solids –

Prism, Cylinder, Pyramid, Cone, Computer aided projections of solids – sectional
views
UNIT – IV:

Development of Surfaces of Right Regular Solids – Prism, Cylinder, Pyramid and

Cone, Development of surfaces using computer aided drafting
UNIT – V:
Isometric Projections: Principles of Isometric Projection – Isometric Scale – Isometric Views –
Conventions – Isometric Views of Lines, Plane Figures, Simple and Compound Solids –
Isometric Projection of objects having non- isometric lines. Isometric Projection of

28
Spherical Parts. Conversion of Isometric Views to Orthographic Views and Vice-versa
–Conventions. Conversion of

29
 orthographic projection into isometric view using computer aided drafting.

Text Books:
1. Engineering Drawing N.D. Bhatt / Charotar

2. Engineering Drawing and graphics Using AutoCAD Third Edition, T.

Jeyapoovan, Vikas: SChand and company Ltd.

Reference Books:
1. Engineering Drawing, Basant Agrawal and C M Agrawal, Third Edition McGraw Hill

2. Engineering Graphics and Design, WILEY, Edition 2020 Engineering Drawing, M. B.

Shah, B.C. Rane / Pearson.

3. Engineering Drawing, N. S. Parthasarathy and Vela Murali, Oxford

4. Computer Aided Engineering Drawing – K Balaveera Reddy et al – CBS Publishers

Note: - External examination is conducted in conventional mode and internal evaluation
to be done by both conventional as well as using computer aided drafting.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Apply computer aided drafting tools to create 2D and 3D objects

2. Sketch conics and different types of solids

3. Appreciate the need of Sectional views of solids and Development of surfaces of solids

4. Read and interpret engineering drawings

5. Conversion of orthographic projection into isometric view and vice versa

manually and by using computer aided drafting

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L H L M M

CO-2 L M H L L

CO-3 L

CO-4 M H L

CO-5 H

H-HIGH M-MODERATE L-LOW

30
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS106ES) ELEMENTS OF COMPUTER SCIENCE & ENGINEERING

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0-0-2-1

Course objectives:
The objectives of this course is to provide:

 Understand Basic Computer Functional Units.

 Develop Programming and Problem-Solving Skills

 Acquire Knowledge of Operating Systems and Databases

 Understand the Significance of Networks and Cyber Security

 Gain Insight into Autonomous Systems

Unit - I:

Basics of a Computer – Hardware, Software, Generations of computers. Hardware -

functional units, Components of CPU, Memory – hierarchy, types of memory, Input
and output devices. Software – systems software, application software, packages,
frameworks, IDEs.
Unit – II:

Software development – waterfall model, Agile, Types of computer languages –

Programming, markup, scripting Program Development – steps in program
development, flowcharts, algorithms, data structures – definition, types of data
structures
Unit - III:

Operating systems: Functions of operating systems, types of operating systems, Device &
Resource management
Database Management Systems: Data models, RDBMS, SQL, Database Transactions, data
centers, cloud services
Unit - IV:

Computer Networks: Advantages of computer networks, LAN, WAN, MAN, internet, WiFi,
sensor networks, vehicular networks, 5G communications.
World Wide Web – Basics, role of HTML, CSS, XML, Tools for web designing,
Social media, Online social networks.
Security – information security, cyber security, cyber laws
Unit - V:

31
Autonomous Systems: IoT, Robotics, Drones, Artificial Intelligence – Learning, Game
Development, natural language processing, image and video processing.

32
 Cloud Basics

Text Book:
1. Invitation to Computer Science, G. Michael Schneider, Macalester College, Judith L.
Gersting University of Hawaii, Hilo, Contributing author: Keith Miller University of
Illinois, Springfield. Agrawal

Reference Books:
1. Fundamentals of Computers, Reema Thareja, Oxford Higher Education, Oxford
University Press.
2. Introduction to computers, Peter Norton, 8th Edition, Tata McGraw Hill.
3. Computer Fundamentals, Anita Goel, Pearson Education India, 2010.
4. Elements of computer science, Cengage

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Know the working principles of functional units of a basic Computer

2. Understand program development, the use of data structures and

algorithms in problem solving.
3. Know the need and types of operating system, database systems.
4. Understand the significance of networks, internet, WWW and cyber security.

5. Understand Autonomous systems, the application of artificial intelligence.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M M

CO-2 M H M M M

CO-3 M M M M

CO-4 M L L M M M

CO-5 M L M M M M

H-HIGH M-MODERATE L-LOW

33
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CH107BS) ENGINEERING CHEMISTRY LABORATORY

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0-0-2-1

Course Objectives:
The objectives of this course is to provide:
 Estimation of hardness and chloride content of water to check its suitability
for drinking purpose.
 Students are able to perform estimation of acids and bases using
conductometry, potentiometry and pH metry methods.
 Skills related to the lubricant properties such as saponification value, surface tension
and viscosity of oils.
 To prepare polymers such as Thiokol rubber and Bakelite in the laboratory.

List of Experiments:
Volumetric Analysis: Estimation of Hardness of water by EDTA
Complexometry method.

Conductometry:
1. Estimation of the concentration of strong acid by Conductometry.
2. Estimation of the concentration of weak acid by Conductometry

Potentiometry:
1. Estimation of the amount of Fe+2 by Potentiometry
2. Estimation of the concentration of acid by Potentiometry
Corrosion: Determination of rate of corrosion of mild steel in various conditions
PH Metry: Determination of an acid concentration using pH meter.
Argentometry: Estimation of Chloride content of water by Argentometry

Preparations:

Preparation of Thiokol rubber.

1. Preparation of Bakelite
Lubricants:
1. Estimation of acid value of given lubricant oil
2. Estimation of Viscosity of lubricant oil using Ostwald’s Viscometer.
3. Estimation of Surface tension of lubricant oil using Stalagmometer.

34
Reference Books:
1. Lab manual for Engineering chemistry by B. Ramadevi and P. Aparna,
S Chand Publications, New Delhi(2022)
2. Vogel’s text book of practical organic chemistry 5th edition
3. Inorganic Quantitative analysis by A.I. Vogel, ELBS Publication

Course outcomes:
Upon the successful completion of this course, the student will be able to:
1. Determination of rate of corrosion of mild steel in various conditions.
2. To perform methods such as conductometry, potentiometry and pH metry in
order to find out the concentrations or equivalence points of acids and bases.
3. To prepare polymers like Thiokol rubber and Bakelite.
4. Estimation of Saponification value, Viscosity and surface tension of lubricant oils.
5. Estimation of hardness of water, Chloride content of water sample.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M H L M M M M

CO-2 H H H L M

CO-3 H M L M

CO-4 L M M L

CO-5 H M M M L L M

H-HIGH M-MODERATE L-LOW

35
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS109ES) PROGRAMMING FOR PROBLEM SOLVING LABORATORY

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0-0-2-1

[Note: The programs may be executed using any available Open Source/ Freely available IDE
Some of the Tools available are:

CodeLite: https://codelite.org/
Code:Blocks:http://www.codeblocks.org/
DevCpphttp://www.bloodshed.net/devcpp.htmlEclipse:
http://www.eclipse.org
This list is not exhaustive and is NOT in any order of preference]
Course objectives:
The objectives of this course is to provide:

 To work with an IDE to create, edit, compile, run and debug programs
 To analyze the various steps in program development.

 To develop programs to solve basic problems by understanding basic

concepts in C like operators, control statements etc.
 To develop modular, reusable and readable C Programs using the concepts
like functions, arrays etc.
 To Write programs using the Dynamic Memory Allocation concept.

 To create, read from and write to text and binary files

Practice sessions:

a. Write a simple program that prints the results of all the operators
available in C (including pre/post increment, bitwise and/or/not,
etc.). Read required operand values from standard input.
b. Write a simple program that converts one given data type to
another using auto conversion and casting. Take the values from
standard input.

Simple numeric problems:

a. Write a program for finding the max and min from the three numbers.

b. Write the program for the simple, compound interest.

c. Write a program that declares Class awarded for a given percentage of marks,
where mark
36
<40%= Failed, 40% to <60% = Second class, 60% to <70%=First class, >= 70% =
Distinction. Read percentage from standard input.

37
 d. Write a program that prints a multiplication table for a given number
and the number of rows in the table. For example, for a number 5 and
rows = 3, the output should be:
5x1=5

5 x 2 = 10

5 x 3 = 15

e. Write a program that shows the binary equivalent of a given positive

number between 0 to 255.

Expression Evaluation:

a. A building has 10 floors with a floor height of 3 meters each. A ball is

dropped from the top of the building. Find the time taken by the ball to
reach each floor. (Use the formula s = ut+(1/2)at^2 where u and a are the
initial velocity in m/sec (= 0) and acceleration in m/sec^2 (= 9.8 m/s^2)).
b. Write a C program, which takes two integer operands and one operator
from the user, performs the operation and then prints the result.
(Consider the operators +,-
,*, /, % and use Switch Statement)

c. Write a program that finds if a given number is a prime number

d. Write a C program to find the sum of individual digits of a positive integer

and test given number is palindrome.
e. A Fibonacci sequence is defined as follows: the first and second terms in
the sequence are 0 and 1. Subsequent terms are found by adding the
preceding two terms in the sequence. Write a C program to generate the
first n terms of the sequence.
f. Write a C program to generate all the prime numbers between 1 and n,
where n is a value supplied by the user.
g. Write a C program to find the roots of a Quadratic equation.
h. Write a C program to calculate the following, where x is a
fractional value. 1-x/2 +x^2/4-x^3/6
i. Write a C program to read in two numbers, x and n, and then compute the
sum of this geometric progression: 1+x+x^2+x^3+ +x^n. For example: if n
is 3 and x is 5, then the program computes 1+5+25+125.

Arrays, Pointers and Functions:

a. Write a C program to find the minimum, maximum and average in an array of

integers.

b. Write a function to compute mean, variance, Standard Deviation,

38
 sorting of n elements in asingle dimension array.
c. Write a C program that uses functions to perform the following:

i. Addition of Two Matrices

39
 ii. Multiplicatio
n of Two Matrices
iii. Transpose of a matrix with memory dynamically allocated for
the new matrix as row and column counts may not be the same.
d. Write C programs that use both recursive and non-recursive functions
i. To find the factorial of a given integer.

ii. To find the GCD (greatest common divisor) of two given integers.

iii. To find x^n

e. Write a program for reading elements using a pointer into an array

and display the values using the array.
f. Write a program for display values reverse order from an array using a pointer.
g. Write a program through a pointer variable to sum of n elements from an array.
Files:

a. Write a C program to display the contents of a file to standard output device.

b. Write a C program which copies one file to another, replacing all

lowercase characters with their uppercase equivalents.
c. Write a C program to count the number of times a character occurs
in a text file. The file name and the character are supplied as
command line arguments.
d. Write a C program that does the following:

It should first create a binary file and store 10 integers, where the file name
and 10 values are given in the command line. (hint: convert the strings
using atoi function) Now the program asks for an index and a value from
the user and the value at that index should be changed to the new value
in the file. (hint: use fseek function)
e. Write a C program to merge two files into a third file (i.e., the
contents of the first file followed by those of the second are put in the
third file).
Strings:

a. Write a C program to convert a Roman numeral ranging from I to L to

its decimal equivalent.
b. Write a C program that converts a number ranging from 1 to 50 to Roman
equivalent

c. Write a C program that uses functions to perform the following operations:

i. To insert a sub-string into a given main string from a given position.

ii. To delete n Characters from a given position in a given string.

40
d. Write a C program to determine if the given string is a palindrome or not
(Spelled same in both directions with or without a meaning like madam,
civic, noon, abcba, etc.)
e. Write a C program that displays the position of a character ch in the string S or – 1
if

41
 S doesn’t contain ch.
f. Write a C program to count the lines, words and characters in a given text.
Miscellaneous:
a. Write a menu driven C program that allows a user to enter n numbers and
then choose between finding the smallest, largest, sum, or average. The
menu and all the choices are to be functions. Use a switch statement to
determine what action to take. Display an error message if an
invalidchoice is entered.

b. Write a C program to construct a pyramid of numbers as follows:

1 * 1 1 *
1 2 * * 2 3 2 2 **
1 2 3 * * 4 56 3 3 3 ** *
4 4 4 4 **
*

Sorting and Searching:

a. Write a C program that uses non recursive function to search for a Key value in
a givenlist of integers using linear search method.
b. Write a C program that uses non recursive function to search for a Key
value in a given sorted list of integers using binary search method.
c. Write a C program that implements the Bubble sort method to sort a
given list of integers in ascending order.

d. Write a C program that sorts the given array of integers using selection sort
in descending order
e. Write a C program that sorts the given array of integers using insertion
sort in ascending order
f. Write a C program that sorts a given array of names

Text Books:
1. Jeri R. Hanly and Elliot B.Koffman, Problem solving and Program
Design in C 7th Edition, Pearson
2. B.A. Forouzan and R.F. Gilberg C Programming and Data
Structures, Cengage Learning, (3rdEdition)

Reference Books:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, PHI

2. Balagurusamy, Computer fundamentals and C, 2nd Edition, McGraw-Hill

3. Yashavant Kanetkar, Let Us C, 18th Edition, BPB

4. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression)

42
5. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.

43
 6. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition
7. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Apply fundamental programming concepts and Exercise control statements to
solve simple problems.
2. Represent and manipulate data with arrays and strings
3. Modularize the code with functions so that they can be reused.
4. Develop applications using user defined data types
5. Implement various searching and sorting techniques

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M L L H L

CO-2 L M L H H L

CO-3 M H H M H M

CO-4 L M M M H L

CO-5 L H H H H M

H-HIGH M-MODERATE L-LOW

44
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE108ES) BASIC ELECTRICAL ENGINEERING LABORATORY

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0-0-2-1

Prerequisite: Basic Electrical Engineering

Course Objectives:
The objectives of this course is to provide:
 To analyze a given network by applying various electrical laws and network theorems
 To study the transient response of various R,L, and C circuits using different
excitations.
 To analyze the concepts of resonance and magnetic circuits.
 To analyze the performance characteristics of DC and AC electrical machines.
 To determine the performance of Transformers through various testing methods.
List of experiments/demonstrations:
PART- A (compulsory)
1. Verification of KVL and KCL.
2. Verification of Thevenin’s and Norton’s theorem.
3. Transient Response of Series RL and RC circuits for DC excitation.
4. Resonance in series RLC circuit.
5. Calculations and Verification of Impedance and Current of RL, RC and RLC series
circuits.
6. Measurement of Voltage, Current and Real Power in primary and Secondary
Circuits of a Single-Phase Transformer.
7. Performance Characteristics of a DC Shunt Motor.
8. Torque-Speed Characteristics of a Three-phase Induction Motor.

PART-B (any two experiments from the given list)

1. Verification of Superposition theorem.
2. Load Test on Single Phase Transformer (Calculate Efficiency and Regulation).
3. Measurement of Active and Reactive Power in a balanced Three-phase circuit.
4. No-Load Characteristics of a Three-phase Alternator.

45
 Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Apply the various procedures and techniques for the experiments.

2. Verify the various electrical laws and theorems with DC Excitation.

3. Determine the losses, efficiency and regulation of single phase transformer.

4. Obtain the performance of induction motors.

5. Evaluate the speed of DC shunt motor.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H M M M H M

CO-2 H M H M H M

CO-3 M M M H M H

CO-4 H M M M H M H

CO-5 L L L M M H H H

H-HIGH M-MODERATE L-LOW

46
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(HS110MC) CONSTITUTION OF INDIA

I Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0-0-2-0

Course Objectives:
The objectives of this course is to provide:

 To understand the Indian constitution- its historical perspective and salient features
 To understand the fundamental rights of citizens accorded by the Indian constitution

 To understand the directive principles and fundamental duties given

in the Indian constitution
 To understand the Quasi-federal and parliamentary structure of Indian constitution

 To understand the constitution amendment powers and Emergency

Provisions of Indian constitution

UNIT-I

Meaning of the Constitution Law and Constitutionalism, Historical perspective of the

Constitution of India, Salient features and characteristics of the Constitution of India
UNIT-II

Scheme of the Fundamental Rights, Scheme of the Fundamental Right to Equality,

Scheme of the Fundamental Right to certain Freedom under Article 19, Scope of the
Right to Life and Personal Liberty under Article 21
UNIT-III

The Directive Principles of State Policy – Its importance and implementation, The
scheme of the Fundamental Duties and its legal status
UNIT-IV

Federal structure and distribution of Legislative and Financial powers between the
Union and the States, Parliamentary Form of Government in India – The constitution
powers and status of the President of India, Local Self Government – Constitutional
Scheme in India
UNIT-V

Amendment of the Constitutional Powers and Procedure, The historical perspectives of

the Constitutional Amendments in India, Emergency Provisions - National Emergency,
President Rule, Financial Emergency

47
 Text Books:

1. Introduction to Constitution of India, D.D. Basu, Lexis Nexus

2. The Constitution of India, PM Bhakshi, Universal Law.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Knowledge of historical perspective and salient features of Indian constitution

2. Aware of the fundamental rights of Indian citizens.

3. Know the directive principles and fundamental duties of government and citizens

4. Knowledge of the Quasi-federal and parliamentary structure of Indian constitution

5. Knowledge of the constitution amendment powers and Emergency

Provisions of Indian constitution

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M

CO-2 M M

CO-3 H M

CO-4 M M

CO-5 M M

H-HIGH M-MODERATE L-LOW

48
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(MA201BS) ORDINARY DIFFERENTIAL EQUATIONS AND VECTOR

CALCULUS

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3-1-0-4

Prerequisite: Mathematical Knowledge at pre-university level

Course Objectives:
 Methods of solving the differential equations of first order.

 Methods of solving the differential equations of higher order.

 Concept, properties of Laplace transforms

 Solving ordinary differential equations using Laplace transforms techniques.

 The physical quantities involved in engineering field related to vector valued
functions

 The basic properties of vector valued functions and their applications to

line, surface and volume integrals
UNIT-I: First Order ODE

Exact differential equations, Equations reducible to exact differential equations, linear

and Bernoulli’s equations, Orthogonal Trajectories (only in Cartesian Coordinates).
Applications: Newton’s law of cooling, Law of natural growth and decay.
UNIT-II: Ordinary Differential Equations of Higher Order

Second order linear differential equations with constant coefficients: Non-

Homogeneous terms of the type 𝑥, sin, cos 𝑥, polynomials in 𝑥, (𝑥) and 𝑥 (𝑥), method of
variation of parameters, Equations reducible to linear ODE with constant coefficients:
Legendre’s equation, Cauchy-Euler equation.
UNIT-III: Laplace transforms

Laplace Transforms: Laplace Transform of standard functions, First shifting theorem,

Second shifting theorem, Unit step function, Dirac delta function, Laplace transforms of
functions when they are multiplied and divided by ‘t’, Laplace transforms of derivatives
and integrals of function, Evaluation of integrals by Laplace transforms, Laplace
transform of periodic functions, Inverse Laplace transform by different methods,
convolution theorem (without proof). Applications: solving Initial value problems by
Laplace Transform method.
UNIT-IV: Vector Differentiation

49
Vector point functions and scalar point functions, Gradient, Divergence and Curl,
Directional derivatives, Tangent plane and normal line, Vector Identities, Scalar
potential functions, Solenoidal and Irrotational vectors.

50
Unit-V: Vector Integration

Line, Surface and Volume Integrals, Theorems of Green, Gauss and Stokes
(without proofs) and their applications.

Text Books:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010

2. R.K. Jain and S.R.K. Iyengar, Advanced Engineering Mathematics, Narosa

Publications, 5th Edition, 2016.

Reference Books:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,
2006.

2. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th
Edition, Pearson, Reprint, 2002.
3. H. K. Dass and Er. Rajnish Verma, Higher Engineering Mathematics, S
Chand and Company Limited, New Delhi.
4. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications, Reprint, 2008.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Methods of solving the differential equations of first order

2. Methods of solving the second and higher order differential equations.

3. Evaluation of multiple integrals

4. The basic properties of vector valued functions and derivatives

5. Line, surface and volume integrals and vector integral theorems.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M H M L L M L H

CO-2 M H M L H M L H

CO-3 H H M L M M L M

CO-4 H H M L M L L M

CO-5 H H M L M L L M

H-HIGH M-MODERATE L-LOW

51
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AP202BS) APPLIED PHYSICS

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3-1-0-4

Prerequisites: Basic knowledge of Physics in intermediate level.

Course Objectives:
The objectives of this course is to provide:
 Understand the phenomenon of diffraction, interference and polarization
 Recognize the basic principles of quantum physics and band theory of solids.

 Understand the underlying mechanism involved in construction and working

principles of various semiconductor devices.
 Identify the importance of nanoscale, quantum confinement and various
fabrications techniques.
 Study the characteristics of lasers and optical fibers.

UNIT-I: WAVE OPTICS

Huygen’s principle, superposition of waves, interference, interference in thin films by

Reflection, Newton’s rings (theory & experiment), diffraction, types of diffraction,

Farunhofer diffraction at single slit, plane diffraction gratings, resolving power of
grating, polarization, polarization by reflection, polarization by double refraction, Nicol’s
prism.

UNIT-II: QUANTUM PHYSICS AND SOLIDS

Quantum Physics: blackbody radiation and Planck’s law (Qualitative), De Broglie

hypothesis, Davisson – Germer experiment, Heisenberg uncertainty principle
(Qualitative), Born interpretation of the wave function, time independent Schrodinger
wave equation, particle in one dimensional potential box.
Solids: free electron theory (Drude & Lorentz, Somerfield) (Qualitative), Bloch’s
theorem, Kronig- Penney model (Qualitative), E-K diagram, effective mass of electron,
origin of energy bands, classification of solids.
UNIT-III: SEMICONDUCTORS AND DEVICES

Intrinsic and extrinsic semiconductors, energy band diagrams, Hall effect, direct and
indirect band gap semiconductors, Formation of P-N junction diode, energy level
diagram of P-N junction, V-I characteristics of P-N Junction, Zener diode and bipolar
52
junction transistor (BJT), Construction, working and characteristics of LED, photo diode
and solar cell

53
UNIT-IV: NANOTECHNOLOGY

Nanoscale, quantum confinement, surface to volume ratio, bottom-up fabrication: sol-

gel, combustion methods, top-down fabrication: ball milling. physical vapor deposition
(PVD) , Chemical vapor deposition (CVD), Characterization techniques - XRD, SEM
&TEM, applications of nanomaterials

UNIT-V: LASER AND FIBER OPTICS

Lasers: Interaction of radiation with matter: Absorption, Spontaneous emission and

stimulated emission, Einstein coefficients and their relations, Laser beam
characteristics, important components of laser-active medium, pumping source, optical
resonator, Construction and working principle- Nd:YAG laser, He-Ne laser,
semiconductor laser, applications of laser.
Fiber Optics: Introduction to optical fiber, advantages of optical fibers, total internal
reflection, construction of optical fiber, acceptance angle, numerical aperture,
classification of optical fibers- step index and graded index optical fiber, losses in optical
fiber, optical fiber for communication system, applications of optical fiber.

Text Books:
1. M. N. Avadhanulu, P.G. Kshirsagar & TVS Arun Murthy” A Text book of
Engineering Physics”-
2. S. Chand Publications, 11th Edition 2019.

3. Shatendra Sharma and Jyotsna Sharma, Engineering Physics, Pearson Publication,2019

4. P.K. Palanisamy A Text Book of Engineering Physics, Scietech Publications

Reference Books:
1. Halliday, Resnick and Walker, Fundamentals of Physics, John Wiley
&Sons,11th Edition, 2018.
2. B.K. Pandey and S. Chaturvedi, Engineering Physics, Cengage Learning,
2ndEdition,2022.

3. Essentials of Nanoscience & Nanotechnology by Narasimha Reddy Katta,

Typical Creatives NANO DIGEST, 1st Edition, 2021
4. A.K. Katiyar,C.K.Pandey Engineering Physics 2nd Edition, Wiley india pvt Ltd.2017.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand various optical phenomena of light
2. Apply basic the principles of quantum mechanics to classify solids based on band
theory.
3. Identify the role of semiconductor devices in science and engineering Applications.
4. Understand the features and applications of Nanomaterial’s in various fields.
54
 5. Understand various aspects of Lasers and Optical fiber and their applications in diverse
fields.

CO-PO-PSO Mapping:

55
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H M H

CO-2 M H M M M

CO-3 H M M

CO-4 M L M L M

CO-5 H L M M M

H-HIGH M-MODERATE L-LOW

56
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(ME203ES) ENGINEERING WORKSHOP

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
0-1-3-2.5

Prerequisite: Practical skill

Course Objectives:
The objectives of this course is to provide:
 To Study of different hand operated power tools, uses and their demonstration.
 To gain a good basic working knowledge required for the production of
various engineering products.
 To provide hands on experience about use of different engineering materials, tools,
equipment’s and processes those are common in the engineering field.
 To develop a right attitude, team working, precision and safety at work place.

 To have practical exposure to various Manufacturing processes.

1. TRADES FOR EXERCISES:

At least two exercises from each trade:

I. Carpentry – (T-Lap Joint, Dovetail Joint, Mortise & Tenon Joint).

II.Fitting – (V-Fit, Dovetail Fit & Semi-circular fit).

III. Tin-Smithy – (Square Tin, Rectangular Tray & Conical Funnel).

IV. Foundry – (Preparation of Green Sand Mould using Single Piece and Split Pattern).

V. Welding Practice – (Arc Welding & Gas Welding).

VI. House-wiring – (Parallel & Series, Two-way Switch and Tube Light).

VII.Black Smithy – (Round to Square, Fan Hook and S-Hook).

2. TRADES FOR DEMONSTRATION & EXPOSURE:
1. Plumbing, Machine Shop, Power tools in construction and Wood Working.

Text Books:
1. Workshop Practice /B. L. Juneja / Cengage.

2. Workshop Manual / K. Venugopal / Anuradha.

Reference Books:
1. Work shop Manual - P. Kannaiah/ K.L. Narayana/ Scitech.

2. Workshop Manual / Venkat Reddy/ BSP.

57
 Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Study and practice on machine tools and their operations

2. Practice on manufacturing of components using workshop trades including

pluming, fitting, carpentry, and foundry, house wiring and welding.
3. Identify and apply suitable tools for different trades of engineering processes
including drilling, material removing, measuring, and chiseling.
4. Build right attitude, team working, precision and safety at work place.
5. Apply basic electrical engineering knowledge and various manufacturing processes.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M L M L

CO-2 H M L

CO-3 H L

CO-4 L L

CO-5 L

H-HIGH M-MODERATE L-LOW

58
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EN204HS) ENGLISH FOR SKILL ENHANCEMENT

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
2-0-0-2

Course Objectives:
The objectives of this course is to provide:
 Improve the language proficiency of students in English with an emphasis on
Vocabulary, Grammar, Reading skills.
 Develop study skills and communication skills in various professional situations.
 Study engineering subjects more effectively and critically using the theoretical
and practical components of the syllabus.
 Understand the importance of reading
 Develop writing skills of the students in English
UNIT –I:

Chapter entitled ‘Toasted English’ by R.K.Narayan from “English: Language, Context and
Culture” published by Orient Black Swan, Hyderabad.

Vocabulary: The Concept of Word Formation - The Use of Prefixes and Suffixes -
Acquaintance with Prefixes and Suffixes from Foreign Languages to form Derivatives -
Synonyms and Antonyms Grammar: Identifying Common Errors in Writing with Reference
to Articles and Prepositions- Active and Passive Voice.
Reading: Reading and Its Importance - Techniques for Effective Reading.

Writing: Sentence Structures - Use of Phrases and Clauses in Sentences- Importance of

Proper Punctuation - Techniques for Writing precisely – Paragraph Writing -Types,
Structures and Features of a Paragraph - Creating Coherence - Organizing Principles of
Paragraphs in Documents.

UNIT-II:

Chapter entitled ‘Appro JRD’ by Sudha Murthy from “English: Language, Context and
Culture” published by Orient BlackSwan, Hyderabad.

Vocabulary: Words Often Miss spelt - Homophones, Homonyms and Homographs

Grammar: Identifying Common Errors in Writing with Reference to Noun-pronoun

Agreement and Subject-Verb Agreement.
Reading: Sub-Skills of Reading – Skimming and Scanning – Exercises for Practice
59
Writing: Nature and Style of Writing - Defining/Describing People, Objects, Places and
Events –

60
Classifying - Providing Examples or Evidence.

UNIT-III:

Chapter entitled ‘Lessons from Online Learning’ by F. Haider Alvi, Deborah Hurst et al

from

“English: Language, Context and Culture” published by Orient BlackSwan, Hyderabad.

Vocabulary: Words Often Confused - Words from Foreign Languages and their
Use in English.
Grammar: Identifying Common Errors in Writing with Reference to Misplaced
Modifiers and Tenses.

Reading: Sub-Skills of Reading – Intensive Reading and Extensive Reading –

Exercises for Practice.
Writing: Format of a Formal Letter - Writing Formal Letters E.g.., Letter of
Complaint, Letter of Requisition, Email Etiquette, Job Application with
CV/Resume.
UNIT-IV:

Chapter entitled ‘Art and Literature’ by Abdul Kalam from “English: Language, Context and
Culture” published by Orient BlackSwan, Hyderabad.

Vocabulary: Standard Abbreviations in English

Grammar: Redundancies and Clichés in Oral and Written Communication.

Reading: Survey, Question, Read, Recite and Review (SQ3R Method) - Exercises for
Practice
Writing: Writing Practices- Essay Writing-Writing Introduction and Conclusion
– Précis Writing.

UNIT-V:

Chapter entitled ‘Go, Kiss the World’ by Subroto Bagchi from “English: Language,
Context and Culture” published by Orient BlackSwan, Hyderabad.

Vocabulary: Technical Vocabulary and their Usage

Grammar: Common Errors in English (Covering all the other aspects of grammar which were not
covered in the previous units)
Reading: Reading Comprehension-Exercises for Practice

Writing: Technical Reports - Introduction – Characteristics of a Report –

Categories of Reports Formats- Structure of Reports (Manuscript
Format) -Types of Reports
- Writing a Report.
61
Text Book:
1. “English: Language, Context and Culture” by Orient BlackSwan Pvt. Ltd, Hyderabad.
2022.

62
 Reference Books:
1. Effective Academic Writing by Liss and Davis (OUP)

2. Wood, F.T. (2007). Remedial English Grammar. Macmillan.

3. Vishwamohan, Aysha. (2013). English for Technical Communication for

Engineering Students. Mc Graw-Hill Education India Pvt. Ltd.
4. Swan, Michael. (2016). Practical English Usage. Oxford University Press. Fourth
Edition.
Course Outcomes:

Upon the successful completion of this course, the student will be able to:
1. Understand the importance of vocabulary and sentence structures.
2. Choose appropriate vocabulary and sentence structures for oral and written
communication.
3. Demonstrate understanding of the rules of functional grammar.
4. Develop comprehension skills from known and unknown passages through
effective reading strategies.
5. Construct paragraphs, letters, essays, abstracts, précis and reports in various
contexts thereby improving proficiency in writing modules of English.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L H L

CO-2 L H M M M

CO-3 M L L H M

CO-4 H M L M L

CO-5 H H M H M

H-HIGH M-MODERATE L-LOW

63
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC205ES) ELECTRONIC DEVICES AND CIRCUITS

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

2-0-0-2

Prerequisite: Applied physics

Course Objectives:
The objectives of this course is to provide:

 To introduce components such as diodes,.

 To know the applications of Diode.

 To understand the characteristics of the BJT.

 To understand the characteristics of the JFET and MOSFET.
 To understand the characteristics of the special purpose devices.

UNIT - I

Diodes: Diode - Static and Dynamic resistances, Equivalent circuit, Diffusion and
Transition Capacitances, V-I Characteristics of Diode, Diode as a switch- switching times.
UNIT - II

Diode Applications: Rectifier - Half Wave Rectifier, Full Wave Rectifier, Bridge Rectifier,
Rectifiers with Capacitive and Inductive Filters,
Clippers and Clampers: Clippers-Clipping at two independent levels, Clamper-Clamping
Circuit Theorem, Clamping Operation, Types of Clampers.
UNIT - III

Bipolar Junction Transistor (BJT): Principle of Operation, Common Emitter, Common Base
and Common Collector Configurations, Transistor as a switch, switching times.
UNIT - IV

Junction Field Effect Transistor (FET): Construction, Principle of Operation, Pinch-Off

Voltage, Volt-Ampere Characteristic, Comparison of BJT and FET, FET as Voltage
Variable Resistor, MOSFET,MOSTET as a capacitor.
UNIT – V

Special Purpose Devices: Zener Diode - Characteristics, Zener diode as Voltage

Regulator, Principle of Operation - SCR, Tunnel diode, UJT, Varactor Diode, Photo
diode, Solar cell, LED, Schottky diode.

64
Text Books:
1. Electronic Devices and Circuits - J.Millman, C.C.Halkias, and SatyabrathaJit
Tata McGraw Hill, 2nd Ed.,2007.
2. Electronic Devices and Circuits - R.L. Boylestad and Louis
Nashelsky, Pearson/Prentice Hall, 9thEdition,2006.
3. Introduction to Electronic Devices and Circuits- Rober T. PaynterPE

Reference Books:
1. Electronic Devices and Circuits - T.F. Bogart Jr., J.S.Beasley and
G.Rico, Pearson Education, 6th edition,2004.
2. Principles of Electronic Circuits - S.G.Burns and P.R.Bond, Galgotia Publications, 2nd
Edn..,1998.
3. Microelectronics - Millman and Grabel, Tata McGraw Hill,1988.

4. Electronic Devices and Circuits - Dr. K. Lal Kishore,B.S.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Analyze the PN Junction diode operation and its characteristics

2. Know the applications of Diode such as clippers and clampers.

3. Analyze the characteristics of BJT.

4. Analyze the characteristics of FET.

5. Understand the concept of special purpose devices.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H L M L L L M

CO-2 H L M L L L H

CO-3 H M H M L L H

CO-4 H M H M L L H

CO-5 H H H M L L M

H-HIGH M-MODERATE L-LOW

65
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AP206BS) APPLIED PHYSICS LABORATORY

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0-0-3-1.5

Prerequisites: Basic knowledge of higher secondary school level experimental

physics, electronics and mathematics are preferred.

Course Objectives:
The objectives of this course is to provide:
 To gain practical knowledge related to optics experiments by performing Newton’s
rings, diffraction grating and single slit diffraction.
 Capable of handling instruments related to photoelectric effect experiment and its
Measurements
 Understand the characteristics of various devices such as PN junction diode, Zener
diode, BJT, LED, solar Cell and energy gap and semiconductor materials
 Understand the characteristics of Lasers and optical fiber
 Understanding the method of least squares fitting.
LIST OF EXPERIMENTS:

1. Newton’s rings – Determination of radius of curvature of plano convex lens

2. Diffraction grating – Determination of wavelength of a monochromatic source

3. Single slit diffraction using Lasers – Determination of wavelength of laser light.

4. Dispersive power of the material of a prism by minimum deviation method.

5. Determination of work function and Planck’s constant using photo electric effect.

6. (a) V-I characteristics of light emitting diode(LED)

7. (b) V-I characteristics of LASER diode

8. V-I characteristics of a p-n junction diode and Zenar diode

9. V-I Characteristics of solar cell

10. Input and output characteristics of BJT(CE,CB&CC configurations)

11. Determination of energy gap of a semiconductor

(a) Determination of acceptance angle and numerical aperture of an optical

fiber.

(b) Binding losses of optical fiber

12. Understanding the method of least squares–torsionalpendulumas an example.

66
Reference Book:
1. S. Balasubramanian, M.N. Srinivasan “A Text book of Practical Physics”-
S Chand Publishers,2017

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Know the determination of the Planck’s constant using Photo electric effect

2. Appreciate quantum physics in semiconductor devices and opto electronics.

3. Gain the knowledge of various semiconductor devices like .PN junction diode,
Zener diode, BJT, LED, solar Cell
4. Understand the properties and principles of laser and optical fiber.
5. Carried out data analysis

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M M L

CO-2 H L L L

CO-3 M L M M

CO-4 H M M L M

CO-5 M M M

H-HIGH M-MODERATE L-LOW

67
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS207ES) PYTHON PROGRAMMING LABORATORY

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
0-1-2-2
Course Objectives:
The objectives of this course is to provide:
 Able to introduce core programming basics .
 To construct Python programs with control structures.
 To structure a Python Program as a set of functions
 To use Python data structures-lists, tuples, dictionaries.
 To do input/output with files in Python and create Window wizard programs with various
buttons

Note: All the Programs should be implemented using functions.

Week 1

1. i) Use a web browser to go to the Python website http://python.org. This

page contains information about Python and links to Python-related pages,
and it gives you the ability to search the Python documentation.
ii) Start the Python interpreter and type help() to start the online help utility.

2. Start a Python interpreter and use it as a calculator.

3. i) Write a program to calculate compound interest when principal, rate and

numbers of periods are given.
ii) Given coordinates (x1, y1), (x2, y2) find the distance between two points
4. Read name, address, email and phone number of a person through keyboard
and print the details.
Week - 2:

1. Print the below triangle using

for loop. 5
44

333

2222

11111

2. Write a program to check whether the given input is digit or lowercase

character or uppercase character or a special character (use 'if-else-if'
68
 ladder)
3. Python Program to Print the Fibonacci sequence using while loop

69
 4. Python program to print all prime numbers in a given interval (use break)
Week - 3:

1.i) Write a program to convert a list and tuple into arrays.

ii) Write a program to find common values between two arrays.

2. Write a function called gcd that takes parameters a and b and returns their greatest
common divisor.
3.Write a function called palindrome that takes a string argument and returnsTrue if
it is a palindrome and False otherwise. Remember that you can use the built-in
function len to check the length of a string.
Week - 4:

1.Write a function called is sorted that takes a list as a parameter and returns
True if the list is sorted in ascending order and False otherwise.
2.Write a function called has duplicates that take a list and returns True
if there is any element that appears more than once. It should not
modify the original list.

i). Write a function called remove duplicates that takes a list and returns a
new list with only the unique elements from the original. Hint: they don’t
have to be in the same order.
ii). The wordlist I provided, words.txt, doesn’t contain single letter words.
So you might want to add “I”, “a”, and the empty string.
iii). Write a python code to read dictionary values from the user. Construct
a function to invert its content. i.e., keys should be values and values should
be keys.
3. i) Add a comma between the characters. If the given word is 'Apple', it
should become 'A,p,p,l,e'
ii)Remove the given word in all the places in a string?

iii) Write a function that takes a sentence as an input parameter and replaces the
first letter of every word with the corresponding upper case letter and the rest of
the letters in the word by corresponding letters in lower case without using a built-
in function?

4.Writes a recursive function that generates all binary strings of n-bit length
Week - 5:

1.i) Write a python program that defines a matrix and prints

ii) Write a python program to perform addition of two square matrices

iii) Write a python program to perform multiplication of two square matrices

70
 2. How do you make a module? Give an example of construction of a
module using different geometrical shapes and operations on them
as its functions.
3.Use the structure of exception handling all general purpose exceptions.

Week-6:

71
 1. a. Write a function called draw rectangle that takes a Canvas and a
Rectangle as arguments and draws a representation of the
Rectangle on the Canvas.
b. Add an attribute named color to your Rectangle objects and modify draw
rectangle so that it uses the color attribute as the fill color.
c.Write a function called draw point that takes a Canvas and a Point as
arguments and draws a representation of the Point on the Canvas.
d.Define a new class called Circle with appropriate attributes and
instantiate a few Circle objects. Write a function called draw circle
that draws circles on the canvas.
2. Write a Python program to demonstrate the usage of Method
Resolution Order (MRO) in multiple levels of Inheritances.
3. Write a python code to read a phone number and email-id from the
user and validate it for correctness.

Week- 7

1. Write a Python code to merge two given file contents into a third file.

2. Write a Python code to open a given file and construct a function to

check for given words present in it and display on found.
3.Write a Python code to Read text from a text file, find the word with
most number of occurrences
4.Write a function that reads a file file1 and displays the number of
words, number of vowels, blank spaces, lower case letters and
uppercase letters.
Week - 8:

1. Import numpy, Plotpy and Scipy and explore their functionalities.

2. a) Install NumPy package with pip and explore it.

3.Write a program to implement Digital Logic Gates – AND, OR, NOT, EX-OR

4.Write a program to implement Half Adder, Full Adder, and Parallel Adder

5. Write a GUI program to create a window wizard having two text

labels, two text fields and two buttons as Submit and Reset.

Text Books:
1. Supercharged Python: Take your code to the next level, Overland

2. Learning Python, Mark Lutz, O'reilly

Reference Books:
1. Python for Data Science, Dr. Mohd. Abdul Hameed, Wiley Publications - 1st Ed. 2021.
72
2. Python Programming: A Modern Approach, Vamsi Kurama, Pearson

3. Python Programming A Modular Approach with Graphics, Database,

Mobile, and Web Applications, Sheetal Taneja, Naveen Kumar, Pearson

73
 4. Programming with Python, A User’s Book, Michael Dawson, Cengage
Learning, India Edition

5. Think Python, Allen Downey, Green Tea Press

6. Core Python Programming, W. Chun, Pearson

7. Introduction to Python, Kenneth A. Lambert, Cengage

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Able to develop programs using control statements.

2. Able to code programs using modular approach.

3. Read and write data from/to files in Python Programs

4. To write GUI program to create window wizard using various buttons.

5. Implement digital systems using python and to install and use various libraries.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M M M M L

CO-2 L M M M M M

CO-3 L M M M M M

CO-4 L M H M H H H

CO-5 H H H H H H H

H-HIGH M-MODERATE L-LOW

74
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EN208HS) ENGLISH LANGUAGE AND COMMUNICATION SKILLS

LABORATORY

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0-0-2-1

Course Objectives:
The objectives of this course is to provide:
 To facilitate computer-assisted multi-media instruction enabling individualized and
independent language learning
 To sensitize the students to the nuances of English speech sounds, word accent,
intonation and rhythm
 To bring about a consistent accent and intelligibility in students’ pronunciation
of English by providing an opportunity for practice in speaking
 To improve the fluency of students in spoken English and neutralize the impact of
dialects.

 To train students to use language appropriately for public speaking, group

discussions and interviews

Exercise I
CALL Lab:
Understand: Listening Skill- its importance-Purpose-Process-Types-Barriers-
Effective Listening.
Practice: Introduction to Phonetics- Speech Sounds- Vowels and Consonants- Minimal
Pairs - Consonant Clusters - Past Tense Marker and Plural Marker - Testing Exercises
ICS Lab:

Understand: Spoken vs. Written language - Formal and Informal English.

Practice: Ice-Breaking Activity and JAM Session- Situational Dialogues – Greetings –

Taking Leave – Introducing Oneself and Others.
Exercise II
CALL Lab:
Understand: Structure of Syllables – Word Stress– Weak Forms and Strong
Forms – Stress pattern in sentences – Intonation.
Practice: Basic Rules of Word Accent - Stress Shift - Weak Forms and Strong Forms-
Stress pattern in sentences – Intonation - Testing Exercises
ICS Lab:
75
Understand: Features of Good Conversation – Strategies for Effective Communication.
Practice:

76
 Situational Dialogues – Role Play- Expressions in Various Situations –Making
Requests and Seeking Permissions - Telephone Etiquette.
Exercise III
CALL Lab:
Understand: Errors in Pronunciation-Neutralizing Mother Tongue Interference (MTI).

Practice: Common Indian Variants in Pronunciation – Differences between British

and American Pronunciation - Testing Exercises

ICS Lab:

Understand: Descriptions – Narrations - Giving Directions and Guidelines – Blog

Writing- Netiquette.
Practice: Giving Instructions – Seeking Clarifications – Asking for and Giving
Directions – Thanking and Responding – Agreeing and Disagreeing – Seeking and
Giving Advice – Making Suggestions.

Exercise
IV CALL
Lab:
Understand: Listening for General Details.

Practice: Listening Comprehension Tests - Testing Exercises

ICS Lab:

Understand: Public Speaking – Exposure to Structured Talks - Non-verbal

Communication - Presentation Skills.
Practice: Making a Short Speech – Extempore - Making a Presentation.

Exercise V
CALL Lab:
Understand: Listening for Specific Details.

Practice: Listening Comprehension Tests -Testing Exercises

ICS Lab:

Understand: Introduction to Group Discussion and Interviews

Practice: Group Discussion and Mock Interviews

Reference Books:

1. (2022). English Language Communication Skills – Lab Manual cum

Workbook. Cengage Learning India Pvt. Ltd.
2. Shobha, KN & Rayen, J. Lourdes. (2019). Communicative English – A
workbook. Cambridge University Press

77
3. Board of Editors. (2016). ELCS Lab Manual: A Workbook for
CALL and ICS Lab Activities. Orient Black Swan Pvt. Ltd.

78
Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Reproduce speech sounds and improve language
2. Develop accent and pronunciation in various situations
3. Understand variants in pronunciation by differentiating between British and
American accents
4. Identify the diverse purposes of listening and speaking
5. Exhibit critical thinking, problem-solving and decision-making skills through Group
Discussions and Interviews.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L M M M M

CO-2 M L M M M

CO-3 M L M L L

CO-4 M H H H H

CO-5 H H H H M

H-HIGH M-MODERATE L-LOW

79
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS209ES) IT WORKSHOP

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0-0-2-1
Course Objectives:
The objectives of this course are to provide:
 Training on PC Hardware, troubleshooting
 Training Internet & World Wide Web and
 Training Productivity tools including Word, Excel, PowerPoint and Publisher.
 Training on Safeguard computer systems from viruses/worms
 Training on Document/ Presentation preparation

PC Hardware
Task 1: Identify the peripherals of a computer, components in a CPU and its functions.
Draw the block diagram of the CPU along with the configuration of each peripheral
and submit to your instructor.
Task 2: Every student should disassemble and assemble the PC back to working
condition. Lab instructors should verify the work and follow it up with a Viva. Also
students need to go through the video which shows the process of assembling a PC. A
video would be given as part of the course content.
Task 3: Every student should individually install MS windows on the personal computer.
Lab instructor should verify the installation and follow it up with a Viva.
Task 4: Every student should install Linux on the computer. This computer should have
windows installed. The system should be configured as dual boot with both Windows
and Linux. Lab instructors should verify the installation and follow it up with a Viva
Internet & World Wide Web

Task1: Orientation & Connectivity Boot Camp: Students should get connected to their
Local Area Network and access the Internet. In the process they configure the TCP/IP
setting. Finally students should demonstrate, to the instructor, how to access the
websites and email. If there is no internet connectivity preparations need to be made
by the instructors to simulate the WWW on the LAN. Task 2: Web Browsers, Surfing the
Web: Students customize their web browsers with the LAN proxy settings,
bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia
Flash and JRE for applets should be configured.
Task 3: Search Engines & Netiquette: Students should know what search engines are and
how to use the search engines. A few topics would be given to the students for which
80
they need to search on Google. This should be demonstrated to the instructors by the
student.

81
Task 4: Cyber Hygiene: Students would be exposed to the various threats on the internet
and would be asked to configure their computer to be safe on the internet. They need
to customize their browsers to block pop ups, block active x downloads to avoid
viruses and/or worms.
LaTeX and WORD

Task 1 – Word Orientation: The mentor needs to give an overview of LaTeX and Microsoft
(MS) office or equivalent (FOSS) tool word: Importance of LaTeX and MS office or
equivalent (FOSS) tool Word as word Processors, Details of the four tasks and
features that would be covered in each, Using LaTeX and word – Accessing,
overview of toolbars, saving files, Using help and resources, rulers, format painter in
word.
Task 2: Using LaTeX and Word to create a project certificate. Features to be covered:-
Formatting Fonts in word, Drop Cap in word, Applying Text effects, Using
Character Spacing, Borders and Colors, Inserting Header and Footer, Using Date
and Time option in both LaTeX and Word.
Task 3: Creating project abstract Features to be covered:-Formatting Styles, Inserting
table, Bullets and Numbering, Changing Text Direction, Cell alignment, Footnote,
Hyperlink, Symbols, Spell Check, Track Changes.
Task 4: Creating a Newsletter: Features to be covered:- Table of Content, Newspaper
columns, Images from files and clipart, Drawing toolbar and Word Art, Formatting
Images, Textboxes, Paragraphs and Mail Merge in word.

Excel

Excel Orientation: The mentor needs to tell the importance of MS office or

equivalent (FOSS) tool Excel as a Spreadsheet tool, give the details of the four tasks
and features that would be covered in each. Using Excel – Accessing, overview of
toolbars, saving excel files, Using help and resources.
Task 1: Creating a Scheduler - Features to be covered: Gridlines, Format Cells,
Summation, auto fill, Formatting Text
Task 2 : Calculating GPA - .Features to be covered:- Cell Referencing, Formulae in
excel – average, std. deviation, Charts, Renaming and Inserting worksheets,
Hyper linking, Count function, LOOKUP/VLOOKUP
Task 3: Split cells, freeze panes, group and outline, Sorting, Boolean and logical
operators, Conditional formatting
PowerPoint

Task 1: Students will be working on basic power point utilities and tools which help
them create basic powerpoint presentations. PPT Orientation, Slide Layouts,
Inserting Text, Word Art, Formatting Text, Bullets and Numbering, Auto Shapes,
82
Lines and Arrows in PowerPoint.
Task 2: Interactive presentations - Hyperlinks, Inserting –Images, Clip Art, Audio,
Video, Objects, Tables and Charts.

83
 Task 3: Master Layouts (slide, template, and notes), Types of views (basic,
presentation, slide slotter, notes etc), and Inserting – Background, textures, Design
Templates, Hidden slides.

Reference Books:
1. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dreamtech

2. The Complete Computer upgrade and repair book, 3rd edition Cheryl
A Schmidt, WILEY Dreamtech
3. Introduction to Information Technology, ITL Education Solutions
limited, Pearson Education.
4. PC Hardware - A Handbook – Kate J. Chase PHI (Microsoft)

5. LaTeX Companion – Leslie Lamport, PHI/Pearson.

6. IT Essentials PC Hardware and Software Companion Guide Third

Edition by David Anfinson and Ken Quamme. – CISCO Press, Pearson
Education.
7. IT Essentials PC Hardware and Software Labs and Study Guide Third
Edition by Patrick Regan CISCO Press, Pearson Education.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Perform Hardware troubleshooting
2. Understand Hardware components and inter dependencies
3. Safeguard computer systems from viruses/worms
4. Document/ Presentation preparation
5. Perform calculations using spreadsheets

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M M H M

CO-2 M H M M H M

CO-3 M M M M H M

CO-4 M M L M M H M

CO-5 M L M M H M

H-HIGH M-MODERATE L-LOW

84
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(ES210MC) ENVIRONMENTAL SCIENCE

I Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0- 0- 0

Course Objectives:
The objectives of this course is to provide:
 To explain the multidisciplinary nature of environment, essence and
functioning of ecosystem,
 To impart knowledge about natural resources and their protection
 To inculcate the importance of Biodiversity and its conservation
 To explain about the causes and effects of environmental pollution and its
management as well as environmental issues
 To discuss about the environmental wastes Management rules, regulations, EIA for
the protection of environment and to make students to understand about sustainable
development.
UNIT - I
Ecosystems: Definition, Scope, and Importance of ecosystem. Classification, structure,
and function of an ecosystem, Food chains, food webs, and ecological pyramids. Flow of
energy, Biogeochemical cycles, Bioaccumulation, Bio magnification, ecosystem value,
services and carrying capacity. Structural features- Biotic structure, Abiotic structure,
Ecological succession, Types of Ecosystems.
UNIT-II
Natural Resources: Classification of Resources: Water resources: use and over utilization of
surface and ground water, floods and droughts, Dams: benefits and problems. Mineral
resources: use and exploitation, environmental and social effects of extracting and using
mineral resources, Land resources: Desertification. Forest resources: Use and
overexploitation, Deforestation. Energy resources: growing energy needs, renewable
energy sources, use of alternate energy sources.
UNIT-III
Biodiversity and Biotic Resources: Introduction, Definition, genetic, species and ecosystem
diversity. Value of biodiversity; consumptive use, productive use, social, ethical,
aesthetic and optional values. India as a mega diversity nation, Hot spots of biodiversity.
Field visit. Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife
conflicts; conservation of biodiversity: In-Situ and Ex-situ conservation. National
Biodiversity act.
85
UNIT-IV
Environmental Pollution and Control Technologies: Environmental Pollution: Classification of
pollution, Air Pollution: Primary and secondary pollutants, Ambient air quality
standards. Water pollution: Sources and types of pollution, drinking water quality
standards.

86
Soil Pollution: Sources and types, Impacts of modern agriculture. Landslides, floods,
cyclones. Noise Pollution: Sources and Health hazards, standards. Solid waste: Municipal
Solid Waste management, composition and characteristics of e-Waste and its
management. Pollution control technologies: Wastewater Treatment methods: Primary,
secondary and Tertiary. Overview of air pollution control technologies, Concepts of
bioremediation.
Global Environmental Issues and Global Efforts: Climate change and impacts on human
environment. Ozone depletion and Ozone depleting substances (ODS). Deforestation
and desertification. International conventions / Protocols: Earth summit, Kyoto protocol,
and Montréal Protocol. NAPCC-GoI Initiatives
UNIT-V
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal aspects Air
Act- 1981, Water Act, Municipal solid waste management and handling rules,
biomedical waste management and handling rules, hazardous waste management and
handling rules. EIA: EIA structure and steps.
Towards Sustainable Future: Concept of Sustainable Development Goals, Population and
its explosion, Crazy Consumerism, Environmental Education, Urban Sprawl, Human
health, Environmental Ethics, Concept of Green Building, Ecological Foot Print, Life
Cycle assessment (LCA), Low carbon life style.

Text Books:
1.Textbook of Environmental Studies for Undergraduate Courses by Erach
Bharucha for University Grants Commission, University Press.
2.Environmental studies, From Crisis to cure by R.Rajagopalan, third edition

Reference Books:
1. Environmental Science: towards a sustainable future by Richard T.Wright.2008
PHL Learning Private Ltd .New Delhi
2. Environmental Engineering and science by Gilbert M.Masters and Wendell
P.Ela.2008 PHI Learning Pvt. Ltd.
3. Environmental Science by Daniel B. Botkin& Edward A. Keller, Wiley INDIA edition.
4. Environmental Studies by Anubha Kaushik, 4th Edition, New age international
publishers.
5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy 2007, BS
Publications.
6. Introduction to Environmental Science by Y. Anjaneyulu, BS.Publications.

87
 Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. The multidisciplinary nature of environment, essence of environment,
2. About the natural resources utilization and their conservation
3. The importance of Biodiversity and its Conservation
4. About the causes and effects of environmental pollution and its
management as well as environmental issues
5. About the environmental wastes management rules, regulations and EIA for the
protection of environment and to achieve sustainable development.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H H M L H M

CO-2 H H H M L H M

CO-3 M M H M

CO-4 M M M L

CO-5 M M M L M

H-HIGH M-MODERATE L-LOW

88
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(PS301BS) PROBABILITY AND STATISTICS

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3- 0- 0- 3

Pre-requisites: Mathematics courses of first year of study.

Course Objectives:
The objectives of this course is to provide:
 Basic concepts of probability and Understand Chance causes and random variable
that describes randomness or an uncertainty in certain realistic situation. It can be of
either discrete or continuous type.
 Concepts like mean variance, co-variance of random variables expectation, discrete
distributions.
 The Normal random variable for the continuous case predominantly describes
important probability distributions, the types of sampling and Sampling distribution.
 Estimations of statistical parameters and Testing of hypothesis of few
unknown statistical parameters.
 Understand the stochastic process and Markov chains.
UNIT - I: Probability
Sample Space, Events, Counting Sample Points, Probability of an Event, Additive Rules,
Conditional Probability, Independence, and the Product Rule, Baye’s Rule, Random Variables
and Probability Distributions: Concept of a Random Variable, Discrete Probability Distributions,
Continuous Probability Distributions.
UNIT - II: Expectation and discrete distributions
Mean of a Random Variable, Variance and Covariance of Random Variables, Means and
Variances of Linear Combinations of Random Variables, Chebyshev’s Theorem. Discrete
Probability Distributions: Binomial Distribution, Poisson distribution.
UNIT - III: Continuous and Sampling Distributions
Uniform Distribution, Normal Distribution, Areas under the Normal Curve, Applications of
the Normal Distribution, Normal Approximation to the Binomial Distributions.
Fundamental Sampling Distributions: Random Sampling, Some Important Statistics, Sampling
Distributions, Sampling Distribution of Means and the Central Limit Theorem, t -
Distribution, F- Distribution.
UNIT - IV: Sample Estimation & Tests of Hypotheses
Introduction, Statistical Inference, Classical Methods of Estimation, Single Sample:

89
Estimating the mean, standard error of a point estimate, prediction interval. Two sample:
Estimating the difference between two means, Single sample: Estimating a proportion,
Two samples: Estimating the difference between two

90
proportions, Two samples: Estimating the ratio of two variances. Statistical Hypotheses:
General Concepts, Testing a Statistical Hypothesis, Single sample: Tests concerning a
single mean, Two samples: tests on two means, One sample: test on a single proportion.
Two samples: tests on two proportions, Two- sample tests concerning variances.
UNIT-V: Stochastic Processes and Markov Chains
Introduction to Stochastic processes- Markov process. Transition Probability, Transition
Probability Matrix, First order and Higher order Markov process, n-step transition
probabilities, Markov chain, Steady state condition, Markov analysis.

Text Books:
1. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, Probability &
Statistics For Engineers & Scientists, 9th Ed. Pearson Publishers.
2. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna
publications.
3. S.D.Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut, Delhi.

Reference Books:
1. T.T. Soong, Fundamentals of Probability and Statistics For Engineers, John Wiley &
Sons, Ltd,2004.
2. Sheldon M Ross, Probability and statistics for Engineers and scientists, academic press.
3. Miller and Freund’s, Probability and Statistics for Engineers, 8th Edition, Pearson
Educations.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Basic concepts of probability and Understand Chance causes and random variable that
describes randomness or an uncertainty in certain realistic situation. It can be of either
discrete or continuous type.
2. Concepts like mean variance, co-variance of random variables expectation, discrete
distributions.
3. The Normal random variable for the continuous case predominantly describes
important probability distributions, the types of sampling and Sampling distribution.
4. Estimations of statistical parameters and Testing of hypothesis of few
unknown statistical parameters.
5. Understand the stochastic process and Markov chains.

91
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H M M M L L L H

CO-2 H H M M M L L L H

CO-3 H H M M M L L L M

CO-4 H H M M M L L L M

CO-5 M M M M M L L L M

H-HIGH M-MODERATE L-LOW

92
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS303PC) DATA STRUCTURES

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0- 0- 3
Prerequisite: Programming for Problem Solving
Course Objectives:
The objectives of this course are to provide:
 Exploring knowledge of basic data structures and their implementations
 Introduces a variety of data structures such as dictionaries, hash tables
 Exploring knowledge of search trees
 Understanding on sorting techniques and graphs
 Introduces pattern matching algorithms
UNIT - I
Introduction to Data Structures, abstract data types, Linear list – singly linked list
implementation, insertion, deletion and searching operations on linear list, Stacks-
Operations, array and linked representations of stacks, stack applications, Queues-
operations, array and linked representations.
UNIT - II
Dictionaries: linear list representation, skip list representation, operations - insertion,
deletion and searching. Hash Table Representation: hash functions, collision resolution-
separate chaining, open addressing- linear probing, quadratic probing, double hashing,
rehashing, extendible hashing.
UNIT - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching,
Insertion and Deletion, B- Trees, B+ Trees, AVL Trees, Definition, Height of an AVL Tree,
Operations – Insertion, Deletion and Searching, Red –Black, Splay Trees.
UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods. Sorting: Quick Sort,
Heap Sort, External Sorting- Model for external sorting, Merge Sort.
UNIT - V
Pattern Matching and Tries: Pattern matching Algorithms-Brute force, the Boyer –Moore
algorithm, the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix
tries.

Text Books:
93
1. Fundamentals of Data Structures in C, 2 nd Edition, E. Horowitz, S.
Sahni and Susan AndersonFreed, Universities Press.
2. Data Structures using C – A. S.Tanenbaum, Y. Langsam, and M.J. Augenstein,
PHI/PearsonEducation.

94
Reference Book:
1. Data Structures: A Pseudocode Approach with C, 2 nd Edition, R. F.
Gilberg and B.A.Forouzan, Cengage Learning.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Analyze the representation of various static, dynamic and, hierarchical data
structures and Design and implement the mechanism of linear data structures.
2. Outline the concepts of hashing, collision and its resolution methods using hash function.
3. Design and Implementation of various advanced concepts of binary trees.
4. Implement various algorithms on graph data structures and implementation of
various sorting techniques.
5. Design and implementation of Pattern Matching algorithms to find patterns within a
bigger set of data or text.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H M M M H H

CO-2 M H M M M H H

CO-3 L H H M M H H

CO-4 H M M M M M M

CO-5 M M H L M M M

H-HIGH M-MODERATE L-LOW

95
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS304PC) COMPUTER ORGANIZATION AND ARCHITECTURE

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0- 0- 3
Co-requisite: A Course on “Digital Electronics”.
Course Objectives:
The objectives of this course are to provide:
 To introduce the Digital computers and various types Register transfer language
micro operation, basic computer organization and its design.
 Topics include control memory, address sequencing Micro program example, design of
control unit, and central processing unit, various instruction formats, addressing
modes and program control.
 To study the various data types representation, arithmetic operations and floating
point arithmetic operations.
 To study the different ways of communicating with input and output devices and
Memory mapping Techniques.
 To study the RISC and CISC characteristics, Pipeline processing, characteristics multi
processor and its interconnection structures
UNIT - I
Digital Computers: Introduction, Block diagram of Digital Computer, Definition of
Computer Organization, Computer Design and Computer Architecture.
Register Transfer Language and Micro operations: Register Transfer language, Register
Transfer, Bus and memory transfers, Arithmetic Micro operations, logic micro operations,
shift micro operations, Arithmetic logic shift unit. Basic Computer Organization and
Design: Instruction codes, Computer Registers Computer instructions, Timing and
Control, Instruction cycle, Memory Reference Instructions, Input – Output and Interrupt.
UNIT - II
Micro programmed Control: Control memory, Address sequencing, micro program example,
design of control unit. Central Processing Unit: General Register Organization, Instruction
Formats, Addressing modes, Data Transfer and Manipulation, Program Control.
UNIT - III
Data Representation: Data types, Complements, Fixed Point Representation, Floating
Point Representation. Computer Arithmetic: Addition and subtraction, multiplication
96
Algorithms, Division Algorithms, Floating– point Arithmetic operations. Decimal Arithmetic
unit, Decimal Arithmetic

97
operations.
UNIT - IV
Input-Output Organization: Input-Output Interface, Asynchronous data transfer, Modes
of Transfer, Priority Interrupt Direct memory Access. Memory Organization: Memory
Hierarchy, Main Memory, Auxiliary memory, Associate Memory, Cache Memory.
UNIT - V
Reduced Instruction Set Computer: CISC Characteristics, RISC Characteristics.
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline,
Instruction Pipeline, RISC Pipeline, Vector Processing, Array Processor.
Multi Processors: Characteristics of Multiprocessors, Interconnection Structures,
Inter processor arbitration, Inter processor communication and synchronization,
Cache Coherence.

Text Book:
1. Computer System Architecture – M. Morris Mano, Third Edition, Pearson/PHI.

Reference Books:
1. Computer Organization – Carl Hamacher, Zvonks Vranesic, SafeaZaky, V th Edition,
McGrawHill.
2. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI.
3. Structured Computer Organization – Andrew S. Tanenbaum, 4 th Edition, PHI/Pearson.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the basics of instruction sets and their impact on processor design.
2. Demonstrate an understanding of the design of the functional units of a
digital computer system.
3. Evaluate cost performance and design trade-offs in designing and
constructing a computer processor including memory.
4. Design a pipeline for consistent execution of instructions with minimum hazards.
5. Recognize and manipulate representations of numbers stored in digital computers.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M H L M H L

CO-2 L L H L M H

CO-3 H H M L H H
CO-4 L M L M

98
CO-5 H L L M H

H-HIGH M-MODERATE L-LOW

99
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM305PC) SOFTWARE ENGINEERING

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3- 0- 0- 3

Course Objectives:
The objectives of this course is to provide:
 Knowledge of basic software engineering methods and practices, and their appropriate
application and a general understanding of software process models.
 Understanding of software requirements and the SRS documents.
 Understanding of different software architectural styles and design models.
 Understanding of software testing approaches, techniques and metrics.
 Understanding on quality control and risk management.
UNIT - I
Introduction to Software Engineering: The Evolving Role of Software, Changing Nature of
Software, Software Myths. A Generic View of Process: Software Engineering- A Layered
Technology, A Process Framework, The Capability Maturity Model Integration (CMMI).
Process Models: The Waterfall Model, Spiral Model and Agile Methodology
UNIT - II
Software Requirements: Functional and Non-Functional Requirements, User Requirements,
System Requirements, Interface Specification, The Software Requirements Document.
Requirements Engineering Process: Feasibility Studies, Requirements Elicitation and Analysis,
Requirements Validation, Requirements Management.
UNIT - III
Design Engineering: Design Process and Design Quality, Design Concepts, The Design
Model. Creating an Architectural Design: Software Architecture, Data Design, Architectural
Styles and Patterns, Architectural Design. UML: Conceptual Model of UML, Basic Structural
Modeling, Class Diagrams, Sequence Diagrams, Collaboration Diagrams, Use Case
Diagrams, Component Diagrams.
UNIT – IV
Testing Strategies: A Strategic Approach to Software Testing, Test Strategies for Conventional
Software, Black-Box and White-Box Testing, Validation Testing, System Testing, The Art of
Debugging.
Metrics for Process and Products: Software Measurement, Metrics for Software Quality.
UNIT - V
10
0
Risk Management: Reactive Vs Proactive Risk Strategies, Software Risks, Risk Identification,
Risk Projection, Risk Refinement, RMMM. Quality Management: Quality Concepts,
Software Quality

10
1
Assurance, Software Reviews, Formal Technical Reviews, Statistical Software Quality
Assurance, Software Reliability, The ISO 9000 Quality Standards.

Text Books:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6 th edition,
McGraw Hill International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.

Reference Books:
1. The Unified Modeling language user guide Grady Booch, James Rambaugh, Ivar
Jacobson,Pearson Education.
2. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John
Wiley.
3. Software Engineering principles and practice- Waman S Jawadekar, The McGraw-
HillCompanies.
4. Fundamentals of object-oriented design using UML Meiler Page-Jones: Pearson
Education.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the software engineering principles, practices and process models.
2. Elicit, analyse and specify software requirements from the project stakeholders.
3. Analyse and translate the specifications into software designs and model the designs.
4. Apply different test strategies to perform testing and metrics to assess the software.
5. Identify and manage software risks and maintain the quality of the software.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H

CO-2 M H H M M M H

CO-3 M M H M H M M H

CO-4 L M H M H M H

CO-5 L M M M H M H

H-HIGH M-MODERATE L-LOW

10
2
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM306PC) OPERATING SYSTEMS

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3- 0- 0- 3

Prerequisites:
1. A course on “Computer Programming and Data Structures”.
2. A course on “Computer Organization and Architecture”.

Course Objectives:
The objectives of this course are to provide:
 Understand operating system concepts.
 Analyze process scheduling and synchronization concepts.
 Identify deadlock mechanisms.
 Understand memory management approaches.
 Introduce basic Unix commands, inter-process communication and I/O in Unix
effectively.
UNIT - I
Operating System - Introduction, Structures - Simple Batch, Multi programmed, Time-shared,
Personal Computer, Parallel, Distributed Systems, Real-Time Systems, System components,
Operating System services, System Calls.
Process - Process concepts and scheduling, Operations on processes, Cooperating Processes,
Threads.
UNIT - II
CPU Scheduling - Scheduling Criteria, Scheduling Algorithms, Multiple -Processor
Scheduling. System call interface for process management-fork, exit, wait, waitpid, exec.
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling.
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and
Recovery from Deadlock
UNIT - III
Process Management and Synchronization - The Critical Section Problem, Synchronization
Hardware, Semaphores, and Classical Problems of Synchronization, Critical Regions,
Monitors
Interprocess Communication Mechanisms: IPC between processes on a single computer
system ,IPC between processes on different systems, using pipes, FIFOs, message queues,
shared memory.

10
3
UNIT - IV
Memory Management and Virtual Memory - Logical versus Physical Address Space,
Swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging, Demand Paging,
Page Replacement, Page Replacement Algorithms.

10
4
UNIT - V
File System Interface and Operations -Access methods, Directory Structure, Protection, File
System Structure, Allocation methods, Free-space Management. Usage of open, create,
read, write, close, lseek, stat, ioctl system calls.

Text Books:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition,John Wiley.
2. Advanced programming in the UNIX environment, W.R. Stevens, Pearson education.

Reference Books:
1. Operating Systems- Internals and Design Principles, William Stallings, Fifth Edition–
2005,Pearson Education/PHI
2. Operating System A Design Approach- Crowley, TMH.
3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition, Pearson/PHI
4. UNIX programming environment, Kernighan and Pike, PHI/ Pearson Education
5. UNIX Internals -The New Frontiers, U. Vahalia, Pearson Education.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Will be able to control access to a computer and the files that may be shared
2. Demonstrate the knowledge of the components of computers and their respective roles in
computing.
3. Ability to recognize and resolve user problems with standard operating environments.
4. Gain practical knowledge of how programming languages, operating systems, and
architectures interact and how to use each effectively.
5. Identify storage management and protection

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H L M L M M H

CO-2 M M M L H

CO-3 H L L H

CO-4 H M L M L L M H

CO-5 M M L M

H-HIGH M-MODERATE L-LOW

10
5
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS306PC) DATA STRUCTURES LABORATORY

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
0-0-3-1.5
Prerequisite: A Course on “Programming for problem solving”.
Course Objectives:
The objectives of this course are to provide:
 It covers various concepts of C programming language
 It introduces searching and sorting algorithms
 It provides an understanding of data structures such as stacks and queues.
 It covers various concepts of search trees
 Knowledge on pattern matching algorithms
List of Experiments:
1. Write a program that uses functions to perform the following operations on singly linked
list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
2. Write a program that uses functions to perform the following operations on doubly
linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that uses functions to perform the following operations on circular
linked list.:
i) Creation ii) Insertion iii) Deletion iv) Traversal
4. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given
list of integersin ascending order
i) Quick sort ii) Heap sort iii) Merge sort

7. Write a program to implement the tree traversal methods (Recursive and Non
Recursive).
8. Write a program to implement
i) Binary Search tree ii) B Trees iii) B+ Trees iv) AVL trees

v) Red - Black trees

9. Write a program to implement the graph traversal methods.
10. Implement a Pattern matching algorithms using Boyer- Moore, Knuth-Morris-Pratt

10
6
Text Books:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and
Susan Anderson Freed, Universities Press.

10
7
 2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M. J.
Augenstein, PHI/Pearson Education.

Reference Book:
1. Data Structures: A Pseudo code Approach with C, 2nd Edition, R. F. Gilberg and B.
A. Forouzan, Cengage Learning.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Ability to develop C programs for computing and real-life applications using basic
elements like control statements, functions, pointers and structures and various
linked lists.
2. Ability to develop data structures like stacks and queues using arrays and pointers.
3. Ability to implements the sorting methods like Quick sort, Heap sort and Merge sort.
4. Ability to implement various trees and tree traversal techniques in recursive and
non-recursive manner.
5. Gain knowledge on implementing the graph traversal techniques and Pattern
matching algorithms like Boyer- Moore, Knuth-Morris-Pratt.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M L H H H H

CO-2 M H M M H H H

CO-3 H H M M M H H

CO-4 M M M H M M M

CO-5 M M H L M M M

H-HIGH M-MODERATE L-LOW

10
8
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM307PC) OPERATING SYSTEMS LABORATORY

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0- 0-3-1.5

Prerequisites:
 A course on “Programming for Problem Solving”, A course on “Computer
Organization and Architecture”.

Co-requisite: A course on “Operating Systems”.

Course Objectives:
The objectives of this course are to provide:
 Analyze system calls that can offer operating system services
 Demonstrate various operating system concepts
 Understand and apply concepts towards new operating system design
 Understand the concept of Dead lock and itsavoidance and page
replacementalgorithms
 Understand Unix commands, system calls

List of Experiments:
1. Write C programs to simulate the following CPU Scheduling algorithms a) FCFS b)
SJF c) Round Robin d) priority
2. Write programs using the I/O system calls of UNIX/LINUX operating system (open,
read, write, close,fcntl, seek, stat, opendir, readdir)
3. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance and
Prevention.
4. Write a C program to implement the Producer – Consumer problem using
semaphores using UNIX/LINUX system calls.
5. Write C programs to illustrate the following IPC mechanisms a) Pipes b) FIFOs
c)Message Queues
d) Shared Memory
6. Write C programs to simulate the following memory management
techniques a) Paging b)Segmentation
7. Write C programs to simulate Page replacement policies a) FCFS b) LRU c) Optimal

Text Books:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin,
GregGagne 7th Edition,John Wiley

10
9
2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.

11
0
Reference Books:
1. Operating Systems – Internals and Design Principles, William Stallings,Fifth Edition–
2005,Pearson Education/PHI
2. Operating System - A Design Approach-Crowley, TMH.
3. Modern Operating Systems, Andrew S Tanenbaum, 2nd edition, Pearson/PHI
4. UNIX Programming Environment, Kernighan and Pike, PHI/Pearson Education
5. UNIX Internals: The New Frontiers, U. Vahalia, Pearson Education

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Simulate and implement operating system concepts such as scheduling,
2. Able to implement C programs using Unix system calls
3. Implement the dead lock avoidance using banker’s algorithm
4. Implement the producer and consumer problem and Page Replacement algorithms
5. Exercise inter-process communication.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M L L L M H

CO-2 M H L M L L M H

CO-3 M L H L L M M H

CO-4 H M H M H

CO-5 H M L L L M H

H-HIGH M-MODERATE L-LOW

11
1
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM308PC) SOFTWARE ENGINEERING LABORATORY

II Year B.Tech. CSE(AI & ML)- I Sem L-T-P-C

0- 0-2- 1

Prerequisite:
 A course on “Programming for Problem Solving”.

Course Objectives:
The objectives of this course are to provide:
 Skills to analyse the problem and solution domains.
 Skills to develop software requirements documents.
 Skills to develop software design documents.
 Skills to model design using CASE tools.
 Skills to design test cases.

List of Experiments
Do the following seven exercises for any two projects given in the list of sampleprojects or
any other Projects:
1. Development of problem statements.
2. Preparation of Software Requirement Specification Document, Design Documents and
Testing Phase related documents.
3. Preparation of Software Configuration Management and Risk Management related
Documents.
4. Study and usage of any Design phase CASE tool
5. Performing the Design by using any Design phase CASE tools.
6. Develop test cases for unit testing and integration testing
7. Develop test cases for various white box and black box testing techniques.

Sample Projects:
1. Passport automation System
2. Book Bank
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system
6. E-ticketing
7. Software Personnel Management System
8. Credit Card Processing
11
2
 9. E-book management System.
10. Recruitment system

Text Books:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition,
McGrawHill International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar
Jacobson,Pearson Education.

Reference Books:
1. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz,
JohnWiley.
2. Software Engineering principles and practice- Waman S Jawadekar, The McGraw-Hill.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand and analyse problem domain of the applications
2. Create software requirements documents for the applications to be developed
3. Define software design documents for applications to be developed
4. Build various models to represent software design using modeling tools
5. Design different types of test cases to test the applications.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H

CO-2 M H H M M M H

CO-3 M M H M H M M H

CO-4 M M H M H M M H

CO-5 L M H M H M H

H-HIGH M-MODERATE L-LOW

11
3
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(HS309MC) GENDER SENSITIZATION

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
0- 0-2- 0
Course Description:
This course offers an introduction to Gender Studies, an interdisciplinary field that asks
critical questions about the meanings of sex and gender in society. The primary goal of
this course is to familiarize students with key issues, questions and debates in Gender
Studies, both historical and contemporary. It draws on multiple disciplines – such as
literature, history, economics, psychology, sociology, philosophy, political science,
anthropology and media studies – to examine cultural assumptions about sex, gender, and
sexuality.
This course integrates analysis of current events through student presentations, aiming
to increase awareness of contemporary and historical experiences of women, and of the
multiple ways that sex and gender interact with race, class, caste, nationality and other
social identities. This course also seeks to build an understanding and initiate and
strengthen programmes combating gender-based violence and discrimination. The course
also features several exercises and reflective activities designed to examine the concepts
of gender, gender-based violence, sexuality, and rights. It will further explore the impact
of gender-based violence on education, health and development.

Course Objectives:
 To develop students’ sensibility with regard to issues of gender in contemporary India.
 To provide a critical perspective on the socialization of men and women.
 To introduce students to information about some key biological aspects of genders.
 To expose the students to debates on the politics and economics of work.
 To help students reflect critically on gender violence.
UNIT-I: UNDERSTANDING GENDER
Introduction: Definition of Gender-Basic Gender Concepts and Terminology- Exploring
Attitudes towards Gender-Construction of Gender-Socialization: Making Women, Making
Men - Preparing for Womanhood. Growing up Male. First lessons in Caste.
UNIT – II: GENDER ROLES AND RELATIONS
Two or Many? -Struggles with Discrimination-Gender Roles and Relations-Types of
Gender Roles- Gender Roles and Relationships Matrix-Missing Women-Sex Selection and
Its Consequences- Declining Sex Ratio. Demographic Consequences-Gender Spectrum:
Beyond the Binary
11
4
UNIT – III: GENDER AND LABOUR
Division and Valuation of Labour-Housework: The Invisible Labor- “My Mother doesn’t
Work.” “Share the Load.”-Work: Its Politics and Economics -Fact and Fiction.
Unrecognized and Unaccounted work.-

11
5
Gender Development Issues-Gender, Governance and Sustainable Development- Gender
and Human Rights-Gender and Mainstreaming
UNIT – IV: GENDER - BASED VIOLENCE
The Concept of Violence- Types of Gender-based Violence-Gender-based Violence from a
Human Rights Perspective-Sexual Harassment: Say No!-Sexual Harassment, not Eve-
teasing- Coping with Everyday Harassment- Further Reading: “Chupulu”. Domestic
Violence: Speaking OutIs Home a Safe Place? -When Women Unite [Film]. Rebuilding
lives. Thinking about Sexual Violence Blaming the Victim-“I Fought for my Life….”
UNIT – V: GENDER AND CULTURE
Gender and Film-Gender and Electronic Media-Gender and Advertisement-Gender and
Popular Literature- Gender Development Issues-Gender Issues-Gender Sensitive
Language-Gender and Popular Literature - Just Relationships: Being Together as Equals
Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers.
Rosa Parks-The Brave Heart.
Note: Since it is Interdisciplinary Course, Resource Persons can be drawn from the fields
of English Literature or Sociology or Political Science or any other qualified faculty
who has expertise in this field from engineering departments.
 Classes will consist of a combination of activities: dialogue-based lectures, discussions,
collaborative learning activities, group work and in- class assignments.Apart from the above
prescribed book, Teachers can make use of any authentic materials related to the topics given
in the syllabus on “Gender”.ESSENTIAL READING:
 The Textbook, “Towards a World of quals: Bilingual Textbook on Gender” written by
A.Suneetha, Uma Bhrugubanda, DuggiralaVasanta, Rama Melkote, Vasudha Nagaraj,
Asma Rasheed, Gogu Shyamala, Deepa Sreenivas and Susie Tharu published by
Telugu Akademi, Telangana Government in 2015.
ASSESSMENT AND GRADING:
 Discussion & Classroom Participation: 20%
 Project/Assignment: 30%
 End Term Exam: 50%

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Students will have developed a better understanding of important issues
related to gender in contemporary India.
2. Students will be sensitized to basic dimensions of the biological, sociological,
psychological and legal aspects of gender. This will be achieved through discussion
of materials derived from research, facts, everyday life, literature and film.
3. Students will attain a finer grasp of how gender discrimination works in our
11
6
society and how to counter it.

11
7
 4. Students will acquire insight into the gendered division of labour and its relation
to politics and economy.
5. Men and women students and professionals will be better equipped to work and
live together as equals

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H

CO-2 M H

CO-3 H M

CO-4 L M

CO-5 H H

H-HIGH M-MODERATE L-LOW

11
8
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM310PC) SKILL DEVELOPMENT COURSE (NODE JS/ REACT JS/ DJANGO)

II Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0- 0- 2- 1

Prerequisites:
 Object Oriented Programming through Java, HTML Basics Co-requisite: A course on
“Operating Systems”.

Course Objectives:
 To implement the static web pages using HTML and do client side validation using
JavaScript.
 To design and work with databases using Java
 To develop an end to end application using java full stack.
 To introduce Node JS implementation for server side programming.
 To experiment with single page application development using React.

Exercises:
1. Build a responsive web application for shopping cart with registration, login, catalog
and cart pages using CSS3 features, flex and grid.
2. Make the above web application responsive web application using Bootstrap framework.
3. Use JavaScript for doing client – side validation of the pages implemented in
experiment 1 and experiment 2.
4. Explore the features of ES6 like arrow functions, callbacks, promises, async/await.
Implement an application for reading the weather information from
openweathermap.org and display the information in the form of a graph on the web
page.
5. Develop a java standalone application that connects with the database (Oracle / mySql)
and perform the CRUD operation on the database tables.
6. Create an xml for the bookstore. Validate the same using both DTD and XSD.
7. Design a controller with servlet that provides the interaction with application
developed in experiment 1 and the database created in experiment 5.
8. Maintaining the transactional history of any user is very important. Explore
the various Sessiontracking mechanism (Cookies, HTTP Session)
9. Create a custom server using http module and explore the other modules of Node JS
like OS,path, event.
10. Develop an express web application that can interact with REST API to
11
9
 perform CRUD operations on student data. (Use Postman)
11. For the above application create authorized end points using JWT (JSON Web Token).

12
0
 12. Create a react application for the student management system having registration,
login, contact, about pages and implement routing to navigate through these pages.
13. Create a service in react that fetches the weather information from
openweathermap.org and the display the current and historical weather information
using graphical representation usingchart.js
14. Create a TODO application in react with necessary components and deploy it into
github.

Reference Books:
1. Jon Duckett, Beginning HTML, XHTML, CSS, and JavaScript, Wrox Publications, 2010
2. Bryan Basham, Kathy Sierra and Bert Bates, Head First Servlets and JSP,
O’Reilly Media, 2ndEdition, 2008.
3. Vasan Subramanian, Pro MERN Stack, Full Stack Web App Development with
Mongo,Express, React, and Node, 2nd Edition, A Press.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Build a custom website with HTML, CSS, and Bootstrap and little JavaScript.
2. Demonstrate Advanced features of JavaScript and learn about JDBC
3. Develop Server – side implementation using Java technologies.
4. Develop the server – side implementation using Node JS.
5. Design a Single Page Application using React.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M M M H M

CO-2 M M H L L M H

CO-3 M M M H H M H

CO-4 M M M H H M H

CO-5 H M M M M H H

H-HIGH M-MODERATE L-LOW

12
1
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS402PC) DISCRETE MATHEMATICS

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3-0- 0- 3

Course Objectives:
The objectives of this course is to provide:

 Introduces elementary discrete mathematics for computer science and engineering.

 Topics include formal logic notation, methods of proof, induction, sets,

relations, algebraic structures, elementary graph theory, permutations and
combinations, counting principles; recurrence relations and generating
functions.
 Analyze and solve Posets and Algebraic Problems using Groups.

 Apply Permutations and Combinations to Solve the Discrete Problems.

 Apply graph theory in solving computing problems.

UNIT - I
Mathematical logic: Introduction, Statements and Notation, Connectives, Normal
Forms, Theory of Inference for the Statement Calculus, The Predicate Calculus,
Inference Theory of the Predicate Calculus.
UNIT - II
Set theory: Introduction, Basic Concepts of Set Theory, Representation of Discrete
Structures, Relations and Ordering, Functions.
UNIT - III
Algebraic Structures: Introduction, Algebraic Systems, Semi groups and Monoids,
Lattices as Partially Ordered Sets, Boolean Algebra.
UNIT - IV
Elementary Combinatorics: Basics of Counting, Combinations and
Permutations, Enumeration of Combinations
and Permutations, Enumerating Combinations
and Permutations with Repetitions, Enumerating Permutation
with Constrained Repetitions, Binomial Coefficient, The Binomial and
Multinomial Theorems, The Principle of Exclusion. UNIT - V
Graph Theory: Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties,
Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula,
Multi-graphs and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The
Four-Color Problem.
12
2
Text Books:
1. Discrete Mathematical Structures with Applications to Computer Science: J.P.

12
3
 Tremblay, R. Manohar, McGraw-Hill, 1st ed.
2. Discrete Mathematics for Computer Scientists & Mathematicians:
Joe l. Mott, Abraham Kandel,Teodore P. Baker, Prentis Hall of
India, 2nd ed.

Reference Books:
1. Discrete and Combinatorial Mathematics - an applied
introduction: Ralph.P. Grimald, Pearsoneducation, 5th edition.
2. Discrete Mathematical Structures: Thomas Kosy, Tata McGraw Hill publishing co.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Understand and construct Inference Theory and Normal Forms

2. Apply set theory and Relations to formulate Discrete Structures

3. Analyze and solve Posets and Algebraic Problems using Groups

4. Apply Permutations and Combinations to Solve the Discrete Problems

5. Apply graph theory in solving computing problems.

CO-PO-PSO Mapping: PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H H L H M L H

CO-2 H H H L H M L H

CO-3 M M M M L H

CO-4 M M M L L H

CO-5 M M L M L M

H-HIGH M-MODERATE L-LOW

12
4
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM403PC) AUTOMATA THEORY AND COMPILER DESIGN

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Prerequisite: Nil
Course Objectives:
The objective of this course is to provide:
 To introduce the fundamental concepts of formal languages, grammars and automata
theory.
 To understand Context-Free Grammars Regular Expressions.
 To understand decidability and undecidability.
 Introduce the major concepts of language translation and compiler design and the
knowledge of practical skills necessary for constructing a compiler.
 Topics include syntax directed translation, type checking use of symbol tables,
intermediate code generation
UNIT - I
Introduction to Finite Automata: Structural Representations, Automata and Complexity, the
Central Concepts of Automata Theory – Alphabets, Strings, Languages, Problems.
Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite
Automata with Epsilon-Transitions.
Deterministic Finite Automata: Definition of DFA, How A DFA Process Strings, The
language of DFA, Conversion of NFA with €-transitions to NFA without €-transitions.
Conversion of NFA to DFA
UNIT - II
Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to
Regular Expressions.
Pumping Lemma for Regular Languages: Statement of the pumping lemma, Applications of the
Pumping Lemma.
Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a
Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Parse Trees,
Ambiguity in Grammars and Languages
UNIT - III
Push Down Automata: Definition of the Pushdown Automaton, the Languages of a PDA,
Equivalence of PDA and CFG’s, Acceptance by final state
Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous
12
5
description, The language of a Turing machine

12
6
Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An
Undecidable Problem That is RE, Undecidable Problems about Turing Machines
UNIT - IV
Introduction: The structure of a compiler,
Lexical Analysis: The Role of the Lexical Analyzer, Input Buffering, Recognition of Tokens,
The Lexical- Analyzer Generator Lex,
Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar,
Top-Down Parsing, Bottom- Up Parsing, Introduction to LR Parsing: Simple LR, More
Powerful LR Parsers.
UNIT - V
Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's,
Syntax- Directed Translation Schemes, Implementing L-Attributed SDD's.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code
Run-Time Environments: Stack Allocation of Space, Access to Nonlocal Data on
the Stack, Heap Management

Text Books:
1. Introduction to Automata Theory, Languages, and Computation, 3nd
Edition, John E. Hopcroft,Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation,
Mishra andChandrashekaran, 2nd Edition, PHI.

Reference Books:
1. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi
Sethi, Jeffry
D. Ullman, 2nd Edition, Pearson.
2. Introduction to Formal languages Automata Theory and Computation,
Kamala Krithivasan,Rama R, Pearson.
3. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
4. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly Compiler
Construction, Kenneth C. Louden, Thomson. Course Technology

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Able to employ finite state machines for modeling and solving computing problems.
2. Able to design context free grammars for formal languages.
3. Able to distinguish between decidability and undecidability.
4. Demonstrate the knowledge of patterns, tokens & regular expressions for lexical
analysis.
5. Acquire skills in using lex tool and design LR parsers.

12
7
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H M M M M M

CO-2 H H M

CO-3 H M

CO-4 H M

CO-5 M H H M

H-HIGH M-MODERATE L-LOW

12
8
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS404PC) DATABASE MANAGEMENT SYSTEMS

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3-0-0-3

Prerequisite: A course on “Data Structures”.

Course Objectives:
 To understand the basic concepts of database systems and ER Model.
 To analyze and apply the concepts relational model and normalization.
 To master the basics of SQL and construct queries using SQL.
 To understand the basics of transaction processing and concurrency control.
 To know the concepts of database storage structures and access techniques.
UNIT - I
Database System Applications: A Historical Perspective, File Systems versus a DBMS, the
Data Model, Levels of Abstraction in a DBMS, Data Independence, Structure of a
DBMS
Introduction to Database Design: Database Design and ER Diagrams, Entities, Attributes, and
Entity Sets, Relationships and Relationship Sets, Additional Features of the ER Model,
Conceptual Design With the ER Model
UNIT - II
Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity
constraints, querying relational data, logical database design, introduction to views,
destroying/altering tables and views. Relational Algebra, Tuple relational Calculus,
Domain relational calculus.
UNIT - III
SQL: QUERIES, CONSTRAINTS, TRIGGERS: form of basic SQL query, UNION,
INTERSECT, and
EXCEPT, Nested Queries, aggregation operators, NULL values, complex integrity
constraints in SQL, triggers and active databases.
Schema Refinement: Problems caused by redundancy, decompositions, problems
related to
decomposition, reasoning about functional dependencies, First, Second, Third normal
forms, BCNF, lossless join decomposition, multivalued dependencies, Fourth normal form,
Fifth normal form.
UNIT - IV

12
9
Transaction Concept, Transaction State, Implementation of Atomicity and Durability,
Concurrent Executions, Serializability, Recoverability, Implementation of Isolation,
Testing for serializability, Lock Based Protocols, Timestamp Based Protocols, Validation-
Based Protocols, Multiple Granularity, Recovery and Atomicity, Log–Based Recovery,
Recovery with Concurrent Transactions.

13
0
UNIT - V
Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary and
Secondary Indexes, Index data Structures, Hash Based Indexing, Tree based Indexing,
Comparison of File Organizations, Indexes- Intuitions for tree Indexes, Indexed
Sequential Access Methods (ISAM),
B+ Trees: A Dynamic Index Structure.

Text Books:
1. Database System Concepts, Silberschatz, Korth, McGraw hill, V edition.3rd Edition
2. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc
Graw Hill

Reference Books:
1. Database Systems design, Implementation, and Management, Peter
Rob & Carlos Coronel 7thEdition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C. J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL, Shah, PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student
Edition.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Gain knowledge of fundamentals of DBMS and ER Model.
2. Able to apply the knowledge of relational model and normalization.
3. Apply the basics of SQL for retrieval and management of data.
4. Be acquainted with the basics of transaction processing and concurrency control.
5. Gain knowledge on database storage structures and access techniques.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L H M M M H

CO-2 M H M M M M L M H

CO-3 H H H H H M M H

CO-4 M H H L M H M M H

CO-5 M M L L H H M L H

13
1
 H-HIGH M-MODERATE L-LOW

13
2
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM405PC) INTRODUCTION TO ARTIFICIAL INTELLIGENCE

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3

Prerequisite: Knowledge on Data Structures.

Course Objectives:
The objective of this course is to provide:
 To learn different Search algorithms for real time problems.
 To understand the concepts of optimal decisions in games, Constraint satisfaction
problem and knowledge representation in propositional logic.
 To learn different knowledge representation techniques.
 To learn algorithms for Classical planning and concept of Hierarchical planning.
 To understand the applications of Probabilistic Reasoning and Bayesian Networks.
UNIT - I
Introduction to AI - Intelligent Agents, Problem-Solving Agents,
Searching for Solutions - Breadth-first search, Depth-first search, Hill-climbing search,
Simulated annealing search, Local Search in Continuous Spaces.
UNIT - II
Games - Optimal Decisions in Games, Alpha–Beta Pruning, Defining Constraint Satisfaction
Problems, Constraint Propagation, Backtracking Search for CSPs, Knowledge-Based Agents
Logic- Propositional Logic, Propositional Theorem Proving: Inference and proofs, Proof by
resolution, Horn clauses and definite clauses.
UNIT - III
First-Order Logic - Syntax and Semantics of First-Order Logic, Using First Order Logic,
Knowledge Engineering in First-Order Logic. Inference in First-Order Logic: Propositional
vs. First-Order Inference,Unification, Forward Chaining, Backward Chaining, Resolution.
Knowledge Representation: Ontological Engineering, Categories and Objects, Events.
UNIT - IV
Planning - Definition of Classical Planning, Algorithms for Planning with State Space Search,
Planning Graphs, other Classical Planning Approaches, Analysis of Planning approaches.
Hierarchical Planni ng.
UNIT - V
Probabilistic Reasoning:
Acting under Uncertainty, Basic Probability Notation Bayes’ Rule and Its Use, Probabilistic
13
3
Reasoning, Representing Knowledge in an Uncertain Domain, The Semantics of
Bayesian Networks, Efficient

13
4
Representation of Conditional Distributions, Approximate Inference in Bayesian
Networks, Relational and First- Order Probability.

Text Book:
1. Artificial Intelligence:A Modern Approach, Third Edition, Stuart Russell and
Peter Norvig,Pearson Education.

Reference Books:
1. Artificial Intelligence, 3rd Edn., E. Rich and K. Knight (TMH)
2. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.
3. Artificial Intelligence, Shivani Goel, Pearson Education.
4. Artificial Intelligence and Expert systems – Patterson, Pearson Education.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Able to select a search algorithm for a problem and estimate its time and space
complexities.
2. Apply AI techniques to solve problems of game playing, theorem proving, and machine
learning.
3. Understand different knowledge representation techniques.
4. Analyse classical planning and Hierarchical planning.
5. Comprehend the applications of Probabilistic Reasoning and Bayesian Networks.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M H H H L H M

CO-2 M H H H L H H

CO-3 M H M M L L M

CO-4 M H M H L M M

CO-5 M H H H L M M

H-HIGH M-MODERATE L-LOW

13
5
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM406PC) OBJECT ORIENTED PROGRAMMING THROUGH JAVA

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3

Course Objectives:
The objective of this course is to provide:
 To Understand the basic object-oriented programming concepts and apply them in
problemsolving.
 To Illustrate inheritance concepts for reusing the program.
 To Demonstrate multitasking by using multiple threads and event handling
 To Understand the process of graphical user interface design and implementation using
AWT.
 To Understand using Applet for client-side programming and GUI based programming
using Swings.
UNIT - I
Object oriented thinking and Java Basics- Need for oop paradigm, summary of oop
concepts, coping with complexity, abstraction mechanisms. A way of viewing world –
Agents, responsibility, messages, methods, History of Java, Java buzzwords, data types,
variables, scope and lifetime of variables, arrays, operators, expressions, control
statements, type conversion and casting, simple java program, concepts of classes, objects,
constructors, methods, access control, this keyword, garbage collection, overloading
methods and constructors, method binding, inheritance, overriding and exceptions,
parameter passing, recursion, nested and inner classes, exploring string class
UNIT - II
Inheritance, Packages and Interfaces – Hierarchical abstractions, Base class object,
subclass, subtype, substitutability, forms of inheritance specialization, specification,
construction, extension, limitation, combination, benefits of inheritance, costs of
inheritance. Member access rules, super uses, using final with inheritance, polymorphism-
method overriding, abstract classes, the Object class. Defining, Creating and Accessing a
Package, Understanding CLASSPATH, importing packages, differences between classes
and interfaces, defining an interface, implementing interface, applying interfaces, variables
in interface and extending interfaces. Exploring java.io.
UNIT - III
Exception handling and Multithreading-- Concepts of exception handling, benefits of
exception handling, Termination or resumptive models, exception hierarchy, usage of try,

13
6
catch, throw, throws and finally, built in exceptions, creating own exception subclasses.
String handling, Exploring java.util. Differences between multithreading and multitasking,
thread life cycle, creating threads, thread priorities, synchronizing threads, inter thread
communication, thread groups, daemon threads. Enumerations, autoboxing, annotations,
generics.

13
7
UNIT - IV
Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event
model, handling mouse and keyboard events, Adapter classes. The AWT class hierarchy,
user interface components- labels, button, canvas, scrollbars, text components, check box,
checkbox groups, choices,lists panels – scrollpane, dialogs, menubar, graphics, layout
manager – layout manager types – border, grid, flow, card and grid bag.
UNIT - V
Applets – Concepts of Applets, differences between applets and applications, life cycle of an
applet, types of applets, creating applets, passing parameters to applets. Swing –
Introduction, limitations of AWT, MVC architecture, components, containers, exploring
swing- JApplet, JFrame and JComponent, Icons and Labels, text fields, buttons – The
JButton class, Check boxes, Radio buttons, Combo boxes, Tabbed Panes, Scroll Panes,
Trees, and Tables.

Text Books:
1. Java the complete reference, 7th edition, Herbert schildt, TMH.
2. Understanding OOP with Java, updated edition, T. Budd, Pearson education.

Reference Books:
1. An Introduction to programming and OO design using Java, J.Nino and F.A. Hosch,
John wiley& sons.
2. An Introduction to OOP, third edition, T. Budd, Pearson education.
3. Introduction to Java programming, Y. Daniel Liang, Pearson education.
4. An introduction to Java programming and object-oriented application development,
R.A.Johnson- Thomson.
5. Core Java 2, Vol 1, Fundamentals, Cay.S. Horstmann and Gary Cornell, eighth
Edition,Pearson Education.
6. Core Java 2, Vol 2, Advanced Features, Cay.S. Horstmann and Gary
Cornell, eighth Edition,Pearson Education
7. Object Oriented Programming with Java, R.Buyya, S.T.Selvi, X.Chu, TMH.
8. Java and Object Orientation, an introduction, John Hunt, second edition,
Springer. 9. Maurach’sBeginning Java2 JDK 5, SPD.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the basic object-oriented programming concepts and apply them in
problem solving.
2. Illustrate inheritance and package concepts for reusing the program.
3. Demonstrate developing of exception handling and multitasking programs
using multiple threading concept.
13
8
4. Able to write programs of graphical user interface using AWT.
5. Able to write Applet based programs and swing applications.

13
9
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M H H M L M M H

CO-2 M H M M M H

CO-3 M H M L L M H

CO-4 M L H M L L M H

CO-5 M M H L M L M L H

H-HIGH M-MODERATE L-LOW

14
0
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS407PC) DATABASE MANAGEMENT SYSTEMS LABORATORY

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0- 0- 2- 1

Course Objectives:
 To introduce ER data model and Relational data model
 To Design database schema for a given application and apply normalization.
 To gain knowledge of SQL commands for data definition and data manipulation.
 To understand the basics of querying.
 To develop solutions for database applications using procedures, cursors and triggers.

Co-requisite: “Database Management Systems”

List of Experiments:
1. Concept design with E-R Model

2. Relational Model

3. Normalization

4. Practicing DDL commands

5. Practicing DML commands

6. A. Querying (using ANY, ALL, UNION, INTERSECT, JOIN, Constraints etc.)

B. Nested, Correlated subqueries

7. Queries using Aggregate functions, GROUP BY, HAVING and Creation and

dropping of Views.
8. Triggers (Creation of insert trigger, delete trigger, update trigger)

9. Procedures

10. Usage of Cursors

Text Books:
1. Database Management Systems, Raghurama Krishnan, Johannes
Gehrke, Tata Mc Graw Hill,3rd Edition
2. Database System Concepts, Silberschatz, Korth, McGraw Hill, V edition.

Reference Books:
1. Database Systems design, Implementation, and Management, Peter
Rob & Carlos Coronel 7thEdition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C.J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S. Shah and V. Shah, SPD.
14
1
 5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL, Shah, PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student
Edition.

Course Outcomes:
1. Develop ER data model and Relational data model for a database.
2. Design database schema for a given application and apply normalization.
3. Apply SQL commands for data definition and data manipulation.
4. Apply the basics of SQL for retrieval and management of data.
5. Develop solutions for database applications using procedures, cursors and triggers.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M H H H H L M M H

CO-2 M H M M M M L M H

CO-3 H H H H H L M M H

CO-4 M H H H M L M M H

CO-5 M M L L H L M L H

H-HIGH M-MODERATE L-LOW

14
2
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM408PC) JAVA PROGRAMMING LABORATORY

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0 -0 -2 -1
Course Objectives:
The objective of this course is to provide:
 To introduce java compiler and Eclipse platform
 To write programs using abstract classes.
 To write multi-threaded programs
 To write programs for solving real world problems using the java collection
framework.
 To write GUI programs using swing controls in Java.

List of Experiments:
1. Use Eclipse or Net bean platform and acquaint yourself with the various menus.
Create a test project, add a test class, and run it. See how you can use auto
suggestions, auto fill. Try code formatter and code refactoring like renaming
variables, methods, and classes. Try debug step by step with a small program of
about 10 to 15 lines which contains at least one if else condition and a for loop.
2. Write a Java program to demonstrate the OOP principles. [i.e., Encapsulation,
Inheritance, Polymorphism and Abstraction]
3. Write a Java program to handle checked and unchecked exceptions. Also,
demonstrate the usage of custom exceptions in real time scenario.
4. Write a Java program on Random Access File class to perform different read and write
operations.
5. Write a Java program to demonstrate the working of different collection classes.
[Use package structure to store multiple classes].
6. Write a program to synchronize the threads acting on the same object. [Consider
the example of any reservations like railway, bus, movie ticket booking, etc.]
7. Write a program to perform CRUD operations on the student table in a database using
JDBC.
8. Write a Java program that works as a simple calculator. Use a grid layout to arrange
buttons for the digits and for the +, -,*, % operations. Add a text field to display the
result. Handle any possible exceptions like divided by zero.
9. Write a Java program that handles all mouse events and shows the event name at the
center of the window when a mouse event is fired. [Use Adapter classes]

Reference Books:
14
3
1. Java for Programmers, P. J. Deitel and H. M. Deitel, 10th Edition Pearson education.
2. Thinking in Java, Bruce Eckel, Pearson Education.

14
4
 3. Java Programming, D. S. Malik and P. S. Nair, Cengage Learning.
4. Core Java, Volume 1, 9th edition, Cay S. Horstmann and G Cornell, Pearson.

Course Outcomes:
1. Able to write programs using OOP principles.
2. Able to write programs using abstract classes.
3. Able to write multithreaded programs.
4. Able to write programs for solving real world problems using the java collection
framework.
5. Able to write GUI programs using swing controls in Java.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M L H M H H

CO-2 M H M M M H H

CO-3 H H M M H H H

CO-4 M M M H M M H

CO-5 M M H L M M H

H-HIGH M-MODERATE L-LOW

14
5
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(HS411MC) INTELLECTUAL PROPERTY RIGHTS

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3-0-0-0

Course Objectives:
 To understand the intellectual properties and its role in modern business.
 To elaborate on process of registration and maintain intellectual properties.
 To understand the legal rights and limitations of intellectual properties.
 To understand the international intellectual property rights.
 To understand the how to avoid duplication of transfer of intellectual properties.
UNIT - I
Introduction to Intellectual property: Introduction, types of intellectual property, international
organizations, agencies and treaties, importance of intellectual property rights.

UNIT - II
Trade Marks: Purpose and function of trademarks, acquisition of trade mark rights,
protectable matter, selecting and evaluating trade mark, trade mark registration
processes.

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

UNIT - IV
Trade Secrets: Trade secrete law, determination of trade secrete status, liability for
misappropriations of trade secrets, protection for submission, trade secret litigation.

Unfair competition: Misappropriation right of publicity, False advertising.

UNIT - V
New development of intellectual property: new developments in trade mark law; copy right
law, patent law, intellectual property audits.

International overview on intellectual property, international - trade mark law, copy

right law, international patent law, and international development in trade secrets law.

Text Books & Reference Books:

1. Intellectual property right, Deborah, E. Bouchoux, cengage learning.
2. Intellectual property right - Unleashing the knowledge economy, prabuddha
ganguli, Tata McGraw Hill Publishing Company Ltd.

14
6
 Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Understand the fundamentals of intellectual properties and its agencies.

2. Know the trade mark registration process and its rights.

3. Understand the fundamentals of copy rights and patent law.

4. Know the trade secret determination and protection.

5. Know the recent developments in protection of intellectual property rights.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M L H H L

CO-2 M L H H L

CO-3 M L H H L

CO-4 M L H H L

CO-5 M L H H L

H-HIGH M-MODERATE L-LOW

14
7
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM412PC) SKILL DEVELOPMENT COURSE (PROLOG/ LISP/ PYSWIP)

II Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0-0-2-1

Course Objectives:
The objective of this course is to provide:
 Insight into syntax and semantics of prolog
 Understanding on facts and predicates
 Knowledge to develop prolog programs for real time problems
 Understanding on list operations.
 Solving problems using accumulators

List of Programs:
1. Write simple fact for following:
A) Ram likes mango.
B) Seema is a girl.
C) Bill likes Cindy.
D) Rose is red.
E) John owns gold
2. Write predicates one converts centigrade temperatures to Fahrenheit, the other
checks if a temperature is below freezing.

3. Write a program to solve the Monkey Banana problem

4. WAP in turbo prolog for medical diagnosis and show the advantages and
disadvantages of green and red cuts.

5. Write a program to solve the 4-Queen problem.

6. Write a program to solve traveling salesman problems.

7. Write a program to solve water jug problems using Prolog.

8. Write simple Prolog functions such as the following. Take into account lists which are
too short.
--remove the Nth item from the list. -- insert as the Nth item.
9. Assume the prolog predicate gt(A, B) is true when A is greater than B. Use this
predicate to define the predicate addLeaf(Tree, X, NewTree) which is true if
NewTree is the Tree produced by adding the item X in a leaf node. Tree and
NewTree are binary search trees. The empty tree is represented by the atom nil.

14
8
 10. Write a Prolog predicate, countLists(Alist, Ne, Nl), using accumulators, that is
true when Nl is the number of items that are listed at the top level of Alist and Ne is
the number of empty lists. Suggestion: First try to count the lists, or empty lists, then
modify by adding the other counter.

11. Define a predicate memCount(AList,Blist,Count) that is true if Alist occurs

Count times within Blist. Define without using an accumulator. Use "not" as defined
in utilities.pro, to make similar cases are unique, or else you may get more than one
count as an answer.
Examples:
memCount(a,[b,a]
,N).N = 1 ;
no memCount(a,[b,[a,a,[a],c],a
],N).N = 4 ;
no memCount([a],[b,[a,a,[a],c], a],N).N
= 1 ; No

Reference Book:
1. PROLOG: Programming for Artificial Intelligence, 3e, by BRATKO, WILEY

Course Outcomes:
1. Explore the features of PROLOG programming language, including basic syntax,
selection and search strategies of PROLOG.
2. Develop structured prolog programs for various tasks of moderate complexity and
requirements
3. Understand syntax, semantics and natural deduction of predicate logic.
4. Describe the basic predicates to manipulate list data structure and sorting algorithms
using PROLOG programming
5. Demonstrate the PROLOG programming language skills by solving real life
problems through AI prospect.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L M L M L M L

CO-2 H M H H L M M

CO-3 M M M H M M M

14
9
CO-4 M H H H M H H

CO-5 H H H H M H H

H-HIGH M-MODERATE L-LOW

15
0
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS501PC) DESIGN AND ANALYSIS OF ALGORITHMS

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-1-0-4
Course Objectives:
 Introduces the notations for analysis of the performance of algorithms and
the data structure ofdisjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking,
dynamic programming, greedy, branch and bound methods) and mention
problems for which each technique is appropriate
 Describes how to evaluate and compare different algorithms using worst-,
average-, and bestcase analysis.
 Synthesize efficient algorithms in common engineering design solutions
 Explains the difference between tractable and intractable problems, and
introduces the problems that are P, NP and NP complete.

UNIT - I
Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space
complexity, Time complexity, Asymptotic Notations: Big oh notation, Omega notation and
Theta notation.
Divide and conquer: General method, Applications: Binary search, Quick sort, Merge sort,
Strassen’s matrix multiplication.

UNIT – II
Disjoint Sets: Disjoint set operations, union and find algorithms
Basic Traversal and Search Techniques: Connected components, Bi connected components
Greedy method: General method, Applications: Job sequencing with deadlines, Knapsack
problem, Minimum cost spanning trees: Prim’s Algorithm, Kruskal’s Algorithm.
UNIT - III

Dynamic Programming: General method, applications: Optimal binary search tree, 0/1
knapsack problem, All pairs shortest path problem, Traveling salesperson problem.

UNIT - IV
Backtracking: General method, Applications: 8-queen’s problem, Sum of subsets problem, Graph
coloring.
Branch and Bound: General method, 0/1 knapsackproblem: LC Branch and Bound solution,
FIFO Branch and Bound solution.

UNIT - V
NP-Hard and NP-Complete problems: Basic concepts: Deterministic and Non-deterministic
algorithms, NP-Hard andNP-Complete classes, Node cover Decision Problem.

Text Book:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj
Sahni and Rajasekharan, University press, 1998.

Reference Books:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
2. Introduction to Algorithms, second edition, T. H. Cormen, C.E.
Leiserson, R. L. Rivest, and C.Stein, PHI Pvt. Ltd./ Pearson
Education.
3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T.
Goodrich and R.Tamassia, John Wiley and sons.

Course Outcomes:
1. Acquire the knowledge of algorithm analysis and its notations that are
applied on the problems solved by divide and conquer paradigm

2. Apply the major graph algorithms for model engineering problems and
knowledge of the greedy paradigm

3. Apply the dynamic programming paradigm and recite algorithms that

employ dynamic programming paradigm

4. Apply the concept of back tracking, branch and bound paradigm for real time problems

5. Analyse the complexity of problems and differentiate that in term of P and NP

Problems.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M L M M H M

CO-2 H M L M M H M
CO-3 M M L M M H M

CO-4 M M L M M H M

CO-5 M M L L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS502PC) COMPUTER NETWORKS

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0- 0- 3
Prerequisites
1. A course on “Programming for problem solving”
2. A course on “Data Structures”

Course Objectives
 Compare OSI & TCP/IP models.
 Understand error detection, correction codes and framing methods.
 Explain Multiple Access Protocols and the concepts of noise and noiseless protocols.
 Discuss the concepts of LANs and WLANs and different routing protocols.
 Outline the concepts of logical addressing and Outline Application Layer
UNIT - I
Network hardware, Network software, OSI, TCP/IP Reference models, Example
Networks: ARPANET, Internet.
Physical Layer: Guided Transmission media: twisted pairs, coaxial cable, fiber optics,
Wireless Transmission.
Data link layer: Design issues, framing, Error detection and correction.

UNIT - II
Elementary data link protocols: simplex protocol, A simplex stop and wait protocol
for an error-free channel, A simplex stop and wait protocol for noisy channel.
Sliding Window protocols: A one-bit sliding window protocol, A protocol using Go-
Back-N, A protocol using Selective Repeat.
Medium Access sublayer: The channel allocation problem, Multiple access protocols:
ALOHA, Carriersense multiple access protocols, collision free protocols. Wireless
LANs.

UNIT - III
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding,
Hierarchical routing, Broadcast, Multicast, distance vector routing, Congestion
Control Algorithms, Quality of Service, Internetworking, The Network layer in the
internet: IPV4, IPV6.
 UNIT - IV
Transport Layer: Transport Services, Elements of Transport protocols,
Connection management, TCP and UDP protocols.

UNIT - V
Application Layer: Domain name system, SNMP, Electronic Mail, The World
Wide WEB, HTTP, Streaming audio and video.

Text Book:
1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5th
Edition. Pearson Education/PHI

Reference Books:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd
Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.

Course Outcomes
1. Analyze TCP/IP and OSI models and various protocols and various error
handling mechanisms.
2. Use of various devices in connecting different types of LANs.
3. Analyze different routing protocols and IP Addresses.
4. Discuss the various services offered by transport layer.
5. Describes the working of various networked applications such as DNS,
Mail, WWW and HTTP.
CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H

CO-2 M H H M M M M M H

CO-3 H M H M H H M M H

CO-4 L M H M H M H

CO-5 L M M M H M H
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM503PC) MACHINE LEARNING

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0- 0- 3
Course Objectives:
 To teach the theoretical foundations of various learning algorithms.
 To introduce student to the basic concepts of Perceptron and Dimensionality Reduction.
 Identify and study the appropriate Supervised Learning models.
 To understand the various concepts of Unsupervised Learning techniques.
 The study the concepts and algorithms of Reinforcement Learning.

UNIT – I Introduction (Concepts of Machine Learning):

Learning, Types of Machine Learning, Supervised Learning. Design a Learning

System, Perspectives and Issues in Machine Learning. Concept Learning Task,
Concept Learning as Search, Finding a Maximally Specific Hypothesis,
Version Spaces and the Candidate Elimination Algorithm.

UNIT – II Perceptron and Dimensionality Reduction

Testing Machine Learning Algorithms: Overfitting, Training, Testing and
Validation sets, Confusion Matrix, Accuracy Metrics.
Perceptron: The Brain and the Neuron, Perceptron, Linear Separability, Linear
Regression. Multi-layer Perceptron: Going Forwards, Going Backwards: Back
Propagation of Error.
Dimensionality Reduction: Linear Discriminant Analysis (LDA), Principal
Components Analysis (PCA)
UNIT – III Supervised Learning

Learning with Trees: Decision Trees, Constructing Decision Trees, Classification and
Regression Trees (CART).

Support Vector Machines: Optimal Separation, Kernels, SVM algorithm.

UNIT – IV Unsupervised Learning and Probabilistic Learning

Unsupervised Learning: The K-Means Algorithm, Vector quantisation, Self-

 organising feature map.

Probabilistic Learning: Gaussian mixture models, Nearest Neighbour methods.

UNIT – V Reinforcement Learning and Ensemble Learning
Reinforcement Learning: Markov Decision Processes.

Graphical Models: Bayesian Networks, Markov Random Fields.

Ensemble Learning: Boosting, Bagging, Random Forests.

Text Book:
1. Stephen Marsland, ―Machine Learning – An Algorithmic Perspective,
Second Edition, Chapman and Hall/CRC Machine Learning and Pattern
Recognition Series, 2014.

Reference Books:
1. Tom M Mitchell, ―Machine Learning, First Edition, McGraw Hill Education, 2013.

2. Peter Flach, ―Machine Learning: The Art and Science of Algorithms

that Make Sense of Data‖,First Edition, Cambridge University Press,
2012.
3. Jason Bell, ―Machine learning – Hands on for Developers and
Technical Professionals‖, First Edition, Wiley, 2014
4. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive
Computation and Machine Learning Series), Third Edition, MIT Press,
2014

Course Outcomes:
1. Demonstrate the foundational Machine Learning concepts.
2. Generate models using Perceptron in real world scenarios.
3. Build appropriate models for real world problem solving using Supervised Learning.
4. Interpret algorithm results and transform them into actionable information suitable
for real-time applications in Unsupervised Learning.
5. Device Reinforcement Learning models.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H L H

CO-2 M M L M L
CO-3 M L L

CO-4 H M M H M

CO-5 L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(BF504HS) BUSINESS ECONOMICS AND FINANCIAL

ANALYSIS
III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
3-0- 0- 3
Course Objectives:
The objectives of this course is to provide:
 To learn the basic Business types, impact of the Economy on Business and Firms
specifically.
 To learn the basic concepts in Demand and Supply Concepts.
 To share the concepts of Production, Cost, Market Structures and Pricing Concepts.
 To provide awareness on Financial Accounting Concepts.
 To analyze the Business from the Financial Perspective

UNIT – I: Introduction to Business and Economics

Business: Structure of Business Firm, Theory of Firm, Types of Business Entities,
Limited Liability Companies, Sources of Capital for a Company, Non-Conventional
Sources of Finance.
Economics: Significance of Economics, Micro and Macro Economic Concepts, Concepts
and Importance of National Income, Inflation, Money Supply and Inflation, Business
Cycle, Features and Phases of Business Cycle. Nature and Scope of Business
Economics, Role of Business Economist, Multidisciplinary nature of Business
Economics.
UNIT - II: Demand and Supply Analysis
Elasticity of Demand: Elasticity, Types of Elasticity, Law of Demand, Measurement
and Significance of Elasticity of Demand, Factors affecting Elasticity of Demand,
Elasticity of Demand in decision making, Demand Forecasting: Characteristics of
Good Demand Forecasting, Steps in Demand Forecasting, Methods of Demand
Forecasting.
Supply Analysis: Determinants of Supply, Supply Function and Law of Supply.
UNIT - III: Production, Cost, Market Structures & Pricing
Production Analysis: Factors of Production, Production Function, Production Function
with one variable input, two variable inputs, Returns to Scale, Different Types of
Production Functions.
Cost analysis: Types of Costs, Short run and Long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly,
Oligopoly,
 Monopolistic Competition. Pricing: Types of Pricing, Product Life Cycle based
Pricing, Break Even Analysis, Cost Volume Profit Analysis.
UNIT - IV: Financial Accounting: Accounting concepts and Conventions, Accounting
Equation, Double-Entry system of Accounting, Rules for maintaining Books of
Accounts, Journal, Posting to Ledger, Preparation of Trial Balance, Elements of
Financial Statements, Preparation of Final Accounts (Simple Problems).
UNIT - V: Financial Ratios Analysis: Concept of Ratio Analysis, Importance and Types
of Ratios, Liquidity Ratios, Turnover Ratios, Profitability Ratios, Proprietary
Ratios, Solvency, Leverage Ratios – Analysis and Interpretation (simple problems).

Text Books:
1. D. D. Chaturvedi, S. L. Gupta, Business Economics - Theory and
Applications, InternationalBook House Pvt. Ltd. 2013.
2. Dhanesh K Khatri, Financial Accounting, Tata Mc –Graw Hill, 2011.
3. Geethika Ghosh, Piyali Gosh, Purba Roy Choudhury, Managerial
Economics, 2e, Tata McGraw Hill Education Pvt. Ltd. 2012.

Reference Books:
1. Paresh Shah, Financial Accounting for Management 2e, Oxford Press, 2015.
2. S. N. Maheshwari, Sunil K Maheshwari, Sharad K Maheshwari, Financial
Accounting, 5e, Vikas Publications, 2013.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. The students will understand the various Forms of Business and the impact
of economic variables on the Business.

2. The students will understand the concept in Demand and supply.

3. The student will learn the various concepts in Production, Cost and Pricing strategies.

4. The student will gain the knowledge on financial position by analyzing the
financial statements of a company.

5. The students can able to understand financial position by analyzing the financial
rations of the company.

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H M L H H

CO-2 H M M H H

CO-3 H M H H

CO-4 H M M H H

CO-5 H M M H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM511PE) GRAPH THEORY (Professional Elective – I)

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3- 0- 0-3

Course Objectives:
 To understand the basics of Graph theory.
 To Learn the concepts of cut-sets, cut-vertices, Dijkstra‟s shortest path algorithm.
 To introduce the concepts of varies types of Trees and Graph.
 To understand basic algorithms for graphs.
 To gain the knowledge of coloring and graphs .

UNIT - I

Introduction-Discovery of graphs, Definitions, Subgraphs, Isomorphic graphs, Matrix

representations of graphs, Degree of a vertex, Directed walks, paths and cycles,
Connectivity in digraphs, Eulerian and Hamilton digraphs, Eulerian digraphs,
Hamilton digraphs, Special graphs, Complements, Larger graphs from smaller
graphs, Union, Sum, Cartesian Product, Composition, Graphic sequences, Graph
theoretic model of the LAN problem, Havel-Hakimi criterion, Realization of a graphic
sequence.

UNIT - II

Connected graphs and shortest paths - Walks, trails, paths, cycles, Connected
graphs, Distance, Cut-vertices and cut-edges, Blocks, Connectivity, Weighted
graphs and shortest paths, Weighted graphs, Dijkstra‟s shortest path algorithm,
Floyd-Warshall shortest path algorithm.

UNIT - III

Trees- Definitions and characterizations, Number of trees, Cayley‟s formula,

Kircho↵-matrix- tree theorem, Minimum spanning trees, Kruskal‟s algorithm,
Prim‟s algorithm, Special classes of graphs, Bipartite Graphs, Line Graphs, Chordal
Graphs, Eulerian Graphs, Fleury‟s algorithm, Chinese Postman problem, Hamilton
Graphs, Introduction, Necessary conditions and sufficient conditions.
UNIT - IV

Independent sets coverings and matchings– Introduction, Independent sets and coverings:
 basic equations, Matchings in bipartite graphs, Hall‟s Theorem, K¨onig‟s Theorem,
Perfect matchings in graphs, Greedy and approximation algorithms.

UNIT - V

Vertex Colorings- Basic definitions, Cliques and chromatic number, Mycielski‟s

theorem, Greedy coloring algorithm, Coloring of chordal graphs, Brooks theorem,
Edge Colorings, Introduction and Basics, Gupta-Vizing theorem, Class-1 and Class-2
graphs, Edge-coloring of bipartite graphs, Class-2 graphs, Hajos union and Class-2
graphs, A scheduling problem and equitable edge-coloring.

Text Books:
1. J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of

Graduate Texts in Mathematics. Springer, 1st edition, 2008.

2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.

Reference Books:
1. Lecture Videos: http://nptel.ac.in/courses/111106050/13
2. Introduction to Graph Theory, Douglas B. West, Pearson.

Course Outcomes:
1. Know some important classes of graph theoretic problems.

2. Apply cut-sets, cut-vertices, Dijkstra‟s shortest path algorithm

3. Prove central theorems about trees, matching ,connectivity, coloring and planar
graphs;

4. Describe and apply some basic algorithms for graphs;

5. Use graphs & coloring as a modeling tool.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H H M M H H

CO-2 H H L H H H M

CO-3 M H M M M M H

CO-4 H M H H M H M
CO-5 H H H M H H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM512PE) INTRODUCTION TO DATA SCIENCE

(Professional Elective – I)

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3- 0- 0- 3

Course Objectives:
 To learn concepts, techniques and tools they need to deal with various
facets of data sciencepractice, including data collection and integration
 To understand the basic types of data and basic statistics
 To learn arrays, matrices, data frames and Lists.

 To implement R programming concepts

 To identify the importance of data reduction and data visualization techniques

UNIT- I

Introduction
Definition of Data Science, Big Data and Data Science hype, getting past the
hype
,Datafication ,Current landscape of perspectives , Statistical Inference
,Populations and samples ,Statistical modeling, probability distributions, fitting a
model ,Over fitting.
Basics of R: Introduction, R-Environment Setup, Programming with R, Basic Data Types.
UNIT- II Data Types & Statistical Description

Types of Data: Attributes and Measurement, Attribute, The Type of an Attribute,

The Different Types of Attributes, Describing Attributes by the Number of Values,
Asymmetric Attributes, Binary Attribute, Nominal Attributes, Ordinal Attributes,
Numeric Attributes, Discrete versus Continuous Attributes.
Basic Statistical Descriptions of Data: Measuring the Central Tendency: Mean,
Median, and Mode, Measuring the Dispersion of Data: Range, Quartiles,
Variance, Standard Deviation, and Interquartile Range, Graphic Displays of Basic
Statistical Descriptions of Data.

UNIT- III

Vectors: Creating and Naming Vectors, Vector Arithmetic, Vector sub setting,
 Matrices: Creating and Naming Matrices, Matrix Sub setting, Arrays, Class.

Factors and Data Frames: Introduction to Factors: Factor Levels, Summarizing a

Factor, Ordered Factors, Comparing Ordered Factors, Introduction to Data Frame,
subsetting of Data Frames, Extending Data Frames, Sorting Data Frames.
Lists: Introduction, creating a List: Creating a Named List, Accessing List
Elements, Manipulating List Elements, Merging Lists, Converting Lists to Vectors

UNIT- IV

Conditionals and Control Flow: Relational Operators, Relational Operators and

Vectors, Logical Operators, Logical Operators and Vectors, Conditional Statements.
Iterative Programming in R: Introduction, While Loop, For Loop, Looping Over List.
Functions in R: Introduction, writing a Function in R, Nested Functions, Function
Scoping, Recursion, Loading an R Package, Mathematical Functions in R.

UNIT- V

Charts and Graphs: Introduction, Pie Chart: Chart Legend, Bar Chart, Box Plot,
Histogram, Line Graph: Multiple Lines in Line Graph, Scatter Plot.
Regression: Linear Regression Analysis, Multiple Linear regression.

Text Books:
1. Doing Data Science, Straight Talk from The Frontline. Cathy O’Neil and
Rachel Schutt, O’Reilly, 2014.
2. K G Srinivas, G M Siddesh, “Statistical programming in R”, Oxford Publications.

Reference Books:
1. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts
and Techniques, 3rd ed. The Morgan Kaufmann Series in Data
Management Systems.
2. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael
Steinbanch, Pearson Education.
3. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second
Edition, 4 LLC, 2014.

4. Dalgaard, Peter, “Introductory statistics with R”, Springer Science &

Business Media, 2008.

5. Paul Teetor, “R Cookbook”, O’Reilly, 2011.

Course Outcomes:
1. Understand basic terms of statistical modeling and data science

2. Analyze data measuring the Central Tendency and measuring the Dispersion of
Data.

3. Understand arrays, matrices, data frames and Lists

4. Implement R programming concepts

5. Utilize R elements for data visualization and prediction

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M H M M M H

CO-2 M M M M M H

CO-3 M H M M M H

CO-4 M H M M M H

CO-5 M H M M M M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM513PE) WEB PROGRAMMING (Professional Elective – I)

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0-0-3
Course Objectives:
 To get programming skills for creating websites and web applications
by learning various technologies like HTML, CSS, JavaScript.
 To gain the knowledge on object oriented principles using Java.
 Learn the data base connectivity using JDBC.
 Develop the web based applications using Applets and Servlets.
 Know the importance of XML in web services.

UNIT – I Client side Programming

HTML- Basic Tags- List, Tables, Images, Forms, Frames, CSS

JAVA Script -Web page Designing using HTML, Scripting basics- Client side
and server side scripting. Java Script Object, names, literals, operators and
expressions- statements and features- events - windows - documents - frames -
data types - built-in functions- Browser object model - Verifying forms.-
HTML5- CSS3- HTML 5 canvas
- Web site creation using tools.

UNIT – II JAVA
Introduction to object-oriented programming-Features of Java – Data types,
variables and arrays – Operators – Control statements – Classes and Methods –
Inheritance. Packages and Interfaces – Exception Handling – Multithreaded
Programming – Input/Output – Files – Utility Classes – StringHandling.
UNIT – III JDBC
JDBC Overview – JDBC implementation – Connection class – Statements -
Catching Database Results, handling database Queries. Networking– InetAddress
class – URL class- TCP sockets – UDPsockets, Java Beans –RMI.

UNIT – IV APPLETS
Java applets- Life cycle of an applet – Adding images to an applet – Adding sound
to an applet. Passing parameters to an applet. Event Handling. Introducing
AWT: Working with
 Windows Graphics and Text. Using AWT Controls, Layout Managers and
Menus. Servlet – life cycle of a servlet. The Servlet API, Handling HTTP Request
and Response, using Cookies, Session Tracking. Introduction toJSP.
UNIT – V XML AND WEB SERVICES
Xml – Introduction-Form Navigation-XML Documents- XSL – XSLT- Web services-
UDDI- WSDL-Javaweb services – Web resources.

Text Books:
1. Harvey Deitel, Abbey Deitel, Internet and World Wide Web: How To
Program 5th Edition.
2. Herbert Schildt, Java - The Complete Reference, 7th Edition. Tata
McGraw- Hill Edition.
3. Michael Morrison XML Unleashed Tech media SAMS.

Reference Books:
1. John Pollock, Javascript - A Beginners Guide, 3rd Edition –- Tata McGraw-Hill
Edition.

2. Keyur Shah, Gateway to Java Programmer Sun Certification, Tata McGraw Hill,
2002.

Course Outcomes:
1. Understand the User Interface for web applications using HTML, CSS and Java
Script.
2. Understand the object oriented programming concepts using Java.
3. Describe the usage of JDBC API and Network API in Java.
4. Understand the importance of Applets, Event driven programming in Java
and the usage of Servlet API.
5. Identify XML tags with their purpose.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M H M H M H M

CO-2 H M H M H M H M

CO-3 H H H M H M H M

CO-4 M M L M M M H M
CO-5 M M L H H M L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC514PE) IMAGE PROCESSING

(Professional Elective – I)

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0-0-3
Prerequisites
1. Students are expected to have knowledge in linear signals and systems,
Fourier Transform, basic linear algebra, basic probability theory and basic
programming techniques; knowledge ofdigital signal processing is
desirable.
2. A course on “Computational Mathematics”.
3. A course on “Computer Oriented Statistical Methods”.

Course Objectives
• Provide a theoretical and mathematical foundation of fundamental
Digital Image Processing concepts.
• The topics include image acquisition.
• The topics include sampling and quantization.
• The topics include preprocessing.
• The topics include enhancement, restoration, segmentation, and compression.

UNIT - I
Digital Image Fundamentals: Digital Image through Scanner, Concept of Gray
Levels. Gray Level to Binary Image Conversion. Sampling and Quantization.
Relationship between Pixels. 2D Transformations-DFT, DCT, KLT and SVD.

UNIT - II
Image Enhancement in Spatial Domain Point Processing, Histogram Processing,
Spatial Filtering, Enhancement in Frequency Domain, Image Smoothing, Image
Sharpening..

UNIT - III

Image Restoration Degradation Model, Algebraic Approach to Restoration,

Inverse Filtering, Least Mean Square Filters, Constrained Least Squares
Restoration, Interactive Restoration.
UNIT - IV
Image Segmentation Detection of Discontinuities, Edge Linking and Boundary
Detection, Thresholding, Region Oriented Segmentation.

UNIT - V

Image Compression Redundancies and their Removal Methods, Fidelity Criteria,

Image Compression Models, Source Encoder and Decoder, Error Free
Compression, Lossy Compression.

Text Book:
1. Digital Image Processing: R.C. Gonzalez & R. E. Woods, Addison Wesley/

Pearson Education, 2nd Ed, 2004.

Reference Books:
1. Fundamentals of Digital Image Processing: A. K. Jain, PHI.

2. Digital Image Processing using MAT LAB: Rafael C. Gonzalez,

Richard E. Woods, Steven L.Eddins: Pearson Education India, 2004.
3. Digital Image Processing: William K. Pratt, John Wiley, 3rd Edition, 2004.

Course Outcomes
1. Demonstrate the knowledge of the basic concepts of two-dimensional signal
acquisition, sampling, and quantization.
2. Demonstrate the knowledge of filtering techniques.
3. Demonstrate the knowledge of 2D transformation techniques.
4. Demonstrate the knowledge of image enhancement, segmentation, restoration .
5. Demonstrate the compression techniques.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L H M L L M M

CO-2 M M M L L L L M M

CO-3 L L L L M L M M L

CO-4 L L L L L L L
CO-5 M M M L L L L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM515PE) COMPUTER GRAPHICS

(Professional Elective – I)

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

3-0-0-3
Prerequisites
Programming for problem solving and Data Structures

Course Objectives
 Provide the knowledge of graphics applications and graphics primitives
 Provide the basics of 2D transformations
 Provide the understanding on 3D representations
 Provide the basics of 3D transformations
 Provide an insight on computer animation

UNIT - I

Introduction: Application areas of Computer Graphics, video-display devices, raster-scan

systems, random-scan systems, graphics monitors and work stations and input
devices.
Output primitives: Points and lines, line drawing algorithms (DDA and Bresenham’s
Algorithm).
Polygon Filling: Scan-line algorithm, boundary-fill and flood-fill algorithms.
UNIT - II

2-D geometric transformations: Translation, scaling, rotation, reflection and shear

transformations, matrix representations and homogeneous coordinates,
composite transforms, transformations between coordinate systems.
2-D viewing: The viewing pipeline, window to view- port coordinate transformation,
clipping operations, point clipping, Line clipping-Cohen Sutherland algorithms,
Polygon clipping- Sutherland Hodgeman polygon clipping algorithm.

UNIT - III

3-D object representation: Polygon surfaces, quadric surfaces, spline representation,

Hermite
 curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces, Polygon
rendering methods, color models and color applications.
UNIT - IV

3-D Geometric transformations: Translation, rotation, scaling, reflection and

shear transformations, composite transformations.
3-D Viewing: Viewing pipeline, viewing coordinates, projections, general projection
transforms and clipping.

UNIT - V

Computer animation: Design of animation sequence, general computer animation

functions, raster animations, computer animation languages, key frame systems, motion
specifications.
Visible surface detection method: Back-face detection, depth-buffer method, BSP- tree
method, area sub-division method and octree method.

Text Book:
1. “Computer Graphics C version”, Donald Hearn and M. Pauline Baker,
Pearson Education

Reference Books:
1. Procedural elements for Computer Graphics, David F Rogers, Tata Mc
Graw hill, 2nd edition.
2. Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
3. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.
4. “Computer Graphics Principles & practice”, second edition in C,
Foley, Van Dam, Feiner and Hughes, Pearson Education.
5. Computer Graphics, Steven Harrington, TMH.

Course Outcomes
1. Understand the applications and primitives of Computer Graphics system.
2. Perform 2D transformations on graphical objects.
3. Understand 3D object representations.
4. Perform 3D transformations on graphical objects.
5. Design computer based animation systems.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H M H M

CO-2 M M H M

CO-3 H H H H M

CO-4 M M H M

CO-5 M H M H H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM505PC) MACHINE LEARNING LABORATORY

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

0-0-3-1.5
Course Objective:
 To get an overview of the various machine learning techniques.
 To study the Python Basic Libraries.
 Demonstrate the Machine Learning Techniques using python.
 To Implement Various Machine Learning Algorithms.
 To Understand the Performance analysis of Classification algorithms.

List of Experiments

1. Write a python program to compute Central Tendency

Measures: Mean, Median, Mode Measure of Dispersion:
Variance, Standard Deviation
2. Study of Python Basic Libraries such as Statistics, Math, Numpy and Scipy

3. Study of Python Libraries for ML application such as Pandas and Matplotlib

4. Write a Python program to implement Simple Linear Regression

5. Implementation of Multiple Linear Regression for House Price Prediction using

sklearn

6. Implementation of Decision tree using sklearn and its parameter tuning

7. Implementation of KNN using sklearn

8. Implementation of Logistic Regression using sklearn

9. Implementation of K-Means Clustering

10. Performance analysis of Classification Algorithms on a specific dataset (Mini

Project)

Text Book:
1. Machine Learning – Tom M. Mitchell, - MGH.

Reference Book:
1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor &
Francis.
Course Outcomes:
1. Understand modern notions in predictive data analysis.
2. Select data, model selection, model complexity and identify the trends.
3. Understand a range of machine learning algorithms along
with their strengths and weaknesses.
4. Build predictive models from data and analyse their performance.
5. Understand the Performance Analysis of Classification Algorithms.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L L

CO-2 M M M L

CO-3 M M M

CO-4 H M M M

CO-5 M L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS504PC) COMPUTER NETWORKS LABORATORY

III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
0-0-3-1.5
Course Objectives
 To understand the working principle of various communication protocols.

 To understand the network simulator environment and visualize a

network topology andobserve its performance
 To analyze the traffic flow and the contents of protocol frames
 To analyze data encryption and decryption algorithms.
 To acquire the knowledge on Wireshark to capture and display real-
time details of network traffic.

List of Experiments
1. Implement the data link layer framing methods such as character,
character- stuffing and bitstuffing.
2. Write a program to compute CRC code for the polynomials CRC-12, CRC-16
and CRC CCIP

3. Develop a simple data link layer that performs the flow control
using the sliding windowprotocol, and loss recovery using the Go-
Back-N mechanism.
4. Implement Dijsktra’s algorithm to compute the shortest path through a network

5. Take an example subnet of hosts and obtain a broadcast tree for the subnet.

6. Implement distance vector routing algorithm for obtaining routing tables at each
node.

7. Implement data encryption and data decryption

8. Write a program for congestion control using Leaky bucket algorithm.

9. Write a program for frame sorting techniques used in

buffers. 10.Wireshark

i. Packet Capture Using Wire shark

ii. Starting Wire shark

iii. Viewing Captured Traffic

 iv. Analysis and Statistics & Filters.

11. How to run Nmap scan

12. Operating System Detection using Nmap
13. Do the following using NS2 Simulator
i. NS2 Simulator-Introduction

ii. Simulate to Find the Number of Packets Dropped

iii. Simulate to Find the Number of Packets Dropped by TCP/UDP

iv. Simulate to Find the Number of Packets Dropped due to Congestion

v. Simulate to Compare Data Rate & Throughput.

vi. Simulate to Plot Congestion for Different Source/Destination

vii. Simulate to Determine the Performance with respect to Transmission of

Packets

Text Book:
1. Computer Networks, Andrew S Tanenbaum, David. j. Wetherall, 5th
Edition. Pearson Education/PHI.

Reference Books:

1. An Engineering Approach to Computer Networks, S. Keshav, 2nd

Edition, Pearson Education.
2. Data Communications and Networking – Behrouz A. Forouzan. 3rd Edition, TMH.

Course Outcomes
1. Implement data link layer farming methods

2. Analyze error detection and error correction codes.

3. Implement and analyze routing and congestion issues in network design.

4. Implement Encoding and Decoding techniques used in presentation layer

5. To be able to work with different network tools

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M M L

CO-2 M M M M L

CO-3 M M M M M M H M

CO-4 H H M H M

CO-5 L M H M M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS507PC) SKILL DEVELOPMENT COURSE (UI DESIGN-

FLUTTER)
III Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
0-0-2-1
Course Objectives:
 To learn installation of SDK of Flutter, Xcode and Android Emulator.

 How to Create and Organize Folders and Files, Structuring Widgets.

 Understanding Stateless and Stateful Widgets and Widget Tree

 Learning of Dart basics

 Application of Animation to app.

UNIT - I Introducing Flutter and Getting Started

Introducing Flutter, Defining Widgets and Elements, Understanding Widget

Lifecycle Events, The Stateless Widget Lifecycle, The Stateful Widget Lifecycle,
Understanding the Widget Tree and the Element Tree, Stateless Widget and
Element Trees, Stateful Widget and Element Trees, Installing the Flutter SDK,
Installing on mac OS, System Requirements, Get the Flutter SDK, Check for
Dependencies, iOS Setup: Install Xcode, Android Setup: Install Android Studio, Set
Up the Android Emulator, Installing on Windows, System Requirements, Get the
Flutter SDK, Check for Dependencies, Install Android Studio, Set Up the Android
Emulator, Installing on Linux, System Requirements, Get the Flutter SDK, Check for
Dependencies, Install Android Studio, Set Up the Android Emulator, Configuring the
Android Studio Editor.

UNIT - II Creating a Hello World App

Setting Up the Project, Using Hot Reload, Using Themes to Style Your App, Using a
Global App Theme, Using a Theme for Part of an App, Understanding Stateless
and Stateful Widgets, Using External Packages, Searching for Packages, Using
Packages
UNIT - III Learning Dart Basics
Use of Dart, Commenting Code, Running the main() Entry Point, Referencing
Variables, Declaring Variables, Numbers, Strings, Booleans, Lists, Maps, Runes,
Using Operators, Using
 Flow Statements, if and else, ternary operator, for Loops, while and do-while, while
and break, continue, switch and case, Using Functions, Import Packages, Using
Classes, Class Inheritance, Class Mixins, Implementing Asynchronous
Programming.

UNIT- IV Creating a Starter Project Template

Creating and Organizing Folders and Files, Structuring Widgets.

Understanding the Widget Tree

Introduction to Widgets, Building the Full Widget Tree, Building a Shallow Widget
Tree, Refactoring witha Constant, Refactoring with a Method, Refactoring with a
Widget Class.

UNIT- V Using Common Widgets

Using Basic Widgets, Safe Area, Container, Text, Rich Text, Column, Row,
Column and Row Nesting, Buttons, Floating Action Button, Flat Button, Raised
Button, Icon Button, Popup Menu Button, Button Bar, Using Images and Icons,
Asset Bundle, Image, Icon, Using Decorators, Using the Form Widget to Validate
Text Fields, Checking Orientation.

Adding Animation to an App

Using Animated Container, Using Animated Cross Fade, Using Animated Opacity,
Using Animation Controlle, Using Staggered Animations,

Text Book:
1. Marco L. Napoli, Beginning Flutter: A Hands-on Guide to App Development,

1st edition, Wroxpublisher.

Reference Books:
1. Flutter for Beginners: An introductory guide to building cross-
platform mobile applications with Flutter and Dart 2, Packt
Publishing Limited.
2. Rap Payne, Beginning App Development with Flutter: Create Cross-

Platform Mobile Apps, 1st edition, Apress.

3. Frank Zammetti, Practical Flutter: Improve your Mobile

Development with Google’s Latest Open-Source SDK, 1st edition,

Apress.

Course Outcomes:
1. Knowledge on installation of various softwares.

2. Understanding of various Widgets

3. Application of Animation to Apps

4. Implements Flutter Widgets and Layouts

 5. Responsive UI Design and with Navigation in Flutter

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H L M L M M

CO-2 M M L H M M M

CO-3 M M M M M M M M

CO-4 M M M M H L M H

CO-5 M M L L M L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM601PC) KNOWLEDGE REPRESENTATION

AND REASONING

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3

Course Objectives:
 To investigate the key concepts of Knowledge Representation (KR)
techniques and different notations.
 To introduce the study of ontologies as a KR paradigm and applications of
ontologies.
 To understand various KE techniques.
 To aquire knowledge on Syntax and Semantics of Contexts and processes Classification
 To Understand knowledge acquisition and sharing ofontology.
UNIT - I
The Key Concepts: Knowledge, Representation, Reasoning , Why knowledge
representation and reasoning, Role of logic.
Logic: Historical background, Representing knowledge in logic, Varieties of logic.

UNIT - II
Ontology: Ontological categories, Philosophical background, Top-level categories,
Describing physical entities, Defining abstractions, Sets, Collections, Types and
Categories.

UNIT - III
Knowledge Representations: Knowledge Engineering, Representing structure in
frames, Rules and data, Object-oriented systems.

UNIT - IV
Processes: Times, Events and Situations, Classification of processes, Procedures,
Processes and Histories.
Contexts: Syntax of contexts, Semantics of contexts, First-order reasoning in contexts.

UNIT – V

Knowledge Soup: Vagueness, Uncertainty, Randomness and Ignorance,

Limitations of logic, Fuzzy logic, Nonmonotonic Logic. Knowledge Acquisition
and Sharing: Sharing
 Ontologies, Conceptual schema, Accommodating multiple paradigms.

Text Books:
1. Knowledge Representation logical, Philosophical, and Computational
Foundations by John F. Sowa, Thomson Learning.
2. Knowledge Representation and Reasoning by Ronald J. Brachman, Hector J.
Levesque, Elsevier

Course Outcomes:
1. Ability to understand Representing knowledge in logic

2. Acquire theoretical knowledge on Ontological categories.

3. Ability to understand knowledge-engineering process and frames.

4. Percept Classification of processes and Syntax and Semantics of Contexts.

5. Ability to understand Conceptual schema and tools for knowledge acquisition

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M L L

CO-2 M M L

CO-3 L L L L M

CO-4 M L M M L

CO-5 L M M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM602PC) DATA ANALYTICS

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3
Prerequisites
1. A course on “Database Management Systems”.
2. Knowledge of probability and statistics.

Course Objectives:
• To explore the fundamental concepts of data analytics.

• To understand different data modelling techniques

• To learn the principles and methods of statistical analysis

• Discover interesting patterns, analyze supervised and unsupervised models and
estimate the accuracy of the algorithms.

• To understand the various search methods and visualization techniques.

UNIT - I
Data Management: Design Data Architecture and manage the data for analysis,
understand various sources of Data like Sensors. Data Management, Data
Quality(noise, outliers, missing values, duplicate data) and Data Preprocessing.

UNIT - II
Data Analytics: Introduction to Analytics, Introduction to Tools and Environment,
Application of Modeling in Business, Databases & Types of Data and Variables, Data
Modeling Techniques, MissingImputations etc. Need for Business Modeling.

UNIT - III
Regression – Least Square Estimation, Variable Rationalization, and Model Building.
Logistic Regression: Introduction, Types of LR, Confusion Matrix, Analytics applications
to various Business Domains.

UNIT - IV
Object Segmentation: Regression Vs Segmentation – Supervised and Unsupervised
Learning,
Tree Building – Regression, Classification, Overfitting, Pruning and Complexity,
Multiple Decision Trees etc.
Time Series Methods:- Measures of Forecast Accuracy, ETL approach, Analyze for prediction.

UNIT - V
Data Visualization: Pixel-Oriented Visualization Techniques, Geometric Projection Visualization
Techniques, Hierarchical Visualization Techniques, Visualizing Complex Data and Relations.

Text Books:
1. Data Mining Concepts and Techniques, Han, Kamber, 3rd Edition, Morgan
Kaufmann Publishers.
2. Introduction to Data Mining, Tan, Steinbach and Kumar, Addision Wisley, 2006.
Reference Books:
1. Student’s Handbook for Associate Analytics – II, III.
2. Data Mining Analysis and Concepts, M. Zaki and W. Meira
3.Mining of Massive Datasets, Jure Leskovec Stanford Univ. Anand Rajaraman
Milliway LabsJeffrey D Ullman Stanford Univ.

Course Outcomes:
1. Understand various Data Sources and Design Data Architecture

2. Carry out data analysis/statistical analysis

3. Understand the impact of data analytics for business

decisions and strategy 4.Understand the role of Segmentation

and Regression

5.To carry out standard data visualization and formal inference procedures

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H

CO-2 M H H M M M H

CO-3 M M H M H M M H

CO-4 L M H M H M H

CO-5 L M M M H M H
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM603PC) NATURAL LANGUAGE PROCESSING

III Year B.Tech. CSE (AI & ML)-II Sem L-T-P-C

3- 0 -0 -3
Prerequisites:
1. Data structures and Compiler Design

Course Objectives:
 Provide basic understanding on natural language models.
 Provide the perception on language parsing techniques.
 Provide the knowledge on multilingual semantics.
 Provide the cognizance on advanced semantic parsing.
 Provide necessary knowledge of language models.

UNIT - I

Finding the Structure of Words: Words and Their Components, Issues and Challenges,
Morphological Models
Finding the Structure of Documents: Introduction, Methods, Complexity of the Approaches,
Performances of the Approaches, Features
UNIT - II

Syntax I: Parsing Natural Language, Treebanks: A Data-Driven Approach to

Syntax, Representation of Syntactic Structure, Parsing Algorithms

UNIT – III
Syntax II: Models for Ambiguity Resolution in Parsing, Multilingual Issues

Semantic Parsing I: Introduction, Semantic Interpretation, System Paradigms, Word Sense

UNIT - IV

Semantic Parsing II: Predicate-Argument Structure, Meaning Representation Systems

UNIT - V

Language Modeling: Introduction, N-Gram Models, Language Model Evaluation,

Bayesian parameter estimation, Language Model Adaptation, Language Models- class
based, variable
length, Bayesian topic based, Multilingual and Cross Lingual Language Modeling

Text Book:
1. Multilingual natural Language Processing Applications: From Theory to
Practice – Daniel M.Bikel and Imed Zitouni, Pearson Publication.

Reference Books:
1. Speech and Natural Language Processing - Daniel Jurafsky & James
H Martin, Pearson Publications.
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S.
Tiwary.

Course Outcomes:
1. Understand the natural language word and document structures.
2. Analyse syntax processing and parsing algorithms.
3. Comprehend sematic parsing techniques.
4. Understand structure of representation systems.
5. Analyse multilingual cross lingual models.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M H H H M

CO-2 H H H H M H M

CO-3 M H H H M H M

CO-4 M M M H M

CO-5 H H H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM621PE) SOFTWARE TESTING METHODOLOGIES

(Professional Elective – II)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3
Prerequisite
1. Software Engineering

Course Objectives
 To provide knowledge of the concepts in software testing such as testing process,
criteria, strategies, and methodologies.
 To develop skills in software test automation and management using the latest tools.
 To develop logic-based test strategies
 To understand State, State Graphs and Transition testing
 To understand graph matrices and its applications

UNIT - I
Introduction: Purpose of testing, Dichotomies, model for testing, consequences of bugs,
taxonomy for bugs.
Flow graphs and Path testing: Basics concepts of path testing, predicates, path predicates
and achievable paths, application of path testing.

UNIT - II
Transaction Flow Testing: transaction flows, transaction flow testing techniques.
Data Flow testing: Basics of data flow testing, strategies in data flow testing,
application of data flow testing.
Domain Testing: domains and paths, Nice & ugly domains, domain testing.

UNIT - III
Paths, Path products and Regular expressions: path products & path expression, reduction
procedure, applications, regular expressions & flow anomaly detection.
Logic Based Testing: overview, decision tables, path expressions.

UNIT - IV

State, State Graphs and Transition testing: state graphs, good & bad state graphs,
state testing, Testability tips.

UNIT - V
Graph Matrices and Application: Motivational overview, matrix of graph, relations,
power of a matrix, node reduction algorithm, building tools. (Student should be
given an exposure to a tool like Jmeter/selenium/soapUI/Catalon).

Text Books:
1. Software Testing techniques - Baris Beizer, Dreamtech, second edition.
2. Software Testing Tools – Dr. K. V. K. K. Prasad, Dreamtech.

Reference Books:
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing – Meyers, John Wiley.

Course Outcomes:
1. Understand purpose of testing and path testing
2. Understand strategies in data flow testing and domain testing
3. Develop logic-based testing strategies
4. Develop state testing strategies
5. Understand graph matrices and its applications and Implement test cases
using any testing automation tool

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M M H

CO-2 M H M H M M M H
CO-3 L L L H H M M H

CO-4 L M H M H M H

CO-5 L M M M H H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM622PE) INFORMATION RETRIEVAL SYSTEMS

(Professional Elective – II)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3
Prerequisite:
1. Data Structures

Course Objectives:
 Provide fundamental understanding on retrieval systems
 Provide the awareness on data structures
 Provide the knowledge on data clustering
 Provide the understanding on data visualization
 Provide basic knowledge of multimedia

UNIT - I
Introduction to Information Retrieval Systems: Definition of Information Retrieval System,
Objectives of Information Retrieval Systems, Functional Overview, Relationship to
Database Management Systems, Digital Libraries and Data Warehouses.
Information Retrieval System Capabilities: Search Capabilities, Browse Capabilities,
Miscellaneous Capabilities
UNIT - II
Cataloging and Indexing: History and Objectives of Indexing, Indexing Process, Automatic
Indexing, Information Extraction.
Data Structure: Introduction to Data Structure, Stemming Algorithms, Inverted
File Structure, N-Gram Data Structures, PAT Data Structure, Signature File
Structure, Hypertext and XML Data Structures.

UNIT - III
Automatic Indexing: Classes of Automatic Indexing, Natural Language, Concept
Indexing, Hypertext Linkages.
Document and Term Clustering: Introduction to Clustering, Thesaurus Generation, Item
 Clustering, Hierarchy of Clusters.

UNIT - IV
User Search Techniques: Search Statements and Binding, Similarity Measures and
Ranking, Relevance Feedback, Selective Dissemination of Information Search,
Searching the INTERNET and Hypertext.
Information Visualization: Introduction to Information Visualization,
Cognition and Perception, Information Visualization Technologies.
UNIT - V
Text Search Algorithms: Introduction to Text Search Techniques, Software Text
Search Algorithms, Hardware Text Search Systems.
Multimedia Information Retrieval: Spoken Language Audio Retrieval, Non-Speech
Audio Retrieval, Graph Retrieval, Imagery Retrieval, Video Retrieval.

Text Book:
1. Information Storage and Retrieval Systems – Theory and
Implementation, Second Edition, Gerald J. Kowalski, Mark T. Maybury,
Springer

Reference Books:
1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data
Structures and Algorithms, Prentice Hall, 1992.
2. Information Storage & Retrieval by Robert Korfhage – John Wiley & Sons.
3. Modern Information Retrieval by Yates and Neto Pearson Education.

Course Outcomes:
1. Know the basics of information retrieval & database systems and their capabilities.
2. Understand different data structures and indexing algorithms.
3. Understand automatic indexing and clustering techniques.
4. Analyse search procedures and visualization technologies.
5. Comprehend text and multimedia retrieval systems

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M H M H M
CO-2 H H M H H H M

CO-3 M M H H H M

CO-4 M M H H H M

CO-5 M M H H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM623PE) PATTERN RECOGNITION

(Professional Elective – II)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3 -0 -0 -3
Prerequisites:
 Programming for problem solving
 Computer Oriented Statistical Methods

Course Objectives:

 To introduce fundamental concepts, theories, and

algorithms for patternrecognition and machine
learning.
 To understand Nearest Neighbor Based Classifier.
 To acquire Knowledge of Bayes theorem, Hidden Markov Models.
 To understand Neural Networks, SVM for Classification.
 To understand Clustering algorithms.
UNIT – I
Introduction: Pattern Recognition, Data Sets for Pattern Recognition, Different
Paradigms for Pattern Recognition. Representation: Data Structures for Pattern
Representation, Representation of Clusters, Proximity Measures, Size of
Patterns, Abstractions of the Data Set, Feature Extraction, Feature Selection,
Evaluation of Classifier, Evaluation of Clustering.

UNIT – II

Nearest Neighbor Based Classifier: Nearest Neighbor Algorithm, Variants of

the NN Algorithm, use of the Nearest Neighbor Algorithm for Transaction
Databases, Efficient Algorithms, Data Reduction, Prototype Selection.

UNIT – III

Bayes Classifier: Bayes Theorem, Minimum Error Rate Classifier, Estimation of

Probabilities, Comparison with the NNC, Naïve Bayes Classifier. Hidden
Markov Models: Markov Models for Classification, Hidden Markov
Models, Classification
 using HMMs.

UNIT – IV

Support Vector Machines: Introduction, Learning the Linear Discriminant

Functions, Neural Networks. Combination of Classifiers: Introduction, Methods
for Constructing Ensembles of Classifiers.

UNIT – V

Clustering: Importance of clustering, Hierarchical Algorithms, Partitional

Clustering, Clustering Large Data Sets.

Text Book:
1. Pattern Recognition: An Algorithmic Approach: Murty, M. Narasimha,
Devi, V. Susheela, Spinger Pub, 1st Ed.

Reference Books:
1. Machine Learning – Mc Graw Hill, Tom M. Mitchell.

2. Fundamentals Of Speech Recognition: Lawrence Rabiner and Biing-

Hwang Juang. PrenticeHall Pub.

Course Outcomes:

1. Ability to know the importance of pattern recognition and its representation.

2. Analyze the variants of NN algorithm.

3. Explore the necessity of Bayes theorem, Hidden Markov models.

4. Ability to apply Neural Networks, SVM for Classification.

5. Apply different types of clustering algorithms.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M L L M H

CO-2 M H L M H M

CO-3 L M H L M M
M
CO-4 M H M M M H
CO-5 H L M H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM624PE) DISTRIBUTED COMPUTING

(Professional Elective – II)

III Year B.Tech. CSE (AI & ML)– II Sem L-T-P-C

3-0-0-3

Course Objectives:
 To differentiate among forms of computing.
 To study about different computing paradigms.
 To demonstrate the Remote Method Invocation.
 To describe and learn about Distributed object paradigm CORBA.
 To distinguish about Grid computing and Cluster computing.
UNIT-I
Introduction: Different forms of computing – Monolithic, Distributed, parallel and
cooperative computing, The strengths and weaknesses of Distributed computing,
Basics of Operating systems (relevant to distributed computing), The architecture
of distributed applications.
UNIT-II
Distributed computing Paradigms: Paradigms for Distributed Applications – Message
passing Paradigm, The Client-Server Paradigm (JAVA Socket API), The peer-to-
peer paradigm, Message System (or MOM) Paradigm – the Point-to-point message
model and the publish/subscribe message model, RPC model, The Distributed
Objects Paradigms - RMI,ORB, the object space Paradigm, The Mobile Agent
Paradigm, the Network Services Paradigm, The Mobile Agent Paradigm, the
Network Services Paradigm, The collaborative application (Groupware Paradigm),
choosing a Paradigm for an application.
UNIT-III
Distributed Objects Paradigm (RMI): Message passing versus Distributed Objects, An
Archetypal Distributed Object Architecture, Distributed Object Systems, RPC,
RMI, The Java RMI Architecture, Java RMI API, A sample RMI Application,
steps for building an RMI application, testing and debugging, comparison of
RMI and socket API.
UNIT-IV
Distributed Object Paradigm (CORBA): The basic Architecture, The CORBA object
interface, Inter-ORB Protocols, object servers and object clients, CORBA Object
references, CORBA Naming Service and the Interoperable Naming Service,
CORBA object services, Object Adapters, Java IDL, An example CORBA
application.
UNIT-V
Grid Computing: Definition of grid, grid types – computational grid, data grid, grid
benefits and applications, drawback of grid computing, grid components, grid
architecture and its relation to various Distributed Technologies. Cluster
Computing, Parallel computing overview, cluster computing – Introduction,
Cluster Architecture, parallel programming models and Paradigms, Applications
of Clusters.

Text Book:
1. Distributed, Computing, Principles and applications, M.L.Liu, Pearson Education

Reference Books:
1. Client-Server Programming with Java and CORBA 2nd edition, R. Orfali&

Dan Harkey, John Wiley &Sons

2. Grid Computing, J. Joseph & C. Fellenstein, Pearson Education 5. High

Performance cluster computing, RajKumar Buyya, Pearson Education

3. A Networking Approach to grid computing, D.Mimoli, Wiley & Sons

4. Grid Computing: a practical guide to technology and applications, A.

Abacus, Firewall media

Course Outcomes:
1. Compare and differentiate between different forms of computing techniques.
2. Understand the usage of Distributed computing Paradigms and
Distributed Objects Paradigms.
3. Demonstrate the Remote Method Invocation.
4. Demonstrate the Distributed object paradigm CORBA
5. Express the outline of Grid computing concept and cluster computing concept.

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L M L
CO-2 L H H M
CO-3 L H H M
CO-4 L H M M
CO-5 L M H M
H-HIGH M-MODERATE L-
LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM625PE) DATA WAREHOUSING AND BUSINESS

INTELLIGENCE (Professional Elective – II)

III Year B.Tech. CSE (AI & ML)– II Sem L-T-P-C

3-0-0-3

Course Objectives:
 To learn data warehouse Modelling and OLAP operations.
 To study fundamental concepts of Business Intelligence.
 To know Business Intelligence Implementation.
 To learn Advanced Business Intelligence Tools.
 To know Business Intelligence ethics.
UNIT - I
Data Warehouse, Data Warehouse Modelling, OLAP operations, Data Qube
Computation methods

UNIT - II
Business Intelligence Introduction – Definition, Leveraging Data and Knowledge for
BI, BI Components, BI Dimensions, Information Hierarchy, Business Intelligence
and Business Analytics. BI Life Cycle. Data for BI - Data Issues and Data
Quality for BI.

UNIT - III
BI Implementation - Key Drivers, Key Performance Indicators and Performance
Metrics, BI Architecture/Framework, Best Practices, Business Decision Making,
Styles of BI-vent- Driven alerts-A cyclic process of Intelligence Creation. The
value of Business Intelligence- Value driven and Informationuse.

UNIT - IV
Advanced BI – Big Data and BI, Social Networks, Mobile BI, emerging trends,
Description of different BI-Tools (Pentaho, KNIME)
UNIT - V
Business Intelligence and integration implementation-connecting in BI systems-
Issues of legality- Privacy and ethics- Social networking and BI.
Text Books:
1. Data Mining – Concepts and Techniques - JIAWEI HAN &

MICHELINE KAMBER, Elsevier, 4th Edition.

2. Rajiv Sabherwal “Business Intelligence” Wiley Publications, 2012.

Reference Books:
1. Efraim Turban, Ramesh Sharda, Jay Aronson, David King, Decision
Support and Business Intelligence Systems, 9th Edition, Pearson
Education, 2009.
2. David Loshin, Business Intelligence - The Savy Manager's Guide
Getting Onboard with Emerging IT, Morgan Kaufmann Publishers, 2009.
3. Philo Janus, Stacia Misner, Building Integrated Business Intelligence.
Solutions with SQLServer, 2008 R2 & Office 2010, TMH, 2011.

4. Business Intelligence Data Mining and Optimization for decision making

[Author: Carlo-Verellis] [Publication: (Wiley)]
5. Data Warehousing, Data Mining & OLAP- Alex Berson and Stephen J.
Smith- Tata McGraw- Hill Edition, Tenth reprint 2007
6. Building the Data Warehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd.
7. Data Mining Introductory and Advanced topics – Margaret H Dunham, PEA.

Course Outcomes:
1. Understand architecture of data warehouse and OLAP operations.

2. Understand Fundamental concepts of BI

3. Application of BI Key Performance indicators

4. Understand Utilization of Advanced BI Tools and their Implementation.

5. Implementation of BI Techniques and BI Ethics.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H L
CO-2 M L

CO-3 L M M

CO-4 H M

CO-5 M L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE611OE) DISASTER PREPAREDNESS & PLANNING

MANAGEMENT (Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To provide the concept and characteristics of disaster management system.
 To know the types of environmental hazards& disasters.
 To have the knowledge of endogenous hazards and measures to control them.
 To impart the knowledge of exogenous hazards and measures to control them.
 To enable the students to understand the concept of emerging
approaches in disaster management.

UNIT – I
Introduction: Concepts and definitions: disaster, hazard, vulnerability, resilience, risks
severity, frequency and details, capacity, impact, prevention, mitigation, disaster
phenomena, events- global National & Regional.

UNIT – II
Disasters: Disasters classification; natural disasters (floods, draught, cyclones,
volcanoes, earthquakes, tsunami, landslides, coastal erosion, soil erosion, forest fires
etc.); manmade disasters (industrial pollution, artificial flooding in urban areas,
nuclear radiation, chemical spills, transportation accidents, terrorist strikes, etc.);
hazard and vulnerability profile of India, Covid 2019 in India , mountain and coastal
areas, ecological fragility, coping with disaster- strategies , safety norms & survival
kits.

UNIT – III
Disaster Impacts: Disaster impacts (environmental, physical, social, ecological,
economic, political, etc.); health, psycho-social issues; demographic aspects
(gender, age, special needs); hazard locations; global and national disaster trends;
climate change and urban disasters, capacity building – concepts, assessment –
structural & nonstructural measures, legislative support.
UNIT – IV
Disaster Risk Reduction (DRR): - Disaster management cycle – its phases; prevention,
mitigation, preparedness, relief and recovery; structural and non-structural
measures; risk analysis, vulnerability and capacity assessment; early warning
systems, Post disaster environmental response (water, sanitation, food safety,
waste management, disease control, security, communications); Roles and
responsibilities of government, community, local institutions, NGOs and other
stakeholders; Policies and legislation for disaster risk reduction, DRR
programmes in India and the activities of National Disaster Management Authority.

UNIT – V
Disasters, Environment and Development: - Factors affecting vulnerability such as impact
of developmental projects and environmental modifications (including of dams, land
use changes, urbanization etc.), sustainable and environmental friendly recovery;
reconstruction and development methods.

Text Books:
1.Pradeep Sahni, 2004, Disaster Risk Reduction in South Asia, Prentice Hall.
2.Singh B.K., 2008, Handbook of Disaster Management: Techniques &
Guidelines, Rajat Publication.
3.Ghosh G.K., 2006, Disaster Management, APH Publishing Corporation.

4.Manual on Natural Disaster Management plans.

5.Disaster Management in India, Rajendra Kumar Pandey, SAGE Publications, TEXTS.

Reference Books:
1. http://ndma.gov.in/ (Home page of National Disaster Management Authority).

2.http://www.ndmindia.nic.in/ (National Disaster management in India, Ministry

of Home Affairs).

3. Disaster Medical Systems Guidelines. Emergency Medical Services

Authority, State of California, EMSA no.214, June 2003.
4. Inter-Agency Standing Committee (IASC) (Feb. 2007). IASC Guidelines
on Mental Health and Psychosocial Support in Emergency Settings. Geneva: IASC.

Course Outcomes:
On successful completion of course students will be able to

1. Understand the need of disaster management system in India.

 2. Have the thorough knowledge of environmental hazards and disasters.

3. Get the complete concept of endogenous hazards and their mitigation measures.

4. Know the principles and measures to control exogenous hazards.

5. Have the in-depth knowledge of emerging approaches in disaster management.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H H H H M

CO-2 M M H L L H M

CO-3 H L M L H H

CO-4 H L H L M M L

CO-5 L L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE612OE) BUILDING MANAGEMENT SYSTEMS

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 Comprehend the concepts of building management systems.
 Understand the Fire Alarm System Fundamentals
 Learn the concepts of Access Control Systems.
 Grasp the Security Systems Fundamentals.
 Know the procedures Energy Management Building Management Systems.

UNIT – I
Introduction: Concept and application of Building Management System (BMS) and
Automation, requirements and design considerations and its effect on functional
efficiency of building automation system, architecture and components of BMS.

UNIT – II
Fire Alarm System Fundamentals: What is Fire? Fire modes, History, Components, and
Principles of Operation. FAS Components: Different fire sensors, smoke detectors
and their types, Fire control panels, design considerations for the FA system. Field
Components, Panel Components.

UNIT – III
Access Control System: Access Components, Access control system Design. CCTV:
Camera: Operation & types, Camera Selection Criteria, Camera Applications, DVR
Based system, DVM, Network design, Storage design. Components of CCTV system
like cameras, types of lenses, typical types of cables, controlling system. CCTV
Applications: CCTV Applications.

UNIT – IV
Security Systems Fundamentals: Introduction to Security Systems, Concepts. Perimeter
Intrusion: Concept, Components, Technology, Advanced Applications. Security
Design: Security system design for verticals. Concept of automation in access
control system for safety,
 Physical security system with components, RFID enabled access control with
components, Computer system access control – DAC, MAC, RBAC.

UNIT – V
Energy Management Building Management System: ASHRAE Symbols Energy Management:
Energy Savings concept & methods, lighting control, Building Efficiency
improvement, IBMS (HVAC, Fire & Security) project cycle, Project steps BMS.
Verticals: Advantages & Applications of BMS.

Text Books:
1.Intelligent Building Systems by Albert Ting-Pat So, WaiLok Chan, Kluwer Academic
publisher

2.HVAC Controls and Systems by Levenhagen, John I. Spethmann, Donald H.,

McGraw-Hill Pub.

Reference Books:
1.Smart Buildings by Jim Sinopoli, Butterworth-Heinemann imprint of Elsevier,
2. Understanding Building Automation Systems by Reinhold A. Carlson,
Robert A. Di iandomenico, pub. By R.S. Means Company.

3. Design of Special Hazards and Fire Alarm Systems by Robert Gagnon,

Thomson Delmar Learning.
4.Process Control- Instrument Engineers Handbook by Bela G. Liptak, Chilton book co

5.HVAC Control in the New Millennium by Hordeski, Michael F, Fairmont press.

Course Outcomes:
On successful completion of course students will be able to

1. Understand the need of building management systems.

2. Have the thorough knowledge of Fire Alarm Systems.

3. Get the complete concept of Access Control Systems.

4. Know the principles of Security Systems Fundamentals.

5. Have the in-depth knowledge of Energy Management Building Management Systems.

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H L H H L

CO-2 L M H M

CO-3 H L M H L

CO-4 M M

CO-5 H M H L M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE613OE) ENVIRONMENTAL IMPACT ASSESSMENT

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To develop students regard to environmental impact assessment.
 To get knowledge on EIA methodologies.
 To introduce students to information about Environmental Management Plan.
 To expose the students on Environmental Legislation and
Life cycle assessment.
 To help students reflects new Preparation of EIA.

UNIT – I
Introduction: The Need for EIA, Indian Policies Requiring EIA, The EIA Cycle and
Procedures, Screening, Scoping, Baseline Data, Impact Prediction, Assessment of
Alternatives, Delineation of Mitigation Measure and EIA Report, Public Hearing,
Decision Making, Monitoring the Clearance Conditions, Components of EIA, Roles in
the EIA Process. Government of India Ministry of Environment and Forest Notification
(2000), List of projects requiring Environmental clearance, Application form,
Composition of Expert Committee, Ecological sensitive places, International
agreements.

UNIT – II
EIA Methodologies: Environmental attributes-Criteria for the selection of EIA methodology,
impact identification, impact measurement, impact interpretation & Evaluation, impact
communication, Methods- Adhoc methods, Checklists methods, Matrices methods,
Networks methods, Overlays methods. EIA review- Baseline Conditions -Construction
Stage Impacts, post project impacts.
UNIT – III
Environmental Management Plan: EMP preparation, Monitoring Environmental
Management Plan, Identification of Significant or Unacceptable Impacts Requiring
Mitigation, Mitigation Plans and Relief & Rehabilitation, Stipulating the conditions,
Monitoring Methods, Pre- Appraisal and
 Appraisal.

UNIT – IV
Environmental Legislation and Life cycle Assessment: Environmental laws and protection acts,
Constitutional provisions-powers and functions of Central and State government, The
Environment (Protection) Act 1986, The Water Act 1974, The Air act 1981, Wild Life
act 1972, Guidelines for control of noise, loss of biodiversity, solid and Hazardous waste
management rules. Life cycle assessment: Life cycle analysis, Methodology,
Management, Flow of materials-cost criteria- case studies.

UNIT – V
Case Studies: Preparation of EIA for developmental projects-Factors to be considered in
making assessment decisions, Water Resources Project, Pharmaceutical industry,
thermal plant, nuclear fuel complex, Highway project, Sewage treatment plant,
Municipal Solid waste processing plant, Air ports.

Text Books:
1. Anjaneyulu. Y and Manickam. V., Environmental Impact Assessment
Methodologies, B.
S. Publications, Hyderabad, 2007
2.Barthwal, R. R., Environmental Impact Assessment, New Age International Publishers
2002

Reference Books:
1. Jain, R.K., Urban, L.V., Stracy, G.S., Environmental Impact Analysis, Van
Nostrand Reinhold Co., New York, 1991.
2. Rau, J.G. and Wooten, D.C., Environmental Impact Assessment, McGraw Hill
Pub. Co., New York, 1996.

Course Outcomes:
On successful completion of course students will be able to

1. Develop students regarding environmental impact assessment.

2. Gain knowledge on EIA methodologies.
3. Get information about Environmental Management Plan.
4. Expose the students on Environmental Legislation and Life cycle assessment.
5. Help students reflects new Preparation of EIA.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H L H M L

CO-2 H L H M H H H M

CO-3 H L H M H M

CO-4 M H M L

CO-5 H M H H L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE614OE) HYDROGEOLOGY (Open Elective – I)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To provide students with a solid understanding of the fundamental principles and
concepts of hydrogeology, including groundwater flow, aquifer properties, and
groundwater-surface water interactions.
 To equip students with the necessary skills to conduct groundwater exploration,
interpret hydro geological data, and analyze groundwater flow and
contamination problems.
 To enable students to apply theoretical knowledge to real-world hydro geological
problems, such as groundwater contamination assessment, well design, and
groundwater management.
 To encourage critical thinking and analytical skills in evaluating hydro geological
issues, including the identification of factors influencing groundwater quality
and the assessment of sustainable groundwater use practices.
 To improve students' ability to communicate hydro geological concepts, findings,
and solutions effectively through written reports, presentations, and
discussions.

UNIT – I
Introduction to Hydrogeology: Introduction to Hydrogeology, Definition and scope of
hydrogeology, Hydrological cycle and its components, Groundwater occurrence and
distribution, Properties of aquifers.

UNIT – II
Groundwater Flow: Darcy's law and its applications, Hydraulic conductivity and
transmissivity, Flow nets and their interpretation, Groundwater flow equations.

UNIT – III
Groundwater Exploration and Well Hydraulics: Methods of ground water exploration,
Geophysical techniques for groundwater detection, Well hydraulics: concepts and
principles, pumping tests and their interpretation.
UNIT – IV
 Groundwater Quality and Contamination: Groundwater quality parameters, Sources and types
of groundwater contamination, Fate and transport of contaminants in aquifers,
remediation techniques for contaminated aquifers.

UNIT – V
Groundwater Management and Sustainability: Principles of groundwater management,
Groundwater depletion and its consequences, Sustainable groundwater development
practices, Legal and regulatory aspects of groundwater use.

Text Books:

1. "Applied Hydrogeology" by C.W. Fetter Jr.

o This book provides a comprehensive introduction to hydrogeology, covering
topics such as groundwater flow, aquifer properties, contamination, and
remediation. It is widely used as a textbook in hydrogeology courses.
2. "Principles of Hydrogeology" by P.J. Younger, D. Brabben, and M. Atkinson
o This textbook offers a solid foundation in the principles and applications
of hydrogeology, including groundwater exploration, flow dynamics, and
management. It is suitable for undergraduate and graduate-level courses.
3. "Groundwater" by R. Allan Freeze and John A. Cherry
o This classic textbook covers the fundamental principles of groundwater
hydrology, including groundwater flow, aquifer characterization, and
contaminant transport. It is widely regarded as a standard reference in the
field.
4. "Introduction to Hydrology" by Warren Viessman Jr. and Gary L. Lewis
o While primarily focused on general hydrology, this textbook provides a
good introduction to the hydrological cycle and its relevance to
groundwater hydrology. It covers topics such as precipitation, evaporation,
infiltration, and runoff.
5. "Environmental Hydrogeology" by Andy D. Ward, Stanley W. Trimble, and Suzette M.
Kimball
o This textbook focuses on the intersection of hydrogeology with
environmental science and engineering, covering topics such as
groundwater contamination, remediation technologies, and regulatory
frameworks.
Reference Books:
 1. "Groundwater Geochemistry and Isotopes" by Ian Clark and Peter Fritz
o This reference book explores the application of geochemical and isotopic
techniques in hydrogeology, providing insights into groundwater sources,
flow paths, and reactions with aquifer materials.
2. "Hydrogeology: Principles and Practice" by Kevin M. Hiscock
o This comprehensive reference book covers a wide range of topics in
hydrogeology, including field methods, numerical modeling, groundwater-
surface water interactions, and groundwater management.
3. "Applied Contaminant Transport Modeling" by Chunmiao Zheng
o This book focuses on the modeling of contaminant transport in groundwater
systems, providing practical guidance on numerical simulation techniques
and their application to real- world problems.

Course Outcomes:
1. Students will demonstrate a comprehensive understanding of fundamental
hydrogeological principles, including groundwater flow, aquifer properties,
and contamination processes.

2. Students will exhibit proficiency in interpreting hydrogeological data, including

groundwater level measurements, pumpig test results, and contaminant
concentrations, to draw meaningful conclusions.

3. Students will effectively communicate hydrogeological concepts, findings, and

recommendations through written reports, oral presentations, and discussions,
demonstrating clarity, coherence, and professionalism.

4. Students will develop the ability to identify, analyze, and solve hydrogeological
problems using quantitative and qualitative approaches, considering technical,
environmental, and socio- economic factors.

5. students will be able to analyze the principles of groundwater management and

evaluate sustainable development practices, including legal and regulatory
aspects, to address groundwater depletion and its environmental consequences.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H H L M H L
CO-2 M H M H M L M M

CO-3 M M L M L M M L

CO-4 L M L H H M

CO-5 H L L H H H L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE611OE) RENEWABLE ENERGY SOURCES

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Pre-requisites: None

Course Objectives:
 To recognize the awareness of energy conservation in students.

 To identify the use of renewable energy sources for electrical power generation.

 To understand the principle of operation of induction generators.

 To collect different energy storage methods and detect about environmental

effects of energy conversion.

 To understand the Standards and Codes for Interconnection of alternative energy

sources with the Grid.

UNIT-I
Introduction

Renewable Sources of Energy-Grid-Supplied Electricity-Distributed Generation-

Renewable Energy Economics-Calculation of Electricity Generation Costs –Demand
side Management Options –Supply side Management Options-Modern Electronic
Controls of Power Systems. Wind Power Plants:

Appropriate Location -Evaluation of Wind Intensity -Topography -Purpose of the

Energy Generated - General Classification of Wind Turbines-Rotor Turbines-
Multiple-Blade Turbines Drag Turbines -Lifting Turbines-Generators and Speed
Control used in Wind Power Energy Analysis of Small Generating Systems.
UNIT-II
Photovoltaic Power Plants

Solar Energy-Generation of Electricity by Photovoltaic Effect -Dependence of a PV

Cell Characteristic on Temperature-Solar cell Output Characteristics-Equivalent
Models and Parameters for Photovoltaic Panels-Photovoltaic Systems-
Applications of Photovoltaic
 Solar Energy-Economical Analysis of Solar Energy.

Fuel Cells: The Fuel Cell-Low and High Temperature Fuel Cells-Commercial and
Manufacturing Issues Constructional Features of Proton Exchange-Membrane Fuel
Cells – Reformers-Electrolyzer Systems and Related Precautions-Advantages and
Disadvantages of Fuel Cells-Fuel Cell Equivalent Circuit- Practical Determination
of the Equivalent Model Parameters -Aspects of Hydrogen as Fuel.
UNIT-III
Induction Generators

Principles of Operation-Representation of Steady-State Operation-Power and

Losses Generated-Self- Excited Induction Generator-Magnetizing Curves and Self-
Excitation Mathematical Description of the Self-Excitation Process-Interconnected
and Stand-alone operation -Speed and Voltage Control - Economical Aspects.
UNIT-IV
Storage Systems

Energy Storage Parameters-Lead–Acid Batteries-Ultra Capacitors-Flywheels –

Superconducting Magnetic Storage System-Pumped Hydroelectric Energy
Storage - Compressed Air Energy Storage - Storage Heat -Energy Storage as an
Economic Resource.
UNIT-V
Integration of Alternative Sources of Energy

Principles of Power Injection-Instantaneous Active and Reactive Power Control

Approach Integration of Multiple Renewable Energy Sources-Islanding and
Interconnection Control- DG Control and Power Injection.

Interconnection of Alternative Energy Sources with the Grid:

Interconnection Technologies -Standards and Codes for Interconnection-

Interconnection Considerations -Interconnection Examples for Alternative Energy
Sources.

Text Books:
1. Felix A. Farret, M. Godoy Simoes, “Integration of Alternative Sources of
Energy”, John Wiley& Sons, 2006.
2. Solanki: Renewable Energy Technologies: Practical Guide For Beginneers, PHI
Learning Pvt. Ltd., 2008.

Reference Books:
1. D. Mukherjee: Fundamentals of Renewable Energy Systems, New Age International
publishers, 2007.
2. Remus Teodorescu, Marco Liserre, Pedro Rodríguez: Grid Converters for Photovoltaic
and Wind
 Power Systems, John Wiley & Sons, 2011.
3. Gilbert M. Masters: Renewable and Efficient Electric Power Systems, John Wiley &
Sons, 2004.

Course Outcomes:
At the end of the course the student will be able to:
1. Understand the principles of wind power plants.
2. Understand the principles of solar photovoltaic power generation and fuel cells.
3. Assess the cost of generation for conventional and renewable energy plants
4. Understand the different energy storage methods and detect about
environmental effects of energyconversion.
5. Design suitable power controller for wind and solar applications and analyze the issues
involved in the integration of renewable energy sources to the grid

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M H L M M H H M L H

CO-2 L L L M L H L M M

CO-3 L H L M M L M M L

CO-4 M L M L H L L M M M

CO-5 M H L M H M M M H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE612OE) FUNDAMENTAL OF ELECTRIC VEHICLES

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Pre-requisites: None; Interest in Electric Vehicles
Course Objectives:
 To understand the fundamentals of Electric Vehicles (EVs), especially in Indian Context.

 To understand the Vehicle Dynamics.

 To examine technology associated with each element of EV drive-train.

 To understand the operation of EV Motors, Controllers and chargers.

 To get into the economics of EVs in India vis-à-vis petrol vehicles.

UNIT-I
Introduction

Overview of Electric Vehicles in India, India’s EV program, Charging and Swapping

Infrastructure, brief introduction of batteries, Lithium for batteries, EV
Subsystems.
UNIT-II
Vehicle Dynamics: Forces acting when a vehicle move, Aerodynamic drags,
Rolling Resistance and Uphill Resistance, Power and Torque to accelerate. Drive
Cycle: Concept of Drive Cycle, Drive Cycles and Energy used per km.
UNIT-III
EV Powertrain: Design of EV Drive Train, Introduction to Battery Parameters,
Why Lithium Ion Battery? Batteries in Future, Li-Ion Battery Cells, SoH and
SoC estimation and Self Discharge, Battery Pack Development, Computation of
Effective cost of battery, Charging Batteries.

Fundamentals of EV Battery Pack design: Mechanical, Thermal and Electrical

Design, BMS Design of Electric Vehicle.
UNIT-IV
EV Motors and Controllers: Fundamentals and Design, Understanding Flow of
Electricity, Magnetism and Heat, Power and Efficiency, Torque Production,
Speed and Back EMF, the d-q Equivalent circuit, Field-oriented Control,
Understanding Three phase AC and DC to
 AC conversion systems, Understanding the thermal design of the motors,
Engineering Considerations, Future Frontiers.
UNIT-V
EV Charging: Introduction, Slow or Fast EV Chargers, Battery Swapping,
Standardization and On board Chargers, Public Chargers, Bulk Chargers/Swap
Stations, Economics of Public Chargers in context, Analytics and Tools for EV
systems.

Text Books:
1. Electric Powertrain - Energy Systems, Power electronics and drives for Hybrid,
electric and fuel cell vehicles by John G. Hayes and A. Goodarzi, Wiley Publication
2. Mehrdad Ehsani, Yimi Gao, Sebastian E. Gay, Ali Emadi, Modern Electric, Hybrid
Electric and Fuel Cell Vehicles: Fundamentals, Theory and Design, CRC Press, 2004
3. Iqbal Hussein, Electric and Hybrid Vehicles: Design Fundamentals, CRC Press, 2003

Reference Books:
1. James Larminie, John Lowry, Electric Vehicle Technology Explained, Wiley, 2003
2. Chris Mi, M. Abul Masrur, David Wenzhong Gao, Hybrid Electric Vehicles:
Principles and Applications with Practical Perspectives, John Wiley & Sons Ltd.,
2011
3. Fundamentals of Electric Vehicles: technology and
economics https://onlinecourses.nptel.ac.in/noc20_ee99/preview
https://archive.nptel.ac.in/courses/108/106/108106170/
4. Link to EV101 course – https://www.pupilfirst.school/courses/641/curriculum Link
to EV201 course: https://www.pupilfirst.school/courses/643/curriculum

Course Outcomes:
At the end of the course the student will be able to:

1. Understand the fundamentals of Electric Vehicles.

2. Understand the Electrical Vehicle Dynamics

3. Understand the technology associated with each element of EV drive-train

4. Design the batteries, EV motors and Power electronic controllers for EV systems.

5. Analyze the economics of EV market and EV data using Analytical tools.

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H L M M H H M L

CO-2 M H L H M L M H M H

CO-3 M H L H M M L H M

CO-4 H L M H H L L L M L M

CO-5 H H L M H M M M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(ME611OE) BASIC MECHANICAL ENGINEERING

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course objectives: To provide the essential basic knowledge of Mechanical Engineering
to the students:
 The knowledge of engine components, working principles of Air
Refrigeration system.
 The principles in mechanisms used for flywheel and governing of machines
 To make student familiar with various operations on machine tools.
 To learn various aspects of different manufacturing techniques such as
various welding methods.
 Programmed a robot to perform tasks in industrial applications

UNIT-I

Energy: Power Generation: External and internal combustion engines

Thermal Power Plants-Working Principle, layouts, element/component
description, advantages, disadvantages, applications.

Two stroke four stroke engines and their components. Refrigeration:

Mechanical Refrigeration and types --units of refrigeration air refrigeration
system, vapour compression refrigeration system --principle of operation
UNIT-II

Machine and Mechanisms-Degrees of Freedom, functions of Flywheel and

Governors, Types of joints-Riveted, welded and bolted joints. Applications,
Merits and Demerits.

Power Transmission Elements :Gears terminology of spur, helical and bevel

gears, gear trains .Belt drives(types). Chain drives.

UNIT-III
 Manufacturing Processes: Primary and secondary process. Casting: Types,
equipment, applications. Metal forming processes-rolling, extrusion.

Welding:Types–Equipment–Techniquesemployed–advantages/disadvantages–Gascutting–
Brazingandsoldering.

Knowledge Representation: Ontological Engineering, Categories and Objects, Events

UNIT-IV

Machine Tools: Introduction to lathe, drilling machine, milling machine, grinding

machine - Operationsperformed.CNCMachines-Basicelements,advantages. Limits,
fits and tolerances, Surface finish of various manufacturing process.
UNIT-V
Non-conventionalsourcesofenergy-Solar,wind,tidal,biogasandnuclear-Principles.Robotics–
Joints,endeffectors,applications.Introductionto3DPrinting.

Text Books:

1. SadhuSingh,BasicMechanicalEngineering,S.Chand&Co.Ltd,NewDelhi,2013

2. PravinKumar,BasicmechanicalEngineering,2018,Pearson

Reference Books
1. HajraChoudhary,S.K.andHajraChoudhary,A.K.,ElementsofWorkshopTechnolog
yVols.I& II, IndianBookDistributingCompanyCalcutta,2007.

2. Nag,P.K.,PowerPlantEngineering,TataMcGraw-Hill,NewDelhi,2008.

3. Rattan,S.S.,TheoryofMachines,TataMcGraw-Hill,NewDelhi,2010.

Course Outcomes: At the end of the course, student will be able to

1. Understand different types of power generation, working of refrigerator.

2. SummarizedifferenttypesofmanufacturingprocessesandPowertransmission systems.

3. Discuss about conventional and non-conventional sources of energy.

4. Identifyautomationofvariousmanufacturingprocessesinengineeringpractice.

5. Describe the basic concepts and applications of industrial robotics.

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H L L M

CO-2 M L M M H

CO-3 M M H

CO-4 H H H L

CO-5 M L M L M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(ME612OE) POWER PLANT ENGINEERING

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Pre-requisite: Thermal engineering- I & II.
Course Objectives:
 Analysis and preliminary design of the major systems of conventional fossil-fuel
steam-cycle power plants.
 Fundamental concepts of diesel power plant and gas turbine power plant.
 To study hydrological cycle, hydrographs, hydro power plant and projects.
 A working knowledge of the basic design principles of nuclear, wind, tidal, solar,
and alternate power plants.
 Awareness of the economic, environmental, and regulatory issues related to power
generation.

UNIT-I

Introduction to the Sources of Energy – Resources and Development of Power in

India. Steam Power Plant: Plant Layout, Working of different Circuits, Fuel
and handling equipment, types of coals, coal handling, choice of handling
equipment, coal storage, Ash handling systems

Combustion Process: Properties of coal – overfeed and underfeed fuel beds, traveling
grate stokers, spreader stokers, retort stokers, pulverized fuel burning system and
its components, combustion needs and draught system, cyclone furnace design
and construction, Dust collectors, Electrostatic precipitators, cooling towers and
heat rejection, corrosion and feed water treatment.
UNIT-II

Diesel Power Plant: Introduction – IC Engines, Types, Construction– Plant Layout with
Auxiliaries – Fuel Storage

Gas Turbine Plant: Introduction – Classification - Construction – Layout with Auxiliaries

– Principles of Working Closed and Open Cycle Gas Turbines.
Advantages And
 Disadvantages Combined Cycle Power Plants.
UNIT-III
Hydro Electric Power Plant: Water power – Hydrological cycle – Hydrographs –
storage and Pondage –construction of Hydrograph, Load duration curves -
classification of dams and spill ways.

Hydro Projects and Plant: Classification – Typical layouts – plant auxiliaries – plant
operation and pumped storage plants.
UNIT-IV

Nuclear Power Station: Nuclear fuel – breeding and fertile materials – Nuclear
reactor – reactor operation.

Types of Reactors: Pressurized water reactor, Boiling water reactor, sodium-

graphite reactor, fast Breeder Reactor, Gas cooled Reactor, Radiation hazards
and shielding – radioactive waste disposal.

Power from Non-Conventional Sources: Utilization of solar – Collectors – Principle of

working, Wind energy – Types – HAWT, VAWT – Tidal energy.
UNIT-V

Direct energy conversion: solar energy, Fuel cells, Thermo electric and thermo ionic,
MHD generation.

Power Plant Economics and Environmental Considerations: Capital cost, investment of

fixed charges, operating costs, general arrangement of power distribution, Load
curves, load duration curve, Definitions of connected load, Maximum demand,
demand factor, average load, load factor, diversity factor – related numerical
exercises, Effluents from power plants and impact on environment – pollutants
and pollution standards – Methods of Power plant Pollution control.

References:
1. A Text book of Power Plant Engineering -R.K. Rajput-Laxmi Publications
2. Power plant Engineering-S. Ram lingam-Scietech Publishers.
3. Power Plant Engineering: P.K.Nag -2ndEdition-TMH.
4. An introduction to Power Plant Technology-G.D. Rai.
5. Power plant Engg – Elanchezhian – I.K international Publications.

Course Outcomes:
1. Understand the
principle of various sources of energy, resources and development
of Power.

2. To know the concept of internal combustion engine and gas turbine power plant.

3. To know the concept of hydroelectric power plant.

4. To know the concept of nuclear power stations and non-conventional power sources.

5. Understand the power plant economics and environmental considerations.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L H H L H

CO-2 L M L L L

CO-3 M M L M M

CO-4 H L L H H

CO-5 L L M H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC611OE) FUNDAMENTALS OF INTERNET OF

THINGS (Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To understand the Characteristics of IoT and functional blocks of IoT

 Make concepts of Internet of Things understandable to build IoT applications

 Teach the programming and use of Arduino and Raspberry Pi boards.

 provide Knowledge about data handling and analytics in SDN.

 provide Knowledge IoT applications in different domains.

UNIT - I Introduction to Internet of Things: Characteristics of IoT, Physical design

of IoT, Functionalblocks of IoT, Sensing, Actuation, Basics of Networking,
Communication Protocols, Sensor Networks.
UNIT - II Machine-to-Machine Communications: Difference between IoT and M2M,
Interoperabilityin IoT, Introduction to Arduino Programming, Integration of Sensors
and Actuators with Arduino.
UNIT - III Introduction to Python programming: Introduction to Raspberry Pi, Interfacing
Raspberry Pi with basic peripherals, Implementation of IoT with Raspberry Pi.
UNIT - IV Implementation of IoT with Raspberry Pi: Introduction to Software defined
Network (SDN), SDN for IoT, Data Handling and Analytics.
UNIT - V Cloud Computing: Sensor-Cloud, Smart Cities and Smart Homes,
Connected Vehicles, Smart Grid, Industrial IoT.
Case Study: Agriculture, Healthcare, Activity Monitoring

Text Books:
1. "The Internet 'of Things: Enabling Technologies, Platforms, and Use
Cases", by Pethuru Rajand Anupama C. Raman (CRC Press)
2. “Make sensors”: Terokarvinen, kemo, karvinen and villeyvaltokari, 1st edition,
 maker media, 2014.
3. "Internet of Things: A Hands-on Approach", by Arshdeep Bahga and Vijay Madisetti

Reference Books:
1. Vijay Madisetti, Arshdeep Bahga, “Internet of Things: A Hands-On Approach”

2. Waltenegus Dargie, Christian Poellabauer, "Fundamentals of

Wireless Sensor Networks: Theory and Practice".
3. Beginning Sensor networks with Arduino and Raspberry Pi – Charles Bell, Apress,
2013

Course Outcomes:
1. Know basic protocols in sensor networks.

2. Program and configure Arduino boards for various designs.

3. Python programming and interfacing for Raspberry Pi.

4. Understand the Software defined Network and Data Handling.

5. Design IoT applications in different domains.

CO-PO-PSO Mapping: PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L L L L M L L L

CO-2 L L L H L L M M

CO-3 L L L H L L M L L

CO-4 L L H H L L M M

CO-5 L H M L M L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC612OE) PRINCIPLES OF SIGNAL PROCESSING

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To give the basics of Signals and Systems required for all Engineering related
courses.
 To provide the basic characteristics of LTI systems.
 To provide knowledge on signal transmission requirements.
 To provide knowledge on Sampling Theorem.
 To give basic understanding of signal statistical properties and noise source concepts.

UNIT-I: Signal Analysis: Analogy between Vectors and Signals, Orthogonal Signal
Space, Signal approximation using Orthogonal functions, Mean Square Error,
Closed or complete set of Orthogonal functions, Orthogonality in Complex
functions, Classification of Signals and systems, Exponential and Sinusoidal
signals, Concepts of Impulse function, Unit Step function, Signum function.
UNIT-II: Signal Transmission through Linear Systems Linear System: Impulse response,
Response of a Linear System, Linear Time Invariant(LTI) System, Linear Time
Variant (LTV) System, Transfer function of a LTI System, Filter characteristic of
Linear System, Distortion less transmission through a system, Signal bandwidth,
System Bandwidth, Ideal LPF, HPF, and BPF characteristics, Convolution and
Correlation of Signals, Concept of convolution in Time domain and Frequency
domain, Graphical representation of Convolution. UNIT-III: Sampling theorem:
Graphical and analytical proof for Band Limited Signals, Impulse Sampling,
Natural and Flat top Sampling, Reconstruction of signal from its samples, Effect
of under sampling – Aliasing, Introduction to Band Pass Sampling.
UNIT-IV: Temporal characteristics of signals: Concept of Stationarity and Statistical
Independence, First-Order Stationary Processes, Time Averages and
Ergodicity, Cross Correlation and Auto Correlation of Functions, Properties of
Correlation Functions, Cross- Correlation Function and Its Properties, Power
Spectrum and its Properties, Relationship between Power Spectrum and
Autocorrelation Function.
UNIT-V: Noise sources: Resistive/Thermal Noise Source, Arbitrary Noise
Sources, Effective Noise Temperature, Noise equivalent bandwidth, Average Noise
Figures, Average Noise Figure of cascaded networks, Narrow Band noise,
Quadrature representation of narrow band noise & its properties.

Text Books:
1. Signals, Systems & Communications - B.P. Lathi, B.S. Publications, 2013.
2. Probability, Random Variables & Random Signal Principles - Peyton Z.
Peebles, TMH, 4 th Ed.,2001.

Reference Books:
1. Signals and Systems - A.V. Oppenheim, A.S. Willsky and S.H. Nawabi, 2 Ed.
2. Fundamentals of Signals and Systems - Michel J. Robert, MGH, 2008.
3. Random Processes for Engineers-Bruce Hajck, Cambridge unipress, 2015
4. Statistical Theory of Communication – S.P Eugene Xavier, New Age Publications,
2003

Course Outcomes:
1. Understand the concepts of continuous time and discrete time systems.
2. Understand the characteristics of linear time invariant systems.
3. Understand the concepts of sampling theorem.
4. Apply the correlation and PSD functions for
various applications.
5. Determine the noise sources and signal to noise ratios.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H L L L L L L M

CO-2 H L M L L L L M

CO-3 M M H L L L L L

CO-4 H L M L L L L M
CO-5 H L M M H M L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC613OE) DIGITAL ELECTRONICS FOR ENGINEERING

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To provide basic understanding of properties and theorems of Boolean Algebra.
 To provide knowledge on logic gates and universal gates.
 To teach techniques to reduce the Boolean expressions using K map.
 To Provide Knowledge on Realization of Logic Gates Using Diodes & Transistors
 To give introduction to Logic families and different types Integrated circuits.

UNIT- I: Number Systems: Number systems, Complements of Numbers, Codes-

Weighted and Non- weighted codes and its Properties. Boolean Algebra: Basic
Theorems and Properties, Switching Functions- Canonical and Standard Form,
Algebraic Simplification, Digital Logic Gates, EX-OR gates, Universal Gates,
Multilevel NAND/NOR realizations.
UNIT-II: Minimization of Boolean functions: Karnaugh Map Method - Up to four
Variables, Don’t Care Map Entries, Tabular Method, Combinational Logic Circuits:
Adders, Subtractors, Comparators, Multiplexers, Demultiplexers, Encoders,
Decoders and Code converters, Hazards and Hazard Free Relations.
UNIT-III: Sequential Circuits Fundamentals: Basic Architectural Distinctions between
Combinational and Sequential circuits, SR Latch, Flip Flops: SR, JK, JK Master
Slave, D and T Type Flip Flops, Excitation Table of all Flip Flops, Fundamentals
of shift registers, ripple and decade counters.
UNIT-IV: Realization of Logic Gates Using Diodes & Transistors: AND, OR and NOT
Gates using Diodes and Transistors, DCTL, RTL, DTL, TTL, CML and CMOS
Logic Families and its Comparison, standard TTL NAND Gate Analysis &
characteristics, TTL open collector O/Ps, Tristate TTL, MOS & CMOS open
drain and tristate outputs, CMOS transmission gate,

UNIT-V: Integrated Circuits: Classification, chip size and circuit complexity, basic
information of Op- amp, ideal and practical Op-amp, internal circuits, Op-amp
characteristics, DC and AC Characteristics, 741 opamp and its features, modes of
operation- inverting, non-inverting, differential.

Text Books:
1. Switching and Finite Automata Theory - ZviKohavi& Niraj K. Jha, 3rd Edition,
Cambridge, 2010.
2. Modern Digital Electronics – R. P. Jain, 3rd Edition, 2007- Tata McGraw-Hill
3. Linear Integrated Circuits, D. Roy Chowdhury, New Age International(p) Ltd.
4. Op-Amps & Linear ICs, Ramakanth A. Gayakwad, PHI

Reference Books:
1. Digital Design- Morris Mano, PHI, 4th Edition,2006
2. Operational Amplifiers & Linear Integrated Circuits, R.F. Coughlin & Fredrick
F. Driscoll, PHI

3. Operational Amplifiers & Linear Integrated Circuits: Theory &

Applications, Denton J. Daibey, TMH.

Course Outcomes:
1. Get basic knowledge on logic gates, Universal gates and their switching logics.
2. Realize Boolean expressions using NAND/NOR gates and reduce them using K
map.
3. Know all types of combinational and sequential circuits.
4. Acquire knowledge on realization of logic families using diodes and
transistor, and also ondifferent types of integrated circuits.
5. Acquire knowledge on different types of integrated circuits.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L L M L L L

CO-2 M M H M L L L M
CO-3 L L M L L L

CO-4 L L L L L H

CO-5 H L L M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS611OE) DATA STRUCTURES (Open Elective – I)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Prerequisite
 A course on “Programming for Problem Solving”.

Course Objectives
The objectives of this course are to provide:
 Exploring knowledge of basic data structures and their implementations
 Introduces a variety of data structures such as dictionaries, hash tables
 Exploring knowledge of search trees
 Understanding on sorting techniques and graphs
 Introduces pattern matching algorithms

UNIT - I
Introduction to Data Structures, abstract data types, Linear list – singly linked list
implementation, insertion, deletion and searching operations on linear list,
Stacks- Operations, array and linked representations of stacks, stack applications,
Queues - operations, array and linked representations.

UNIT - II
Dictionaries: linear list representation, skip list representation, operations -
insertion, deletion and searching.
Hash Table Representation: hash functions, collision resolution-separate chaining, open
addressing- linear probing, quadratic probing, double hashing, rehashing,
extendible hashing.

UNIT - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations-
Searching, Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree,
Operations – Insertion, Deletion and Searching, Red –Black, Splay Trees.

UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods.
Sorting: Quick Sort, Heap Sort, External Sorting- Model for external sorting, Merge Sort.
 UNIT - V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –
Moore algorithm, the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed
Tries, Suffix tries.

Text Books:
1. Fundamentals of Data Structures in C, 2 nd Edition, E. Horowitz, S. Sahni
and Susan Anderson Freed, Universities Press.
2. Data Structures using C – A. S.Tanenbaum, Y. Langsam, and M.J.
Augenstein, PHI/Pearson Education.

Reference Book:
1. Data Structures: A Pseudocode Approach with C, 2 nd Edition, R. F.
Gilberg and B.A.Forouzan, Cengage Learning.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Analyze the representation of various static, dynamic and, hierarchical data
structures and Design and implement the mechanism of linear data
structures.
2. Outline the concepts of hashing, collision and its resolution methods using hash
function.
3. Design and Implementation of various advanced concepts of binary trees.
4. Implement various algorithms on graph data structures and implementation
of various sorting techniques.
5. Design and implementation of Pattern Matching algorithms to find patterns
within a bigger set of data or text.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H M M M H H

CO-2 M H M M M H H

CO-3 L H H M M H H

CO-4 H M M M M M M

CO-5 M M H L M M M
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS612OE) DATABASE MANAGEMENT SYSTEMS

(Open Elective – I)
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Prerequisite: A course on “Data Structures”.

Course Objectives:
 To understand the basic concepts of database systems and ER Model.
 To analyze and apply the concepts relational model and normalization.
 To master the basics of SQL and construct queries using SQL.
 To understand the basics of transaction processing and concurrency control.
 To know the concepts of database storage structures and access techniques.

UNIT - I

Database System Applications: A Historical Perspective, File Systems versus a

DBMS, the Data Model, Levels of Abstraction in a DBMS, Data Independence,
Structure of a DBMS Introduction to Database Design: Database Design and ER
Diagrams, Entities, Attributes, and Entity Sets, Relationships and Relationship
Sets, Additional Features of the ER Model, Conceptual Design With the ER
Model

UNIT - II

Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity
constraints, querying relational data, logical database design, introduction to views,
destroying/altering tables and views.
Relational Algebra, Tuple relational Calculus, Domain relational calculus.
UNIT - III

SQL: QUERIES, CONSTRAINTS, TRIGGERS: form of basic SQL query,

UNION, INTERSECT, and

EXCEPT, Nested Queries, aggregation operators, NULL values, complex

integrity constraints in SQL, triggers and active databases.
Schema Refinement: Problems caused by redundancy, decompositions, problems related
to decomposition, reasoning about functional dependencies, FIRST, SECOND,
THIRD normal
forms, BCNF, lossless join decomposition, multivalued dependencies, FOURTH
normal form, FIFTH normal form.

UNIT - IV
Transaction Concept, Transaction State, Implementation of Atomicity and
Durability, Concurrent Executions, Serializability, Recoverability, Implementation
of Isolation, Testing for serializability, Lock Based Protocols, Timestamp Based
Protocols, Validation- Based Protocols, Multiple Granularity, Recovery and
Atomicity, Log–Based Recovery, Recovery with Concurrent Transactions.
UNIT - V

Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary
and Secondary Indexes, Index data Structures, Hash Based Indexing, Tree based
Indexing, Comparison of File Organizations, Indexes- Intuitions for tree Indexes,
Indexed Sequential Access Methods (ISAM),
B+ Trees: A Dynamic Index Structure.

Text Books:
1. Database System Concepts, Silberschatz, Korth, McGraw hill, V edition. 3rd Edition

2. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata

Mc Graw Hill

Reference Books:
1. Database Systems design, Implementation, and Management, Peter

Rob & Carlos Coronel 7th Edition.

2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education

3. Introduction to Database Systems, C. J. Date, Pearson Education

4. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.

5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL, Shah, PHI.

6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student

Edition.

Course Outcomes:
1. Gain knowledge of fundamentals of DBMS and ER Model.

2. Able to apply the knowledge of relational model and normalization

3. Apply the basics of SQL for retrieval and management of data.

 4. Be acquainted with the basics of transaction processing and concurrency control.

5. Gain knowledge on database storage structures and access techniques.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L H M M M H

CO-2 M H M M M M L M H

CO-3 H H H H H M M H

CO-4 M H H L M H M M H

CO-5 M M L L H H M L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(IT611OE) JAVA PROGRAMMING (Open Elective – I)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Prerequisites:
 Students are expected to have knowledge in linear signals and systems, Fourier
Transform, basic linear algebra, basic probability theory and basic programming
techniques; knowledge of digital signal processing is desirable.

 A course on “Computational Mathematics”

 A course on “Computer Oriented Statistical Methods”

Course Objectives:
The objectives of this course are to provide:

 To Understand the basic object-oriented programming concepts and apply them in

problem solving.

 To illustrate inheritance concepts for reusing the program.

 To Demonstrate multitasking by using multiple threads and event handling

 To understand the process of graphical user interface design and implementation using
AWT.

 To Understand using Applet for client-side programming and GUI based programming
using swings.

UNIT - I

Foundations of Java: History of Java, Java Features, Variables, Data Types, Operators,
Expressions, Control Statements. Elements of Java - Class, Object, Methods,
Constructors Generics, Inner classes, String class.

OOP Principles: Encapsulation–concept, this keyword. Inheritance -concept, Inheritance

Types, super keyword. Polymorphism–concept, Method Overriding usage
Abstraction–concept, abstract keyword and Interface.

UNIT-II

Exception Handling: Exception and Error, Exception Types, Exception Handler,

Exception Handling Clauses–try, catch, finally, throws and the throw statement, Built-
in-Exceptions and Custom Exceptions.

Files and I/O Streams: The file class, Streams, The Byte Streams, Filtered Byte
Streams, The
Random Access File class.

UNIT-III
Packages-Defining a Package, CLASSPATH, Access Specifiers, importing packages. Few
Utility Classes-String Tokenizer, Bit Set, Date, Calendar, Random, Formatter, Scanner.

Collections: Collections overview, Collection Interfaces, Collections Implementation

Classes, Sorting in Collections, Comparable and Comparator Interfaces.

UNIT- IV

Multithreading:

Process and Thread, Differences between thread-based multi tasking and process-based
multi tasking, Java thread lifecycle, creating threads, thread priorities, synchronizing
threads, inter thread communication.

Java Data base Connectivity: Types of Drivers, JDBC architecture, JDBC Classes and
Interfaces, Basic steps in Developing JDBC Application, Creating a New Data base and
Table with JDBC.

UNIT-V

GUI Programming with Swing–Introduction, limitations of AWT, MVC architecture,

components, containers, Layout Manager Classes, Simple Applications using AWT and
Swing.

Event Handling- The Delegation event model- Events, Event sources, Event Listeners,
Event classes, Handling mouse and key board events, Adapter classes.

Text Books:
1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill
Education (India) Pvt. Ltd.
2. Understanding Object-Oriented Programming with Java, updated edition, T.
Budd, Pearson Education.

Reference Books:
1. An Introduction to programming and OO design using Java, J. Nino and F.A.
Hosch, John Wiley & sons
2. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
3. Object Oriented Programming through Java, P. Radha Krishna, University Press.

4. Programming in Java, S. Malhotra, S. Chudhary, 2nd edition, Oxford Univ. Press.

5. Java Programming and Object-oriented Application Development, R. A.

Johnson, Cengage Learning.
Course Outcomes:
1. Solve real world problems using OOP techniques.
2. Develop programs using the concepts of exception handling.
3. Solve problems using packages and java collection framework.

4. Develop multithreaded applications with synchronization and applications using

JDBC.

5. Design GUI based applications

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M L L H M L L M M

CO-2 M M M L L L L M M

CO-3 L L L L M L M M L

CO-4 L L L L L L L

CO-5 M M M L L L L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(IT612OE) SOFTWARE ENGINEERING (Open Elective – I)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 Knowledge of basic software engineering methods and practices, and their
appropriate application and a general understanding of software process models.
 Understanding of software requirements and the SRS documents.
 Understanding of different software architectural styles and design models.
 Understanding of software testing approaches, techniques and metrics.
 Understanding on quality control and risk management.

UNIT - I

Introduction to Software Engineering: The evolving role of software, changing nature of

software, software myths.
A Generic view of process: Software engineering- a layered technology, a process
framework, the capability maturity model integration (CMMI).
Process models: The waterfall model, Spiral model and Agile methodology
UNIT - II

Software Requirements: Functional and non-functional requirements, user requirements, system

requirements, interface specification, the software requirements document.
Requirements engineering process: Feasibility studies, requirements elicitation and analysis,
requirements validation, requirements management.

UNIT - III

Design Engineering: Design process and design quality, design concepts, the design
model. Creating an architectural design: software architecture, data design,
architectural styles and patterns, architectural design, conceptual model of UML,
basic structural modeling, class diagrams, sequence diagrams, collaboration diagrams,
use case diagrams, component diagrams.

UNIT - IV

Testing Strategies: A strategic approach to software testing, test strategies for

conventional software, black-box and white-box testing, validation testing, system
testing, the art of debugging. Metrics for Process and Products: Software
measurement, metrics for software quality.
UNIT - V

Risk management: Reactive Vs proactive risk strategies, software risks, risk identification,
risk projection, risk refinement, RMMM.
Quality Management: Quality concepts, software quality assurance, software reviews,
formal technical

reviews, statistical software quality assurance, software reliability, the ISO 9000 quality
standards.

Text Books:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th
edition, McGraw Hill International Edition.

2. Software Engineering- Sommerville, 7th edition, Pearson Education.

Reference Books:
1. The unified modeling language user guide Grady Booch, James Rambaugh,
Ivar Jacobson, Pearson Education.

2. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John

Wiley.

3. Software Engineering principles and practice- Waman S Jawadekar, The

McGraw- Hill Companies.

4. Fundamentals of object-oriented design using UML Meiler page-Jones: Pearson

Education.

Course Outcomes:
1. Understand the software engineering principles, practices and process models.
2. Identify, analyse and specify software requirements from the project stakeholders.
3. Analyse and translate the specifications into software designs and model the designs.
4. Apply different test strategies to perform testing and metrics to assess the software.
5. Identify and manage software risks and maintain the quality of the software.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M M M M

CO-2 M M M M L

CO-3 M H M M H M
CO-4 H M M M M
CO-5 H M M M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM611OE) FUNDAMENTALS OF AI (Open Elective – I)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -3
Course Objectives:
 To Understand the fundamentals of Artificial Intelligence and the concept of
Intelligence Agents
 To gain an insight into the problem solving process through uninformed
and informed searches and their various techniques
 To get complete idea of knowledge representation and understand the
two knowledge representation techniques Propositional and First-order
logics
 To understand the various concepts of Uncertainty knowledge and
its inference mechanisms and the role and
significance of Learning
 Understand the concept of learning from examples and Explore
different forms of learning, including supervised learning.

UNIT – I

Foundations of AI: Introduction to AI, History of AI, Strong and Weak AI, The
State of the Art, Risksand Benefits of AI
Philosophy, Ethics and Safety of AI: The Limits of AI, Machine thinking
capability, The Ethics of AI Intelligent Agents: Agents and Environments, Good
Behavior: The Concept of Rationality, The Natureof Environments, The
Structure of Agents.

UNIT – II

Solving Problems by Searching: Problem – Solving Agents

Uninformed Search Strategies: Best-First Search, Breadth-First Search, Uniform-

Cost Search, Depth-First Search, Iterative Deepening Search and Bidirectional
Search
Informed Search Strategies: Greedy Best-First Search, A* Search

UNIT – III

Logical Agents: Knowledge-based agents, Propositional Logic, Propositional Theorem

Proving

First-Order Logic: Syntax and Semantics of First-Order Logic

Inference in First-Order Logic: Propositional Vs. First-Order Inference, Unification and
First- Order Inference, Forward Chaining, Backward Chaining
Knowledge Representation: Ontological Engineering, Categories and Objects, Events
UNIT – IV

Quantifying Uncertainty: Basic Probability Notation, Inference Using Full-Joint

Distributions, Independence, Bayes’ Rule and its Use, Naive Bayes Models
Probabilistic Reasoning: Representing Knowledge in an Uncertain Domain, The
semantics of Bayesian Networks, Exact Inference in Bayesian Networks

UNIT – V
Learning from Examples: Forms of Learning, Supervised Learning, Learning Decision
Trees, Model Selection, Linear Regression and Classification, Ensemble Learning
Natural Language Processing: Language Models, Grammar, Parsing, Complications of
Real Natural Language, Natural Language Tasks

Robotics: Robots, Robot Hardware, Kind of Problems solved, Application Domains

Computer Vision: Simple Image Features, Using Computer Vision

Text Book:
1. “Artificial Intelligence a Modern Approach”, Fourth Edition, Stuart J.
Russell & Peter Norvig – Pearson.

Reference Books:
1. “Artificial Intelligence”, Elaine Rich, Kevin Knight &
Shivashankar B Nair – McGraw Hill Education.
2. Artificial Intelligence, 3rd Edn, E. Rich and K. Knight (TMH)

3. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.

4. Artificial Intelligence, Shivani Goel, Pearson Education.

5. Artificial Intelligence and Expert systems – Patterson, Pearson Education

Course Outcomes:
1. Visualize what Artificial Intelligence is and the role of Intelligent Agents.

2. Investigate the uniformed and informed search techniques and

tracing the execution various search algorithm.
3. Differentiate Propositional and First-order logic knowledge representation
techniques and draw inferences using them.

4. State what Uncertainty knowledge is and inference mechanisms therein.

5. Ability to apply supervised learning algorithms to real-world datasets.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L M H L H M H H

CO-2 H H M L H M H H

CO-3 H H H L H M H H

CO-4 L M M L H M H H

CO-5 H H H L H M H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM612OE) MACHINE LEARNING BASICS

(Open Elective – I)

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

3- 0 -0 -3
Course Objectives:
 To introduce students to the basic concepts and techniques of Machine Learning.
 To have a thorough understanding of the Supervised learning techniques.
 To Understand the Unsupervised Learning Techniques.
 To study the various probability-based learning techniques

 To study the concepts and algorithms of reinforcement learning.

UNIT - I
Learning – Types of Machine Learning – Supervised Learning – The Brain and
the Neuron – Design a Learning System – Perspectives and Issues in Machine
Learning – Concept Learning Task – Concept Learning as Search – Finding a
Maximally Specific Hypothesis – Version Spaces and the Candidate Elimination
Algorithm – Linear Discriminants: – Perceptron – Linear Separability – Linear
Regression.

UNIT - II
Multi-layer Perceptron– Going Forwards – Going Backwards: Back Propagation Error –
Multi-layer Perceptron in Practice – Examples of using the MLP – Overview – Deriving
Back-Propagation – Radial Basis Functions and Splines – Concepts – RBF Network – Curse
of Dimensionality – Interpolations and Basis Functions – Support Vector Machines.

UNIT - III
Learning with Trees – Decision Trees – Constructing Decision Trees – Classification
and Regression Trees – Ensemble Learning – Boosting – Bagging – Different
ways to Combine Classifiers – Nearest Neighbor Methods – Unsupervised
Learning – K means Algorithms

UNIT - IV
Dimensionality Reduction – Linear Discriminant Analysis – Principal Component Analysis –
Factor
 Analysis – Independent Component Analysis – Locally Linear Embedding – Isomap – Least
Squares Optimization.
Evolutionary Learning – Genetic algorithms – Genetic Offspring: - Genetic Operators –
Using Genetic Algorithms.
UNIT - V
Reinforcement Learning – Overview – Getting Lost Example
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution – Markov Chain
Monte Carlo– Graphical Models – Bayesian Networks – Markov Random Fields – Hidden
Markov Models – Tracking Methods.

Text Book:
1. Stephen Marsland, ―Machine Learning – An Algorithmic
Perspective, Second Edition, Chapman and Hall/CRC Machine Learning
and Pattern Recognition Series, 2014.

Reference Books:
1. Tom M Mitchell, ―Machine Learning, First Edition, McGraw Hill Education, 2013.
2. Peter Flach, ―Machine Learning: The Art and Science of Algorithms
that Make Sense of Data‖,First Edition, Cambridge University Press, 2012.
3. Jason Bell, ―Machine learning – Hands on for Developers and
Technical Professionals‖, First Edition, Wiley, 2014
4. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive
Computation and Machine Learning Series), Third Edition, MIT Press,
2014.

Course Outcomes:
1. Distinguish between, supervised, unsupervised and semi-supervised learning
2. Understand algorithms for building classifiers applied on datasets of
non-linearly separableclasses
3. Understand the principles of evolutionary computing algorithms
4. Design an ensembler to increase the classification accuracy.
5. Understand the Reinforcement Learning methods.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H L H

CO-2 M M L M L

CO-3 M L L

CO-4 H M M H M

CO-5 L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM604PC) NATURAL LANGUAGE PROCESSING

LABORATORY
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
0- 0 -2 -1
Prerequisites:
1. Data structures, finite automata and probability theory.

Course Objectives:
 To Understand Word Analysis & Word Generation

 To Provide the Knowledge of Ambiguous sense & WSD

 To Acquire the Knowledge of NLTK tool kit.

 To Understand the Morphological Analysis using NLTK library.

 To learn the N- Grams Smoothing NLTK Package.

List of Experiments
1. Write a Python Program to perform Tokenization tasks on text.

2. Write a Python Program to perform Stop word Removal tasks on text.

3. Write Python Program for Word Analysis

4. Write Python Program for Word Generation

5. Create a Sample list for at least 5 words with ambiguous sense and
Write a Python program to implement WSD
6. Install NLTK tool kit and perform stemming

7. Create Sample list of at least 10 words POS tagging and find the POS for any given
word

8. Write a Python program to

a) Perform Morphological Analysis using NLTK library

b) Generate n-grams using NLTK N-Grams library

c) Implement N-Grams Smoothing

9. Write a Python program to implement Porter stemmer algorithm for stemming

10. Using NLTK package to convert audio file to text and text file to audio files.
 Text Books:
1. Multilingual natural Language Processing Applications: From Theory to
Practice – Daniel M.Bikel and Imed Zitouni, Pearson Publication.
2. Oreilly Practical natural Language Processing, A Comprehensive Guide
to Building Real World NLP Systems.
3. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An
Introduction to Natural Language Processing, Computational Linguistics
and Speech, Pearson Publication, 2014

Reference Book:
1. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language
Processing with Python, First Edition, O‘Reilly Media, 2009.

Course Outcomes:
1. Apply Knowledge of Word Analysis & Word Generation.

2. Implement Ambiguous sense & WSD.

3. Knowledge on Morphological Analysis NLTK tool Kit

4. Understand the Morphological Analysis using NLTK library

5. Explore N- Grams Smoothing &NLTK Package.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H M H M H

CO-2 H H M H M H

CO-3 H M H H M H

CO-4 M M H H M H

CO-5 M M H H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS643PC)/(AM605PC) DATA ANALYTICS

LABORATORY
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
0- 0 -2 -1
Course Objectives:
 To explore the fundamental concepts of data analytics.

 To learn the principles and methods of statistical analysis

 Discover interesting patterns, analyze supervised and unsupervised models

 Estimate theaccuracy of the algorithms.

 To understand the various search methods and visualization techniques.

List of Experiments:
1. Data Preprocessing

a. Handling missing values

b. Noise detection removal

2. Implement Data Preprocessing to Identifying data redundancy and elimination

3. Implement any one imputation model

4. Implement Linear Regression

5. Implement Logistic Regression

6. Implement Decision Tree Induction for classification

7. Implement Random Forest Classifier

8. Object segmentation using hierarchical based methods

9. Perform Visualization techniques (types of maps - Bar, Colum, Line, Scatter, 3D

Cubes etc)

10. Perform Descriptive analytics on healthcare data

11. Perform Predictive analytics on Product Sales data

12. Apply Predictive analytics for Weather forecasting.

Text Books:
1. Data Mining Concepts and Techniques, Han, Kamber, 3rd Edition, Morgan
 Kaufmann Publishers.

2. Introduction to Data Mining, Tan, Steinbach and Kumar, Addison Wesley, 2006.

Reference Books:
1. Student’s Handbook for Associate Analytics – II, III.

2. Data Mining Analysis and Concepts, M. Zaki and W. Meira

3. Mining of Massive Datasets, Jure Leskovec Stanford

Univ. Anand Rajaraman Milliway Labs Jeffrey D Ullman

Stanford Univ.

Course Outcomes:
1. Understand linear regression and logistic regression
2. Understand the functionality of different classifiers
3. Implement visualization techniques using different graphs
4. Apply descriptive and predictive analytics for different types of data
5. Design various classification techniques.

CO-PO-PSO Mapping: PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M

CO-2 M H H

CO-3 M M M

CO-4 L H

CO-5 L M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AE606HS) ADVANCED ENGLISH COMMUNICATION SKILLS

LAB

III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C

0- 0 -2 -1
Course Objectives:
 To improve the students’ fluency in English by focusing on listening and reading skills
 To communicate their ideas relevantly and coherently in writing
 To enable them to give effective presentations in their professional life
 To develop employability skills by participating in group discussions
 To train the students with appropriate strategies to crack interviews

Syllabus:
The following course content to conduct the activities is prescribed for the
Advanced English Communication Skills (AECS) Lab:
1. Listening and Reading Comprehension: Active Listening – Development of Listening Skills

Through Audio clips - Benefits of Reading – Methods and Techniques of Reading – Basic
Steps to Effective Reading – Common Obstacles – Discourse Markers or Linkers - Sub-skills
of reading - Reading for facts, negative facts and Specific Details- Guessing Meanings from
Context, Inferring Meaning - Critical Reading –– Reading Comprehension – Exercises for
Practice.
2. Writing Skills: Vocabulary for Competitive Examinations - Planning for Writing – Improving

Writing Skills - Structure and presentation of different types of writing – Free Writing and
Structured Writing - Letter Writing –Writing a Letter of Application –Resume vs.
Curriculum Vitae – Writing a Résumé – Styles of Résumé - e-Correspondence – Emails –
Blog Writing - (N)etiquette – Report Writing – Importance of Reports – Types and Formats
of Reports– Technical Report Writing– Exercises for Practice.

3. Presentation Skills - Starting a conversation – responding appropriately and relevantly – using

the right language and body language – Role Play in different situations including Seeking
Clarification, Making a Request, Asking for and Refusing Permission, Participating in a
Small Talk – Oral presentations (individual and group) through JAM sessions- PPTs –
Importance of Presentation Skills – Planning,
Preparing, Rehearsing and Making a Presentation – Dealing with Glossophobia or Stage Fear –
Understanding Nuances of Delivery - Presentations through Posters/Projects/Reports –
Checklist for Making a Presentation and Rubrics of Evaluation

4. Group Discussion (GD): Types of GD and GD as a part of a Selection Procedure -

Dynamics of Group Discussion- Myths of GD - Intervention, Summarizing - Modulation

of Voice, Body Language, Relevance, Fluency and Organization of Ideas – Do’s and Don’ts
- GD Strategies – Exercises for Practice.

5. Interview Skills: Concept and Process - Interview Preparation Techniques - Types of

Interview Questions – Pre-interview Planning, Opening Strategies, Answering Strategies -

Interview Through Tele- conference & Video-conference - Mock Interviews.

Minimum Requirement:
The Advanced English Communication Skills (AECS) Laboratory shall have the following infra-
structural facilities to accommodate at least 35 students in the lab:

 Spacious room with appropriate acoustics

 Round Tables with movable chairs
 LCD Projector
 Public Address system
 One PC with latest configuration for the teacher
 Headphones of High quality

Suggested Software & Dictionaries:

The software consisting of the prescribed topics elaborated above should be procured and
used.

 Oxford Advanced Learner’s Dictionary, 10th Edition

 Cambridge Advanced Learner’s Dictionary
 DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice.
 WALDEN

Books Recommended:

1. Rizvi, M. Ashraf (2018). Effective Technical Communication. (2nd ed.). McGraw Hill
Education (India) Pvt. Ltd.

2. Suresh Kumar, E. (2015). Engineering English. Orient BlackSwan Pvt. Ltd.

 3. Bailey, Stephen. (2018). Academic Writing: A Handbook for International Students. (5th
Edition). Routledge.

4. Koneru, Aruna. (2016). Professional Communication. McGraw Hill Education (India) Pvt. Ltd.

5. Raman, Meenakshi & Sharma, Sangeeta. (2015). Technical Communication, 3E: Principles and
Practice.
Oxford University Press.

6. Anderson, Paul V. (2007). Technical Communication. Cengage Learning Pvt. Ltd. New Delhi.

7. McCarthy, Michael; O’Dell, Felicity & Redman, Stuart. (2017). English Vocabulary in
Use Series. Cambridge University Press

8. Sen, Leela. (2009). Communication Skills. PHI Learning Pvt Ltd., New Delhi.

9. Goleman, Daniel. (2013). Emotional Intelligence: Why it can matter more than IQ. Bloomsbury
Publishing.

Course Outcomes:

1. Apply reading and listening strategies to enhance comprehension skills

2. Develop different kinds of Writing: Formal Letters, Précis Writing, Essay
Writing and Technical Report Writing
3. Enhance presentation skills to apply in professional life
4. Use strategies and techniques to clear group discussions
5. Practice mock interviews to improve employability skills

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L L M M L

CO-2 L M M M

CO-3 M M H H M

CO-4 H M H H H

CO-5 H H H H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

ENVIRONMENTAL SCIENCE#
III Year B.Tech. CSE (AI & ML)- II Sem L-T-P-C
3- 0 -0 -0
Course Objectives:
The objectives of this course is to provide:
 To explain the multidisciplinary nature of environment, essence and
functioning of ecosystem,
 To impart knowledge about natural resources and their protection
 To inculcate the importance of Biodiversity and its conservation
 To explain about the causes and effects of environmental pollution and its
management as well as environmental issues
 To discuss about the environmental wastes Management rules, regulations,
EIA for the protection of environment and to make students to understand about
sustainable development.

UNIT - I

Ecosystems: Definition, Scope, and Importance of ecosystem. Classification, structure,

and function of an ecosystem, Food chains, food webs, and ecological pyramids. Flow
of energy, Biogeochemical cycles, Bioaccumulation, Biomagnification, ecosystem
value, services and carrying capacity, Field visits.

UNIT - II

Natural Resources: Classification of Resources: Living and Non-Living resources, water

resources: use and over utilization of surface and ground water, floods and droughts,
Dams: benefits and problems. Mineral resources: use and exploitation, environmental
effects of extracting and using mineral resources, Land resources: Forest resources,
Energy resources: growing energy needs, renewable and non-renewable energy sources,
use of alternate energy source, case studies.

UNIT - III

Biodiversity and Biotic Resources: Introduction, Definition, genetic, species and

ecosystem diversity. Value of biodiversity; consumptive use, productive use, social,
ethical, aesthetic and optional values. India as a mega diversity nation, Hot spots
of biodiversity. Field visit. Threats to biodiversity: habitat loss, poaching of
wildlife, man-wildlife conflicts; conservation of
 biodiversity: In-Situ and Ex-situconservation. National Biodiversity act.
UNIT - IV

Environmental Pollution and Control Technologies: Environmental Pollution:

Classification of pollution, Air Pollution: Primary and secondary pollutants, Automobile
and Industrial pollution, Ambient air quality standards. Water pollution: Sources and
types of pollution, drinking water quality standards. Soil Pollution: Sources and types,
Impacts of modern agriculture, degradation of soil. Noise Pollution: Sources and Health
hazards, standards, Solid waste: Municipal Solid Waste management, composition
and characteristics of e-Waste and its management. Pollution control technologies:
Wastewater Treatment methods: Primary, secondary and Tertiary.
Overview of air pollution control technologies, Concepts of bioremediation. Global
Environmental Issues and Global Efforts: Climate change and impacts on human
environment. Ozone depletion and Ozone depleting substances (ODS). Deforestation
and desertification. International conventions / Protocols: Earth summit, Kyoto
protocol, and Montréal Protocol. NAPCC-GoI Initiatives.

UNIT - V
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal aspects
Air Act- 1981, Water Act, Forest Act, Wild life Act, Municipal solid waste
management and handling rules, biomedical waste management and handling
rules, hazardous waste management and handling rules. EIA: EIA structure,
methods of baseline data acquisition. Overview on Impacts of air, water, biological
and Socio- economical aspects. Strategies for risk assessment, Concepts of
Environmental Management Plan (EMP). Towards Sustainable Future: Concept of
Sustainable Development Goals, Population and its explosion, Crazy Consumerism,
Environmental Education, Urban Sprawl, Human health, Environmental Ethics,
Concept of Green Building, Ecological Foot Print, Life Cycle assessment (LCA),
Low carbon life style.

Text Books:
1 Textbook of Environmental Studies for Undergraduate Courses by Erach
Bharucha for University Grants Commission.
2 Environmental Studies by R. Rajagopalan, Oxford University Press.

Reference Books:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008 PHL
 Learning Private Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and
Wendell P. Ela. 2008 PHILearning Pvt. Ltd.
3. Environmental Science by Daniel B. Botkin & Edward A. Keller, Wiley INDIA
edition.

4. Environmental Studies by Anubha Kaushik, 4th Edition, New age international

publishers.

5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy

2007, BS Publications.

6. Introduction to Environmental Science by Y. Anjaneyulu, BS. Publications.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. The multidisciplinary nature of environment, essence of environment,
2. About the natural resources utilization and their conservation
3. The importance of Biodiversity and its Conservation
4. About the causes and effects of environmental pollution and its
management as well as environmental issues
5. About the environmental wastes management rules, regulations and EIA for
the protection of environment and to achieve sustainable development.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H H M L H M

CO-2 H H H M L H M

CO-3 M M H M

CO-4 M M M L

CO-5 M M M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM701PC) DEEP LEARNING

IV Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
3- 0 -0 -3
Pre-requisites:
 Basic Knowledge of Mathematical Foundations.

Course Objectives:
 To introduce Machine Learning basics and introduce Deep learning concepts
 To explore regularization techniques for deep learning
 To introduce the Convolutional Neural Networks
 To understand Recurrent and Recursive Neural Networks
 To apply deep learning techniques to solve real world problems
UNIT - I
Machine Learning Basics: Supervised Learning Algorithms, Unsupervised Learning
Algorithms, Stochastic Gradient Descent, Building a Machine Learning Algorithm,
Challenges Motivating Deep Learning.
Deep Feedforward Networks: Learning XOR, Gradient-Based Learning, Hidden Units,
Architecture Design.
UNIT - II
Regularization for Deep Learning : Parameter Norm Penalties, Norm Penalties as
Constrained Optimization, Regularization and Under-Constrained Problems,
Dataset
Augmentation, Noise Robustness, Semi-Supervised Learning, MultiTask Learning,
Early Stopping, Parameter Tying and Parameter Sharing, Sparse Representations,
Bagging and Other Ensemble Methods, Dropout, Adversarial Training, Tangent
Distance, Tangent Prop, and Manifold Tangent Classifier.
UNIT – III
Convolutional Networks : The Convolution Operation, Motivation, Pooling,
Convolution and Pooling as an Infinitely Strong Prior, Variants of the Basic
Convolution Function, Structured Outputs, Data Types, Efficient Convolution
Algorithms, Random or Unsupervised Features.
UNIT - IV
Recurrent and Recursive Nets : Unfolding Computational Graphs, Recurrent Neural
Networks,
 Bidirectional RNNs, Encoder-Decoder Sequence-to-Sequence Architectures, Deep
Recurrent Networks.
Recursive Neural Networks: The Challenge of Long-Term Dependencies, Echo
State Networks, Leaky Units and Other Strategies for Multiple Time Scales, The
Long Short-Term Memory and Other Gated RNNs, Optimization for Long- Term
Dependencies, Explicit Memory. UNIT - V
Practical Methodology: Performance Metrics, Default Baseline Models,
Determining
Whether to Gather More Data, Selecting Hyperparameters, Debugging
Strategies, Example: Multi-Digit Number Recognition.
Applications: Large-Scale Deep Learning, Computer Vision.

Text Book:
1. Deep Learning by Ian Goodfellow, Yoshua Bengio and Aaron Courville, MIT Press,2016.

Reference Books:
1. The Elements of Statistical Learning. Hastie, R. Tibshirani, and J. Friedman, Springer.
2. Probabilistic Graphical Models. Koller, and N. Friedman, MIT Press.
3. Bishop. C.M., Pattern Recognition and Machine Learning, Springer, 2006.
4. Yegnanarayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
5. Golub, G.,H., and Van Loan, C.,F., Matrix Computations, JHU Press, 2013.
6. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill
Education, 2004.Student Edition.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Gain knowledge of neural networks and deep learning basics
2. Apply regularization techniques to improve deep learning models
3. Design and implement CNNs for image recognition and classification tasks
4. Implement Recurrent and Recursive Neural Network models
5. Develop deep models for real-world problems

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L M L L
CO-2 M M L M M L

CO-3 M L L M M L

CO-4 M M M M M L

CO-5 M L H L H L L H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM702PC) NATURE INSPIRED COMPUTING

IV Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C

2- 0 -0 -2

Prerequisites: A course on “Introduction to Artificial Intelligence” or “Foundations of

Computer Science”
Course Objectives:
 Understand evolutionary algorithms and their applications in optimization,
inspired by biological evolution and natural selection processes.
 Study artificial neural networks and learning algorithms, exploring their
connections to the nervous system and computational problem-solving
 Explore the behavior of swarm-based systems, such as ant colonies and swarm
robotics, for decentralized problem-solving and knowledge adaptation.
 Learn about artificial immune systems and algorithms inspired by the
immune system, applying them to computational tasks like optimization and
pattern recognition.
 Apply bioinspired computing techniques to real-world problems in
bioinformatics and information display systems.
UNIT - I
Evolutionary Computing
Problem Solving as a Search Task, Hill Climbing and Simulated Annealing,
Evolutionary Biology, Evolutionary Computing, The Other Main Evolutionary
Algorithms, From Evolutionary Biology to Computing, Scope of Evolutionary
Computing
UNIT - II
Neurocomputing
The Nervous System, Artificial Neural Networks, Typical ANNS and Learning
Algorithms, From Natural to Artificial Neural Networks, Scope of Neurocomputing
UNIT - III
Swarm Intelligence
Ant Colonies, Swarm Robotics, Social Adaptation of Knowledge
UNIT - IV
Immunocomputing
The Immune System, Artificial Immune Systems, Bone Marrow Models, Negative
Selection Algorithms, Clonal Selection and Affinity Maturation, Artificial Immune
Networks, From Natural to Artificial Immune Systems, Scope of Artificial Immune
Systems
UNIT - V
Case Studies- Bioinformatics, Information Display

Text Books:
1. Leandro Nunes de Castro - " Fundamentals of Natural Computing, Basic
Concepts, Algorithms and Applications", Chapman & Hall/ CRC, Taylor and
Francis Group, 2007
2. Albert Y.Zomaya - "Handbook of Nature-Inspired and Innovative Computing",
Springer2006

Reference Books:
1. Floreano, D. and C. Mattiussi -"Bio-Inspired Artificial Intelligence: The
oriesethods, and Technologies" IT Press, 2008
2. Marco Dorrigo, Thomas Stutzle -” Ant Colony Optimization”, Prentice Hall of
India, New lhi, 2005
3. Vinod Chandra S S, Anand H S - “Machine Learning: A Practitioner's
Approach”, Prentice Hall of India, New Delhi, 2020

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Explore evolutionary computing, problem solving, algorithms, and biological
inspirations for optimization.
2. Understand neural networks, learning algorithms, and neurocomputing from biological
systems.
3. Explore swarm intelligence, ant colonies, robotics, and knowledge adaptation strategies..
4. Study immune systems, algorithms, networks, and their artificial computational
applications.
5. Analyze bio-informatics case studies and explore information display techniques
applications.
CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M H H M
CO-1 M H H H M

CO-3 H M M L M
CO-4 M M L H M

CO-5 H M H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM731PE) INTERNET OF THINGS

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
3- 0 -0 -3
Prerequisites:
•A course on Computer organization
•A course on Computer Networks

Course Objectives:
The objectives of this course are to provide:
•To introduce the terminology, technology and its applications
•To introduce the concept of M2M (machine to machine) with necessary protocols
•To introduce the Python Scripting Language which is used in many IoT devices
•To introduce the Raspberry PI platform, that is widely used in IoT applications
•To introduce the implementation of web-based services on IoT devices
UNIT - I
Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design of
IoT, Logical Design of IoT, IoT Enabling Technologies, IoT Levels and Deployment
Templates Domain Specific IoTs – Home automation, Environment, Agriculture, Health
and Lifestyle.
UNIT - II
IoT and M2M – M2M, Difference between IoT and M2M, SDN and NFV for IoT.
IoT System Management with NETCONF, YANG- Need for IoT system Management,
Simple Network management protocol, Network operator requirements, NETCONF,
YANG, IoT Systems Management with NETCONF-YANG.
UNIT - III
IoT Systems – Logical design using Python-Introduction to Python – Python Data types & Data
structures, Control flow, Functions, Modules, Packaging, File handling, Data/Time
operations, Classes, Exception, Python packages of Interest for IoT.
UNIT - IV
IoT Physical Devices and Endpoints - Raspberry Pi, Linux on Raspberry Pi, Raspberry Pi
Interfaces, Programming Raspberry PI with Python, Other IoT devices.
IoT Physical Servers and Cloud Offerings – Introduction to Cloud Storage models
and
 communication APIs, WAMP-AutoBahn for IoT, Xively Cloud for IoT, Python web
application framework–Django, Designing a RESTful web API.
UNIT - V
Case studies- Home Automation, Environment-weather monitoring-
weather reporting- air pollution monitoring, Agriculture.

Text Book:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547.

Reference Book:
1. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly
(SPD), 2014, ISBN: 9789350239759.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Interpret the impact and challenges posed by IoT networks leading to new
architectural models
2. Compare and contrast the deployment of smart objects and the technologies to
connect them to network.
3. Appraise the role of IoT protocols for efficient network communication.
4. Identify the applications of IoT in Industry.
5. Identify the Case studies of IoT.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L H L H H M L

CO-2 M H H H L L H

CO-3 L H H H H M M

CO-4 L H M H M H

CO-5 M H H H L M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM732PE) DATA MINING

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML)- I Sem L-T-P-C
3- 0 -0 -3
Prerequisites:

 Database Management System

 Probability and Statistics

Course Objectives:
The objectives of this course are to provide:
 To understand the basic concepts of data mining and data models.
 To analyze and apply using association rule mining with market basket analysis
 To understand the fundamental processes concepts and techniques of data mining.
 To consistently apply knowledge concerning current data mining research and
how this may contribute to the effective design and implementation of data
mining applications.
 To provide advanced research skills through the investigation of data-mining

UNIT-I

Introduction to Data Mining:

What is Data mining? Kinds of Data, Knowledge Discovery Process, Data Mining
Functionalities, Kinds of Patterns, Major Issues in Data Mining. Data Objects and
Attribute Types, Multidimensional Data Model, OLAP Operations on Multidimensional
Data, Measuring Data Similarity and Dissimilarity, Data Pre-processing: Major Tasks
in Data Pre-processing, Data Cleaning, Data Integration, Data Reduction, Data
Transformation and Data Discretization.
UNIT-II

Association Analysis: Basic Concepts, Market Basket Analysis, A priori Algorithm, FP-
growth, From Association Analysis to Correlation Analysis, Pattern Mining in Multi-
Level Associations and Multi-Dimensional Associations.
UNIT-III

Classification: Basic Concepts, Decision Tree Induction, Bayes Classification Methods,

Metrics for Evaluating Classifier Performance, Ensemble Methods, Multi-layer Feed-
Forward Neural Network,
Support Vector Machines, k-Nearest-Neighbor Classifier
UNIT-IV

Cluster Analysis: Requirements for Cluster Analysis, Overview of Basic Clustering

Methods, Partitioning Methods-k-Means, k-Medoids, Hierarchical Methods-AGENES,
DIANA, BIRCH, Density- Based Method-DBSCAN, Outlier
Analysis: Types of Outliers, Challenges of Outlier Detection,
UNIT-V

Advanced Concepts: Web Mining- Web Content Mining, Web Structure Mining, Web
Usage Mining, Spatial Mining Spatial Data Mining Primitives, Spatial Rules, Spatial
Clustering Algorithms, Temporal Mining-Modeling Temporal Events, Time Series,
Pattern Detection, Sequences, Temporal Association Rules.

Text Books:
1. JiaweiHan, Micheline Kamber, JianPei., Datamining: Concepts and Techniques,
3rd Edition, Morgan Kaufmann/Elsevier,2012.
2. Margaret HDunham, Data Mining Introductory and Advanced Topics, 2nd
Edition, Pearson Education, India,2006.

Reference Books:
1. Data Mining Techniques, Arun K Pujari, 3rd Edition, Universities Press.

2. Pang-Ning Tan, Michael Steinbach, Anuj Karpatne and Vipin Kumar,

Introduction to Data Mining, 2nd Edition, Pearson Education India, 2021.

3. Amitesh Sinha, Data Warehousing, Thomson Learning, India, 2007.

Course Outcomes:
1. Understand the need for data mining and pre-processing techniques.
2. Perform market basket analysis using association rule mining.
3. Utilize classification techniques for analysis and interpretation of data.
4. Identify appropriate clustering and outlier detection techniques to handle complex data.
5. Understand the mining of data from web, text, and time series data.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M L L H L L M M

CO-2 M H M M M M - M H

CO-3 L H H H M L - M M

CO-4 M M H H M L - M L

CO-5 M M L L H L M L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM733PE)MERN STACK DEVELOPMENT

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:
 Introduction to Object Oriented Programming
 A course on Web Programming

Course Objectives:
 To understand full stack development Concepts.
 To master the basics of react and analyze its core concepts.
 To understand the fundamentals of Node.js.
 To learn how to handle request and response objects to interact with client
applications.
 To know the concepts of MongoDB and explore its features.
UNIT-I
Introduction to full stack development: Understanding the web development basicsBrowser,
Server, Backend services, Full stack technologies (MERN) - Mongo DB, Express JS,
React JS and Node JS. Javascript fundamentals-DOM Manipulations, Functions and
loops), Event handling, Callback functions
UNIT - II
React js: Need of React, Simple React Structure, The Virtual DOM, Introducing React
Components, Creating Components in React, JSX Basics, Component Styling-CSS
Modules, Inline Styles. Handling Events in React, Data and Data Flow (Passing Props)
in React, Rendering and Life Cycle Methods in React, Working with Forms in React,
Integrating Third Party Libraries, Routing in React UNIT - III:
Node js: Working with JSON data -Reading and Writing, Accessing File system from
Node js -
Opening, Closing, Reading and Writing Files and other file system tasks. Understanding
Request from the client and Response from the Server. Implementing HTTP services -
processing URLs, Processing query strings and Form parameters. Implementing HTTPS
servers and clients.
UNIT – IV:
Express js: Getting Started with Express, Serving Static Files in Express, Configuring
Routes, Using
 Requests Objects, Using Response Objects, Basic Middleware Concepts, Creating APIs
with CRUD Operations -Using GET, PUT, POST, DELETE Methods.
UNIT – V:
MongoDB : Relational and Non-Relational Databases. Types of NoSQL Databases -
KeyValue, Document, Column-Family, Graph. Introduction to MongoDB and Its
Features. Mongo DB installation and setting up cluster. Adding Mongo DB driver to
Node js, Connecting Mongo DB from Node js environment, CRUD operations using
Mongo DB, Querying with filters.

Text Books:
1. Brad Dayley, Brendan Dayley, Caleb Dayley., Node.js, MongoDB and
Angular Web Development, 2nd Edition, Addison-Wesley, 2019.
2. Mark Tielens Thomas, React in Action, 1st Edition, Manning Publications.

Reference Books:
1. Vasan Subramanian, Pro MERN Stack, Full Stack Web App Development with
Mongo, Express, React, and Node, 2nd Edition, Apress, 2019.

2.Chris Northwood, The Full Stack Developer: Your Essential Guide to the Everyday
Skills Expected of a Modern Full Stack Web Developer’, 1st edition, Apress, 2018.
3.Kirupa Chinnathambi, Learning React: A Hands-On Guide to Building Web
Applications Using React and Redux, 2nd edition, Addison-Wesley Professional, 2018.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Be acquainted with building and deploying a full-stack web application using the MERN
stack.
2. Able to develop interactive and dynamic user interfaces using React components.
3. Able to perform various file system operations, such as reading, writing, and
managing files programmatically.
4. Gain knowledge on CRUD operations to manage data in web applications.
5. Able to implement efficient data operations in MongoDB.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L M L L M L M

CO-2 L H M M M M H
CO-3 M L M M H L L

CO-4 M M L L M L M

CO-5 L M L M M M M
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM734PE) MOBILE APPLICATION DEVELOPMENT

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 Learn the architecture, features, and setup of Android Studio for app development.
 Develop interactive UIs using layouts, views, and essential UI components.
 Implement activities, fragments, and handle their lifecycle and state changes.
 Use explicit and implicit intents for navigation and system interactions.
 Perform CRUD operations for data storage and management in Android applications.
UNIT-I:
Introduction to Android Operating System: Android OS design and Features – Android
development framework, Installing and running applications on Android Studio, Creating
AVDs, Types of Android applications. Android Application Lifecycle – Creating Activities,
Activity lifecycle, Activity states, monitoring state changes.
UNIT-II:
Android application Component: Android Manifest file, Externalizing resources like Simple
Values, Drawables, Layouts, Menus, etc.
Building User Interface: Fundamental Android UI Design, Layouts – Linear, Relative, Grid and
Table Layouts.
User Interface (UI) Components –Editable and non-editable TextViews, Buttons, Radio and
Toggle Buttons, Checkboxes, Spinners.
UNIT – III
Fragments – Creating fragments, Lifecycle of fragments, Fragment states, Adding
fragments to Activity, adding, removing and replacing fragments with fragment
transactions, interfacing between fragments and Activities.
UNIT-IV:
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new
Activity, Implicit Intents, Passing data to Intents, Getting results from Activities. Native
Actions using Intent to dial a number or to send SMS.
Broadcast Receivers – Using Intent filters to service implicit Intents, Resolving Intent filters.
UNIT-V:
Database – Introduction to SQLite database, creating and opening a database, creating tables,
inserting retrieving and deleting data.

Text books:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012
2. Android Application Development for Java Programmers, James C Sheusi, Cengage
Learning, 2013

Reference books:
1. Android Application Development Black Book by Pradeep Kothari, DreamTech, 2020.
2. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Gain knowledge of Android architecture, features, and development environment.
2. Create user-friendly interfaces using layouts, views, and UI components.
3. Implement activities, fragments, and handle their lifecycle effectively.
4. Navigate between activities and interact with system services.
5. Perform CRUD operations using SQLite for data storage.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M L L M H

CO-2 M H M H M M H

CO-3 M M H H M H

CO-4 L M H H M H

CO-5 L M M M M M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(AM735PE) CLOUD COMPUTING
(Professional Elective-III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Pre-requisites:
 A course on “Computer Networks”.
 A course on “Operating System”.

Course Objectives:
 To understand the fundamental concepts and various paradigms of cloud computing.
 To examine different cloud deployment and service models.
 To delve into virtualization concepts and programming models used in cloud
environments.
 To analyze networking requirements and issues in cloud computing, especially within data
centers.
 To explore security concerns and advanced concepts in cloud computing.

UNIT - I
Computing Paradigms, Cloud Computing Fundamentals, Cloud Computing Architectur e
and Management
UNIT - II

Cloud Deployment Models, Cloud Service Models, Technological Drivers for Cloud
Computing: SOA and Cloud, Multicore Technology, Web 2.0 and Web 3.0
UNIT - III

Virtualization, Programming Models for Cloud Computing: Map Reduce,

Cloud Haskell, Software Development in Cloud

UNIT - IV
Networking for Cloud Computing: Introduction, Overview of Data Center
Environment, Networking Issues in Data Centers, Transport Layer Issues in DCNs, Cloud
Service Providers

UNIT - V
Security in Cloud Computing, and Advanced Concepts in Cloud Computing

Text Books:
1. Cloud Computing: Principles and Paradigms, Editors: Rajkumar Buyya, James
Broberg,
Andrzej M. Goscinski, Wiley, 2011
2. Chandrasekaran, K. Essentials of cloud computing. CRC Press, 2014

Reference Books:
1. Enterprise Cloud Computing - Technology, Architecture, Applications,
Gautam Shroff, Cambridge University Press, 2010
2. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010

Course Outcomes:
By the end of this course, students will be able to:

1. Explain and compare different computing paradigms and fundamentals of cloud

computing.
2. Identify and implement suitable cloud service models and recognize the
technological drivers for cloud computing.
3. Apply virtualization techniques and programming models like MapReduce in cloud
environments.
4. Analyze and address networking and transport layer issues in data centers.
5. Evaluate security concerns and advanced concepts related to cloud computing.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M L L L M L

CO-2 M M M L M M M

CO-3 M M H L M M M

CO-4 M M L M M M M

CO-5 M M L M M M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM741PE) QUANTUM COMPUTING

(Professional Elective – IV)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
• To introduce the fundamentals of quantum computing.
• The problem-solving approach using finite dimensional mathematics.
• To comprehend the concept of a qubit.
• Introduction to basics of quantum circuits and applications of quantum algorithms.
• To introduce the techniques used to protect the information stored in qubits
from errors and decoherence caused by noise.
UNIT - I
History of Quantum Computing: Importance of Mathematics, Physics and Biology. Introduction
to Quantum Computing: Bits Vs Qubits, Classical Vs Quantum logical operations
UNIT - II
Background Mathematics: Basics of Linear Algebra, Hilbert space, Probabilities and
measurements. Background Physics: Paul's exclusion Principle, Superposition,
Entanglement and super-symmetry, density operators and correlation, basics of quantum
mechanics, Measurements in bases other than computational basis. Background Biology:
Basic concepts of Genomics and Proteomics (Central Dogma).
UNIT – III
Qubit: Physical implementations of Qubit. Qubit as a quantum unit of information. The
Bloch sphere Quantum Circuits: single qubit gates, multiple qubit gates, designing the
quantum circuits. Bell states.
UNIT – IV
Quantum Algorithms: Classical computation on quantum computers. Relationship between
quantum and classical complexity classes. Deutsch’s algorithm, Deutsch’s-Jozsa
algorithm, Shor’s factorization algorithm, Grover’s search algorithm.
UNIT - V
Noise and error correction: Graph states and codes, Quantum error correction, fault-tolerant
computation. Quantum Information and Cryptography: Comparison between classical and
quantum information theory. Quantum Cryptography, Quantum teleportation
Text Book:
1. Nielsen M. A., Quantum Computation and Quantum Information, Cambridge

Reference Books:
1. Quantum Computing for Computer Scientists by Noson S. Yanofsky and Mirco
A.Mannucci
2. Benenti G., Casati G. and Strini G., Principles of Quantum Computation and
Information, Vol. I: Basic Concepts, Vol II

3. Basic Tools and Special Topics, World Scientific. Pittenger A. O., An Introduction
to Quantum Computing Algorithms

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand basics of quantum computing
2. Understanding background mathematics of quantum computing.
3. Understand physical implementation of Qubit
4. Understand Quantum algorithms and their implementation
5. Understand The Impact of Quantum Computing on Cryptography

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M H H H H L M M H

CO-2 M H M M M M L M H

CO-3 H H H H H L M M H

CO-4 M H H H M L M M H

CO-5 M M L L H L M M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM742PE) EXPERT SYSTEMS

(Professional Elective – IV)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To review the concepts of Artificial Intelligence
 To explore the Knowledge Representation
 To introduce the fundamental concepts of Expert Systems
 To introduce the Expert System tools
 To develop an Expert System
UNIT- I
Introduction to AI programming languages, Blind search strategies, Breadth-first –
Depth-first – Heuristic search techniques Hill Climbing – Best first – A Algorithms AO*
algorithm – game trees, Minmax algorithms, game playing – Alpha-beta pruning.
UNIT-II
Knowledge representation issues, predicate logic – logic programming Semantic nets-
frames and inheritance, constraint propagation; Representing Knowledge using rules,
Rules-based deduction systems.
UNIT- III
Introduction to Expert Systems, Architecture of expert systems, Representation and
organization of knowledge, Basics characteristics, and types of problems handled by
expert systems.
UNIT- IV
Expert System Tools: Techniques of knowledge representations in expert systems, knowledge
engineering, system-building aids, support facilities, stages in the development of expert
systems.
UNIT- V
Building an Expert System: Expert system development, Selection of the tool,
Acquiring Knowledge, Building process.
Problems with Expert Systems: Difficulties, common pitfalls in planning, dealing with
domain experts, difficulties during development.

Text Books:
1. Elain Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill, New
Delhi,3rd
 Edition,2017.
2. Waterman D.A., “A Guide to Expert Systems”, Addison Wesley Longman,1986.

Reference Books:
1. Stuart Russel and other Peter Norvig, “Artificial Intelligence – A Modern
Approach”, Prentice Hall,
2. Patrick Henry Winston, “Artificial Intelligence”, Addison Wesley,
3. Patterson, Artificial Intelligence & Expert System, Prentice Hall India, 1999.
4. Hayes-Roth, Lenat, and Waterman: Building Expert Systems, Addison Wesley,
5. Weiss S.M. and Kulikowski C.A., “A Practical Guide to Designing Expert
Systems”, Rowman & Allanheld, New Jersey.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Apply the basic techniques of Artificial Intelligence
2. Understand the representation of Knowledge
3. Understand the basics of Expert Systems
4. Use the Expert System Tools to develop Expert System
5. Build an Expert System and understand the issues

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L M L L L

CO-2 M L L M M L

CO-3 M L L L M M L

CO-4 M M L L M M L

CO-5 M L H M H H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM743PE) SEMANTIC WEB

(Professional Elective – IV)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 Introduction to Semantic Web, XML, and its impact on businesses.
 Basics and security of Web Services, including SOAP, UDDI, and their connection with
the Semantic Web.
 Understand the Resource Description Framework (RDF) and key XML technologies
like XPath, XSL, XQuery, XHTML, and others.
 Overview of taxonomies, ontologies, and knowledge representation in the Semantic Web.
 Semantic Web applications improve automation, learning, bioinformatics, and search
using services, ontologies, and tools like TAP and Swoogle.
UNIT - I
Introduction: Introduction to Semantic Web, the Business Case for the Semantic Web, XML
and Its Impact on the Enterprise.
UNIT - II
Web Services: Uses, Basics of Web Services, SOAP, UDDI, Orchestrating Web Services,
Securing Web Services, Grid Enabled and Semantic Web of Web Services.
UNIT - III
Resource Description Framework: Features, Capturing Knowledge with RDF.
XML Technologies: XPath, The Style Sheet Family: XSL, XSLT, and XSL FO, XQuery,
XLink, XPointer, XInclude, XMLBase, XHTML, XForms, SVG.
UNIT - IV
Taxonomies and Ontologies: Overview of Taxonomies, Defining the Ontology Spectrum, Topic
Maps, Overview of Ontologies, Syntax, Structure, Semantics, and Pragmatics, Expressing
Ontologies Logically, Knowledge Representation.
UNIT - V
Semantic Web Application: Semantic Web Services, e-Learning, Semantic Bioinformatics,
Enterprise Application Integration, Knowledge Base.
Semantic Search Technology: Search Engines, Semantic Search, Semantic Search
Technology, Web Search Agents, Semantic Methods, Latent Semantic Index Search, TAP,
Swoogle

Text Books:
1. The Semantic Web: A Guide to the Future of XML, Web Services, and Knowledge
Management by Michael C. Daconta, Leo J. Obrst , Kevin T. Smith, Wiley Publishing,
Inc.,2003.
2. Peter Mika, Social Networks and the Semantic Web, Springer,2007.

Reference Books:
1. Thinking on the Web - Berners Lee, Godel and Turing, Wiley Interscience
2. The Semantic Web: A Guide to the Future of XML, Web Services, and Knowledge
3. Management by Michael C. Daconta, Leo J. Obrst , Kevin T. Smith, Wiley Publishing,
Inc.
4. Semantic Web Technologies, Trends and Research in Ontology Based Systems, J.
5. Davies, R. Studer, P. Warren, John Wiley & Sons.
6. Semantic Web and Semantic Web Services - Liyang Lu Chapman and Hall/CRC
7. Publishers, (Taylor & Francis Group)
8. Information Sharing on the semantic Web - Heiner Stuckenschmidt; Frank Van
Harmelen,
9. Springer Publications.
10. Programming the Semantic Web, T. Segaran, C. Evans, J. Taylor, O’Reilly, SPD.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the fundamentals of the Semantic Web, its business value, and
XML’s impact on enterprises.
2. Learn the basics of Web Services (SOAP, UDDI), their orchestration, security,
and how they integrate with the Semantic Web.
3. Understand RDF features and its application in knowledge capture. Learn about
various XML technologies such as XPath, XSL, XQuery, SVG, etc.
4. Explore taxonomies and ontologies, their structure, semantics, and logic
for knowledge representation.
5. Learn about Semantic Web technologies in real-world applications like e-learning,
bioinformatics, and enterprise integration.

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H L H H H

CO-2 H M H H L

CO-3 H H L H M H H H

CO-4 H L H H H H

CO-5 H M M L M H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM744PE) GAME THEORY

(Professional Elective – IV)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To introduce the basic concepts of game theory and solutions.
 To know the different types of equilibrium interpretations.
 To introduce the Knowledge and Equilibrium.
 To understand the extensive games with perfect information.
 To know the different types of Repeated Games.
UNIT - I
Introduction- Game Theory, Games and Solutions, Game Theory and the Theory of
Competitive Equilibrium, Rational Behavior, The Steady State and Deductive
Interpretations, Bounded Rationality Terminology and Notation Nash Equilibrium-
Strategic Games, Nash Equilibrium, Examples, Existence of a Nash Equilibrium, Strictly
Competitive Games, Bayesian Games: Strategic Games with Imperfect Information.
UNIT - II
Mixed, Correlated, and Evolutionary Equilibrium -Mixed Strategy Nash Equilibrium,
Interpretations of Mixed Strategy Nash Equilibrium, Correlated Equilibrium, Evolutionary
Equilibrium Rationalizability and Iterated Elimination of Dominated Actions-
Rationalizability Iterated Elimination of Strictly Dominated Actions, Iterated Elimination
of Weakly Dominated Actions.
UNIT - III
Knowledge and Equilibrium -A Model of Knowledge Common Knowledge, Can People Agree
to Disagree? Knowledge and Solution Concepts, The Electronic Mail Game.
UNIT - IV
Extensive Games with Perfect Information -Extensive Games with Perfect Information,
Subgame Perfect Equilibrium, Two Extensions of the Definition of a Game, The
Interpretation of a Strategy, Two Notable Finite Horizon Games, Iterated Elimination
of Weakly Dominated Strategies Bargaining Games -Bargaining and Game Theory, A
Bargaining Game of Alternating Offers, Subgame Perfect Equilibrium, Variations and
Extensions.
UNIT - V
 Repeated Games - The Basic Idea Infinitely Repeated Games vs. Finitely Repeated Games,
Infinitely Repeated Games: Definitions, Strategies as Machines, Trigger Strategies: Nash
Folk Theorems, Punishing for a Limited Length of Time: A Perfect Folk Theorem for the
Limit of Means Criterion, Punishing the Punisher: A Perfect Folk Theorem for the
Overtaking Criterion, Rewarding Players Who Punish: A Perfect Folk Theorem for the
Discounting Criterion, The Structure of Subgame Perfect Equilibria Under the
Discounting Criterion, Finitely Repeated Game.

Text Book:
1. A course in Game Theory, M. J. Osborne and A. Rubinstein, MIT Press,2011.

Reference Books:
1. Game Theory, Roger Myerson, Harvard University Press.
2. Game Theory, D. Fudenberg and J. Tirole, MIT Press.
3. Theory of Games and Economic Behavior, J. von Neumann and O. Morgenstern, New
York: John Wiley and Sons.
4. Games and Decisions, R.D. Luce and H. Raiffa, New York: John Wiley and Sons.
5. Game Theory, G. Owen, 2nd Edition, New York: Academic Press.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Gain the knowledge of the basic concepts of game theory and solutions.
2. Understand different types of equilibrium interpretations.
3. Understand and analyze Knowledge and Equilibrium.
4. Analyze extensive games with perfect information.
5. Explore different types of Repeated Games.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L L M L

CO-2 L L M H L

CO-3 L L L M

CO-4 M L L L M

CO-5 M L L
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM745PE) MOBILE COMPUTING

(Professional Elective – IV)

IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Prerequisites: A course on “Computer Networks”.
Course Objectives:
 Introduce the fundamentals of mobile computing paradigms, applications.
 Analyze Wireless Medium Access Control (MAC) & Mobile Network Layer.
 Understand the Mobile Transport Layer & Database Issues.
 Explore Data Dissemination & Synchronization Mechanisms.
 Understand the Mobile Ad hoc Networks (MANETs).
UNIT – I
Mobile Computing – Introduction, Applications and Impediments and Architecture; Mobile
and Handheld Devices, Limitations of Mobile and Handheld Devices.
GSM – Services, System Architecture, Radio Interfaces.
UNIT - II
GSM -Protocols, Localization, Calling, Handover, Security.
(Wireless) Medium Access Control (MAC)
Motivation for a specialized MAC (Hidden and exposed terminals, Near and far terminals).
Mobile Network Layer
IP and Mobile IP Network Layers, Packet Delivery, Registration, Tunneling and
Encapsulation, DHCP.
UNIT - III
Mobile Transport Layer
Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP, Mobile TCP, Selective
retransmission, Transaction oriented TCP.
Database Issues,Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing.
UNIT - IV
Data Dissemination and Synchronization
Communications Asymmetry, Classification of Data Delivery Mechanisms, Data
Dissemination,
 Broadcast Models, Selective Tuning and Indexing Methods, Data Synchronization –
Introduction, Software, and Protocols.
UNIT - V
Mobile Ad hoc Networks (MANETs)
Introduction, Applications & Challenges of a MANET, Routing, Classification of Routing
Algorithms, Algorithms such as DSR, AODV, DSDV.

Text Books:
1. Raj Kamal, “Mobile Computing”, Oxford University Press, 2007, ISBN: 0195686772
2. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition, 2009.

Reference book:
1. Asoke K Talukder, Hasan Ahmed, Roopa Yavagal Mobile Computing: Technology,
Applications and Service Creation, McGraw Hill Education,2nd Edition.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the concept of mobile computing, applications and limitations.
2. Describe the MAC and mobile network layer.
3. Analyze Mobile transport network layers and data issues.
4. Examine data dissemination mechanisms, including broadcast models, indexing
methods, and data synchronization protocols.
5. Demonstrate knowledge of Mobile Ad Hoc Networks (MANETs) by analyzing
their routing algorithms

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L M L

CO-2 M M H L M

CO-3 M L L L M

CO-4 M L L L

CO-5 L M M M
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(CE721OE) REMOTE SENSING & GEOGRAPHICAL
INFORMATION SYSTEMS
(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3

Course Objectives:
 To Know the concepts of Remote Sensing, its interpreting Techniques and concepts of

 digital images.
 To know the concept of Geographical Information System (GIS), coordinate system.
 To get the knowledge of spatial data input and editing.
 To get awareness and digitization of GIS.
 To understand Implementation of GIS interface for practical usage.
UNIT - I
Concepts of Remote Sensing Basics of remote sensing- elements involved in remote sensing,
electromagnetic spectrum, remote sensing terminology & units, energy resources,
energy interactions with earth surface features & atmosphere, atmospheric effects,
satellite orbits, Sensor Resolution, types of sensors. Remote Sensing Platforms and
Sensors, IRS satellites.
Remote Sensing Data Interpretation Visual interpretation techniques,
basic elements, converging evidence, interpretation for terrain
evaluation, spectral properties of soil, water and vegetation. Concepts of
Digital image processing, image enhancements, qualitative &
quantitative analysis and pattern recognition, classification techniques and accuracy
estimation. UNIT - II:
Introduction to GIS: Introduction, History of GIS, GIS Components, GIS Applications in
Real
life, The Nature of geographic data, Maps, Types of maps, Map scale, Types of scale,
Map and Globe, Co- ordinate systems, Map projections, Map transformation, Geo-
referencing.
Spatial Database Management System: Introduction: Spatial DBMS, Data storage,
Database structure models, database management system, entity-relationship model,
normalization.
Data models and data structures: Introduction, GIS Data model, vector data structure,
raster data structure, attribute data, geo-database and metadata.
UNIT - III:
Spatial Data input and Editing: Data input methods – keyboard entry, digitization,
scanning,
conversion of existing data, remotely sensed data, errors in data input, Data accu
racy, Micro and Macro components of accuracy, sources of error in GIS.
Spatial Analysis: Introduction, topology, spatial analysis, vector data analysis,
Network
analysis, raster data analysis, Spatial data interpolation techniques.
UNIT - IV:
Awareness and digitization of GIS: Awareness, developing system requirements,
evaluation of alternative systems, decision making using GIS.
UNIT - V:
Applications of GIS: GIS based road network planning, Mineral mapping using GIS,
Shortest path detection using GIS, Hazard Zonation using remote sensing and
GIS, GIS for solving multi criteria problems, GIS for business applications.

Text Books:
1. Remote Sensing and GIS by Basudeb Bhatta, Oxford University Press, 2nd Edition,
2011.

2. Introduction to Geographic Information systems by Kang-tsung Chang,

McGraw-Hill Education (Indian Edition), 7th Edition, 2015.

3. Fundamentals of Geographic Information systems by Michael N. Demers,

4th Edition, Wiley Publishers, 2012.

Reference Books:
1. Remote Sensing and Image Interpretation by Thomas M. Lillesand and Ralph
W. Kiefer, Wiley Publishers, 7th Edition, 2015.

2. Geographic Information systems – An Introduction by Tor Bernhardsen,

Wiley India Publication, 3rd Edition, 2010.

3. Advanced Surveying: Total Station, GIS and Remote Sensing by Satheesh

Gopi, R. Sathi Kumar, N. Madhu, Pearson Education, 1st Edition, 2007.

4. Textbook of Remote Sensing and Geographical Information systems by M.Anji Reddy.

Course Outcomes: At the end of the course, the student will be able to:
1. Know the concepts of Remote Sensing, its interpreting Techniques and
concepts of Digital images.

2. know the concept of Geographical Information System (GIS), coordinate system.

3. Get the knowledge of spatial data input and editing.

4. Get awareness and digitization of GIS.
 5. Understand Implementation of GIS interface for practical usage.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L H H H M H H H L

CO-2 M M H L H H H M

CO-3 H H M M M H M H H L

CO-4 M H M M M H M H M

CO-5 H M M H H H
M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE722OE) SUSTAINABLE INFRASTRUCTURE DEVELOPMENT

(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3

Course Objectives: The objectives of this course are to

 Explain the process of sustainable Engineering design.

 Get knowledge on sustainable infrastructure framework.

 Understand the concepts of water conservation supply and integrated water

management.

 Explain about energy and greenhouse gases.

 Get knowledge on sustainable site planning.

UNIT – I:

Process of Sustainable Engineering Design: Key principle of sustainability; Integration of

architecture and engineering; Design drivers for sustainable infrastructure system;
implementation.

UNIT – II:

Sustainable infrastructure framework: Green building rating system; Sustainable Infrastructure

frameworks: Pillars of sustainability, scale-density framework, transect, built form-
ecology framework.

UNIT – III:

Water conservation and supply: water management plans; achieving water balance; analyzing
water resources; water supply strategies

Integrated water management: integrated storm water management; urban storm water
treatment strategies; constraints and barriers to implementation; gray water treatment
and reuse; integrating gray water into a water resources master plan; Black water
management approaches.

UNIT – IV:

Energy and greenhouse gases: reducing demand by design; Designing Sustainable power
supplies; Addressing climate change and reducing carbon footprint; Policy measures for
increasing energy security and efficiency; Design guidelines and Performance
standards.
 UNIT – V:

Sustainable site planning: Built systems, and Material flows: Sustainable site planning;
Green streets and transportation network; working with the land, material and waste
flows.

Text Books:

1. S. BrySarté (2010) Sustainable Infrastructure. John Wiles & Sons, Inc. ISBN 978-0-
470-912

2. Sustainable Infrastructure: Sustainable Buildings – Elisabeth Green, Tristram

Hope & Alan Yates.

3. Sustainable Development spiritual dimension – Krishnan Saigal

Reference Books:
1. Dredging for sustainable infrastructure – aarninkhof, Stefan laboyrie
polite/koningsveld, mark van – cedaiadc

2. Sustainable infrastructure: Breakthrough in Research & Practice.

Course Outcomes: At the end of the course, students will be able to

1. Understand in brief about process of sustainable engineering design.

2. Aquire knowledge on sustainable infrastructure framework.

3. Understand the concepts of water conservation supply and integrated water

management.

4. Design sustainable power supplies.

5. To plan sustainable sites.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H H M H M H

CO-2 H H M H H M L L M

CO-3 H
M M M M H H

CO-4 H H H H H H M H

CO-5 M M H H H M L M
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(CE723OE) SOLID WASTE MANAGEMENT
(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3

Course Objectives:
 To understand about solid waste.
 To get knowledge on Engineering systems for solid waste management.
 To impart the knowledge of Engineering Systems for Resource and Energy
Recovery.
 To learn about landfills.
 To understand about hazardous waste management.

UNIT – I:
Solid Waste: Definitions, Types of solid wastes, sources of solid wastes,
Characteristics, and perspectives; properties of solid wastes, Sampling of Solid
wastes, Elements of solid waste management - Integrated solid waste
management, Solid Waste Management Rules 2016.

UNIT – II:
Engineering Systems for Solid Waste Management: Solid waste generation; on-site handling,
storage and processing; collection of solid wastes; Stationary container system and
Hauled container systems – Route planning - transfer and transport; processing
techniques.

UNIT – III:
Engineering Systems for Resource and Energy Recovery: Processing techniques; materials
recovery systems; recovery of biological conversion products – Composting, pre
and post processing, types of composting, Critical parameters, Problems with
composing - recovery of thermal conversion products; Pyrolisis, Gasification, RDF
- recovery of energy from conversion products; materials and energy recovery
systems.

UNIT – IV:
Landfills: Evolution of landfills – Types and Construction of landfills – Design
considerations – Life of landfills- Landfill Problems – Lining of landfills –
Types of liners – Leachate pollution and control – Monitoring landfills –
Landfills reclamation.

UNIT – V:
Hazardous waste Management: Sources and characteristics, Effects on environment, Risk
assessment – Disposal of hazardous wastes – Secured landfills, incineration -
Monitoring – Biomedical waste disposal, E-waste management, Nuclear Wastes,
Industrial waste Management

Text Books:
1. Tchobanoglous G, Theisen H and Vigil SA ‘Integrated Solid Waste
Management, Engineering Principles and Management Issues’
McGraw-Hill, 1993.

2. Vesilind PA, Worrell W and Reinhart D, ‘Solid Waste Engineering’ Brooks/Cole

Thomson Learning Inc., 2002.

Reference Books:
1. Peavy, H.S, Rowe, D.R., and G. Tchobanoglous, ‘Environmental Engineering’,
McGraw Hill Inc., New York, 1985.

2. Qian X, Koerner RM and Gray DH, ‘Geotechnical Aspects of Landfill

Design and Construction’ Prentice Hall, 2002.

Course Outcomes: At the end of the course, the student will be able to:
1. Understand the types, sources and characteristics of solid waste.

2. Get knowledge on Engineering systems for solid waste management.

3. Understand the knowledge of Engineering Systems for Resource and

Energy Recovery. Gain knowledge on landfills.

4. To obtain information on hazardous waste management.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
M L H L H L
CO-2
L M M L L H
CO-3
L L H M M H M H
CO-4
M M M M L M
CO-5
M L H M H L
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(CE724OE) SMART CITIES
(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To understand fundamentals of smart city and infrastructure.
 To learn about planning and development of smart city infrastructure.
 To understand clearly about intelligent transport systems.
 To obtain knowledge on Management of water resources and related infrastructure.
 To impart knowledge on Infrastructure Management system & Policy for Smart city.
UNIT-I:
Fundamentals of smart city & Infrastructure: Introduction of Smart City, Concept of smart
city, Objective for smart cities, History of Smart city world and India. Need to develop
smart city, Challenges of managing infrastructure in India and world, various types of
Infrastructure systems, Infrastructures need assessment.
UNIT-II:
Planning and development of Smart city Infrastructure: Energy and ecology, solar energy for
smart city, Housing, sustainable green building, safety, security, disaster management,
economy, cyber security, Project management.
UNIT-III:
Intelligent transport systems: Smart vehicles and fuels, GIS, GPS, Navigation system, traffic
safety management, mobility services, E-ticketing
UNIT-IV:
Management of water resources and related infrastructure: Storage and conveyance system of water,
sustainable water and sanitation, sewerage system, flood management, conservation
system.
UNIT-V:
Infrastructure Management system & Policy for Smart city: Integrated infrastructure management
systems for smart city, Infrastructure management, system applications for existing smart
city. Worldwide policies for smart city Government of India - policy for smart city, Mission
statement & guidelines, Smart cities in India, Case studies of smart city .
Textbooks & Reference Books:
1. Smart City on Future Life - Scientific Planning and Construction by Xianyi Li

2. The Age of Intelligent Cities: Smart Environments and Innovation-for-all Strategies

(Regions and Cities) by Nicos Komninos

3. Smart Cities: Big Data, Civic Hackers, and the Quest for a New Utopia by Anthony
Townsend

4. Grig N.S., Infrastructure engineering and management, Wiley-Interseience, 1988

5. Hudson W.R., Haas R., Uddin W., Infrastructure Management, McGraw-Hill, 1997

6. Giffinger, Rudolf; Christian Fertner; Hans Kramar; Robert Kalasek; Nataša Pichler-
Milanovic; Evert Meijers (2007). "Smart cities – Ranking of European medium-sized
cities". Smart Cities. Vienna: Centre of Regional Science

7. Mission statement &guidelines on Smart City Scheme". Government of India - Ministry

of Urban Development http://smartcities.gov.in/upload/uploadfiles/files/Smart City
Guidelines(1).pdf

Course Outcomes: At the end of the course, the student will be able to
1. Understand fundamentals of smart city and infrastructure.

2. Obtain knowledge on planning and development of smart city infrastructure.

3. Understand clearly about intelligent transport systems.

4. Get knowledge on Management of water resources and related infrastructure ..

5. Get knowledge on Infrastructure Management system & Policy for Smart city.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H H H M M M H H L

CO-2 M H M H M L H M M L M H

CO-3 M L H M M M M M M L M
H
CO-4 H L L M L M L L L H L

CO-5 H M M M M H L H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE721OE) UTILIZATION OF ELECTRIC ENERGY

(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Pre-requisites: Electrical Machines-I and Electrical Machines-II

Course Objectives:

Objectives of this course are

 To understand the methods of electric heating.

 To understand the methods of electric welding.

 To understand the fundamentals of illumination and good lighting practices

 To understand the concepts of electric traction system.

 To understand the concepts of electric drives and their application to electrical traction
systems.

UNIT-I:
Electrical Heating: Advantages and methods of electric heating, resistance heating, induction
heating and dielectric heating.
UNIT-II:
Electric Welding: Electric welding equipment, resistance welding and arc welding,
comparison between AC and DC welding. Electrolysis process: principle of electrolysis,
electroplating, metal extraction and metal processing, electromagnetic stirs.
UNIT-III:
Illumination: Terminology, Laws of illumination, coefficient of Utilization and depreciation,
Polar curves, Photometry, integrating sphere, sources of light, fluorescent lamps, compact
fluorescent lamps, LED lamps discharge lamps, mercury vapor lamps, sodium vapor lamps
and neon lamps, comparison between tungsten filament lamps and fluorescent tubes. Basic
principles of light control, Types and design of lighting scheme, lighting calculations,
factory lighting, streetlighting and flood lighting.
UNIT-IV:
Electric Traction: Systems of electric traction and track electrification- DC system, single
phase and 3-
phase low frequency and high frequency system, composite system, kando system,
comparison between AC and DC systems, problems of single-phase traction with current
unbalance and voltage unbalance. Mechanics of traction movement, speed – time curves for
different services, trapezoidal and quadrilateral speed – time curves, tractive effort, power,
specific energy consumption, effect of varying acceleration and braking, retardation,
adhesive weight and braking retardation, coefficient of adhesion.
UNIT-V:
Systems of Train Lighting: special requirements of train lighting, methods of obtaining
unidirectional polarity constant output- single battery system, Double battery parallel block
system, coach wiring, lighting by making use of 25KV AC supply.

Text books:
1. H. Partab: Modern Electric Traction, Dhanpat Rai & Co, 2007.

2. E. Openshaw Taylor: Utilisation of Electric Energy, Orient Longman, 2010.

Reference books:
1. H. Partab: Art & Science of Utilization of Electric Energy, Dhanpat Rai & Sons, 1998.

2. N.V. Suryanarayana: Utilization of Electrical power including Electric drives and

Electric Traction, New Age Publishers, 1997.

Course Outcomes:
At the end of the course the student will be able to:
1. Understand basic principles of electric heating.

2. Understand basic principles of electric welding.

3. Determine the lighting requirements for flood lighting, household and industrial needs.

4. Understand the concepts of electric traction system and evaluate speed time curves for
traction.

5. Analyze the concepts of electric drives and their application to electrical traction systems.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M
M M L L M H H L
CO-2
L L H M L M H M
CO-3 M
H H L M L H M L H
CO-4 M M
M L M M H L H L M
CO-5
H M L M H M M L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(EE722OE) ENERGY STORAGE SYSTEMS
(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3

Course Objectives: To prepare the

students to
 To introduce generalized storage
techniques.

 To analyze the different features of storage systems.

 To know the management of electrical energy storage technologies.

 To know the applications of energy storage technologies.

 To know about electrical energy storage market potential by different forecasting

methods

UNIT- I:
The Roles Of Electrical Energy Storage Technologies In Electricity Use: Characteristics of electricity,
Electricity and the roles of EES, High generation cost during peak-demand periods, Need
for continuous and flexible supply, Long distance between generation and consumption,
Congestion in power grids, Transmission by cable, Emerging needs for EES, More
renewable energy, less fossil fuel, Smart Grid uses, The roles of electrical energy storage
technologies, The roles from the viewpoint of a utility, The roles from the viewpoint of
consumers, The roles from the viewpoint of generators of renewable energy.

UNIT- II:
Types And Features Of Energy Storage Systems: Classification of EES systems, Mechanical
storage systems, Pumped hydro storage (PHS), Compressed air energy storage (CAES),
Flywheel energy storage (FES), Electrochemical storage systems, Secondary batteries,
Lead-Acid Batteries, Lithium-Ion Batteries, Flow batteries, Other Batteries in Development,
Chemical energy storage, Hydrogen (H2), Synthetic natural gas (SNG), Electrical storage
systems, Double-layer capacitors (DLC), Superconducting magnetic energy storage
(SMES),Thermal storage systems, Standards for EES, Technical comparison of EES
technologies.
UNIT- III:
Applications Of EES: Present status of applications, Utility use (conventional power
generation, grid
operation & service), Consumer use (uninterruptable power supply for large consumers),
EES installed capacity worldwide, new trends in applications, Renewable energy
generation, Smart Grid, Smart Micro grid, Smart House, Electric vehicles,

UNIT- IV:
Management And Control Hierarchy Of EES: Internal configuration of battery storage systems,
External connection of EES systems, Aggregating EES systems and distributed generation
(Virtual Power Plant), “Battery SCADA” – aggregation of many dispersed batteries.
Demand For Energy Storage: Growth in Variable Energy Resources, Relationship between
balancing services and variable energy resources, Energy Storage Alternatives, Variable
Generator Control, Demand Management, Market Mechanisms, and Longer-Term Outlook.
Valuation Techniques: Overview, Energy Storage Operational Optimization, Market Price
Method, Power System Dispatch Model Method, Ancillary Service Representation,
Energy Storage Representation, Survey of Valuation Results.
UNIT-V:
Forecast Of EES Market Potential By 2030: EES market potential for overall applications, EES
market estimation by Sandia National Laboratory (SNL), EES market estimation by the
Boston Consulting Group (BCG), EES market estimation for Li-ion batteries by the
Panasonic Group, EES market potential estimation for broad introduction of renewable
energies, EES market potential estimation for Germany by Fraunhofer, Storage of large
amounts of energy in gas grids, EES market potential estimation for Europe by Siemens,
EES market potential estimation by the IEA, Vehicle to grid concept, EES market potential
in the future.

Text books:
1. Power System Energy Storage Technologies, 1st Edition by Paul Breeze, Academic Press.

2. Energy Storage: Systems and Components, by Alfred Rufer, CRC Press, 2017

Reference books:
1. Energy Storage Fundamentals, Materials and Applications, by Huggins and Robert,
Springer.

2. www.ecofys.com/com/publications

Course Outcomes:
At the end of this course, students will be able to:
1. Understand the role of electrical energy storage technologies in electricity usage
2. Know the behavior and features of energy storage system
3. Know the management of electrical energy storage technologies.

4. Know the different applications of energy storage technologies.

5. Understand the hierarchy, demand for energy storage and valuation techniques.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H M
L H H H M H H L M
CO-2 M M
M M M L M L M M H
CO-3 L M
H L M M L M M H
CO-4 H M
M H M M H L H L M
CO-5 M M
M H L H H M M L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(ME721OE) QUANTITATIVE ANALYSIS FOR BUSINESS

DECISIONS
(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To impart knowledge of basic tools of Operations research in solving the
management problems using mathematical approaches for decision making.
 To teach the methods of solving Linear Programming Problems.
 To impart knowledge on assignment model and transportation problem.
 To impart knowledge on the significance of decision tree and Network analysis.
 To highlight the importance of Queuing Theory.
UNIT – I:
Introduction to Operations Research: Nature and Scope of Operations Research:
Origins of OR, Applications of OR in different Managerial Areas, Problem Solving and
Decision - making, Quantitative and Qualitative Analysis. Defining a Model, Types of
Models, Process for Developing an Operations Research Model, Practices,
Opportunities and Shortcomings of using an OR Model.
UNIT – II:
Linear Programming Method: Structure of LPP, Assumptions of LPP, Application Areas
of LPP, Guidelines for Formulation of LPP, Formulation of LPP for Different Areas ,
Solving of LPP by Graphical Method: Extreme Point Method, Simplex Method,
Converting Primal LPP to Dual LPP,Limitations of LPP.
UNIT – III:
Assignment Model: Algorithm for Solving Assignment Model, Hungarians Method for
Solving Assignment Problem, Variations of Assignment Problem: Multiple Optimal
Solutions, Maximization Case in Assignment Problem, Unbalanced Assignment
Problem, Travelling Salesman Problem, Simplex Method for Solving Assignment
Problem.
Transportation Problem: Mathematical Model of Transportation Problem, Methods for
Finding Initial Feasible Solution: Northwest Corner Method, Least Cost Method, Vogels
Approximation Method, Test of Optimality by Modi Method, Unbalanced Supply and
Demand, Degeneracy and
 its Resolution
UNIT – IV:
Decision Theory: Introduction, Ingredients of Decision Problems. Decision-making under
Uncertainty, Cost of Uncertainty Under Risk, Under Perfect Information, Decision
Tree, Construction of Decision Tree.
Network Analysis: Network Diagram, PERT, CPM, Critical Path Determination,
Project Completion Time, Project Crashing.
UNIT – V: Queuing Theory: Queuing Structure and Basic Component of a Queuing Model,
Distributions in Queuing Model, Different Queuing Models with FCFS, Queue
Discipline, Single and Multiple Service Station with Finite and Infinite Population.
Game Theory, Suddle Point, Value of the Game.

Text books:
1. Mik Wisniewski, Dr Farhad Shafti, Quantitative Analysis for Decision Makers,
Pearson, 7e, 2019.

2. Miguel Ángel Canela, Inés Alegre, Alberto Ibarra, Quantitative

Methods for Management: A Practical Approach, Springer International
Publishing, 1e, 2019.

Reference books:
1. James E. Sallis, Geir Gripsrud, Ulf Henning Olsson, Ragnhild Silkoset,
Research Methods and Data Analysis for Business Decisions: A Primer
Using SPSS, Springer International Publishing, 1e, 2021.

2. R. Pannerselvam, Operations Research, Prentice Hall International, 3e, 2015.

3. N.V.S. Raju, Operations Research: Theory and Practice, CRC Press, 2020.

4. R. Pannerselvam, Operations Research, Prentice Hall International, 3e, 2015

5. J.K. Sharma, Operations Research: Theory Dand applications, MacMillian, 5e, 2013.

Course Outcomes: At the end of the course, students will be able to:
1. Understand the origin and application of operations research.

2. Learn about the Formulation of Linear Programming Problem for different areas.

3. Appreciate the significance of variations of assignment problem, methods for

finding Initial feasible solution.
4. Learn the aspects of Decision Theory and Network Analysis.

5. Gain insights of the theoretical principles and practical applications of different queuing
models.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1
L M L M
CO-2
L L H
CO-3
L L L
CO-4
L H H
CO-5
L H L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(ME722OE) INDUSTRIAL ENGINEERING & MANAGEMENT

(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course objectives: The main objectives of this course are the following to Learn:
 Practice the management theories proposed by Taylor, Fayol etc
 Philosophies of various management gurus & characteristics of various organization
structures
 Various Industrial Engineering practices
 Human resource management practices
 Network analysis through PERT and CPM techniques
UNIT - I:

Management and Organization – Functions of Management - Contributions of Taylor,

Fayol, Douglas Mc-Gregor, Mayo Hertzberg and Maslow. – Systems Approach to
Management - Organizational Structures: Basic concepts related to Organization -
Departmentation and Decentralization, Types of mechanistic and organic structures of
organization and their merits, demerits and suitability.

UNIT- II:

Operations Management-I: Plant location, definition, factors affecting the plant location,
comparison of rural and urban sites-methods for selection of plant- Matrix approach.
Types of plant layout – various data analyzing forms-travel chart - Work study: Method
study and Work measurement. Inventory – functions, types, Determination of
Economic Order Quantity (EOQ), ABC and VED analysis. Inventory Control Systems-
Continuous review system-periodical review system. Stores Management and Stores
Records. Purchase management, duties of purchase of manager, JIT System.

UNIT - III:

Operations Management-II: Inspection and quality control, types of inspections -

Statistical Quality Control-techniques- Charts for variables and attributes. Acceptance
sampling plan- single sampling and double sampling plans-OC curves. Introduction to
TQM-Quality Circles, ISO 9000 series procedures. Functions of Marketing, Marketing
vs Selling, Marketing mix, Product Life Cycle.
UNIT - IV:

Human Resources Management (HRM): Concepts of HRM, HRD and Personnel

Management and Industrial Relations (PMIR), HRM vs PMIR, Basic functions of HR
Manager: Manpower planning, Recruitment, Selection, Training and Development,
Placement, Wage and Salary.
Administration, Promotion, Transfer, Separation, Performance Appraisal, Grievance
Handling and Welfare Administration, Job Evaluation and Merit Rating – Capability
Maturity Model (CMM) Levels – Performance Management System.
UNIT- V:

PERT/CPM: Project management, network modelling-probabilistic model, various types

of activity time’s estimation-programme evaluation review techniques- Critical Path-
probability of completing theproject, Critical Path Method (CPM) - Project crashing.
Simple problems.

Text books:
1. Aryasri, Management Science, McGraw hill, 2012

2. Kumar, Rao and Chhalill: Introduction to Management Science, Cengage 2012.

Reference books:
1. Stoner, Freeman, Gilbert, Management, Pearson Education, New Delhi, 2012.

2. Amrine, Manufacturing Organization and Management, Pearson, 2012.

3. Chase, Jacobs, Aquilano, Operations Management, McGraw Hill, 2012.

4. Panner Selvam, Production and Operations Management, PHI, 2012.

5. Nadha Muni Reddy & Vijaya Kumar Reddy, Reliability Engineering & Quality
Engineering, Galgotia, 2012.

6. Ralph M Barnes, Motion and Time Studies, John Wiley and Sons, 2012.

7. L. S. Srinath, PERT / CPM, Affiliate East-West Press, New Delhi, 2012.

8. Gary Dessler, Human Resource Management, Pearson Education Asia, 2012.

9. Phillip Kotler, Marketing Management, Pearson, 2012.

10. S. K. Basu, K. C. Sahu, B. Rajiv: Industrial Organization and Management, PHI,

2012.

11. Dipak Kumar Bhattacharyya: Industrial Management, Vikas publishing house 2013.

Course Outcomes:

1. At the end of course, students will be able to

 2. Consider various factors and identify plant location for given industry.

3. Determine EOQ, classify items and implement P-system and Q-system

4. Conduct work study (method study+ Work measurement: a) Time study & Work
sampling))

5. Practice HRM principles.

6. Analyze the networks by using PERT & CPM

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1
M H
CO-2
M H
CO-3
L L

CO-4
L
CO-5
H L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC721OE) ELECTRONIC SENSORS

(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To teach the characterization of sensors.

 Acquire adequate knowledge of different transducers

 To provide knowledge on working of Electromechanical, Thermal,

Magnetic and radiationsensors

 To provide basic Understanding of Electro analytic and smart sensors

 Provide different applications of sensors.

UNIT – I:
Sensors / Transducers: Principles, Classification, Parameters, Characteristics,
Environmental Parameters (EP), Characterization Electromechanical Sensors:
Introduction, Resistive Potentiometer, Strain Gauge, Resistance Strain Gauge,
Semiconductor Strain Gauges -Inductive Sensors: Sensitivity and Linearity of
the Sensor – Types-Capacitive Sensors: Electrostatic Transducer, Force/Stress
Sensors Using Quartz Resonators, Ultrasonic Sensors
UNIT – II:
Thermal Sensors: Introduction, Gas thermometric Sensors, Thermal Expansion Type
Thermometric Sensors, Acoustic Temperature Sensor, Dielectric Constant and
Refractive Index thermo sensors, H el ium Low Temperature Thermometer,
N uclear Thermometer, M a g n e t i c Thermometer, Resistance Change Type
Thermometric Sensors, Thermo emf Sensors, Junction Semiconductor Types,
Thermal Radiation Sensors, Quartz Crystal Thermoelectric Sensors, NQR
Thermometry, Spectroscopic Thermometry, Noise Thermometry, Heat Flux
Sensors
UNIT- III:
Magnetic sensors: Introduction, Sensors and the Principles Behind, Magneto-
resistive Sensors, Anisotropic Magneto resistive Sensing, Semiconductor
Magneto resistors, Hall Effect and Sensors, Inductance and Eddy Current
Sensors, Angular/Rotary Movement
Transducers, Synchros.
UNIT – IV:
Radiation Sensors: Introduction, Basic Characteristics, Types of Photo resistors/
Photo detectors, Xray and Nuclear Radiation Sensors, Fibre Optic Sensors
Electro analytical Sensors: The Electrochemical Cell, The Cell Potential -
Standard Hydrogen Electrode (SHE), Liquid Junction and Other Potentials,
Polarization, Concentration Polarization, Reference Electrodes, Sensor
Electrodes, Electro ceramics in Gas Media.
UNIT - V
Smart Sensors: Introduction, Primary Sensors, Excitation, Amplification, Filters,
Converters, Compensation, Information Coding/Processing - Data
Communication, Standards for Smart Sensor Interface, the Automation Sensors –
Applications: Introduction, On-board Automobile Sensors (Automotive Sensors),
Home Appliance Sensors, Aerospace Sensors, Sensors for Manufacturing –
Sensors for environmental Monitoring

Text books:
1. “Sensors and Transducers - D. Patranabis” –PHI Learning Private Limited., 2003.

2. Introduction to sensors- John veteline, Aravind Raghu, CRC press, 2011

Reference books:
1. Sensors and Actuators, D. Patranabis, 2nd Ed., PHI, 2013.

2. Make sensors: Teravainen, kemo, karvinen and villeyvaltokari, 1st

edition, maker media, 2014.

3. Sensor’s handbook- Sabri Soloman, 2nd Ed. TMH, 2009

Course Outcomes:
Upon completing this course, the student will be able to

1. Understand the working principle, characteristics and applications of various

resistive, inductive and capacitive sensors.

2. Discuss the operational principles, procedures of Thermal sensors

3. Explore the working of magnetic sensors.

4. Explain the working principle, operation of radiation sensors, electroanalytical sensors.

5. Analyze the various components & stages of smart sensors and learn
applications of modern sensors.
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1
H M L L
CO-2
H M L L
CO-3
H M L L
CO-4
H M L L
CO-5
H M L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC722OE) ELECTRONICS FOR HEALTH CARE

(Open Elective -II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To provide knowledge on Health care data

 To demonstrate need of Electronics in Health Care.

 To give basic knowledge on electronic equipment’s used in medical field.

 To provide the knowledge on telemetry Systems and telemedicine.

 To give the knowledge on therapeutic devices.

UNIT - I:
Health care data, Information and Knowledge: Definitions and Concepts, Converting Data to
Information to Knowledge, Clinical Data Warehouses, what makes Health Informatics
Difficult, Why Health IT fails Sometimes, Terminology of Analytics, Challenges to Data
Analytics, Research and application of analytics, Role of Informatics in analytics.
UNIT - II:
Electronic Health Records: Introduction, Need for Electronic Health Records, Institute of
Medicine’s Vision for EHRs, Electronic Health Record Key Component, Electronic
Prescribing, Electronic Health Record Adoption, Electronic Health Record Adoption and
Meaningful use Challenges, Electronic Health Record Examples, Logical Steps to
Selecting and Implementing an EHR
UNIT- III:
Patient Monitoring Systems: System Concepts, Cardiac Monitor, Bedside Patient Monitoring
Systems, Central Monitors, Measurement of Heart Rate, Measurement of Pulse Rate, Blood
Pressure Measurement, Measurement of Temperature, Measurement of Respiration Rate,
Catheterization Laboratory Instrumentation.
UNIT- IV:
Biomedical Telemetry and Telemedicine : Wireless Telemetry, Single Channel Telemetry
Systems, Multi-channel Wireless Telemetry Systems, Multi-patient Telemetry,
Implantable Telemetry Systems, Transmission of Analog Physiological Signals, Over
Telephone, Telemedicine.
UNIT- V:

Therapeutic devices: Need for Cardiac Pacemaker, Implantable Pacemakers, DC

Defibrillator, Electronics in the Anaesthetic Machine.

Text books:
1. Robret E. Hoyt MD FACP “Health Informatics” sixth edition 2007.

2. R. S. Kandpur “Biomedical Instrumentation Technology and Applications” second

edition Tata McGraw-Hill.

Reference books:
1. Edward H. Shortlliffe, James J.Cimino “Biomedical Informatics, Computer
applications in Health care and Biomedicine” third edition Springer.

2. G.V.R.K. Acharyulu, Bhimaraya Metri, L. Kalyan Viswanath REDDY “Health

care and Hospital Management Contemporary Issues and Strategies”.

Course Outcomes: Upon completion of this course, the students will be able to

1. Know about health care data and its conversion to information and to knowledge.

2. Acquire knowledge on (Electronic Health Records) EHRs and their Implementation.

3. Understand the working of electronic devices used for the patient monitoring.

4. Know the concepts of Telemedicine used inside the human body.

5. Understand the working of therapeutic devices and pacemaker.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
M M L L L M L
CO-2
L L L L L L M
CO-3
L L L L L M L
CO-4
L L L L L L M
CO-5
L L L L L L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC723OE) TELECOMMUNICATIONS FOR SOCIETY

(Open Elective-II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To introduce Telecommunications and its vast development.
 To give knowledge on voice, Data and image transmission.
 To treat with different types of noise/distortions that occur during transmissions.
 To make topics like TV transmission by satellite and broadcasting
understandable.
 Improving signal reception and quality.
UNIT - I:

Introductory Topics in Telecommunications: End-Users, Nodes, and Connectivity’s,

Telephone Numbering and Routing, Use of Tandem Switches in a Local Area
Connectivity, Introduction to the Busy Hour and Grade of Service, Simplex,
Half-Duplex, and Full Duplex, One-Way and Two-Way Circuits, Network
Topologies, Variations in Traffic Flow.

UNIT - II:

Quality of Service and Telecommunication Impairments: Objective, Quality of Service:

Voice, Data, and Image, Signal-to-Noise Ratio, Voice Transmission, Data Circuits,
Video (Television), The Three Basic Impairments and How They Affect the End-
User, Amplitude Distortion, Phase Distortion, Noise Level, Typical Levels, Echo
and Singing.

UNIT - III:

Transmission Aspects of Voice Telephony: Definition of the Voice Channel,

Operation of the Telephone Subset, Subscriber Loop Design, Design of Local Area
Wire-Pair Trunks (Junctions), VF Repeaters (Amplifiers).

UNIT - IV:

Television Transmission: Background and Objectives, An Appreciation of Video

Transmission, Critical Video Parameters, Video Transmission Standards (Criteria
for Broadcasters), Methods of Program Channel Transmission, TV Transmission
by Satellite Relay, Digital Television, Conference Television, Brief Overview of
Frame Transport for Video Conferencing.

UNIT - V:
278
Community Antenna Television (Cable Television): Objective and Scope, The
Evolution of CATV, System Impairments and Performance Measures, Hybrid
Fiber-Coax (HFC) Systems.

Text books:
1. Roger L. Freeman “Fundamentals of Telecommunications” 2nd
Edition, John Wiley & Sons Publications 2005.

2. Annabel Z. Dodd “The Essential Guide to Telecommunications” 5th

Edition, Prentice Hall 2012.

Reference books:
1. JYRKI T. J. PENTTINEN “The Telecommunications Handbook” John
Wiley & Sons Publications 2015.

2. Prof. Dr. Muhammad EL-SABA “Telecommunications systems and

data networks” 3rd Edition 2015.

Course Outcomes: Upon completion of this course, the students will be able to
1. Understand the concepts of simplex, half duplex, and full duplex of
one-way and two-waycircuits.

2. Get knowledge on subscriber loop design and VF repeaters of voice telephony.

3. Get brief overview of video transmission and its broadcasting standards

in television transmission.

4. Know different of modes of television transmission.

5. Enhancing viewing experience for subscribers.

CO-PO-PSO Mapping
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
L L L L L L
CO-2
L L L L L L
CO-3
L L L L L L
CO-4
L L L L L
CO-5
L L L L L L
H-HIGH M-MODERATE L-LOW

279
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS721OE) OPERATING SYSTEMS

(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:
 A course on “Computer Programming and Data Structures”.
 A course on “Computer Organization and Architecture”.

Course Objectives:
The objectives of this course are to provide:
 Understand operating system concepts.
 Analyze process scheduling and synchronization concepts.
 Identify deadlock mechanisms.
 Understand memory management approaches.
 Introduce basic Unix commands, inter-process communication and I/O in Unix
effectively

UNIT-I:
Operating System: Introduction, Structures - Simple Batch, Multiprogrammed, Time-
shared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems, System
components, Operating System services, System Calls
Process: Process concepts and scheduling, Operations on processes, Cooperating
Processes, Threads

UNIT-II:
CPU Scheduling:Scheduling Criteria, Scheduling Algorithms, Multiple -Processor
Scheduling. System call interface for process management-fork, exit, wait, waitpid, exec
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and
Recovery from Deadlock

UNIT-III:
Process Management and Synchronization: The Critical Section Problem, Synchronization
Hardware, Semaphores, and Classical Problems of Synchronization, Critical Regions,
Monitors Interprocess Communication Mechanisms: IPC between processes on a single
computer system, IPC between processes on different systems, using pipes, FIFOs,
message queues, shared memory.

UNIT-IV:
Memory Management and Virtual Memory:Logical versus Physical Address Space, Swapping,
280
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging, Demand
Paging, Page Replacement, Page Replacement Algorithms.

281
UNIT-V:
File System Interface and Operations:Access methods, Directory Structure, Protection, File
System Structure, Allocation methods, Free-space Management. Usage of open, create,
read, write, close, lseek, stat, ioctl system calls.

Text Books:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne
7th Edition, John Wiley.

2. Advanced programming in the UNIX environment, W.R. Stevens, Pearson

education.

Reference Books:
1. Operating Systems- Internals and Design Principles, William Stallings, Fifth
Edition–2005, Pearson Education/PHI

2. Operating System A Design Approach- Crowley, TMH.

3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition, Pearson/PHI

4. UNIX programming environment, Kernighan and Pike, PHI/ Pearson Education

5. UNIX Internals -The New Frontiers, U. Vahalia, Pearson Education.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Will be able to control access to a computer and the files that may be shared

2. Demonstrate the knowledge of the components of computers and their

respective roles in computing.

3. Ability to recognize and resolve user problems with standard operating

environments.

4. Gain practical knowledge of how programminglanguages, operating systems,

and architectures interact and how to use each effectively.

5. Identify storage management and protection

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
H L M L M M H

282
CO-2
M M M L L
CO-3
H L L H
CO-4
H M L M L L M H
CO-5
M M L M

H-HIGH M-MODERATE L-LOW

283
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CS722OE) COMPUTER NETWORKS

(Open Elective – II)

IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C

3- 0 -0 -3
Prerequisites:
 A course on “Programming for problem solving”
 A course on “Data Structures”

Course Objectives:
The objectives of this course are to provide:
 Compare OSI & TCP/IP models.
 Understand error detection, correction codes and farming methods.
 Explain Multiple Access Protocols and the concepts of noise and noiseless protocols.
 Discuss the concepts of LANs and WLANs and different routing protocols.
 Outline the concepts of logical addressing and Outline Application Layer

UNIT-I:
Network hardware, Network software, OSI, TCP/IP Reference models, Example Networks:
ARPANET, Internet.
Physical Layer: Guided Transmission media: twisted pairs, coaxial cable, fiber optics,
Wireless
Transmission.
Data link layer: Design issues, framing, Error detection and correction.

UNIT-II:
Elementary data link protocols: simplex protocol, A simplex stop and wait protocol for an error-
free channel, A simplex stop and wait protocol for noisy channel. Sliding Window protocols:
A one-bit sliding window protocol, A protocol using Go-Back-N, A protocol using Selective
Repeat.
Medium Access sublayer: The channel allocation problem, Multiple access protocols: ALOHA,
Carrier sense multiple access protocols, collision free protocols. Wireless LANs.

UNIT-III:
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding,
Hierarchical routing, Broadcast, Multicast, distance vector routing, Congestion Control
Algorithms, Quality of Service, Internetworking, The Network layer in the internet-IPV4,
IPV6.
UNIT-IV:
Transport Layer: Transport Services, Elements of Transport protocols, Connection
management, TCP and UDP protocols.

UNIT-V:
Application Layer –Domain name system, SNMP, Electronic Mail; the World WEB, HTTP,
Streaming audio and video.

Text Book:

1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5th

Edition. Pearson Education/PHI

Reference Books:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson
Education

2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Analyze TCP/IP and OSI models and various protocols and various error handling
mechanisms.

2. Use of various devices in connecting different types of LANs.

3. Analyze different routing protocols and IP Addresses.

4. Discuss the various services offered by transport layer.

5. Describes the working of various networked applications such as DNS, Mail, WWW and
HTTP.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
H M M H
CO-2
M H H M M M M M H
CO-3
H M H M H H M M H
CO-4
L M H M H M H
CO-5
L M M M H M H
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(IT721OE) FULL STACK DEVELOPMENT

(Open Elective – II)

IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C

3- 0 -0 -3
Prerequisites:

 Object Oriented Programming

 Web Technologies

Course Objectives:
The objectives of this course are to provide:

 Students will become familiar to implement fast, efficient, interactive and

scalable web applications using run time environment provided by the full stack
components.

 To create scalable web applications by writing and testing code, building

databases and servers and building APIs and other services.

 Using MongoDB developing software applications that handle data of all sorts
in a scalable way.

 Introduces angular framework for building web applications

 Introduces React, developers to create fast user interfaces for websites and
applications alike easily

UNIT-I

Introduction to Full Stack Development:

Understanding the Basic Web Development Framework- User, Browser, Webserver,

Backend Services, Full Stack Components - Node.js, MongoDB, Express, React,
Angular. Java Script Fundamentals, NodeJS- Understanding Node.js, Installing Node.js,
Working with Node Packages, creating a Node.js Application, Understanding the
Node.js Event Model, Adding Work to the Event Queue, Implementing Callbacks

UNIT-II

Working with JSON, Using the Buffer Module to Buffer Data, Using the Stream Module to
Stream
 Data, Accessing the File System from Node.js-Opening, Closing, Writing, Reading Files
and other File System Tasks. Implementing HTTP Services in Node.js-Processing URLs,
Processing Query Strings and Form Parameters, Understanding Request, Response,
and Server Objects, Implementing HTTP Clients and Servers in Node.js, Implementing
HTTPS Servers and Clients. Using Additional Node.js Modules-Using the os Module,
Using the util Module, Using the dns Module, Using the crypto module.

UNIT-III

MongoDB:
Need of No SQL, Understanding Mongo DB, Mongo DB Data Types, Planning Your Data
Model
,Building the MongoDB Environment, Administering User Accounts, Configuring
Access Control, Administering Databases, Managing Collections, Adding the Mongo DB
Driver to Node.js, Connecting to Mongo DB from Node.js, Understanding the Objects
Used in the MongoDB Node.js Driver, Accessing and Manipulating Databases,
Accessing and Manipulating Collections

UNIT-IV

Express and Angular:

Getting Started with Express, Configuring Routes, Using Requests Objects, Using
Response Objects. Angular: importance of Angular, Understanding Angular, creating a
Basic Angular Application, Angular Components, Expressions, Data Binding, Built-in
Directives, Custom Directives, Implementing Angular Services in Web Applications.
UNIT-V
React: Need of React, Simple React Structure, The Virtual DOM, React Components,
Introducing React Components, Creating Components in React, Data and Data Flow in
React, Rendering and Life Cycle Methods in React, Working with forms in React,
integrating third party libraries, Routing in React.

Text Books:

1. Brad Dayley, Brendan Dayley, Caleb Dayley.,Node.js, MongoDB and Angular

Web Development,2ndEdition, Addison-Wesley,2019.

2. Mark Tielens Thomas, Reactin Action,1st Edition, Manning Publications.

Reference Books:
1. Vasan Subramanian, Pro MERN Stack, FullStack WebApp Development
with Mongo, Express, React, and Node,2ndEdition, Apress,2019.
 2. Chris Northwood, The FullStack Developer: Your Essential Guide to the
Everyday Skills Expected of a Modern FullStack Web
Developer’,1stedition,Apress,2018

3. Kirupa Chinna thambi, Learning React:AHands-On Guide to Building Web

Applications Using React and Redux,2ndedition, Addison-WesleyProfessional,2018.

Course Outcomes:
1. Understand Full stack components for developing web application.

2. Apply packages of NodeJS to work with Data, Files, Http Requests and Responses.

3. Use MongoDB database for storing and processinghuge data and connects
with NodeJS application.

4. Design faster and effective single page applications using Express and Angular.

5. Create interactive user interfaces with react component

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H

CO-2 M H H M M M H

CO-3 M M H M H M M H

CO-4 L M H M H M H

CO-5 L M M M H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(IT722OE) SCRIPTING LANGUAGES

(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:
 A course on “Computer Programming and Data Structures”.

 A course on “Object Oriented Programming Concepts”.

Course Objectives:
The objectives of this course are to provide:

 This course introduces the script programming paradigm

 Introduces scripting languages such as Perl, Ruby and TCL.

 To demonstrate how to work with Perl to create production systems.

 Learning TCL

 Learning Tk-Visual Tool Kits

UNIT-I

Introduction: Ruby, Rails, The structure and Execution of Ruby Programs, Package
Management with RUBYGEMS, Ruby and web: Writing CGI scripts, Choice of Webservers,
SOAP and web services.

Ruby TK – Simple TK Application, widgets, Binding events, Canvas, scrolling.

Unit-II

Extending Ruby: Ruby Objects in C, the Jukebox extension, Memory allocation, Ruby Type

System, Embedding Ruby to Other Languages, Embedding a Ruby Interpreter

UNIT-III

Introduction to PERL and Scripting Scripts and Programs, Origin of Scripting, Scripting
Today, Characteristics of Scripting Languages,Uses for Scripting Languages, Web
Scripting, and the universe of
Scripting Languages. PERL-Names and Values, Variables, Scalar Expressions, Control
Structures, arrays, list, hashes, strings.

UNIT-IV

Advanced perl Finer points of looping, pack and unpack, filesystem, eval, data structures,
packages, modules, objects,interfacing to the operating system, Creating Internet ware
applications, Dirty Hands Internet Programming, security Issues.Programming, security
Issues.

UNIT-V

TCL Structure, syntax, Variables and Data in TCL, Control Flow, Data Structures,
input/output,procedures, strings, patterns, files, Advance TCL- eval, source, exec and up
level commands, Name spaces, trapping errors, event driven programs, making
applications internet aware, Nuts and Bolts Internet Programming, Security Issues, C
Interface.

Text Books:

1. The World of Scripting Languages, David Barron, Wiley Publications.

2. Ruby Programming language by David Flanagan and Yukihiro Matsumoto O’Reilly

3. “Programming Ruby” The Pramatic Progammers guide by Dabve Thomas Second edition

Reference Books:

1. Open Source Web Development with LAMP using Linux Apache, MySQL, Perl and PHP,
J.Lee and
B. Ware (Addison Wesley) Pearson Education.

2. Perl by Example, E. Quigley, Pearson Education.

3. Programming Perl, Larry Wall, T. Christiansen and J. Orwant, O’Reilly, SPD.

4. Tcl and the Tk Tool kit, Ousterhout, Pearson Education.

5. Perl Power, J. P. Flynt, Cengage Learning.

Course Outcomes:

1. Understand how to comprehend the differences between Ruby, Ruby on Rails and
RubyTk and Designing CGI scripts using Ruby and Web.
2. Able to Understand and Extend the Ruby and Embedding a Ruby Interpreter.
 3. Ability to create and run scripts using PERL and able to translate from Perl/Tk to Ruby.

4. Ability to create Internet ware applications by Advanced Perl.

5. Acquire programming skills in TCL, Tk and Perl-Tk.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L M H M M H M

CO-2 L H H M M H M

CO-3 L H H M H M H

CO-4 L H H M H M H

CO-5 L H M M H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(AM721OE)INTRODUCTION TO NATURAL LANGUAGE PROCESSING
(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
Prerequisites: A course on Data structures and compiler design
Course Objectives:
 Provide basic understanding on natural language models.
 Provide the perception on language parsing techniques.
 Analyze multilingual challenges in parsing.
 Introduce the fundamentals of semantic parsing.
 Provide the cognizance on advanced semantic parsing.
UNIT - I
Finding the Structure of Words: Words and Their Components, Issues and Challenges,
Morphological Models
Finding the Structure of Documents: Introduction, Methods, Complexity of the Approaches,
Performances of the Approaches, Features
UNIT - II
Syntax I: Parsing Natural Language, Treebanks: A Data-Driven Approach to Syntax,
Representation of Syntactic Structure – Syntax analysis using dependency graphs, Syntax
analysis using phrase structure trees, Parsing Algorithms
UNIT - III
Syntax II: Models for Ambiguity Resolution in Parsing – Probabilistic context free grammars,
Generative models for parsing, Multilingual Issues – Tokenization, case and encoding, Word
segmentation, Morphology
UNIT – IV
Semantic Parsing I: Introduction, Semantic Interpretation, System paradigms, Word sense –
Resources, Systems, Software
UNIT – V
Semantic Parsing II: Predicate-Argument Structure – Resources, Systems, Software, Meaning
Representation - Resources, Systems, Software

Text Book:
1. Multilingual natural Language Processing Applications: From Theory to Practice –
Daniel M. Bikel and Imed Zitouni, Pearson Publication,1 st Edition,2012.

Reference Books:
1. Speech and Natural Language Processing - Daniel Jurafsky& James H Martin, Pearson
Publications Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the natural language word and document structures.
2. Analyze syntax processing and parsing algorithms.
3. Apply models for ambiguity resolution.
4. Apply semantic interpretation techniques.
5. Develop and utilize semantic parsing techniques.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L M L L M L M

CO-2 L L M L M M M

CO-3 L M M L L L M

CO-4 M L M L M L M

CO-5 L M L L M M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM722OE) AI APPLICATIONS
(Open Elective – II)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
3- 0 -0 -3
UNIT - I
Alibaba: Using Artificial Intelligence To Power The Retail And Business-To-Business Services
Of The Future
Amazon: Using Deep Learning To Drive Business Performance
UNIT - II
McDonald’s: Using Robots And Artificial Intelligence To Automate
Processes Walmart: Using Artificial Intelligence To Keep Shelves Stacked
And Customers Happy UNIT - III
LinkedIn: Using Artificial Intelligence To Solve The Skills
Crisis Netflix: Using Artificial Intelligence To Give Us A
Better TV Experience UNIT - IV
Salesforce: How Artificial Intelligence Helps Businesses Understand Their Customers
Uber: Using Artificial Intelligence To Do Everything
UNIT - V
Siemens: Using Artificial Intelligence And Analytics To Build The Internet Of Trains
Tesla: Using Artificial Intelligence To Build Intelligent Cars

Text Books:
1. Artificial Intelligence in Practice: How 50 Successful Companies Used AI and
Machine Learning to Solve Problems, Bernard Marr, Matt Ward, Wiley,2019.

Reference Books:
1. Thinking on the Web - Berners Lee, Godel and Turing, Wiley Interscience
2. The Semantic Web: A Guide to the Future of XML, Web Services, and
Knowledge Management by Michael C. Daconta, Leo J. Obrst , Kevin T.
Smith, Wiley Publishing, Inc.
3. Semantic Web Technologies, Trends and Research in Ontology Based
Systems, J. Davies, R. Studer, P. Warren, John Wiley & Sons.
4. Semantic Web and Semantic Web Services - Liyang Lu Chapman and
Hall/CRC Publishers, (Taylor & Francis Group)
 5. Information Sharing on the semantic Web - Heiner Stuckenschmidt; Frank
Van Harmelen, Springer Publications.
6. Programming the Semantic Web, T. Segaran, C. Evans, J. Taylor, O’Reilly, SPD.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H H L M L

CO-1 H M H M L

CO-3 H M H M L L

CO-4 H H H M L

CO-5 H M H M L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM703PC) PROFESSIONAL PRACTICE, LAW & ETHICS

IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
2- 0 -0 -2
Course Objectives:
• Introduce the fundamental principles of ethics and their importance in professional
and personal life.
• Discuss different types of contracts, such as contingent contracts, indemnity, and
guarantee.
• Provide insights into the mechanism of international commercial arbitration and its
importance in cross-border trade and business.
• Analyze the role of courts in arbitration, including reference to arbitration and interim
measures to protect parties' interests.
• Explore legal remedies and procedures available in India for IP protection.
UNIT – I
Professional Practice and Ethics: Definition of Ethics, Professional Ethics - Engineering
Ethics, Personal Ethics; Code of Ethics - Profession, Professionalism, Professional
Responsibility, Conflict of Interest, Gift Vs Bribery, Environmental breaches, Negligence,
Deficiencies in state-of-the-art; Vigil Mechanism, Whistle blowing, protected disclosures.
Introduction to GST- Various Roles of Various Stake holders
UNIT – II
Law of Contract: Nature of Contract and Essential elements of valid contract, Offer and
Acceptance, Consideration, Capacity to contract and Free Consent, Legality of Object.
Unlawful and illegal agreements, Contingent Contracts, Performance and discharge of
Contracts, Remedies for breach of contract. Contracts-II: Indemnity and guarantee,
Contract of Agency, Sale of goods Act -1930: General Principles, Conditions &
Warranties, Performance of Contract of Sale.
UNIT – III
Arbitration, Conciliation and ADR (Alternative Dispute Resolution) system: Arbitration – meaning,
scope and types – distinction between laws of 1940 and 1996; UNCITRAL model law –
Arbitration and expert determination; Extent of judicial intervention; International
commercial arbitration;
UNIT – IV
Arbitration agreements – essential and kinds, validity, reference and interim measures by
court; Arbitration tribunal – appointment, challenge, jurisdiction of arbitral tribunal,
powers, grounds of
challenge, procedure and court assistance; Distinction between conciliation, negotiation,
mediation and arbitration, confidentiality, resort to judicial proceedings, costs; Dispute
Resolution Boards; Lok Adalats.
UNIT – V
Law relating to Intellectual property: Introduction – meaning of intellectual property, main
forms of IP, Copyright, Trademarks, Patents and Designs, Secrets; Law relating to
Copyright in India including Historical evolution of Copy Rights Act, 1957, Meaning of
copyright – computer programs, Ownership of copyrights and assignment, Criteria of
infringement, Piracy in Internet – Remedies and procedures in India; Law relating to
Patents under Patents Act, 1970

Text Books:
1. Professional Ethics: R. Subramanian, Oxford University Press, 2015.
2. Ravinder Kaur, Legal Aspects of Business, 4e, Cengage Learning, 2016.

Reference Books:
1. Wadhera (2004), Intellectual Property Rights, Universal Law Publishing Co.
2. T. Ramappa (2010), Intellectual Property Rights Law in India, Asia Law House.
3. O.P. Malhotra, Law of Industrial Disputes, N.M. Tripathi Publishers.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the concept and significance of ethics, including professional,
engineering, and personal ethics.
2. Analyze the legality of contracts, including unlawful agreements and contingent contracts.
3. Differentiate between the Arbitration Acts of 1940 and 1996 and analyze the impact
of legal reforms on arbitration proceedings.
4. Distinguish between conciliation, negotiation, mediation, and arbitration,
and evaluate their advantages and limitations.
5. Apply legal remedies and procedures to protect intellectual property and
understand
the enforcement mechanisms available in India.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L L L L M L M
CO-2 M L L M L L M
CO-3 L L M L M M L

CO-4 M M L L M M H

CO-5 L M L L H L H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM711PE) INTERNET OF THINGS LABORATORY

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
0- 0 -2 -1
Course Objectives:
 To introduce the raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of distance sensor on IoT devices
 To introduce the Knowledge about Node MCU
 To introduce the Knowledge about Raspberry pi
 To introduce the Knowledge about Python

List of Experiments
1)Using Raspberry pi
a) Calculate the distance using a distance sensor.
b) Interface an LED and switch with Raspberry pi.
c) Interface an LDR with Raspberrry Pi.
2)Using Arduino
a) Calculate the distance using a distance sensor.
b) Interface an LED and switch with Aurdino.
c) Interface an LDR with Aurdino
d) Calculate temperature using a temperature sensor.
3)Using Node MCU
a) Calculate the distance using a distance sensor.
b) Interface an LED and switch with Raspberry pi.
c) Interface an LDR with Node MCU d) Calculate temperature using a
temperature sensor.
4)Installing OS on Raspberry Pi
a) Installation using PiImager
b) Installation using image file
c) Downloading an Image
d) Writing the image to an SD card
•using Linux
 •using Windows
e) Booting up Follow the instructions given in the URL
https://www.raspberrypi.com/documentation/computers/getting-
started.html
5)Accessing GPIO pins using Python
a) Installing GPIO Zero library.
•update your repositories list:
•Install the package for Python 3
b) Blinking an LED connected to one of the GPIO pin
c) Adjusting the brightness of an LED Adjust the brightness of an LED (0 to
100, where 100 means maximum brightness) using the in-built PWM
wavelength.
6)Create a DJANGO project and an app with login form.
7)Create a DJANGO view for weather station REST API
8)Create DJANGO template
9)Configure MYSQL with DJANGO framework

Text Book:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti,
Universities Press, 2015, ISBN: 9788173719547. 2. Getting Started with Raspberry Pi,
Matt Richardson & Shawn Wallace, O'Reilly (SPD), 2014, ISBN: 9789350239759.

Reference Books:
1. Bernd Scholz-Reiter, Florian Michahelles, “Architecting the Internet of Things”,
ISBN 978 3- 642-19156-5 e-ISBN 978-3-642-19157-2, Springer, 2016
2. N. Ida, Sensors, Actuators and Their Interfaces, Scitech Publishers, 2014.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Ability to introduce the concept of M2M (machine to machine) with necessary
protocols and get awareness in implementation of distance sensor
2. Get the skill to program using python scripting language which is used in many IoT
devices
3. Get the Application of Node MCU
4. Get the skill to program using Raspberry pi which is used in many IoT devices
5. Create a DJANGO project and an app and learn MYSQL
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L H M M H M

CO-2 L M H H M L L

CO-3 H H H M H M

CO-4 M H H H H L

CO-5 L M H H H H L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM712PE) DATA MINING LABORATORY

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
0- 0 -2 -1
Prerequisites:

1. A course on “Database Management System

Course Objectives:
1. To implement data warehouses for different organizations.
2. To analyze the process of preprocessing the data.
3. To test the real world data sets using supervised learning and unsupervised learning.
4. To obtain hands-on experience using data mining software.
5. To provide practical exposure of the concepts in data mining algorithms

List of Experiments
1. Experiments using Weka /Pentaho/Python

2. Data Processing Techniques:

(i)Data cleaning(ii)Data transformation–Normalization(iii)Data integration

3. Partitioning-Horizontal, Vertical, Round Robin, Hash based

4. Data Warehouse schemas–star, snowflake, fact constellation

5. Data cube construction–OLAP operations

6. Data Extraction, Transformations & Loading operations

7. Implementation of Attribute oriented induction algorithm

8. Implementation of a priori algorithm

9. Implementation of FP–Growth algorithm

10. Implementation of Decision Tree Induction

11. Calculating Information gain measures

12. Classification of data using Bayesian approach

13. Classification of data using K–nearest neighbour approach

14. Implementation of K–means algorithm

 15. Implementation of BIRCH algorithm

16. Implementation of PAM algorithm

17. Implementation of DBSCAN algorithm

Text Books:
1. JiaweiHan, Micheline Kamber, JianPei., Datamining: Concepts and Techniques,
3rd Edition, Morgan Kaufmann/Elsevier,2012.
2. Data Warehousing, Data Mining &OLAP-Alex Berson and Stephen J.Smith- Tata
McGraw-Hill Edition, Tenth reprint2007

Reference Book:
1. Pang-Ning Tan,Michael Stein bach, Vipin Kumar, Anuj Karpatne,
Introduction to Data Mining, Pearson Education.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Apply preprocess sing statistical methods for any given raw data.
2. Gain practical experience of constructing a data ware house.
3. Implement various algorithms for data mining in order to discover interesting
patterns from large amounts of data.
4. Apply OLAP operations on data cube construction
5. To analyze the process of preprocessing the data

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L M H H M H M

CO-2 M H H H M M H H

CO-3 M L M H L M H H

CO-4 H M M H L M H H

CO-5 H H M H H M H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(AM713PE) MERN STACK DEVELOPMENT LABORATORY
(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
0- 0 -2 -1

Prerequisites: Any High level programming language (C, JAVA)

Course Objectives:
 To understand the fundamental concepts of Node.js and its environment setup.
 To implement user authentication and authorization in a web application.
 To design and develop interactive web applications using React.js.
 To deploy applications on GitHub and cloud platforms.
 To work with MongoDB for storing and managing data efficiently.

List of Experiments
1. Create an application to set up the Node.js environment and display "Hello World".
2. Create a Node.js application for a user login system.
3. Write a Node.js program to perform read, write, and other operations on a file.
4. Write a Node.js program to read form data from the query string and generate a response.
5. Create a TODO application in react with necessary components and deploy it into github.
6. Implement a program with basic commands on databases and collections using MongoDB.
7. Implement CRUD operations on the given dataset using MongoDB.
8. Perform Count, Limit, Sort, and Skip operations on the given collections using MongoDB.
9. Write a program to create a simple calculator application using React.js.
10. Write a program to create a digital clock using React.js.

Text Books:
1. Brad Dayley, Brendan Dayley, Caleb Dayley., Node.js, MongoDB and Angular Web
Development, 2nd Edition, Addison-Wesley, 2019.
2. Mark Tielens Thomas, React in Action, 1st Edition, Manning Publications.

Reference Books:
1. Vasan Subramanian, Pro MERN Stack, Full Stack Web App Development with
Mongo, Express, React, and Node, 2nd Edition, Apress, 2019.
2. Chris Northwood, The Full Stack Developer: Your Essential Guide to the Everyday Skills
Expected
 of a Modern Full Stack Web Developer’, 1st edition, Apress, 2018.
3. Kirupa Chinnathambi, Learning React: A Hands-On Guide to Building Web
Applications Using React and Redux, 2nd edition, Addison-Wesley Professional, 2018
Course

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Set up and configure the Node.js environment.
2. Debug and optimize JavaScript and React.js applications.
3. Process and handle form data through HTTP requests in Node.js.
4. Perform CRUD operations on datasets using MongoDB queries.
5. Gain hands-on experience with modern web development frameworks for industry
readiness.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L M L L M L M

CO-2 M L H M M L M

CO-3 M L L M H M H

CO-4 L M L L L L M

CO-5 L M M M L M M
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM714PE) MOBILE APPLICATION DEVELOPMENT LABORATORY

(Professional Elective – III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
0- 0 -2 -1
Course Objectives:
 Install and configure Android Studio, understand project structure, and run apps on an
emulator.
 Build interactive UI elements like text fields, buttons, radio buttons, spinners, and date
pickers.
 Implement explicit and implicit intents to navigate between activities and pass data.
 Store and retrieve user data using databases (SQLite) and shared preferences.
 Work with fragments, menus, and SMS functionality, and finalize applications for
deployment.

List of Experiments
1) Installation of Android studio.
2) Create an Android application that shows Hello + name of the user and run it on an
emulator.
3) Create an application that takes the name from a text box and shows hello message
along with the name entered in the text box, when the user clicks the OK button.
4) Create a screen that has input boxes for User Name, Password, Address, Gender (radio
buttons for male and female), Age (numeric), Date of Birth (Date Picker), State
(Spinner) and a Submit button. On clicking the submit button, print all the data below
the Submit Button. ( Use any Layout).
5) Design an Android application to create page using Intent and one Button and pass the
Values from one Activity to second Activity.
6) Design an android application that Sends SMS using Intent.
7) Create an Android application using Fragments.
8) Design an Android application Using Radio buttons.
9) Design an Android application for menu.
10) Create a user registration application that stores the user details in a database table.

Text Books:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012.
2. Android Application Development for Java Programmers, James C Sheusi, Cengage, 2013.
Reference Book:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013.
 Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Create and run Android applications using Android Studio.
2. Design user-friendly interfaces with various input controls.
3. Use intents to navigate between activities and pass data efficiently.
4. Implement databases (SQLite) and shared preferences for data storage.
5. Utilize fragments, menus, and SMS functionality in Android applications.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 H M M M M H

CO-2 H H M M M H

CO-3 M H L H H H H

CO-4 M H H M M H

CO-5 L M M H M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM715PE) CLOUD COMPUTING LABORATORY

(Professional Elective-III)
IV Year B.Tech. CSE (AI & ML) - I Sem. L-T-P-C
0- 0 -2 -1
Pre-requisites:
 A course on “Computer Networks”.
 A course on “Operating System”.

Course Objectives:
 To understand the fundamental concepts and various paradigms of cloud computing.
 To examine different cloud deployment and service models.
 To delve into virtualization concepts and programming models used in cloud
environments.
 To analyze networking requirements and issues in cloud computing, especially within data
centers.
 To explore security concerns and advanced concepts in cloud computing.

List of Experiments
1. Install Virtualbox/VMware Workstation with different flavors 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. Create an Amazon EC2 instance and set up a web-server on the instance and
associate an IP address with the instance.
4. Install Google App Engine. Create a hello world app and other simple web
applications using python/java.
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 word count.
9. Create a database instance in the cloud using Amazon RDS.
 10. Create a database instance in the cloud using Google Cloud SQL

Text Books:
 1. Cloud Computing : Principles and Paradigms by Rajkumar Buyya, James Broberg
and Andrzej
M. Goscinski, Wiley, 2011.
2. Essentials of cloud Computing: K. Chandrasekhran, CRC press, 2014

Reference Books:
1. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg and
Andrzej
M. Goscinski, Wiley, 2011.

2. Distributed and Cloud Computing, Kai Hwang, Geoffery C. Fox, Jack J.

Dongarra, Elsevier, 2012.

3. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010

Course Outcomes:
By the end of this course, students will be able to:

1. Explain and compare different computing paradigms and fundamentals of cloud

computing.
2. Identify and implement suitable cloud service models and recognize the
technological drivers for cloud computing.
3. Apply virtualization techniques and programming models like MapReduce in cloud
environments.
4. Analyze and address networking and transport layer issues in data centers.
5. Evaluate security concerns and advanced concepts related to cloud computing.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M L L M M M

CO-2 M M M M M H

CO-3 M M M L M

CO-4 M L M M

CO-5 M M M M M M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(AM851PE) SOCIAL MEDIA ANALYTICS
(Professional Elective – V)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 Understand the concepts of social media.
 Learn the mechanisms for Calculating and Visualizing Network Metrics.
 Understand widely used services such as Email, Thread Networks, etc.
 Interpret Facebook and Hyperlink Networks.
 Analysis of widely used services such as You Tube, Wiki Networks, etc.

UNIT – I
Introduction to Social Network and Media Analysis – Examples of Social Media and their
characteristics, Society as a graph, Candidates of social media and network data for
analysis, Random graphs with general degree distributions, Models of network formation,
Properties of Large-Scale Networks: Six-degree separation, Scale-free distributions, Small-
world effect, and strong community structure – Strong and Weak ties.
UNIT – II
Social Relatedness: Networks and centrality Measures - Degree, Closeness, Betweenness, Edge
betweenness, Eccentricity, Clustering Coefficient, Eigenvector, Social media analytical
applications.
UNIT – III
Community Detection and Graph-based Clustering: Communities in social media, Node-centric
community detection, Group-centric community detection, Network-centric community
detection, Hierarchy-centric community detection, Topology discovery, Community
Evaluation .
UNIT – IV
Link Prediction: Challenges in link prediction, Link prediction methods and algorithms,
Clustering approaches for link prediction.
Social Listening and Sentiment Analysis: Sentiments and Opinions, Lexicon based methods,
Machine learning based methods, Feature-based sentiment analysis, Slang sentiment
analysis.
UNIT – V
Social Recommendation Systems: Classical recommendation algorithms – Content-based
methods,
Collaborative Filtering, Extending individual recommendation to groups of individuals,
Recommendations using social context – Using social context alone, Extending classical
methods with social context - Social Recommendation Using collaborative filtering,
Community detection and probabilistic matrix factorization, Recommendations constrained
by social context, Evaluating recommendations.

Text Books:
1. Reza Zafarani, Mohammad Ali Abbasi, Huan Liu, "Social Media Mining – An
Introduction", Cambridge University Press, 2014.

2. Charu C Aggarwal (Ed.), "Social Network Data Analytics", Springer, 2011

Reference Book:
1. Hansen, Derek, Ben Sheiderman, Marc Smith., "Analyzing Social Media Networks
with NodeXL: Insights from a Connected World", Morgan Kaufmann, 2011.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Ability to construct social network maps easily.
2. Apply network visualization techniques using Node XL for analyzing and
interpreting social networks.
3. Analyze case studies on email networks and thread networks for communication
patterns.
4. Design Network Structures and Utilize Visualizing technique tools.
5. Examine YouTube and Wiki networks for content interaction, collaboration and
influence.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L M M

CO-2 M L M L L M L L

CO-3 L M L L M

CO-4 L M M L M M L

CO-5 M L M M L H L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM852PE) FEDERATED MACHINE LEARNING

(Professional Elective – V)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites: A course on “Machine Learning”
Course Objectives:
 To introduce the fundamental concepts of Federated Learning
 To understand the principles of DML and its integration with privacy-preserving
techniques
 To introduce the architectures, optimization techniques, and security measures in
Horizontal and Vertical Federated Learning
 To understand FTL and incentive mechanisms for Federated Learning
 To explore the applications of Federated Learning in various domains such as CV, NLP
UNIT - I
Introduction: Motivation, Federated Learning as a Solution, The Definition of Federated
Learning, Categories of Federated Learning, Current Development in Federated
Learning, Research Issues in Federated Learning, Open-Source Projects,
Standardization Efforts, The Federated AI Ecosystem.
Background: Privacy-Preserving Machine Learning, PPML and Secure ML, Threat and
Security Models, Privacy Threat Models, Adversary and Security Models, Privacy
Preservation Techniques, Secure Multi-Party Computation, Homomorphic Encryption,
Differential Privacy.
UNIT - II
Distributed Machine Learning: Introduction to DML, The Definition of DML, DML Platforms,
Scalability-Motivated DML, Large-Scale Machine Learning, Scalability-Oriented DML
Schemes, Privacy-Motivated DML, Privacy-Preserving Decision Trees, Privacy-
Preserving Techniques, Privacy-Preserving DML Schemes, Privacy-Preserving Gradient
Descent, Vanilla Federated Learning, Privacy-Preserving Methods.
UNIT – III
Horizontal Federated Learning: The Definition of HFL, Architecture of HFL, The Client- Server
Architecture, The Peer-to-Peer Architecture, Global Model Evaluation, The Federated
Averaging Algorithm, Federated Optimization, The FedAvg Algorithm, The Secured
FedAvg Algorithm, Improvement of the FedAvg Algorithm, Communication Efficiency,
Client Selection.
Vertical Federated Learning: The Definition of VFL, Architecture of VFL, Algorithms of
VFL,
 Secure Federated Linear Regression, Secure Federated Tree-Boosting.
UNIT - IV
Federated Transfer Learning: Heterogeneous Federated Learning, Federated Transfer
Learning, The FTL Framework, Additively Homomorphic Encryption, The FTL Training
Process, The FTL Prediction Process, Security Analysis, Secret Sharing-Based FTL.
Incentive Mechanism Design for Federated Learning: Paying for Contributions, Profit-
Sharing Games, Reverse Auctions, A Fairness-Aware Profit Sharing Framework, Modeling
Contribution, Modeling Cost, Modeling Regret, Modeling Temporal Regret, The Policy
Orchestrator, Computing Payoff Weightage.
UNIT - V
Federated Learning for Vision, Language, and Recommendation: Federated Learning for
Computer Vision, Federated CV, Federated Learning for NLP, Federated NLP,
Federated Learning for Recommendation Systems, Recommendation Model, Federated
Recommendation System.

Text Book:
1. Federated Learning, Qiang Yang, Yang Liu, Yong Cheng, Yan Kang, Tianjian Chen,
and Han,2019.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Understand the basic principles, categories, and security concerns of FL
2. Analyze DML frameworks and privacy-preserving techniques
3. Understand Federated Learning architectures, optimization techniques
4. Comprehend FTL models and design effective incentive mechanisms
5. Apply FL techniques in real-world applications such as CV, NLP, RS

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L L L L L

CO-2 M M L L M L

CO-3 M L L M M L

CO-4 M M L M M L
CO-5 M L H M H L H H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(AM853PE) AUGMENTED REALITY & VIRTUAL REALITY
(Professional Elective –V)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
1. To understand foundation of the fast-growing field of AR and make the
students aware of the various AR concepts.
2. To give historical and modern overviews and perspectives on virtual reality.
3. To describes the fundamentals of sensation, perception,
4. To analyze technical and engineering aspects of virtual reality systems.
5. To Discuss various applications of AR and VR.
UNIT - I

Introduction to Augmented Reality: Augmented Reality - Defining augmented

reality, history of augmented reality, Examples, Related fields.
Displays: Multimodal Displays, Visual Perception, Requirements and Characteristics,
Spatial Display Model, Visual Displays.
UNIT - II
Tracking: Tracking, Calibration, and Registration, Coordinate Systems,
Characteristics of Tracking Technology, Stationary Tracking Systems, Mobile Sensors

Computer Vision for Augmented Reality: Marker Tracking, Multiple-Camera

Infrared Tracking, Natural Feature Tracking by Detection, Outdoor Tracking.
UNIT - III

Introduction to Virtual Reality: Defining Virtual Reality, History of VR.

The Geometry of Virtual Worlds: Geometric Models, Axis-Angle Representations of
Rotation, Viewing Transformations.
UNIT – IV

The Physiology of Human Vision: From the Cornea to Photoreceptors, From

Photoreceptors to the Visual Cortex, Eye Movements.

Visual Perception: Visual Perception - Perception of Depth, Perception of Motion.

UNIT - V
Motion in Real and Virtual Worlds: Velocities and Accelerations, The Vestibular
System, Physics in the Virtual World, Mismatched Motion and Vection

Text Books:
1. Augmented Reality: Principles & Practice by Schmalstieg / Hollerer, Pearson
Education India;First edition (12 October 2016),ISBN-10: 9332578494
2. Virtual Reality, Steven M. LaValle, Cambridge University Press, 2016

Reference Books:
1. Allan Fowler-AR Game Development‖, 1st Edition, A press Publications, 2018, ISBN
978 - 1484236178
2. Understanding Virtual Reality: Interface, Application and Design, William R
Sherman and Alan B Craig, (The Morgan Kaufmann Series in Computer
Graphics)”. Morgan Kaufmann Publishers, San Francisco, CA, 2002
3. Developing Virtual Reality Applications: Foundations of Effective Design, Alan B
Craig, William R Sherman and Jeffrey D Will, Morgan Kaufmann, 2009
4. Designing for Mixed Reality, Kharis O'Connell Published by O'Reilly Media,
Inc., 2016, ISBN: 9781491962381
5. Sanni Siltanen- Theory and applications of marker-based augmented reality.
Julkaisija – Utgivare Publisher. 2012. ISBN 978-951-38-7449-0
6. Gerard Jounghyun Kim, “Designing Virtual Systems: The Structured Approach”,
2005.

Course Outcomes:
1. Describe how AR systems work and list the applications of AR.

2. Understand the software architectures of AR.

3. Understand the Visual perception and rendering in VR

4. Understand the interaction perception of VR

5. Understand the rendering in VR

CO-PO-PSO Mapping:

PSO-1

PSO-2
PO-10

PO-11

PO-12
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
M L M H H M L H H
CO-1
M H H H M M H H H
CO-2
M L M H L M M H H
CO-3
H M M H L M M H H
CO-4
H H M H H M L H H
CO-5

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM854PE) CYBER SECURITY

(Professional Elective – V)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3

Pre-requisites:

● Basic Knowledge on Computer Networks & Operating Systems

Course Objectives:
The objective of this course is to provide:
● To understand various types of cyber-attacks and cyber-crimes.
● To learn threats and risks within the context of cyber security.
● To have an overview of the cyber laws.
● To understand the concepts of cyber forensics.
● To study the defensive techniques against these attacks.

UNIT –I

Introduction to Cyber Security: Basic Cyber Security Concepts, layers of security,

Vulnerability, threat, Harmful acts, Internet Governance – Challenges and Constraints,
Computer Criminals, CIA Triad, Assets and Threat, motive of attackers, active attacks,
passive attacks, Software attacks, hardware attacks, Cyber Threats-Cyber Warfare,
Cyber Crime, Cyber terrorism, Cyber Espionage,
etc., Comprehensive Cyber Security Policy.
UNIT – II
Cyberspace and the Law & Cyber Forensics: Introduction, Cyber Security Regulations, Roles of
International Law. The INDIAN Cyberspace, National Cyber Security Policy.
Introduction, Historical background of Cyber forensics, Digital Forensics Science, The
Need for Computer Forensics, Cyber Forensics and Digital evidence, Forensics
Analysis of Email, Digital Forensics
Lifecycle, Forensics Investigation, Challenges in Computer Forensics.
UNIT – III
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile and
Wireless
Devices, Trends in Mobility, Credit card Frauds in Mobile and Wireless Computing
Era, Security
Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices,
Authentication service
Security, Attacks on Mobile/Cell Phones, Organizational security Policies and
Measures in Mobile Computing Era, Laptops.
UNIT – IV
Cyber Security: Organizational Implications: Introduction - cost of cybercrimes and IPR
issues, web
threats for organizations, security and privacy implications, social media marketing:
security risks and perils for organizations, social computing and the associated
challenges for organizations.
UNIT – V:
Cybercrime: Examples and Mini-Cases Examples: Official Website of Maharashtra
Government Hacked, Indian Banks Lose Millions of Rupees, Parliament Attack,
Pune City Police Bust Nigerian Racket, e-mail spoofing instances. Mini-Cases: The
Indian Case of online Gambling, An Indian Case
of Intellectual Property Crime, Financial Frauds in Cyber Domain.

Text Books
1. Nina Godbole and Sunit Belpure, Cyber Security Understanding Cyber
Crimes, Computer Forensics and Legal Perspectives, Wiley.
2. B. B. Gupta, D.P. Agrawal, Haoxiang Wang, Computer and Cyber Security:
Principles, Algorithm, Applications, and Perspectives, CRC Press.

Reference Books:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC
Press.

2. Introduction to Cyber Security, Chwan-Hwa(john) Wu, J.David Irwin, CRC

Press T&F Group.

3. Cyber security and Cyber war: What Everyone Needs to Know" by P.W.
Singer and Allan Friedman.

4. "Cyber Crime: Investigating High-Technology Computer Crime" by Robert Moore.

Course Outcomes:
Upon successful completion of the course, the student will be able to,
1. Understand the cyber security needs of an organization.
2. Understand Cyber Security Regulations and Roles of International Law.
3. Learn the Basics of Cybercrime in the Context of Mobile and Wireless Devices.
4. Understand security architecture for an organization.
5. Understand the Concept of Cybercrime through Real-World Example
CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L M H M M L

CO-2 M M M M M

CO-3 L M M L L M

CO-4 L L M M M L

CO-5 L H L H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(AM855PE) AD-HOC & SENSOR NETWORKS
(Professional Elective – V)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites: Computer Networks.
Course Objectives:
 To understand the challenges of routing in ad-hoc and sensor networks.
 To understand various broadcast, mutlicast and geocasting protocols in ad hoc
and sensor networks.
 To understand basics of Ad Hoc TCP protocol .
 To understand the lower layer issues in Wireless Sensor Networks (WSNs).
 To understand the transport and application layer issues in WSNs.

UNIT-I
Introduction to Ad Hoc Networks-Characteristics of MANETs, Applications of MANETs and
Challenges of MANETs.
Routing in MANETs -Criteria for classification, Taxonomy of MANET routing
algorithms, Topology-based routing algorithms- Proactive: DSDV, WRP; Reactive: DSR,
AODV, TORA; Hybrid: ZRP; Position- based routing algorithms- Location Services-
DREAM, Quorum-based, GLS.
UNIT - II
Data Transmission-Broadcast Storm Problem, Rebroadcasting Schemes-Simple-flooding,
Probability-based Methods, Area- based Methods, Neighbor Knowledge-based: SBA,
Multipoint Relaying, AHBP. Multicasting: Tree-based: AMRIS, MAODV; Mesh-based:
ODMRP, CAMP; Hybrid: AM Route, MCEDAR.
UNIT – III
Geocasting -Data-transmission Oriented-LBM; Route Creation Oriented-GeoTORA,
MGR.TCP over Ad Hoc TCP protocol over view, TCP and MANETs, Solutions for TCP
over Ad hoc.
UNIT – IV
Basics of Wireless Sensors and Lower Layer Issues- Applications, Classification of sensor
networks, Architecture of sensor network, Physical layer, MAC layer, Link layer, Routing
 Layer.
UNIT - V
Upper Layer Issues of WSN-Transport layer, High level application layer support, Adapting
to the inherent dynamic nature of WSNs.

Text Books:
1. Ad Hoc and Sensor Networks – Theory and Applications, Carlos
Corderio Dharma P.Aggarwal, World Scientific Publications, March 2006, ISBN
– 981-256-681-3
2. Wireless Sensor Networks: An Information Processing Approach, Feng
Zhao, Leonidas Guibas, Elsevier Science, ISBN – 978-1-55860-914-3 (Morgan
Kauffman),2005.

Reference Books:
1. Siva Ram Murthy, B.S. Manoj Ad Hoc Wireless Networks: Architectures and
Protocols.
2. Taieb Znati Kazem Sohraby, Daniel Minoli, Wireless Sensor Networks:
Technology, Protocols and Applications, Wiley

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Classify and Analyze Routing Protocols.
2. Understand and compare the MAC routing protocols for Ad Hoc networks.
3. Understand Geocasting in MANETs.
4. Evaluate Lower Layer Protocols in WSNs.
5. Understand the transport protocols of sensor networks

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L M M L

CO-2 M L M

CO-3 M M L L

CO-4 L M M

CO-5 H M M M H
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM861PE) SPEECH AND VIDEO PROCESSING

(Professional Elective – VI)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 Understand Speech Processing Concepts

 Develop Speech Recognition Techniques

 Analyze Multi-Dimensional Signals and Systems
 Explore Motion Estimation Techniques
 Implement Video Segmentation and Tracking
UNIT - I
Speech processing concepts: Introduction, the process of speech production and perception in
Human Beings, speech production process, Representing speech in time and frequency
domains, speech sounds and features, Approaches to automatic speech recognition by
Machine.
UNIT - II
Speech recognition: Spectral Analysis models, The bank-of-filters front end processor: Types
of filter banks used for speech Recognition, LPC Model: LPC Analysis Equations, vector
quantization models: Elements of a vector quantization implementation, The VQ training
set.
UNIT - III
Multi-Dimensional Signals and Systems:
Multi-Dimensional Signals, Multi-Dimensional Transforms, Multi-Dimensional Systems,
Multi- Dimensional Sampling Theory, Sampling Structure Conversion
Digital Images and Video: Human Visual System and Color, Digital Video.
UNIT – IV
Motion Estimation
Image Formation, Motion Models, 2D Apparent-Motion Estimation, Differential Methods,
Matching Methods, Nonlinear Optimization Methods.
UNIT - V

Video Segmentation and Tracking: Image Segmentation, Change Detection, Motion

Segmentation, Motion Tracking, Image and Video Matting, Performance Evaluation
Text books:
1. Fundamentals of Speech recognition – L. Rabiner and B. Juang, Prentice
Hall signal processing series
2. Digital Video processing, A Murat Tekalp, 2nd edition,Prentice Hall.

Reference books:
1. Discrete-time speech signal processing: principles and practice, Thomas F. Quatieri,
Coth.
2. Video Processing and Communications, Yao Wang, J. Osternann and Qin
Zhang, Pearson Education
3. “Speech and Audio Signal Processing”, B.Gold and N. Morgan, Wiley.
4. “Digital image sequence processing, Compression, and analysis”, Todd R. Reed, CRC
Press
5. “Handbook of Image and Video processing”, Al Bovik, Academic press, second Edition.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Analyze speech production and representation in time and frequency domains.
2. Understand basic algorithms of speech analysis and speech recognition.
3. Understand multi-dimensional signal processing techniques for image
and video analysis.
4. Apply motion estimation and object tracking methods on video.
5. Implement video segmentation and tracking methods.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H M M H

CO-2 M M H M H M H

CO-3 M H M M H M H

CO-4 H M M M M M H

CO-5 H M H M M M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM862PE) REINFORCEMENT LEARNING

(Professional Elective – VI)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites: A course on “Mathematical Foundations”
Course Objectives:
 Introduce the fundamental concepts, elements, and scope of RL.
 Explore Markov Decision Processes (MDPs) and their role RL
 Introduce Monte Carlo (MC) methods for policy evaluation and control.
 Analyze Temporal Difference (TD) learning technique including SARSA and Q-
learning.
 Investigate eligibility traces and advanced reinforcement learning strategies for

UNIT - I
The Reinforcement Learning Problem: Reinforcement Learning (RL) Examples, Elements of
Reinforcement Learning, Limitations and Scope.
Multi-Arm Bandit Problem: An n-Armed Bandit Problem, Action value methods, Incremental
Implementation, tracking a non-stationary problem, optimistic initial values, upper-
confidence-bound action selection, Gradient Bandits.
UNIT - II
Finite Markov decision process (MDP): The Agent-Environment Interface, Goals and Rewards,
Returns, Unified Notation for Episodic and Continuing Tasks, Markov Property, Markov
Decision Processes, Value Functions, Optimal Value Functions, Optimality and
Approximation.
UNIT - III
Dynamic Programming (DP): Policy Evaluation, Policy Improvement, policy iteration, value
iteration, asynchronous DP, Generalized Policy Iteration.
Monte Carlo Methods: Monte Carlo Prediction, Monte Carlo estimation of action values, Monto
Carlo Control, Off-Policy Prediction via Importance Sampling, Incremental Implementation,
Off-policy Monte Carlo Control, Importance Sampling on Truncated Returns.
UNIT - IV
Temporal Difference Learning: TD Prediction, Advantages of TD prediction Methods,
Optimality of TD (0), SARSA- on policy TD Control , Q- Learning: Off-Policy TD Control.
UNIT - V
Eligibility traces: n-Step TD Prediction, Forward and Backward view of TD(λ), Equivalence
of forward and backward view, Sarsa (λ), Watkins’s Q(λ), Off policy eligibility traces using
importance of sampling.

Text Book:
1. Reinforcement Learning: An Introduction, Richard S. Sutton and Andrew G. Barto, ,
2nd Edition, The MIT Press, 2018.

Reference Book:
1. Algorithms for Reinforcement Learning, Csaba Szepesvari, , Morgan & Claypool
Publishers, 2010
Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Formulate Reinforcement Learning problems
2. Formulate and solve problems using Markov Decision Processes (MDPs).
3. Apply Monte Carlo methods to solve RL tasks
4. Develop and compare TD Learning techniques
5. Apply Eligibility Traces and Advanced RL Strategies

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H L H

CO-2 M M L M L

CO-3 M L L

CO-4 H M M H M

CO-5 L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM863PE) RANDOMIZED ALGORITHMS

(Professional Elective – VI)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To introduce the basic concepts of randomized algorithms and techniques.
 To develop a deep understanding of probabilistic methods.
 To master the basics of algebraic techniques.
 To understand the basics of advanced data structures and graph algorithms.
 To know the concepts of fundamental geometric algorithms.
UNIT - I
Introduction, A Min – Cut algorithm, Las Vegas and Monte Carlo, Binary Planar Partitions
Game-Theoretic Techniques: Game Tree Evaluation, the Minimax Principle
UNIT - II
Moments and Deviations: Occupancy Problems, The Markov and Chebyshev Inequalities,
Randomized Selection, Two Point sampling
Markov Chains and Random Walks: A 2-SAT example, Markov Chains, Random Walks on
Graphs
UNIT – III
Algebraic Techniques: Fingerprinting and Freivald’s Technique, Verifying Polynomial
Identities, Perfect Matching in Graphs, Verifying Equality of Strings, A Comparison of
Fingerprinting Techniques, Pattern Matching
UNIT - IV
Data Structures: The Fundamentals of Data-structures, Random Treaps, Skip Lists
Graph Algorithms: All Pairs Shortest Path, the Min- Cut Problem, Minimum Spanning Trees
UNIT - V
Geometric Algorithms: Randomized Incremental Construction, Convex Hulls in the Plane,
Duality, Half-Space Intersections, Delaunay Triangulations
Parallel and Distributed Algorithms: The PRAM Model, Sorting on a PRAM, Maximal
Independent Sets

Text Books:
 1. Randomized Algorithms: Rajeev Motwani, Prabhakar Raghavan, Cambridge University
Press
,1995.
2. Probability and Computing: Randomization and Probabilistic Techniques in
Algorithms and Data Analysis by Eli Upfal and Michael Mitzenmacher,2017.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Gain knowledge of fundamentals of randomized algorithm design.
2. To develop skills to model and analyze probabilistic processes.
3. Able to apply the knowledge of algebraic techniques.
4. Be acquainted with the basics of data structures and graph algorithms.
5. To analyze and implement geometric algorithms.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L M L L L M L

CO-2 M H M L L L M

CO-3 M L L L M M H

CO-4 M L M L L L M

CO-5 L M L L H M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM864PE) COGNITIVE COMPUTING

(Professional Elective-VI)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites: Probability theory
Course Objectives:
 Understand the foundational concepts of cognition, including IBM's Watson and design
principles for human cognition.
 Explore computational models of episodic and semantic memory, and psycholinguistics.
 Study the interaction of language, memory, and learning, along with classical
models of rationality and symbolic reasoning.
 Investigate child concept acquisition and artificial cognitive architectures such as ACT-
R, SOAR, and OpenCog.
 Understand the DeepQA Architecture, Unstructured Information Management
Architecture (UIMA), and structured knowledge for business applications.

UNIT - I

Introduction to Cognitive Science: Understanding Cognition, IBM’s Watson, Design for Human
Cognition, Augmented Intelligence, Cognition Modeling Paradigms: Declarative/ logic-
based computational cognitive modeling, connectionist models of cognition

UNIT - II

Cognitive Models of memory and language, computational models of episodic and

semantic memory, modeling psycholinguistics.

UNIT - III
Cognitive Modeling: modeling the interaction of language, memory and learning,
Modeling select aspects of cognition classical models of rationality, symbolic reasoning
and decision making.

UNIT - IV
Formal models of inductive generalization, causality, categorization and similarity, the
role of analogy in problem solving, Cognitive Development Child concept acquisition.
Cognition and Artificial cognitive architectures such as ACT-R, SOAR, OpenCog.
UNIT - V
DeepQA Architecture, Unstructured Information Management Architecture (UIMA),
Structured Knowledge, Business Implications, Building Cognitive Applications,
Application of Cognitive Computing and Systems.

Text Books:
1. Vijay V Raghavan, Venkat N. Gudivada, Venu Govindaraju, Cognitive Computing:
Theory and Applications: Volume 35 (Handbook of Statistics), North Hollan.

2. The Cambridge Handbook of Computational Psychology by Ron Sun (ed.), Cambridge

University Press.

Reference Book:
1. Judith S. Hurwitz, Marcia Kaufman, Adrian Bowles Cognitive Computing and Big
Data Analytics, Wiley

Course Outcomes:
1. Ability to explain the foundational concepts of cognitive science and its applications.
2. Proficiency in developing and using cognitive models of memory and language.
3. Capability to model interactions between language, memory, and learning processes.
4. Ability to apply cognitive architectures like ACT-R, SOAR, and OpenCog in practical
scenarios.
5. Skills in utilizing DeepQA and UIMA for building cognitive applications and
understanding their business implications.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L H M M L H

CO-2 M M M L M H M

CO-3 M H M M L M M

CO-4 H L M M L H M

CO-5 L M M M M M L
H-HIGH M-MODERATE L-LOW
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM865PE) CONVERSATIONAL AI
(Professional Elective – VI)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To be familiar with the basic knowledge about dialogue systems.
 To understand the different techniques in designing and developing a dialogue system.
 Study the role of fundamental machine learning for building statistical data-driven
 To study the evaluation frameworks used for dialogue systems.
 To Understand retrieval-based response generation, task-oriented and open-
domain neural dialogue system
UNIT- I
Introducing Dialogue Systems:

Introduction of Dialogue System, History of Dialogue Systems, Present-Day Dialogue

Systems: Dialogue Systems on Messaging Platforms, Dialogue Systems on
Smartphones, Dialogue Systems in Cars, Modeling Conversation Dialogue Systems.

UNIT- II
Rule-Based Dialogue Systems:

Architecture, Methods, and Tools Dialogue Systems Architecture, designing a

Dialogue System, Tools for Developing Dialogue Systems, Rule-Based Techniques in
Dialogue Systems Participating in the Alexa Prize
UNIT- III
Statistical Data-Driven Dialogue Systems:
Motivating the Statistical Data-Driven Approach, Dialogue Components in the
Statistical Data- Driven Approach, Reinforcement Learning (RL): Representing Dialogue
as a Markov Decision Process, From MDPs to POMDPs, Dialogue State Tracking,
Dialogue Policy, Problems and Issues with Reinforcement Learning in POMDPs.

UNIT- IV
Evaluating Dialogue Systems:

Process of Evaluation, Evaluating Task-Oriented Dialogue Systems, Evaluating

Open-Domain
 Dialogue Systems, Evaluation Frameworks: PARADISE, Quality of Experience
(QoE), Interaction Quality.
UNIT- V
End-to-End Neural Dialogue Systems
Neural Network Approaches to Dialogue Modeling, A Neural Conversational
Model, Introduction to the Technology of Neural Dialogue, Retrieval-Based Response
Generation, Task- Oriented Neural Dialogue Systems, Open-Domain Neural Dialogue
Systems: Facebook’s Blender Bot, Open AI’sGPT-3, Some Issues and Current
Solutions, Dialogue Systems: Datasets, Competitions, Tasks, and Challenges.

Text Book:
1. Michael McTear, “Conversational AI: Dialogue Systems, Conversational
Agents, and Chatbots”, Second Edition, Moran and Claypool Publishers, 2020.

Reference Book:
1. Cathy Pearl, “Designing Voice User Interfaces: Principles of Conversational
Experiences”, O’REILLY, 2016.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Ability to apply the applications of dialogue systems.
2. Design rule-based dialogue systems using appropriate architectures and tools.
3. Apply statistical and reinforcement learning techniques to build data-driven dialogue
systems.
4. Evaluate dialogue systems using standard metrics and frameworks.
5. Develop end-to-end neural dialogue systems and explore current trends and challenges.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M L M L

CO-2 L M L M

CO-3 M L M M

CO-4 M H L M
CO-5 L M M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE831OE) ENERGY EFFICIENT BUILDINGS

(Open Elective – III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To introduce the different concepts of sustainable design and green building techniques

 Impacts of lighting efficiency in energy efficient buildings

 To achieve energy efficient buildings concepts and how they may be synthesized
to best fit a specific construction project.

 To understand the Energy Conservation Building Codes

 To describe the concepts of sustainable design and green building techniques

UNIT - I:
Introduction: Life Cycle impacts of materials and products – sustainable design concepts
– strategies of Design for the Environment -The sun-earth relationship and the energy
balance on the earth’s surface, climate, wind – Solar radiation and solar temperature
– Sun shading and solar radiation on surfaces – Energy impact on the shape and
orientation of buildings – Thermal properties of building materials. Studying the
Nation Building Code (NBC 2005) code with respect to the Chapter 11 on
Sustainability.
UNIT - II:
Energy Efficient Buildings: Passive cooling and day lighting – Active solar and
photovoltaic- Building energy analysis methods- Building energy simulation- Building
energy efficiency standards- Lighting system design- Lighting economics and aesthetics-
Impacts of lighting efficiency – Energy audit and energy targeting- Technological
options for energy management.
UNIT - III:
Indoor Environmental Quality Management: Psychometric- Comfort conditions- Thermal
comfort- Ventilation and air quality-Air conditioning requirement- Visual perception-
Illumination requirement- Auditory requirement- Energy management options- -Air
conditioning systems- Energy conservation inpumps- Fans
and blowers- Refrigerating machines- Heat rejection equipment- Energy efficient motors-
Insulation.
UNIT - IV:
Energy Conservation Building Codes: Energy Efficiency, Energy Efficient Design (Achieving
Efficiency through design) Energy Conservation Building Codes (ECBC) Codes 2007
Learning Different Energy Simulation Techniques (Energy / Lighting) Advanced Energy
Efficient Standards and Systems HVAC Lighting Appliances and Equipment Building
Envelope Understanding and calculation of energy consumption of a House, office
building.
UNIT - V:
Concepts of Sustainable Building Social, Economic and Environmental aspects Different
types of Indian and International Rating Systems (GRIHA, LEED, IGBC, Eco Housing,

BREEAM, CASBEE, etc.) Text Books:

1. Kibert, C. “Sustainable Construction: Green Building Design and Delivery”, John Wiley
& Sons,
2005

2. Edward G Pita, “An Energy Approach- Air-conditioning Principles and

Systems”, Pearson Education, 2003.

Reference Books:
1. Colin Porteous, “The New Eco-Architecture”, Spon Press, 2002.

2. Energy Conservation Building Codes: www.bee-india.nic.in

3. Lever More G J, “Building Energy Management Systems”, E and FN Spon, London,

2000.

4. Ganesan T P, “Energy Conservation in Buildings”, ISTE Professional Center, Chennai,

1999.

5. John Littler and Randall Thomas, “Design with Energy: The Conservation and Use of
Energy in Buildings”, Cambridge University Press, 1984.

6. Nation Building Code (NBC 2005)

7. ECBC code book.

Course Outcomes: The students completing the course will have ability to

1. Understand the introducing the different concepts of sustainable design and

green building techniques

2. Know the impacts of lighting efficiency in energy efficient buildings

3. Indoor Environmental Quality Management
 4. Design the energy efficient building by understanding the Energy Conservation Building
Codes

5. Describe the concepts of sustainable building design.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M L H

CO-2 M L M H M L M

CO-3 L M M L L L M L M H

CO-4 M H H H

CO-5 H H H M M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE831OE) ENERGY EFFICIENT BUILDINGS

(Open Elective – III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To introduce the different concepts of sustainable design and green building techniques

 Impacts of lighting efficiency in energy efficient buildings

 To achieve energy efficient buildings concepts and how they may be synthesized
to best fit a specific construction project.

 To understand the Energy Conservation Building Codes

 To describe the concepts of sustainable design and green building techniques

UNIT - I:
Introduction: Life Cycle impacts of materials and products – sustainable design concepts
– strategies of Design for the Environment -The sun-earth relationship and the energy
balance on the earth’s surface, climate, wind – Solar radiation and solar temperature
– Sun shading and solar radiation on surfaces – Energy impact on the shape and
orientation of buildings – Thermal properties of building materials. Studying the
Nation Building Code (NBC 2005) code with respect to the Chapter 11 on
Sustainability.
UNIT - II:
Energy Efficient Buildings: Passive cooling and day lighting – Active solar and
photovoltaic- Building energy analysis methods- Building energy simulation- Building
energy efficiency standards- Lighting system design- Lighting economics and aesthetics-
Impacts of lighting efficiency – Energy audit and energy targeting- Technological
options for energy management.
UNIT - III:
Indoor Environmental Quality Management: Psychometric- Comfort conditions- Thermal
comfort- Ventilation and air quality-Air conditioning requirement- Visual perception-
Illumination requirement- Auditory requirement- Energy management options- -Air
conditioning systems- Energy conservation inpumps- Fans
and blowers- Refrigerating machines- Heat rejection equipment- Energy efficient motors-
Insulation.
UNIT - IV:
Energy Conservation Building Codes: Energy Efficiency, Energy Efficient Design (Achieving
Efficiency through design) Energy Conservation Building Codes (ECBC) Codes 2007
Learning Different Energy Simulation Techniques (Energy / Lighting) Advanced Energy
Efficient Standards and Systems HVAC Lighting Appliances and Equipment Building
Envelope Understanding and calculation of energy consumption of a House, office
building.
UNIT - V:
Concepts of Sustainable Building Social, Economic and Environmental aspects Different
types of Indian and International Rating Systems (GRIHA, LEED, IGBC, Eco Housing,

BREEAM, CASBEE, etc.) Text Books:

1. Kibert, C. “Sustainable Construction: Green Building Design and Delivery”, John
Wiley &
Sons,2005

2. Edward G Pita, “An Energy Approach- Air-conditioning Principles and

Systems”, Pearson Education, 2003.

Reference Books:
1. Colin Porteous, “The New Eco-Architecture”, Spon Press, 2002.

2. Energy Conservation Building Codes: www.bee-india.nic.in

3. Lever More G J, “Building Energy Management Systems”, E and FN Spon, London,

2000.

4. Ganesan T P, “Energy Conservation in Buildings”, ISTE Professional Center,

Chennai, 1999.

5. John Littler and Randall Thomas, “Design with Energy: The Conservation
and Use of Energy in Buildings”, Cambridge University Press, 1984.

6. Nation Building Code (NBC 2005)

7. ECBC code book.

Course Outcomes: The students completing the course will have ability to

1. Understand the introducing the different concepts of sustainable design and

green building techniques
2. Know the impacts of lighting efficiency in energy efficient buildings

3. Indoor Environmental Quality Management

 4. Design the energy efficient building by understanding the Energy Conservation Building
Codes

5. Describe the concepts of sustainable building design.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M L H

CO-2 M L M H M L M

CO-3 L M M L L L M L M H

CO-4 M H H H

CO-5 H H H M M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE832OE) MULTI CRITERION DECISION MAKING

(Open Elective – III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To understand Linear Programming Nonlinear Programming and other methods

 To introduce Normalization approaches, cluster analysis.

 To understand the role of optimization and analyze data using various techniques.

 Group decision making algorithms,

 To understand the Taguchi methodology

UNIT - I:
Introduction to the course and role of optimization, data mining, MCDM methods in
sustainable and effective decision making, Linear Programming Nonlinear Programming
and other methods, Introduction to Fuzzy Logic, Membership development, Various
types of membership functions.
UNIT - II:
Normalization approaches: Rating method, Entropy method, Analytic Hierarchy
Process, Fuzzy Analytic Hierarchy Process; MATLAB perspective; Weighting methods:
Constraint method, Case study, MATLAB perspective.
UNIT - III:
K-Means Cluster Analysis, Fuzzy Cluster Analysis, Artificial Neural Networks, Kohonen
Neural Networks, Cluster Validation Techniques, Case Study, SPSS perspective, MATLAB
perspective, Introduction to Discrete MCDM methods, Compromise Programming,
Co-Operative Game Theory, TOPSIS, PROMETHEE, Weighted average, Multi Attribute
Utility Theory, Analytic Hierarchy Process, Case Studies, MATLAB perspective.
UNIT - IV:
Role of uncertainty in decision making, Normalization techniques, Fuzzy TOPSIS,
MATLAB perspective, Spearman rank correlation coefficient, Kendall rank correlation
coefficient, Group decision making algorithms, SPSS perspective, MATLAB perspective,
Data Envelopment Analysis (DEA): Methodology, Drawbacks and remedial measures,
further topics in DEA.
UNIT - V:
Taguchi methodology: Description, ranking process, Ant colony optimization, Particle swarm
optimization, Expert systems, Web-based decision making, Geographic Information
System, MATLABperspective, Case Studies.

Text Book:
1. K. Srinivasa Raju, D. Nagesh Kumar, Multicriterion Analysis in Engineering and
Management, PHI Learning Private Limited, New Delhi, 2014.

Reference Books:
1. S. N. Sivanandam and S. N. Deepa, Principles of Soft Computing, Wiley, 2013.

2. Ross TJ, Fuzzy Logic with Engineering Applications, John Wiley and Sons, 2013.

Course Outcomes: The students completing the course will have ability to:

1. understand Linear Programming Nonlinear Programming and other methods

2. Normalization approaches, cluster analysis.

3. The role ofoptimization and analyze data using various techniques.

4. Group decision making algorithms

5. Understand the Taguchi methodology

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M H L

CO-2 H L M L H M M

CO-3 L M L L M H

CO-4 M H M H M

CO-5 H M M M H L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(CE833OE) ENVIRONMENTAL POLLUTION

(Open Elective – III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 Impart knowledge on aspects of air pollution & control and noise pollution.
 Impart concepts of treatment of waste water from industrial source.
 Differentiate the solid and hazardous waste based on characterization.
 Introduce sanitation methods essential for protection of community health.
 Provide basic knowledge on sustainable development.

UNIT – I:
Air Pollution: Air pollution Control Methods–Particulate control devices – Methods of
Controlling Gaseous Emissions – Air quality standards. Noise Pollution: Noise
standards, Measurement and control methods Reducing residential and industrial noise
– ISO: 14000.

UNIT –II:

Industrial waste water Management: Strategies for pollution control – Volume and Strength
reduction – Neutralization – Equalizatio n – Proportioning – Common Effluent
Treatment Plants – Recirculation of industrial wastes – Effluent standards.

UNIT – III:

Solid Waste Management: solid waste characteristics – basics of on-site handling and collection
– separation and processing – Incineration- Composting-Solid waste disposal methods –
fundamentals of Land filling. Hazardous Waste: Characterization – Nuclear waste –
Biomedical wastes – Electronic wastes – Chemical wastes – Treatment and
management of hazardous waste-Disposal and Control methods.

UNIT–IV:

Environmental Sanitation: Environmental Sanitation Methods for Hostels and Hotels, Hospitals,
Swimming pools and public bathing places, social gatherings (meals and fares), Schools
and Institutions, Rural Sanitation-low cost waste disposal methods.
UNIT – V:

Sustainable Development: Definition- elements of sustainable developments-Indicators of

sustainable development- Sustainability Strategies- Barriers to Sustainability–
Industrialization and sustainable development – Cleaner production in achieving
sustainability- sustainable development.

Text Books:
1. Peavy, H. S., Rowe, D. R, Tchobanoglous, “Environmental Engineering”, Mc-
Graw Hill International Editions, New York 1985.

2. J. G. Henry and G.W. Heinke, “Environmental Science and Engineering”, Pearson

Education.

Reference Books:

1. G. L. Karia and R.A. Christian, “Waste water treatment- concepts and design
approach”, Prentice Hall of India

2. M. N. Rao and H. V. N. Rao, “Air pollution”, Tata McGraw Hill Company.

3. Ruth F. “Weiner and Robin Matthews Environmental Engineering”, 4th Edition

Elsevier, 2003.K. V. S. G. Murali Krishna, “Air Pollution and Control” by, Kousal &
Co. Publ.

Course Outcomes: At the end of the course, the students will be able to:

1. Understand the fundamentals of solid waste management, practices adopted in his

town/village and its importance in keeping the health of the city.

2. Identify the air pollutant control devices and have knowledge on the NAAQ
standards and air emission standards.

3. Differentiate the treatment techniques used for sewage and industrial wastewater
treatment.

4. Inventing the methods of environmental sanitation and the management of

community facilities without spread of epidemics.

5. Appreciate the importance of sustainable development while planning a project or

executing an activity

CO-PO-PSO Mapping:
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

PO-10

PO-11

PO-12

PSO-1

PSO-2
CO-1 M M H

CO-2 H L M L H M H

CO-3 L M M L H L M

CO-4 M H M H M H

CO-5 H M M M M H

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE831OE) CHARGING INFRASTRUCTURE FOR ELECTRIC

VEHICLES
(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3

Prerequisite: None, Interest in Electric Vehicles.

Course Objectives:
 Gain understanding of the various components involved in an electric vehicle charging
system.

 Comprehend the different types of electric vehicle chargers.

 To know the applicable standards governing their design and operation.

 Interpret the diverse communication protocols utilized in electric vehicle charging

systems

 To stay familiar with the latest trends in this evolving field.

UNIT-I:
Introduction to EV charging:
Electric Vehicle Charging; Charging Modes; Electric Vehicle Supply Equipment (EVSE):
Types, Components of EV Battery Chargers; Challenges in Electric Vehicle Charging.
UNIT-II:
Charger sizing and standards:
Charger Classification; Slow Charging and Fast Charging; DC Charging and AC
Charging; Selection and Sizing of Chargers: Charger Connectors and Cables;
Charging Standards: Connectors, Supply Equipment; EMI/EMC; Testing Methods for
Chargers and EVSE
UNIT-III:
EV charger communications protocols:
Open Charge Point Protocol (OCPP); Open System Interconnection Layer Model
(OSI); Adapted PWM Signal based Low-level Communication; PLC based High-level
Communication; CAN Communication; Billing and Authentication
UNIT-IV:
Public charging infrastructure:
Location, Planning and Implementation of Public Charging Stations; Components;
Selection and Sizing HT/LT Equipment & Cables; Protection; Safety Standards: Policy
and Regulatory Aspects; EVCharging Station and their Business Models; Economic
Aspects; Major Challenges
UNIT-V:
Future frontiers in EV charging:
Bulk Charging; Battery Swapping; Wireless Charging; EVs as Distributed Storage
Resources: Grid to Vehicle (G2V) and Vehicle to Grid (V2G), V2X Concept, Integration of
Charging Station with Renewable Sources and its Impact on the Grid

Text books:
1. Iqbal Husain, “Electric and Hybrid Vehicles: Design Fundamentals”, 3rd
Edition, CRC Press, 2021

2. Code of Practice for Electric Vehicle Charging Equipment Installation, 4th

Edition, IET, 2020.

Reference books:
1. Sheldon S. Williamson, “Energy Management Strategies for Electric and Plug-in Hybrid

2. Electric Vehicles”, 1st Edition, Springer, 2013.

3. Tom Denton, “Automotive Electrical and Electronic Systems”, 5th Edition, Routledge,
2018.

4. Wolfhard Lawrenz, “CAN System Engineering: From Theory to Practical

Applications”, Springer, 2nd Edition, 2013.

5. https://www.udemy.com/course/charging-infrastructure-for-electric-vehicles

Course Outcomes: At the end of this course, students will be able to:
1. Understand the various components of Electric vehicle charging system

2. Comprehend the different types of Electric vehicle chargers.

3. know the applicable standards governing their design and operation

4. Interpret the various communication protocols and

5. Become familiar with recent trends in Electric vehicle charging

CO-PO-PSO Mapping:
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M H
H L M M M H H L L
CO-2 M M
M M H M M L M H H
CO-3 H L
M M H L M M M L M
CO-4 M M
L L M H H L H L H
CO-5 M
M H L M H M M L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EE832OE) RELIABILITY ENGINEERING

(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisite: Mathematics-III (Laplace Transforms, Numerical Methods and Complex
variables)

Course Objectives:
 To introduce the basic concepts of reliability.

 To know about various models of reliability

 To analyze reliability of various systems

 To analyze various evaluation techniques of reliability.

 To introduce techniques of frequency and duration for reliability evaluation of

repairable systems

UNIT-I:
Basic Probability Theory: Elements of probability, probability distributions, Random
variables, Density and Distribution functions- Mathematical expected – variance and
standard deviation BINOMIALDISTRIBUTION: Concepts, properties, engineering
applications.
UNIT-II:
Network Modeling and Evaluation of Simple Systems: Basic concepts- Evaluation of network
Reliability / Unreliability - Series systems, Parallel systems - Series-Parallel systems-
Partially redundant systems- Examples.

Network Modeling and Evaluation of Complex Systems: Conditional probability method- tie
set, Cut-set approach- Event tree and reduced event tree methods- Relationships
between tie and cut- sets- Examples.

UNIT-III:
Probability Distributions in Reliability Evaluation: Distribution concepts, Terminology of
distributions, General reliability functions, Evaluation of the reliability functions,
shape of reliability functions –Poisson distribution – normal distribution, exponential
distribution, Weibull distribution.
Network Reliability Evaluation Using Probability Distributions : Reliability Evaluation of Series
systems, Parallel systems – Partially redundant systems- determination of reliability
measure- MTTF for series and parallel systems – Examples.

UNIT-IV:
Discrete Markov Chains: Basic concepts- Stochastic transitional probability matrix- time
dependent probability evaluation- Limiting State Probability evaluation- Absorbing states
– Application.
Continuous Markov Processes: Modeling concepts- State space diagrams- Unreliability
evaluation of single and two component repairable systems
UNIT-V:
Frequency and Duration Techniques: Frequency and duration concepts, application to multi
state problems, Frequency balance approach.

Approximate System Reliability Evaluation: Series systems – Parallel systems- Network

reduction techniques- Cut set approach- Common mode failures modeling and
evaluation techniques- Examples.

Text books:
1. Roy Billinton and Ronald N Allan, Reliability Evaluation of Engineering
Systems, Plenum Press.

2. E. Balagurusamy, Reliability Engineering by Tata McGraw-Hill Publishing Company

Limited

Reference books:
1. Reliability Engineering: Theory and Practice by Alessandro Birolini, Springer
Publications.

2. An Introduction to Reliability and Maintainability Engineering by Charles

Ebeling, TMH Publications.

3. Reliability Engineering by Elsayed A. Elsayed, Prentice Hall Publications.

Course Outcomes: At the end of this course, students will be able to:

1. Model various systems applying reliability networks

2. Analyze reliability of various systems

3. Analyze various evaluation techniques of reliability

 4. Estimate the limiting state probabilities of repairable systems

5. Apply various mathematical models for evaluating reliability of irreparable systems

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 ML
M H L H M H H L M
CO-2 MM
H L M M M L L L H M
CO-3 L M
M M L M L M M L H
CO-4 H L
H L M M M L M L H
CO-5 MM
M M L M H M H M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(ME831OE) ELEMENTS OF ELECTRIC AND HYBRID VEHICLES
(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives
 Explain the history of Electric vehicles and development

 Discuss the Social and environmental importance of hybrid and electric

vehicles, impact ofmodern drive-trains on energy supplies

 Explore to basic concept of electric traction, Configuration and

control of DC Motor drives,Configuration and control of Induction Motor
drives etc.

 Analyse the Fuel Cell based energy storage and Super Capacitor based energy storage
etc.

 Explore to types of Driving Cycles, Range modelling for Battery

Electric Vehicle, Hybrid (ICE & others) etc.

UNIT- I:

Introduction to Electric Vehicle: History of Electric Vehicles, Development towards

21st Century, Types of Electric Vehicles in use today – Battery Electric Vehicle,
Hybrid (ICE & others), Fuel Cell EV, Solar Powered Vehicles. Motion and
Dynamic Equations of the Electric Vehicles: various forces actingon the Vehicle
in static and dynamic conditions.

UNIT- II:
Introduction to Hybrid and Electric Vehicles: Social and environmental importance
of hybrid and electric vehicles, impact of modern drive-trains on energy
supplies. Hybrid Electric Drive-trains: Basic concept of hybrid traction,
introduction to various hybrid Drive-train topologies, power flow control in
hybrid drive-train topologies, fuel efficiency analysis

UNIT- III:

Introduction to Electric Drive Trains: Basic concept of electric traction, introduction

to various electric drive train topologies, power flow control in electric drive-
train topologies, fuel efficiency analysis. Electric Propulsion unit: Introduction
to electric components used
in hybrid and electric vehicles, Configuration and control of DC Motor drives,
Configuration and control of Induction Motor drives, configuration and control
of Permanent Magnet Motor drives, Configuration and control of Switch
Reluctance Motor drives, drive system efficiency.

UNIT- IV:

Types of Storage Systems: Introduction to Energy Storage Requirements in Hybrid

and Electric Vehicles, Battery based energy storage and its analysis, Fuel Cell
based energy storage and its analysis, Super Capacitor based energy storage
and its analysis, Flywheel based energy storage and its analysis, Hybridization
of different energy storage devices. Sizing the drive system: Matching the
electric machine and the internal combustion engine (ICE), Sizing the propulsion
motor, sizing the power electronics, selecting the energy storage technology,
Calculation for the rating.

UNIT- V:

Modelling of Hybrid Electric Vehicle Range: Driving Cycles, Types of Driving

Cycles, Range modelling for Battery Electric Vehicle, Hybrid (ICE & others), Fuel
Cell EV, Solar Powered Vehicles. Case study of 2-wheeler, 3 wheeler and 4
wheeler vehicles.

Text Books
1. James Larminie, J. Lowry, “Electric Vehicle Technology Explained”, John
Wiley & Sons Ltd.2003.

2. M. Ehsani, Y. Gao, S. E. Gay and A. Emadi, “Modern Electric, Hybrid

Electric, and Fuel Cell Vehicles: Fundamentals, Theory, and Design”, CRC
Press, 2004.

Reference Books
1. S. Onori, L. Serrao and G. Rizzoni, “Hybrid Electric Vehicles: Energy
Management Strategies”, Springer, 2016.

2. Iqbal Hussein, “Electric and Hybrid Vehicles: Design Fundamentals”, CRC Press,
2010.

Course Outcomes: At the end of the course student will be able to

1. Choose the appropriate source of energy for the hybrid electric vehicle based on
driving cycle.

2. Analyze the power and energy need of the various hybrid electric vehicle and
Measure and Estimate the energy consumption of the Hybrid Vehicles
 3. Evaluate energy efficiency of the vehicle for its drive trains.

4. Elaborate the types of storage systems such as battery based, fuel cell based etc.

5. Explain the types of Driving Cycles, Fuel Cell EV, Solar Powered Vehicles.

CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L H
CO-2 L H
CO-3 M
CO-4 M M
CO-5 L M

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(ME832OE)ENTREPRENEURSHIP DEVELOPMENT
(Open Elective -III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course objectives:
 To get knowledge about government plans and programs.

 To provide training to operate a business.

 To encourage self-employment tendencies.

 To develop managerial skills

 To know the availability of resources.

UNIT I
Entrepreneurship Entrepreneur – Types of Entrepreneurs – Difference between
Entrepreneur and Intrapreneur Entrepreneurship in Economic Growth, Factors
Affecting Entrepreneurial Growth.

UNIT II
Motivation Major Motives Influencing an Entrepreneur – Achievement
Motivation Training, Self Rating, Business Game, Thematic Apperception
Test – Stress Management, Entrepreneurship Development Programs –
Need, Objectives.

UNIT III
Business Small Enterprises – Definition, Classification – Characteristics,
Ownership Structures – Project Formulation – Steps involved in setting up a
Business – Identifying, selecting a Good Business opportunity, Market Survey
and Research, Techno Economic Feasibility Assessment – Preparation of
Preliminary Project Reports – Project Appraisal – Sources of Information –
Classification of Needs and Agencies.

UNIT IV
Financing and Accounting: Need – Sources of Finance, Term Loans, Capital Structure,
Financial Institution, Management of working Capital, Costing, Break
Even Analysis, Network Analysis Techniques of PERT / CPM – Taxation
– Income Tax,
 Excise Duty – Sales Tax.

UNIT V
Support to Entrepreneurs Sickness in small Business – Concept, Magnitude,
Causes and Consequences, Corrective Measures – Government Policy for
Small Scale Enterprises – Growth Strategies in small industry – Expansion,
Diversification, Joint Venture, Merger and Sub Contracting

Text books:
1. S.S. Khanka, “Entrepreneurial Development” S. Chand & Co. Ltd., 2020.

2. Kuratko & Hodgetts, “Entrepreneurship – Theory, process and

practice”, Thomson learning 6thedition.

Reference books:
1. Hisrich R D, Peters M P, Dean Shepherd, “Entrepreneurship” 12th Edition
McGraw-Hill.

2. Mathew J Manimala,” Entrepreneurship theory at cross roads:

paradigms and praxis” Dreamtech, 2nd edition 2006.

3. Rabindra N. Kanungo, “Entrepreneurship and innovation: Models

for Development”, Sage Publications, 1998.

4. EDII “Faulty and External Experts – A Hand Book for New

Entrepreneurs Publishers: Entrepreneurship Development”, Institute of
India.

Course Outcomes: Upon completion of the course, students will be able to

1. Identify the factors affecting entrepreneurial growth.

2. Understand various programs supporting entrepreneurship.

3. Write preliminary project report.

4. Estimate the finances for the project.

5. Appraise and avail support rendered by the Government and other Appropriate
Agencies

CO-PO-PSO Mapping:
 CO-5

CO-4

CO-3

CO-2

CO-1
PO-1

L
PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

PO-10

LOW
H-HIGH M-MODERATE L-
PO-11

PO-12

PSO-1

PSO-2

M
L

L
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC831OE) MEASURING INSTRUMENTS

(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:
 To provide basic knowledge in transduction principles, sensors and transducer
technology and measurement systems.

 To provide better familiarity with the concepts of Sensors and Measurements.

 To provide the knowledge of various measurement methods of physical

parameters like velocity, acceleration.

 To provide the knowledge of svarious measurements methods of physical

measurements like force, pressure.

 To provide the basic knowledge on density & viscosity measurements.

UNIT-I
Introduction to measurements: Physical measurement, Forms and methods of measurements,
Measurement errors, Statistical analysis of measurement data, Probability of errors,
limiting errors, Standards, Definition of standard units, international standards, Primary
standards, Secondary standards, Working standards, Voltage standard, Resistance
standard, Current standard, Capacitance standard, Time and frequency standards.
UNIT-II
Passive Sensors Resistive Sensors: Potentiometers, Strain Gages, Resistive Temperature
Detectors (RTDs), Thermistors, Light-dependent Resistors (LDRs), Resistive
Hygrometers, Capacitive Sensors: Variable capacitor, Differential capacitor,
Inductive Sensors: Reluctance variation sensors, Eddy current sensors.
UNIT - III
Metrology: Measurement of length – Plainness – Area – Diameter – Roughness – Angle –
Comparators – Gauge Blocks, Optical Methods for length and distance
measurements. Velocity and Acceleration Measurement: Relative velocity – Translational
and Rotational velocity measurements – Revolution counters and Timers - Magnetic
and Photoelectric pulse counting
 stroboscopic methods, Accelerometers- different types, Gyroscopes-applications.
UNIT - IV
Force and Pressure Measurement: Gyroscopic Force Measurement – Vibrating wire Force
transducer. Basics of Pressure measurement –Manometer types – Force-Balance and
Vibrating Cylinder Transducers – High- and Low-Pressure measurement
UNIT - V
Flow: Density and Viscosity Measurements: Flow Meters- Head type, Area type (Rota
meter), electromagnetic type, Positive displacement type, Density measurements – Strain
Gauge load cell method – Buoyancy method. Units of Viscosity, two float viscorator –
Industrial consistency meter

Text books:
1. Measurement Systems – Applications and Design – by Doeblin E.O., 4/e,
McGraw HillInternational, 1990.

2. Principles of Industrial Instrumentation – Patranabis D. TMH. End edition 1997.

Reference books:
1. Sensor Technology Hand Book – Jon Wilson, Newne 2004.

2. Instrument Transducers – An Introduction to their Performance and design – by

Herman K.P.Neubrat, Oxford University Press.

3. Measurement system: Applications and Design – by

E.O. Doeblin, McGraw Hill Publications.

4. Electronic Instrumentation by H.S. Kalsi.

Course Outcomes: Upon Completion of this course the student is

1. Able to identify suitable sensors and transducers for real time applications.

2. Able to translate theoretical concepts into working models.

3. Able to understand the basics of measuring devices and use them in relevant situation.

4. Able to understand the knowledge of various measurements methods of physical

measurements like force, pressure.

5. Able to understand the basic knowledge on density & viscosity measurements

6. CO-PO-PSO Mapping:

PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 L L L L L L
CO-2 M M M L L L
CO-3 L L L L L L
CO-4 H M L L L L L L
CO-5 M L L L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC832OE) COMMUNICATION TECHNOLOGIES

(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:

 To give an overview of Source-Destination communication.

 To provide the different modes of communication technologies like wireless and

cellular mobile networks.

 To make familiar with the generations of communications like 1G, 2G, 3G, 4G and
5G.

 To develop an understanding of free-space optical communication concepts and

technologies.

 To give brief explanation on security of network and its management.

UNIT - I:

Information Theory: Shanon Capacity, Multimedia Data, Data Processing, Boolean Logics,
Information Content, Entropy, Source Coding, Channel Coding, Modulation
Schemes, Internet.
UNIT - II:

Wireless Communication Technologies: WLAN, Wifi, Bluetooth, Other Wireless PAN

And WAN Technologies, Satellite Communications, Broadcast Services.

UNIT - III:

Cellular Mobile Networks: GSM(2G), UMTS (3G), LTE(4G), 5G Mobile Networks,

Mobile Network Planning Aspects.

UNIT - IV:

Free Space Optical Communications: Optical Fiber, FTTC, FTTH, FTTBS, Free Space
Optical Link, Channel Model with Different Factors, Deep Space Optical
Communications.

UNIT - V:

Network Security and Management: Symmetrical Encryption, Asymmetrical Encryption,

Authentication, Hash-Value, Integrity Check, Telecommunications Management Network,
SNMP,Functionalities of Network Management, Trends and Future Development.
Text books:
1. Shun-Ping Chen, “Fundamentals of Information and Communication Technologies”
2020

2. B.P. Lathi, “Communication systems”- BS Publications, 2006.

Reference books:
1. Simon Haykin, John Wiley “Digital Communications” 2005.

2. Herbert Taub, Donald L Schilling Gautham Saha “Principles of Communication

systems” 3rd edition McGraw-Hill 2008.

Course Outcomes: Upon completing this course, the student will be able to

1. Understand the information theory and its coding styles.

2. Acquire knowledge on satellite communication and broadcasting services.

3. Know GSM, LTE and 5G mobile networks.

4. Analyze design and evaluate free space optical links and models under various
conditions and applications.

5. Know about network security through encryption and decryption.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
L L L L L L L
CO-2
M M M L L L L
CO-3
L L L L L L L
CO-4
L L L L L L
CO-5
L L L L L

H-HIGH M-MODERATE L-LOW

 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(EC833OE) FUNDAMENTALS OF SOCIAL NETWORKS

(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Course Objectives:

 To give overview on social networks.

 To make social media, information networks and world wide web concepts more
familiar.

 To provide knowledge on social network ties.

 To provide knowledge on power laws related to information networks.

 To provide knowledge on small world phenomenon.

UNIT - I:
Introduction to social networks: The Empirical Study of Social Networks, Interviews and
Questionnaires, Direct Observation, Data from Archival or Third-Party Records,
Affiliation Networks, The Small-World Experiment.
UNIT - II:
Graph theory and Social Networks: Basic definitions, Paths and Connectivity, The strength of
weak ties, Tie Strength and Network Structure in Large-Scale Data, Tie strength, social
media, passive engagement.
UNIT - III:
Information networks and World Wide Web: The World Wide Web, Information Networks,
Hypertext, and Associative Memory, the emergence of web 2.0, Searching the Web: The
Problem of Ranking Link Analysis using Hubs and Authorities.
UNIT - IV:
Power Laws and Rich-Get-Richer Phenomena: Popularity as a Network Phenomenon,
Power Laws, Rich-Get-Richer Models, The Unpredictability of Rich-Get-Richer Effects,
The Long Tail, The Effect of Search Tools and Recommendation Systems.
UNIT - V:
The Small-World Phenomenon: Six Degrees of Separation, Structure and Randomness,
Decentralized Search, Modeling the Process of Decentralized Search, Advanced
Material: Analysis of Decentralized Search.

Text books:

361
1. M. E. J. Newman “Networks an introduction” Oxford University Press 2010.

362
 2. Networks, Crowds and Markets by David Easley and Jon Kleinberg, Cambridge
University Press, 2010.

Reference books:
1. Social and Economic Networks by Matthew O. Jackson, Princeton University Press,
2010.

2. Maksim Tsvetovat and Alexander Kouznetsov. “Social Network Analysis for

Startups”. O’Reilly Media, 2011.

Course outcomes: upon completing this course the students will be able to
1. Understand concepts like small-world experiment and snowball sampling related
to social networks.
2. Get knowledge on ties, weak ties and their strength.
3. Know about structure of the web, modern web search, link analysis using hubs.

4. Acquire knowledge on power laws and analysis of Rich-get-Richer phenomena.

5. Understand the concepts of decentralized search.

CO-PO-PSO Mapping PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1
L L L L L
CO-2
L L L L L H
CO-3
L L L L L L L
CO-4
L L L L L L
CO-5
L L L L L H L

H-HIGH M-MODERATE L-LOW

363
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(CS831OE) ALGORITHMS DESIGN AND ANALYSIS
(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:
Basic Knowledge on Integration, Differentiation, Laplace Transforms and Intermediate
Physics.
Course Objectives:
The objective of this course is to provide:
 Introduces the notations for analysis of the performance of algorithms and the
data structure of disjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking,
dynamic programming, greedy, branch and bound methods) and mention
problems for which each technique is appropriate
 Describes how to evaluate and compare different algorithms using worst-,
average-, and bestcase analysis.
 Synthesize efficient algorithms in common engineering design solutions
 Explains the difference between tractable and intractable problems, and
introduces the problems that are P, NP and NP complete.
UNIT-I:
Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-
Space complexity, Time complexity, Asymptotic Notations: Big oh notation, Omega
notation and Theta notation.
Divide and conquer: General method, Applications: Binary search, Quick sort, Merge sort,
Strassen’s matrix multiplication.
UNIT-II:
Disjoint Sets: Disjoint set operations, union and find algorithms.
Basic Traversal and Search Techniques: Connected components, Bi connected components.
Greedy method: General method, Applications: Job sequencing with deadlines, Knapsack
problem, Minimum cost spanning trees: Prim’s Algorithm, Kruskal’s Algorithm.
UNIT-III:
Dynamic Programming: General method, applications: Optimal binary search tree, 0/1
knapsack problem, All pairs shortest path problem, Traveling salesperson problem.
UNIT-IV:
Backtracking: General method, Applications: 8-queen’s problem, Sum of subsets problem,
Graph coloring.
Branch and Bound: General method, 0/1 knapsack problem: LC Branch and Bound
364
solution, FIFO

365
Branch and Bound solution.
UNIT-V:
NP-Hard and NP-Complete problems: Deterministic and Non-deterministic algorithms, NP-
Hard and NP-Complete classes, Node cover Decision Problem.

Text Book:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and
Rajasekharan, University press, 1998.

Reference Books:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.

2. Introduction to Algorithms, second edition, T. H. Cormen, C.E. Leiserson, R. L.

Rivest, and C. Stein, PHI Pvt. Ltd./ Pearson Education.

3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T. Goodrich and
R.Tamassia, John Wiley and sons.

Course Outcomes:
Upon successful completion of the course, the student will be able to,

1. Acquire the knowledge of algorithm analysis and its notations that are applied on
the problems solved by divide and conquer paradigm

2. Apply the major graph algorithms for model engineering problems and knowledge
of the greedy paradigm

3. Apply the dynamic programming paradigm and recite algorithms that employ
dynamic programming paradigm

4. Apply the concept of back tracking, branch and bound paradigm for real time problems

5. Analyse the complexity of problems and differentiate that in term of P and NP

Problems.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M L M M H M

CO-2 H M L M M H M

CO-3 M M L M M H M

CO-4 M M L M M H M

CO-5 M M L L L

366
 H-HIGH M-MODERATE L-LOW

367
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(CS832OE) DATA ANALYTICS
(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:
A course on “Database Management Systems”.
Knowledge of probability and statistics.

Course Objectives:
The objectives of this course are to provide:
 To explore the fundamental concepts of data analytics.
 To understand different data modelling techniques
 To learn the principles and methods of statistical analysis
 Discover interesting patterns, analyze supervised and unsupervised models and
estimate the accuracy of the algorithms.
 To understand the various search methods and visualization techniques.

UNIT-I:
Data Management: Design Data Architecture and manage the data for analysis, understand
various sources of Data like Sensors. Data Management, Data Quality(noise, outliers,
missing values, duplicate data) and Data Preprocessing.

UNIT-II:
Data Analytics: Introduction to Analytics, Introduction to Tools and Environment, Application
of Modeling in Business, Databases & Types of Data and Variables, Data Modeling
Techniques, Missing Imputations etc. Need for Business Modeling

UNIT-III:
Regression – Least Square Estimation, Variable Rationalization, and Model Building.
Logistic Regression: Introduction, Types of LR, Confusion Matrix, Analytics applications to
various Business Domains.

UNIT-IV:
Object Segmentation: Regression Vs Segmentation – Supervised and Unsupervised Learning,
Tree Building – Regression, Classification, Overfitting, Pruning and Complexity, Multiple
Decision Trees etc. Time Series Methods: Measures of Forecast Accuracy, ETL approach,
Analyze for prediction.

UNIT-V:
Data Visualization: Pixel-Oriented Visualization Techniques, Geometric Projection
Visualization Techniques, Hierarchical Visualization Techniques, Visualizing Complex Data

368
and Relations.

369
Text Books:
Data Mining Concepts and Techniques, Han, Kamber, 3rd Edition, Morgan Kaufmann

Publishers. Introduction to Data Mining, Tan, Steinbach and Kumar, Addision Wisley, 2006.

Reference Books:
1. Student’s Handbook for Associate Analytics – II, III.
2. Data Mining Analysis and Concepts, M. Zaki and W. Meira.
3. Mining of Massive Datasets, Jure Leskovec Stanford Univ. Anand Rajaraman
Milliway

Labs Jeffrey D Ullman Stanford Univ.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:

1. Understand various Data Sources and Design Data Architecture.

2. Carry out data analysis/statistical analysis.
3. Understand the impact of data analytics for business decisions and strategy.
4. Understand the role of Segmentation and Regression.
5. To carry out standard data visualization and formal inference procedures.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M M

CO-2 M H H M M M H

CO-3 M M H M H M H H

CO-4 L M H M H M M

CO-5 L M M M H M H

H-HIGH M-MODERATE L-LOW

370
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(IT831OE) BIG DATA TECHNOLOGIES

(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:

Basic knowledge of programming, databases, and distributed computing concepts.

Course Objectives:
The objectives of this course are to provide:
 Understand the fundamentals of big data.

 Learn Hadoop architecture and ecosystem.

 Explore data ingestion and storage tools.

 Understand data processing frameworks.

 Learn NoSQL databases and their applications.

UNIT – I
Getting an Overview of Big Data: Big Data, History of Data Management – Evolution of Big
Data, Structuring Big Data, Elements of Big Data, Big Data Analytics, Careers in Big Data,
Future of Big Data Technologies for Handling Big Data: Distributed and Parallel Computing
for Big Data, Introducing Hadoop, Cloud Computing and Big Data, In‐Memory
Computing Technology for Big Data.
UNIT – II
Understanding Hadoop Ecosystem Hadoop Ecosystem: Hadoop Distributed File System, Map
Reduce , Hadoop YARN, Hbase , Hive, Pig and Pig Latin, Sqoop, ZooKeeper, Flume,
Oozie
Understanding MapReduce Fundamentals and HBase: The MapReduce Framework, Techniques
to Optimize MapReduce Jobs, Uses of MapReduce, Role of HBase in Big Data Processing
UNIT - III
Exploring Hive: Introducing Hive, Getting Started with Hive, Data Types in Hive, Built‐In
Functions in Hive, Hive DDL, Data Manipulation in Hive, Data Retrieval Queries, Using
JOINS in Hive
Analyzing Data with Pig: Introducing Pig, Running Pig, Getting Started with Pig Latin,
Working with Operators in Pig, Working with Functions in Pig
UNIT - IV
Using Oozie :Introducing Oozie, Installing and Configuring Oozie, Understanding the Oozie
371
Workflow, Oozie Coordinator, Oozie Bundle, Oozie Parameterization with EL, Oozie Job
Execution Model, Accessing Oozie, Oozie SLA

372
NoSQL Data Management : Introduction to NoSQL, Aggregate Data Models, Key Value Data
Model, Document Databases, Relationships, Graph Databases, Schema‐Less
Databases, Materialized Views, Distribution Models, Sharding, MapReduce
Partitioning and Combining, Composing MapReduce Calculations
UNIT – V
ZooKeeper: Installing and Running ZooKeeper, An Example, Group Membership in
ZooKeeper, Creating the Group, Joining a Group, Listing Members in a Group, The
ZooKeeper Service, Data R22 B.Tech. IT Syllabus JNTU Hyderabad Page 153 of 154
Model, Operations, Implementation, Consistency, Sessions, Building Applications with
ZooKeeper, A Configuration, Service, The Resilient ZooKeeper Application, A Lock Service,
More Distributed Data Structures and Protocols, ZooKeeper in Production
Sqoop: Getting Sqoop, Sqoop Connectors, A Sample Import, Generated Code, Imports: A
Deeper Look, Working with Imported Data, Importing Large Objects, Performing an
Export, Exports: A Deeper Look.

Course Outcomes:
1. Understand the core concepts of big data technologies.

2. Gain proficiency in Hadoop and its ecosystem tools.

3. Implement data ingestion and storage techniques.

4. Develop expertise in data processing frameworks.

5. Build practical solutions for real-world problems.

Text Books:

1. Big data, blackbook, DreamTech Press, 2015

2. Hadoop: The Definitive Guide, Tom White, 3rd Edition, O'Reilly Media, 2012.

Reference Books:
1. Big Data Analytics, Seema Acharya, Subhashini Chellappan, Wiley 2015.
2. Simon Walkowiak, Big Data Analytics with R, Packt Publishing, ISBN: 9781786466457
3. Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for
Today’s Business, Michael Minelli, Michehe Chambers, 1st Edition, Ambiga Dhiraj, Wiley
CIO Series, 2013.
4. Big Data Analytics: Disruptive Technologies for Changing the Game, Arvind Sathi, 1st
Edition, IBM Corporation, 2012.

CO-PO-PSO Mapping:

373
 PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9
CO-1 M M L L H L M M

CO-2 M H M M M L M H

CO-3 L H H H M L M M

CO-4 M M H H M L M L

CO-5 M M L L H L L H

H-HIGH M-MODERATE L-LOW

374
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)
(IT832OE) DEVOPS
(Open Elective – III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3
Prerequisites:

 Software Engineering

 Software Project Management

Course Objectives:
The objectives of this course is to provide:

 Understand the skill sets and high-functioning teams involved in Agile, DevOps.

 Understand relatedmethods to reach a continuous delivery capability.

 Implement automated system update and DevOps lifecycle.

 Understand different project management and integration tools.

 Understand the usage of testing tools and deployment model

UNIT-I:
Introduction to DevOps: Introduction, Agile development model, DevOps and ITIL. DevOps
process and Continuous Delivery, Release management, Scrum, Kanban, delivery pipeline,
identifying bottlenecks. UNIT-II:

Software development models and DevOps: DevOps Lifecycle for Business Agility, DevOps, and
Continuous Testing. DevOps influence on Architecture: Introducing software architecture,
The monolithic scenario, Architecture rules of thumb, The separation of concerns,
Handling database migrations, Micro services and the data tier, DevOps, architecture, and
resilience.
UNIT-III:
Introduction to project management: The need for source code control, the history of source code
management, Roles and code, source code management system and migrations, shared
authentication, Hosted Git servers, Different Git server implementations, Docker
intermission, Gerrit, The pull request model, GitLab.
UNIT-IV:

Integrating the system: Build systems, Jenkins build server, Managing build dependencies,
Jenkins plugins, and file system layout. The host server, Build slaves, Software on the
host, Triggers, Job chaining and build pipelines, Build servers and infrastructure as code,

375
Building by dependency order, Build phases, Alternative build servers, Collating quality
measures.

376
UNIT-V:
Testing Tools and Deployment: Various types of testing, Automation of testing Pros and
cons, Selenium - Introduction, Selenium features, JavaScript testing, Testing backend
integration points, Test- driven development, REPL-driven development. Deployment
of the system: Deployment systems, Virtualization stacks, code execution at the client,
Puppet master and agents, Ansible, Deployment tools: Chef, Salt Stack and Docker.

Text Book:

1. Joakim Verona., Practical DevOps, Packt Publishing, 2016.

Reference Books:

1. Deepak Gaikwad, Viral Thakkar. DevOps Tools from Practitioner's Viewpoint.

Wiley publications.
2. Len Bass, Ingo Weber, Liming Zhu. DevOps: A Software Architect's
Perspective. Addison Wesley

Course Outcomes:

Upon the successful completion of this course, the student will be able to:

1. Understand the various components of DevOps environment.

2. Identify Software development models and architectures of DevOps

3. Understand the concepts of project management

4. Use different integration tools.

5. Select an appropriate testing tool and deployment model for project.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 H M M H

CO-2 M H H M M H

CO-3 M M M M M M H

CO-4 L M M M H M H

CO-5 L M M M H M H

H-HIGH M-MODERATE L-LOW

377
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM831OE) CHATBOTS
(Open Elective – III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3

Prerequisites: Basic knowledge on Programming Concepts

Course Objectives:
 Understand the Fundamentals of Chatbots Learn the basic definition, purpose, and
Functionality
of chatbots in various applications.
 Install and Use Node.js for Bot Development Learn how to install Node.js and use it as a
runtime for building chatbots.
 Implement Intent and Entity Recognition Learn how to design and configure intents
and entities for effective chatbot interactions.
 Understand Advanced Chatbot Design Principles Learn best practices
 Explore Various Chatbot Use Cases Study real-world applications of chatbots in different
communication modes and business models.
UNIT – I
Introduction to Chatbots:
Definition of chatbots, Journey of Chatbots, Rise of Chatbots, Messaging Platforms
UNIT – II
Setting Up the Developer Environment Bot frame work:
Local Installation, Installing NodeJS, Following the Development Pipeline, Storing
Messages in Database.
UNIT – III
Basics of Bot Building- Intents, Entities
UNIT – IV
Advanced Bot Building:
Design Principles, Showing Product Results, Saving Messages, Building Your Own Intent
Classifier
UNIT – V
Business and Monetization:
Analytics, Chatbot Use Cases- Modes of Communication- Business-to-Business (B2B), Chap
Business-to- Consumer(B2C) Consumer-to-Consumer(C2C) Business-to-Employee (B2E),
Employee-toEmployee (E2E), Chatbots by Industry Vertical
378
Text Book:

379
1. Rashid Khan, Anik Das, Build Better Chatbots: A Complete Guide to Getting Started
with Chatbots, Apress ,2018.

Reference Books:
1. Drexen Braxley, Chat GPT #1 Bible - 10 Books in 1: A Comprehensive Guide to AI:
Elevate
Your Daily Life, Increase Work Output, Secure Financial Gains, Foster Career Growth,
and Cultivate Modern Talents Paperback
2. D. Nardo Publications, ChatGPT Made Simple How Anyone Can Harness AI To
Streamline Their Work, Study & Everyday Tasks to Boost Productivity & Maintain
Competitive Edge by Mastering Prompt Engineering
3. Robert E. Miller, Prompt Engineering Bible Join and Master the AI Revolutions Profit
Online with GPT-4 & Plugins for Effortless Money Making!
4. Lucas Foster, Chat GPT Bible Developer and Coder Special Edition: Enhancing Coding
Productivity with AI-Assisted Conversations.

Course Outcomes:
Upon the successful completion of this course, the student will be able to:
1. Describe the evolution and historical journey of chatbots from rule-based systems to AI-
driven models.
2. Install and configure Node.js for building and running chatbot applications.
3. Optimize chatbot conversations by structuring intents and entities effectively.
4. Integrate chatbot functionalities with external databases and APIs for dynamic responses.
5. Explore industry-specific chatbot implementations and their monetization strategies.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 L L M L M M L

CO-2 M H L M L L M

CO-3 M L M L M L M

CO-4 M M L L M M H

CO-5 L M L L H L H

H-HIGH M-MODERATE L-LOW

380
 ANURAG ENGINEERING COLLEGE
(An Autonomous Institution)

(AM832OE) EVOLUTIONARY COMPUTING

(Open Elective-III)
IV Year B.Tech. CSE (AI & ML) - II Sem. L-T-P-C
3- 0 -0 -3

Prerequisites: Knowledge of algorithms

Course Objectives:
 To Introduce the concepts of evolutionary computing and various evolution
algorithms
 To familiarize students with genetic algorithms (GAs), genetic programming, and
evolutionary strategies.
 To explore various selection, mutation, and crossover techniques used in evolutionary
algorithms.
 To apply evolutionary computing techniques to real-world optimization problems.
 To analyzes and compare different evolutionary algorithms with traditional optimization
techniques.

UNIT - I

Optimization, Modelling, and Simulation Problems:Search Problems, Optimization Versus

Constraint Satisfaction

Evolutionary Computing:The Origins: The Main Evolutionary Computing Metaphor,

Brief History, The Inspiration from Biology, Evolutionary Computing.
Evolutionary Algorithm: Definition, Components of Evolutionary Algorithms, An
Evolutionary Cycle by Hand, Example Applications, The Operation of an Evolutionary
Algorithm, Natural Versus Artificial Evolution.
UNIT - II

Representation, Mutation, and Recombination:Representation and the Roles of

Variation Operators, Binary Representation, Integer Representation, Real-
Valued or Floating-Point Representation, Permutation Representation, Tree
Representation.

Fitness, Selection, and Population Management: Population Management Models, Parent

Selection, Survivor Selection, Selection Pressure, Multimodal Problems, Selection,
and the Need for Diversity
UNIT - III

Parameters and Parameter Tuning: Evolutionary Algorithm Parameters, EAs and EA Instances,
Designing Evolutionary Algorithms, The Tuning Problem, Algorithm Quality: Performance

381
and Robustness, Tuning Methods.
Parameter Control: Introduction, Examples of Changing Parameters, Classification of Control
Techniques, Examples of Varying EA Parameters.

382
UNIT – IV

Working with Evolutionary Algorithms: Working of EA, Performance Measures, Test

Problems for Experimental Comparisons.
Hybridization with Other Techniques: Memetic Algorithms: Motivation for Hybridizing EAs, A
Brief Introduction to Local Search, Structure of a Memetic Algorithm, Adaptive
Memetic Algorithms, Design Issues for Memetic Algorithms.
UNIT - V

Multiobjective Evolutionary Algorithms:

Multiobjective Optimization Problems, Dominance and Pareto Optimality,
EA Approaches to Multiobjective Optimization.
Constraint Handling: Two Main Types of Constraint Handling, Approaches to
Handling
Constraints

Text Book:
1. A. E. Eiben, J. E. Smith, Introduction to Evolutionary Computing, Second
Edition, Springer,2015.

Reference Books:
1. David E. Goldberg, "Genetic Algorithms in search, Optimization & Machine
Learning".
2. Neural Networks and Fuzzy Logic System by Bart Kosko, PHI Publications.

Course Outcomes:
1. Appraise the significance of evolutionary computing

2. Apply genetic operators and genetic programming for classification problems

3. Apply Hybridization of genetic algorithms with other techniques

4. Understand multi objective, interactive evolutionary algorithms

5. Gain knowledge on evolutionary computing techniques in various applications such
as artificial intelligence, robotics, and engineering design.

CO-PO-PSO Mapping:
PO-10

PO-11

PO-12

PSO-1

PSO-2
PO-1

PO-2

PO-3

PO-4

PO-5

PO-6

PO-7

PO-8

PO-9

CO-1 M M L L H L M M

CO-2 M H M M M L M H

CO-3 L H H H M L M M

383
CO-4 M M H H M L M L

CO-5 M M L L H L L H

H-HIGH M-MODERATE L-LOW

384