PSG COLLEGE OF TECHNOLOGY, COIMBATORE - 641 004

(Autonomous college affiliated to Anna University, Chennai)

2017 REGULATIONS OF TWO YEAR MSc DEGREE PROGRAMME

(For the batches of students admitted in 2017-2018 and subsequently under Choice Based Credit System)

NOTE: The regulations here under are subject to amendments as may be made by the Academic Council of the College
from time to time. Any or all such amendments will be effective from such date and to such batches of students
(including those already in the middle of the programme) as may be decided by the Academic Council.

1. a. PRELIMINARY DEFINITIONS AND NOMENCLATURE

In the following Regulations, unless the context otherwise requires
i. “Programme” means Degree Programme, that is MSc Degree Programme
ii. “Branch” means specialization or discipline of MSc Degree Programme, like
Applied Mathematics.
iii. “Course” means a theory or laboratory course that is normally studied in a
semester.

iv. “University” means Anna University, Chennai.

b. CONDITIONS FOR ADMISSION

i. Students for admission to the first semester of the M.Sc. degree examination of Anna
University, Chennai will be required to satisfy the eligibility qualification for admission
in section 3 infra or any other examination of any recognized University or authority
accepted by Anna University, Chennai as equivalent thereto. The students shall also
be required to satisfy all other conditions of admission thereto prescribed by the
University and Government of Tamil Nadu.

2. DURATION OF THE PROGRAMME

i. Minimum Duration: The programme will extend over a period of two academic years
leading to the Degree of Master of Science (MSc) of the University, an academic year
being divided into two semesters. Each semester shall normally consist of 90 working
days including examination days.

ii Maximum Duration: The student shall complete the programme in 2 years

(4 semesters) , but in any case not more than 4 years these durations are to be reckoned
from the commencement of the semester to which the student was first admitted to the
programme.

3. QUALIFICATIONS FOR ADMISSION

The eligible qualifications for admission to MSc Applied Mathematics degree programme are
listed below: The Eligible Qualification is subject to amendments as may be made by the
University from time to time.

MSc Degree
Full-time (FT)/
Department Programme Eligible Qualification for Admission
Part-time (PT)
offered
Applied
Mathematics a) B.Sc. (Mathematics / Mathematics with
Applied
and FT Computer Applications) (or)
Mathematics
Computational b) B.Sc. (Applied Science).
Sciences

96
4. STRUCTURE OF THE PROGRAMME
i. The course work of odd semesters will normally be conducted in odd semesters and that
of the even semesters only in even semesters

ii. Curriculum: The curriculum includes courses of study and detailed syllabi. The courses
of study and detailed syllabi of study include theory courses, electives, laboratory
courses, Mini-Project and Project Work as given in section 13 infra. The hours / week
listed in section 13 infra for each of the course refer to periods/week.

iii. Electives: Every student will be opt electives from the list of electives as given in section
13 infra in consultation with the Tutor, Programme Co-ordinator and the HoD. The
students shall study 2 electives spread over in second and third semester.

iv. Project Work: Every student shall undertake the Mini- Project Work & Seminar during
the semester vacation of second semester and evaluated during third semester and the
Project Work during the fourth semester The Project Work shall be undertaken in an
Industrial / Research Organization or in the College in consultation with the faculty guide
and the HoD. In case of Project Work at Industrial / Research organization, the same
shall be jointly supervised by a faculty guide and an expert from the organization.

v. Online courses: Students can register and earn credits for online courses approved by
department committee consisting of HoD, Programme coordinator and subject expert. A
candidate who completes online courses successfully to a maximum of 4 credits may
obtain exemption from studying one Open Elective / one Professional Elective and in such
case the credit points earned in those online courses will be included for calculation of
Cumulative Grade Point Average (CGPA). Such exemption is permitted only for one
elective course. The list of online courses is to be approved by Chairman Academic Council
on the recommendation of HoD at the beginning of a semester if necessary, subject to
ratification in the next Academic council meeting. Candidates may do an online course and
obtain certification between the second semester and the third semester. The Committee
will monitor the progress of the student and recommend the grade or evaluate the
candidate in 100% Continuous Assessment (CA) pattern, if necessary.

vi. Course Enrollment and Registration

a) Each student, on admission shall be assigned to a Tutor who shall advise and counsel
the student about the details of the academic programme and the choice of courses
considering the student‘s academic background and career objectives.
b) Each student on admission shall register for all the courses prescribed in the curriculum
in the student‘s first semester of study.
c) From second semester onwards, a student has the option to drop a maximum of two
theory courses except Professional Core Courses in a semester and a student has the
option to study additionally two theory courses which shall be from professional electives.
d) In case of a student dropping a course of study (other than professional core courses) in
one semester, he/she shall register for that course in the next given opportunity and earn
necessary attendance in that course exclusively to become eligible to appear for the
semester examination in that course.
e) The courses to be offered in a semester for candidates who need to reappear(as per 5
(v) infra) or having attendance shortage etc., will be decided by HoD..

f) After registering for a course, a student shall attend the classes, satisfy the attendance
requirements, earn Continuous Assessment marks and appear for the end semester
examinations.

97
 The enrollment for all the courses of the Semester II will commence ten working days
prior to the last working day of Semester I. The student shall confirm the enrollment by
registering for the courses within the first five working days after the commencement
of the Semester II.
The enrollment for the courses of the Semesters III and IV will commence ten working
days prior to the last working day of the preceding semester. The student shall enroll
for the courses with the guidance of the Tutor. If the student wishes, the student may
drop or add courses subject to eligibility within five working days after the
commencement of the concerned semester and complete the registration process
duly authorized by the Tutor.
vii Credit assignment: Each course is assigned certain number of credits based on the
following:
Contact Period per week Credits
1 Lecture Period 1
2 Tutorial Periods 1
2 Practical Periods(Laboratory 1
/ Project Work/ etc.)

The exact number of credits assigned to the different courses is shown in section 13.

viii Minimum Credits: For the award of the degree, the student shall earn the minimum
number of credits of 85 by passing the prescribed courses of study as shown in section
13 infra.

ix Medium of Instruction: The medium of instruction, examinations, project report etc.

shall be English.

5. REQUIREMENTS OF ATTENDANCE AND PROGRESS

i. A student will be qualified to appear for end semester examinations in a particular course
of a semester only if
a) he / she has satisfied the attendance requirements as per the norms given below:
Shall secure not less than 75% attendance in that course.

If a student secures attendance 65% or more but less than 75% in any course in
the current semester due to medical reasons (hospitalization / accident / specific
illness) or due to participation in the College / University / State / National /
International level Sports events with prior permission from the Chairman, Sports
Board and Head of the Department concerned, the student shall be given
exemption from the prescribed attendance requirement and the student shall be
permitted to appear for the end semester examination of that course.

b) his / her progress has been satisfactory and

c) his / her conduct has been satisfactory.

d) he/she has registered for examination

ii) A student shall normally be permitted to appear for End semester examination of the
course if the student has satisfied the attendance requirements (vide Clause 5(i) supra)
and has registered for examination in those courses of that semester by paying the
prescribed fee.
iii) a) Students who do not satisfy clause 5(i) supra will not be permitted to appear for the
End-semester Examination / Evaluation of that course. The student has to register and
redo that course in a subsequent semester when it is offered next, earn necessary
attendance and CA mark and appear for end semester examinations.

98
 b) If the total number of ―Redo‖ courses at the end of any even semester is more than
ten, the student will not be eligible to register for the next immediate odd and further
semester courses.
Such students will be permitted to register for those semester courses only when offered
next, subject to fulfillment of the above condition.
iv) A student who has already appeared for a course in a semester and passed the
examination is not entitled to reappear in the same course for improvement of letter
grades / marks.

6. DISCIPLINE
i Every student is required to observe disciplined and decorous behavior both inside and
outside the college not indulge in any activity which will tend to bring down the prestige
of the college. The Head of the institution shall constitute a disciplinary committee to
enquire into acts of indiscipline and notify the punishment.

ii If a student indulges in malpractice in any of the examination, he/she shall be liable for
punitive action as decided by th Board of Examiners

7. PROCEDURE FOR REJOINING THE PROGRAMME

A student who desires to rejoin the programme after a period of discontinuance or who upon
his/her own request is permitted by the authorities to repeat the study of any semester, may
join the semester which he/she is eligible or permitted to join, only at the time of its normal
commencement for a regular batch of students and after obtaining the approval from the
University and Commissioner of Technical education. No student will however be enrolled in
more than one semester at any time.

8. ASSESSMENT AND PASSING REQUIREMENTS

i. Assessment: The assessment will comprise of Final Examination (FE) and Continuous
Assessment (CA), carrying marks as specified in the scheme in section 13 infra. The CA
marks will be awarded on assessing the student continuously during the semester as per
guidelines 8(ix) infra. The assessment for theory courses with CA + FE components will
be done by relative grading system. The other courses will be assessed by absolute
grading system. However, for the purpose of reporting the performance of a student,
letter grades and grade points will be awarded as per grading norms stipulated in section
8(vi) infra.
ii. Final Examinations: Final examinations will normally be conducted during October /
November and during March / April of each year. Supplementary examinations may be
conducted at such times as may be decided by the college.
A student will be permitted to appear for the final semester examination in a course only if
he/she has completed the study of that course.

iii. Mini-Project & Seminar: Every student shall submit a report on Mini-Project Work on
dates announced by the department through the faculty guide to the HoD. If a student
fails to submit the report on Mini-Project Work on or before the specified date, he/she is
deemed to have failed in it.

The student shall also present seminars about the progress of the Mini-Project Work
during the appropriate semester. The seminars shall be presented before a review
committee constituted by the HoD.

The Mini-Project Work will be evaluated based on the seminars, report and a viva-voce
examination. The viva-voce examination will be carried out by a team of faculty appointed
by the HoD and the internal examiner.

99
 A student who fails in Mini-Project Work &Seminar shall register for redoing the same at
the beginning of a subsequent semester. However, the student will be allowed to enroll
for Project Work along with Mini-Project Work during the beginning of the subsequent
semester for satisfactory completion of both the courses.

iv. Project Work: Every student shall submit a report on Project Work on dates announced
by the Principal through the faculty guide to the HoD. If a student fails to submit the report
on Project Work on or before the specified date, he/she is deemed to have failed in it.

The student shall also present seminars about the progress of the Project Work during
the appropriate semester. The seminars shall be presented before a review committee
constituted by the HoD.

The Project Work will be evaluated based on the seminars, report and a viva-voce
examination. The viva-voce examination will be carried out by a team consisting of an
internal examiner, usually the supervisor, and an external examiner, appointed by the
Principal.

v. Laboratory Courses: Every laboratory course shall be evaluated based on conduct of

experiments / exercises / mini projects / development of software packages and report
submitted.

vi. Letter Grade and Grade Point: Each student, based on his / her performance, will be
awarded a final letter grade and grade point as given below for each course at the end of
each semester by following relative grading system and absolute grading system.

a. Relative Grading System

In this system, the grades are awarded to the students based on their performance
relative to others in Theory courses having Continuous Assessment (CA) and Final
Examination (FE) components.
For each theory course, the total mark M [ie., the sum of Continuous Assessment marks
(CA) and Final examination marks (FE)] is computed for every candidate. The statistical
parameters Mean ( ) and Standard Deviation ( ) of the distribution of marks are arrived
at as given below:
n
n ( Mj )2
1 j 1
Mj
n j 1 n
th
where, Mj - Total mark of the ‗j‘ student in the course
n – Number of students who appeared for the examination in that
particular course.

The students who secure the total mark M as detailed below are first declared as fail (RA)
in a course.

100
 M < minimum of ( – 1.8 , 50)
(or)
FE less than 50% of maximum of final RA
examination marks for theory course
(or)
M less than 50% in total marks for theory and
laboratory courses with 100% continuous
assessment component
Note:
―RA‖ denotes reappearance in a course

After omitting the marks (M) of all failed candidates, revised and σ are computed for the
marks secured by the remaining candidates (passed), letter grade and grade point to
each student are awarded based on the revised and σ as detailed below.

Total Mark, M secured by the Relative

Grade
student (CA +FE) Grade Point, g
O
M ≥ [ (µ+1.5σ)] 10
A+
µ+0.52σ ≤ M < µ+1.5σ 9
A
µ−0.25σ ≤ M < µ+0.52σ 8
B+
µ –1.08σ ≤ M < µ−0.25σ 7
B
M < µ – 1.08σ 6

Withdrawal from examination W 0

Reappearance RA 0

Shortage of Attendance SA 0

Note:
If the total number of candidates passed is less than 10, the grades shall be awarded
as per Absolute Grading System otherwise Relative Grading System may be
followed.
No ‗O‘ grade shall be awarded if scored mark is less than 80.
If the maximum marks awarded in a course is greater than or equal to 95% and if the
number of candidates getting ‗O‘ Grade is less than 7% of the total number of
candidates, then some candidates with A+ grade may be awarded ‗O‘ grade. In such
a case some candidates having ‗A‘ grade may be awarded ‗A+‘ grade and some
candidates having ‗B+‘ grade may be awarded ‗A‘ grade in order to ensure that a
minimum of 23% of the candidates are awarded ‗A+‘ grade and 30% of the
candidates are awarded ‗A‘ grade.
The Performance Analysis Committee chaired by Principal consisting of Controller of
Examinations and all the Heads of the Departments will by collective wisdom, normalize
the marks secured by the students so as to ensure that the clustering, grading decisions
have been made in a reasonable manner for all the courses.

101
 b. Absolute Grading System
In absolute grading system, the letter grade and grade points are awarded to each
student based on the percentage of marks secured by him/her in all courses like
Laboratory course, Mini Project, Project Work etc. except theory courses having CA
and FE components, as detailed below.
Range of percentage of total Letter Grade Point g
marks grade
90 to 100 O 10
80 to 89 A+ 9
70 to 79 A 8
60 to 69 B+ 7
50 to 59 B 6
0 to 49
RA 0
or less than 50% in final examination
Withdrawal from examination W 0
Shortage of Attendance SA 0
"RA" denotes Reappearance in a course.
The grades RA and SA will not figure in the grade sheet.

vi. Cumulative Grade Point Average: After the completion of the programme, the
Cumulative Grade Point Average (CGPA) from the first semester to final semester is
calculated using the formula.
g i Ci
CGPA =
Ci
where gi is Grade point secured corresponding to the course - i
Ci is Credit rating of the course - i

vii. Passing a course:

a. A student shall be deemed to have passed a theory course with CA+FE components, if
i. he/she secures at least 50% in the final examination paper and
ii. the total marks secured by him/her (CA+FE put together) is at least (µ−1.8σ) or
50%, whichever is lower, where µ is the average mark of the students registered
for the course and σ is the corresponding standard deviation.
A student is deemed to have passed in any course carrying only continuous
assessment marks (like Laboratory course, Mini Project etc.) if the total mark secured
by him/her is at least 50%.
A student is deemed to have passed in Project work if he/she secures at least 50% in
the final examination and the total mark secured by him/her is at least 50%.
b. A student who is absent or has failed in the end semester examinations in any theory
course is permitted to appear for supplementary examination either by retaining the
CA marks already earned or with the re-earned CA marks in the next one attempt of
his/her choice. For further attempts he/she will be solely assessed by the final
examination marks only.
c. A student who after having earned necessary attendance, is absent for final end
semester examination or has failed in any course carrying only continuous
assessment marks (like Lab) will register for the supplementary examination
immediately at the beginning of the next semester and solely assessed in the final
examination carrying the entire marks of that course.

d. A student who has earned necessary attendance in the course Project work but does
not submit the report on Project Work on or before the date specified by the college /
department, he/she shall be deemed to have failed in the Project work and awarded

102
 grade RA and will have to register for the same at the beginning of the subsequent
semester, redo and submit the project report at the end of that semester and appear
for the final examination, the CA mark earned afresh.
e. A student who has earned necessary attendance in the course Project work but
whose project report is not accepted for reasons of incompleteness or other serious
deficiencies will be treated as ‗absent‘ and will have to register for the same at the
beginning of the subsequent semester, redo and submit the project report at the end
of that semester and appear for the final examination, the CA mark earned afresh.

f. A student who has submitted the report on Project Work, but could not appear for the
final examination on the scheduled date, shall be deemed to have failed in the Project
work and awarded grade RA.

g. If a student is absent or has failed in an elective course, he/she may register for the
same course or for any other elective in the subsequent semester.

h. A student who is not eligible to write the end semester examination in any course due
to lack of attendance, will be awarded grade SA and the student has to register for
that course again, when offered next, attend the classes and fulfill the attendance
requirements as per section 5 supra. If the course, in which the student has lack of
attendance, is a Professional Elective, the student may register for the same or any
other Professional Elective course respectively in the subsequent semesters.

i. A student after registering for a course may withdraw his / her registration between
first & second CA Test on valid reasons.

j. If a student has studied more than two professional elective courses, then two
professional elective courses with higher grades alone will be considered for CGPA
calculation. The grades obtained in other elective courses will also appear in the mark
sheet.
k. If a student is prevented from writing end semester examination of a course due to
lack of attendance, the student has to register for that course again, when offered
next, attend the classes and fulfill the attendance requirements as per clause 5. If the
course, in which the student has lack of attendance, is a Professional Elective, the
student may register for the same or any other Professional Elective course
respectively in the subsequent semesters.
l. A student who has already appeared for a course in a semester and passed the
examination is not entitled to reappear in the same course for improvement of letter
grade / marks.

m. A student failing in an elective course may drop the course and opt for a new elective
in the next semester of study or he/she may re-do the same course as and when
offered or appear for the supplementary examinations in that course. If opting for a
new elective, the student shall earn necessary attendance exclusively in that course.
n. A student who is absent in the final semester examination of a course after registering
for the same will be considered to have appeared and failed in that examination and
awarded grade RA.

viii. Supplementary Examinations:

For Supplementary Examinations/ Examinations for any course under REDO category,
absolute grading will be followed irrespective of whether the grading was originally under
Relative Grading System or Absolute Grading System.

103
 ix. Scheme of Evaluation
a. Theory Courses with Tutorial Component (CA: 50% + FE: 50%)
Total: 100 Marks
CA Distribution:
st
(i) Assignment (for 1 semester & final year) 15 Marks
Assignment Presentation (for others) 15 Marks

(ii) Assessment Tutorial I 05 Marks

(iii) Assessment Tutorial II 05 Marks

(iv) Internal Tests: (Best 2 out of 3) 25 Marks

Test I 25 Marks
Test II 25 Marks
Test III 25 Marks

Final Examination (FE) 50 Marks

Note:
1. For theory courses with tutorial component, separate tutorial note books/files are to
be maintained by the students for regular class room tutorials and two assessment
tutorials have to be conducted and marks entered in e-assessment.
2. During tutorial sessions, the students are to be guided to solve problems with faculty
support.
3. Assessment tutorials are of open book type, one each to be conducted in allotted
halls and every student should do it individually.

b. Theory Courses with no Tutorial Component (CA: 50% + FE: 50%)

Total: 100 Marks
CA Distribution:
st
(i) Assignment (for 1 semester & final year) 15 Marks
Assignment Presentation (for others) 15 Marks

(ii) Objective Test I/Mini Project Assessment I 05 Marks

(iii) Objective Test II/Mini Project Assessment II 05 Marks

(iv) Internal Tests: (Best 2 out of 3) 25 Marks

Test I 25 Marks
Test II 25 Marks
Test III 25 Marks
Final Examination (FE) 50 Marks
Note:
Two assessments for objective test/Mini Project are to be conducted and
evaluated as per the deadline.

c. Mini Project & Seminar (CA : 100%) Total: 100 Marks

CA Distribution:

(i) Review - I 25 Marks

Guide 15 Marks
$
Committee 10 Marks

104
 (ii) Review – II 25 Marks
Guide 15 Marks
$
Committee 10 Marks

(iii) Final Review 50 Marks

Guide 25 Marks
$
Committee 25 Marks

a. Project Work (CA : 50% + FE : 50%) Total: 100 Marks

CA Distribution:
Review - I 25 Marks
Guide 15 Marks
$
Committee 10 Marks

Review – II 25 Marks
Guide 15 Marks
$
Committee 10 Marks

Final Exam (FE): 50 Marks

External 25 Marks
Thesis Evaluation 10 Marks
Presentation & Viva Voce 15 Marks

Internal 25 Marks
Thesis Evaluation 10 Marks
Presentation & Viva Voce 15 Marks

$- In respect of Mini project &Seminar and Project Work carried out and reviewed in the departments, the reviewing
committee shall comprise of the Head of the Department/Project Coordinator, two faculty of the department
nominated by the HoD and the respective project guide(s).
In respect of Project Work carried out in industry, the committee nominated for the second review at industry shall
include one faculty deputed by the department and one mentor from respective industry.

9. QUALIFICATION FOR THE AWARD OF DEGREE

A student will be declared to have qualified for the award of the MSc degree provided
i. the student has successfully completed the course requirements and has passed all the
prescribed courses of study of the respective programme listed in section 13 infra within
the duration specified in section 2(ii) supra and earned the total number of credits as
specified in the curriculum of the respective programme of study. However, if the student
wishes, he/she may be permitted to earn more than the total number of credits prescribed
in the curriculum of his/her programme.
ii. no disciplinary action is pending against the student.

10. CLASSIFICATION OF DEGREE

A) FIRST CLASS WITH DISTINCTION:

A student who satisfies the following conditions shall be declared to have passed the
examination in First class with Distinction.
* Should have passed the end semester examination in all the courses of all the four
semesters in his/her First appearance with three years, which includes authorized break
of study of one year withdrawal from examination (vide clause 11).

105
 * Should have secured a CGPA of not less than 8.50.
* Should not have been prevented from writing end semester examination due to lack of
attendance in any of the courses.

B) FIRST CLASS:
A student who satisfies the following condition shall be declared to have passed the
examination in First Class.
* Should have passed the end semester examination in all the courses of all four
semesters within three years, which includes one year of authorized break of study (if
availed) or prevention from writing the end semester examination due to lack of
attendance (if applicable)
* Should have secured a CGPA of not less than 7

C) SECOND CLASS :
All other students (not covered in clauses A and B) who qualify for the award of the degree
shall be declared to have passed the examination in Second class.

D) RANK :

A student shall be eligible for award of ranking only if he/she has passed the examination
in first class or first class with distinction in the first available chance (i.e., first attempt in all
the courses). Those who have availed the provision of break of study / withdrawal will not
be eligible for ranking.

11. WITHDRAWAL FROM EXAMINATION

i. A student may, for valid reasons, be granted permission to withdraw from appearing for
the examination in any course or courses of only one semester examination during the
entire duration of the degree programme, if he/she does not have any history of arrears
at the time of request for withdrawal. Prior permission for withdrawal from semester
examinations is to be obtained from Principal. Also, only one application for withdrawal is
permitted for that semester examination in which withdrawal is sought.

ii. Withdrawal application shall be valid only if the student is otherwise eligible to write the
examination and if it is made prior to the commencement of the semester examination or
on the day of the examination of a course / set of courses and also recommended by the
HoD and the Principal.

12. TEMPORARY BREAK OF STUDY

i) A student is not normally permitted to temporarily break the study. However, if a student
intends to temporarily discontinue the programme in the middle for valid reasons (such as
accident or hospitalization due to prolonged ill health) and to rejoin the programme in a
later respective semester, he/she shall apply to the Principal through the Head of the
Department and stating the reasons therefore.
ii) A student is permitted to rejoin the programme at the respective semester as and when it
is offered after the break subject to the approval of Commissioner of Technical Education
and Anna University, Chennai, and shall be governed by rules and regulations in force at
the time of rejoining.

iii) The duration specified for passing all the courses for the purpose of classification (vide
sections 10 supra) shall be increased by the period of such break of study permitted.

106
iv) The total period for completion of the programme reckoned from the commencement of
the semester to which the student was first admitted shall not exceed the maximum
period specified in section 2 (ii) supra irrespective of the period of break of study in order
that he/she may be qualified for the award of the degree.

v) If any student is detained for want of requisite attendance, progress and conduct, the
period spent in that semester shall not be considered as permitted 'Break of Study'
and section 12 (iii) supra is not applicable for such cases.

107
 13. Courses of Study and Scheme of Assessment

M.Sc APPLIED MATHEMATICS (2017

REGULATIONS)
(Minimum Number of Credits to be earned:
85)
Hours / week Maximum Marks
Course Course title Lectur Tutoria Credits CA
Practical CA FE Total
code e l T
SEMESTER 1
17SA11 Abstract Algebra 4 0 0 4 50 50 100 PC
Differential Equations
17SA12 and Numerical 4 0 0 4 50 50 100 PC
Analysis
Mathematical
17SA13 Foundations of 3 0 0 3 50 50 100 PC
Computer Science
Number Theory and PC
17SA14 3 0 0 3 50 50 100
Cryptography
17SA15 Real Analysis 4 0 0 4 50 50 100 PC
Object Oriented PC
17SA16 3 0 0 3 50 50 100
Programming
EE
Professional
17SA17 0 0 2 1 100 - 100 C
Communication
Unix and Object
Oriented PC
17SA18 0 0 4 2 100 - 100
Programming
Lab
Total 27Hrs 21 0 6 24 500 300 800
SEMESTER 2
17SA21 Complex Analysis 3 0 0 3 50 50 100 PC
17SA22 Linear Algebra 3 0 0 3 50 50 100 PC
Probability and PC
17SA23 3 0 0 3 50 50 100
Statistics
Data Structures and PC
17SA24 4 0 0 4 50 50 100
Algorithms
Data Base PC
17SA25 3 0 0 3 50 50 100
Management System
17SA___ Elective- I 3 2 0 4 50 50 100 PE
17SA27 Data Structures and 0 0 4 2 100 - 100 PC
Algorithms Lab
17SA28 Data Base 0 0 2 1 100 - 100 PC
Management System
Lab
Total 27Hrs 19 2 6 23 500 300 800
SEMESTER 3
17SA31 Graph Theory 3 0 0 3 50 50 100 PC
Optimization PC
17SA32 3 0 0 3 50 50 100
Techniques
Topology and PC
17SA33 4 0 0 4 50 50 100
Functional Analysis
Transforms and its PC
17SA34 3 0 0 3 50 50 100
Applications
17SA35 Machine Learning 3 0 0 3 50 50 100 PC
17SA__ Elective II 3 2 0 4 50 50 100 PE
Mathematical PC
17SA37 Computing Lab (R 0 0 2 1 100 - 100
and Python)
17SA38 Java Lab 0 0 4 2 100 - 100 PC
Mini- Project & EE
17SA39 - - 6 3 100 - 100
Seminar C

108
 Total 33Hrs 19 2 12 26 600 300 900

Hours / week Maximum Marks

Course
Course title Lectur Tutoria Credits CA
code Practical CA FE Total
e l T
SEMESTER 4
EE
17SA40 Project Work - - 24 12 50 50 100
C
Total 24 Hrs - - 24 12 50 50 100

ELECTIVE THEORY COURSES (Two to be opted) CAT

Maximum
Hours / week
Course Course title Credits Marks
code Lecture Tutorial Practical CA FE Total
17SA61 Algebraic PE
3 2 0 4 50 50 100
Topology
17SA62 Artificial PE
3 2 0 4 50 50 100
Intelligence
17SA63 Computational PE
3 2 0 4 50 50 100
Finance
17SA64 Data Mining 3 2 0 4 50 50 100 PE
17SA65 Design and PE
Analysis of 3 2 0 4 50 50 100
Algorithms
17SA66 Digital Image PE
Processing and 3 2 0 4 50 50 100
Computer vision
17SA67 Game Theory 3 2 0 4 50 50 100 PE
17SA68 Intelligent PE
Information 3 2 0 4 50 50 100
Retrieval
17SA69 Mathematical PE
3 2 0 4 50 50 100
Modeling
17SA70 Operating PE
3 2 0 4 50 50 100
Systems
17SA71 Predictive PE
3 2 0 4 50 50 100
Analytics
17SA72 Statistical PE
3 2 0 4 50 50 100
Learning
Stochastic
17SA73 Differential 3 2 0 4 50 50 100 PE
Equations
17SA74 Stochastic Models 3 2 0 4 50 50 100 PE
17SA75 Security in PE
3 2 0 4 50 50 100
Computing
17SA76 Epidemic Models 3 2 0 4 50 50 100 PE
Geometry of
17SA77 Locally Finite 3 2 0 4 50 50 100 PE
Spaces
17SA78 Soft Computing 3 2 0 4 50 50 100 PE

CAT – Category; FC – Foundation Course; PC – Professional Core; PE - Professional Elective

EEC – Employability Enhancement Course.

109
 17SA11 ABSTRACT ALGEBRA
4004
ALGEBRAIC STRUCTURES: Groups, subgroups, normal subgroups, factor groups, homomorphism, isomorphism, external
products.
(10)

GROUPS AND CODING: Coding of Binary information and Error detection. Group codes – Decoding and Error correction.
(6)

RINGS AND INTERGAL DOMAIN: Definition and properties , subrings, rings of quaternions, Integral domain - homomorphism
– Ideals and Quotient Rings. Polynomials Rings – Properties, Division Algorithm, factorization of polynomials (12)

DIVISIBLITY IN INTEGRAL DOMAIN: Irreducible primes, Fermat‘s last theorem, unique factorization domain, Euclidean
domain

(10)

GEOMETRIC CONSTRUCTIONS: Construction with straight line and edges, and compass, circle (4)

FIELDS: Definition, extension fields, algebraic extension. Finite fields- classification and structure of finite fields (8)

SYLOW THEOREMS- Conjugacy classes, probability that two elements commute, Sylow theorems.
(10)

Total L: 60
REFERENCES:

1. Joseph A. Gallian, ―Contemporary Abstract Algebra‖, Brooks/Cole, 2013.

2. Herstein I. N., ―Topics in Algebra‖, John Wiley & Sons, 2012.
3. Neal H. Mcoy, Gerald J Janusz, ‘Introduction to Abstract Algebra‘, Academic Press, 2005 .
4. John B. Fraleigh,‘ First Course in Abstract Algebra‘, Pearson Education, 2005.

17SA12 DIFFERENTIAL EQUATIONS AND NUMERICAL ANALYSIS

40
04

ORDINARY DIFFERENTIAL EQUATIONS:First order linear differential equations-The method of successive approximations,
Lipchitz condition, Convergence of successive approximations, Existence and Uniqueness of solutions for first order initial
value problem Second order linear differential equations-General solution of homogeneous equations, Non-homogeneous
equations, Wronskian, Method of variation of parameters, Sturm comparison theorem, Sturm separation theorem, Boundary
value problems, Green's functions, Sturm-Liouville problems.
(14)

NUMERICAL SOLUTIONS TO DIFFERENTIAL EQUATIONS: Taylor series method, Euler and Modified Euler methods,
Runge Kutta methods, Milne‘s method, convergence criteria and error propagation- Boundary value problems
(10)
PARTIAL DIFFERENTIAL EQUATIONS: Introduction, Cauchy‘s problem of first order equations, linear equations of the first
order, integral surfaces passing through a given curve, surfaces orthogonal to given system, nonlinear partial differential
equation for first order, compatible systems of first order equations. Partial differential equations of second order-
Linear partial differential equations with constant coefficients.
(14)

INTRODUCTION TO FINITE-DIFFERENCE METHODS: Direct approximations, Taylor series approach and numerical errors,
even grid system, uneven grid system, applications to PDEs – regular boundaries, Dirichlet problems, Neumann problems.
(10)

110
NUMERICALSOLUTIONS TO PARTIAL DIFFERENTIAL EQUATIONS: Elliptic Equations: The steady two-dimensional heat
equation/ Laplace equation, Poisson equation, direct method, Liebmann‘s method, Parabolic Equations - The time-dependent
one dimensional heat equation/diffusion equation, Crank-Nicolson method. Hyperbolic Equations- The one dimensional wave
equation,
(12)

Total
L: 60

REFERENCES:

1. Earl A Coddington , ―An Introduction to Ordinary Differential Equations‖ , Prentice Hall of India Ltd.,2002.
2. Simmons G.F., ―Differential Equations with Applications and Historical Notes‖, Tata McGraw Hill, 2003.
3. Earl A Coddington and Normal Levinson, ―Theory of Ordinary Differential Equations‖, Tata McGraw Hill, 2008.
4. CurtisF. Gerald,andPatrickO. Wheatley, ―Applied Numerical Analysis‖ Pearson,2011.
5. Steven C.Chapra and Raymond P.Canale, ―Numerical Methods for Engineers with Software and Programming
Applications‖, McGraw Hill, 2011.
6. Ian Sneddon, ―Elements of Partial Differential Equations‖, Tata McGraw Hill, New Delhi, 2006.

17SA13 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

3003
MATHEMATICAL LOGIC: Proposition - Logical operators - Truth tables – Laws of Logic – Equivalences – Rules of inference -
Validity of arguments – Consistency of specifications – Propositional Calculus – Quantifiers and universe of discourse. (8)
RELATIONS AND FUNCTIONS: Definition and properties of binary relations – Representing relations – Closures of relations
– Composition of Relations – Equivalence relations – Partitions and covering of Sets – Partial Orderings – n-ary Relations and
their applications. Functions-Injective, surjective, bijective functions, Composition, Identity and Inverse. (8)
LATTICES: Lattices as partially ordered set – Properties of Lattices– Lattices as algebraic system – Sublattices – Direct
product and Homomorphism – Some special lattices. (10)
COMBINATORICS: Basics of counting – The Pigeonhole principle - Permutations and Combinations with and without
repetition, Permutations with indistinguishable elements, distribution of objects - Generating permutations and combinations in
lexicographic order. (8)
RECURRENCE RELATIONS:Some Recurrence Relation Models- Solutions of linearhomogeneous recurrence relations with
constant coefficients- solution of linear non-homogeneous recurrence relations by the method of characteristic roots - Divide
and conquer recurrence relations. (11)
Total L: 45
REFERENCES:

1. Kenneth H Rosen, ―Discrete Mathematics and its Application‖, McGraw Hill, 2011.
2. Judith L. Gersting, ―Mathematical Structures for Computer Science‖, W.H. Freeman and Company, 2014.
3. Tremblay J P and Manohar R, ―Discrete Mathematical structures with application to Computer Science‖, Tata McGraw
Hill, 2011.
4. Bernard Kolman, Robert C Busby, Sharon Cutler Ross, ―Discrete Mathematical Structures‖, Prentice Hall, New Delhi,
2006
5. Ralph P Grimaldi, ―Discrete and Combinatorial Mathematics-An Applied Introduction‖, Addison Wesley, USA, 2006

17SA14 NUMBER THEORY AND CRYPTOGRAPHY

3003

ARITHMETICAL FUNCTIONS : Divisibility-Division Algorithm, Euclidean Algorithm; Primes-Fundamental Theorem of

Arithmetic: Arithmetic function-Euler totient functionS .
(6)

CONGRUENCES: Introduction to Congruence - Definition, properties, Ring of integer modulo n, Prime field, Chinese
remainder Theorem, Euler, and Fermat Theorem: Primitive roots- Legendre, Jacobi, and Quadratic Reciprocity.
(6)

CRYPTOGRAPHIC PRIMITIVES: Definitions and Illustrations: Symmetric-Key Cryptography-Classic Ciphers, Stream Ciphers,
LFSRs, Modes of Operation, DES, AES - Attacks.
(8)

PUBLIC-KEY CRYPTOGRAPHY: Ideas behind PKC, RSA Cryptosystem, ElGamal Cryptosystem and Discrete Logs, Elliptic
Curve systems.
(10)

111
HASH FUNCTIONS AND SIGNATURE SCHEMES: Hash functions, The Birthday attack, Discrete Log Hash function, Hash
functions from Cryptosystems, Message Digest. ElGamal Signature Scheme, Digital Signature Standard,Fail-stop Signatures.

(8)

KEY DISTRIBUTION AND KEY AGREEMENT: Introduction, Blom‘s Scheme, Diffie-Hellman Key Predistribution, Kerberos,
Diffie Hellman Key exchange.
(7)

Total
L: 45
REFERENCES:
1. Richard A. Mollin, ― Introduction to Cryptography‖ Chapman & Hall/CRC, 2007.
2. Douglas R Stinson, ―Cryptography Theory and Practice‖, CRC Press, 2006.
3. Alfred J, Menezes, Paul C, Van Oorschot and Scott A Vanstone, ― Hand Book of Applied Cryptography‖, CRC Press, 2010.
4. Neal Koblitz ― A course in Number Theory and Cryptography‖, Springer , 2012.
5. Josef Pieprzyk, Thomas Harjono and Jenifer Seberry, ― Fundamentals of Computer Security‖, Springer, 2009.
6. Behrouz. A. Forouzan, ― Introduction to Cryptography and Network Security‖, Tata McGraw Hill, 2008
7. Gustavus J. Simmons, ―Contemporary Cryptology‖ IEEE Press, 1992.

112
 17SA15 REAL ANALYSIS
4004
METRIC SPACES: Definition and examples, open, closed, compact sets, perfect sets, connected sets. Heine-Borel theorem.
Weirstrass theorem.
(12)

CONTINUITY AND DIFFERENTIATION: Continuous functions, continuity and compactness, continuity and connectedness,
discontinuities, monotonic functions. Differentiation – mean value theorem, continuity of derivatives, derivatives of higher order,
Taylor‘s theorem
(12)

THE RIEMANN STIELTJES INTEGRAL: Riemann Integral - Definition and existence of integral, properties of the integral.
Riemann Stieltjes Integrals, integration and differentiation.
(12)

SEQUENCES AND SERIES OF FUNCTIONS: Uniform convergence, uniform convergence and continuity, differentiation and
integration ,Equi-continuous families of functions, The Stone- Weierstass theorem
(12)

THE LEBESGUE THEORY: Set functions, measure spaces, construction of Lebesgue measure, measurable functions,
integration, comparison with Riemann Integral.
(12)

Total
L: 60
REFERENCES:

1. Walter Rudin, ―Principles of Mathematical Analysis‖, McGraw Hill, 2006.

2. Royden HL, Fitzpatrick,‘Real Analysis‘ Pearson,2015.
3. Tom M Apostol, ―Mathematical Analysis‖, Narosa Publishing House, 2002.
4. Binmore K G, ―Mathematical Analysis‖, Cambridge University Press, 1999.
5. Sterling K Berberian ―Fundamentals of Real Analysis‖, Springer-Verlag,1999.

17SA16 OBJECT ORIENTED PROGRAMMING

3003

PRINCIPLES OF OBJECT ORIENTED PROGRAMMING: Software crisis -Software Evolution - Procedure Oriented
Programming - Object Oriented Programming Paradigm - Basic Concepts and Benefits of OOP - Object Oriented
Programming Language - Application of OOP - Structure of C++ - Tokens, Expressions and Control Structures -
Operators in C++ - Manipulators. (6)

FUNCTIONS IN C++: Function Prototyping - Call by Reference - Return by reference - Inline functions - Default, Const
Arguments - Function overloading - Classes and Objects - Member functions - Nesting of Member functions - Private
member functions - Memory allocation for Objects - Static data members - Static MemberFunctions - Arrays of Objects -
Objects as Function Arguments - Friend Functions - Returning Objects - Const Member functions - Pointers to Members.
(9)

CONSTRUCTORS: Parameterized Constructors - Multiple Constructors in a Class - Constructors with Default Arguments -
Dynamic Initialization of Objects - Copy and Dynamic Constructors – Destructors .
(4)
OPERATOR OVERLOADING: Overloading Unary and Binary Operators - Overloading Binary Operators using Friend
functions – Operator Type conversion.
(5)

INHERITANCE: Defining Derived Classes - Single Inheritance - Making a Private Member Inheritable - Multiple Inheritance -
Hierarchical Inheritance - Hybrid Inheritance - Virtual Base Classes - Abstract Classes - Constructors in Derived Classes -
Member Classes: Nesting of Classes – Composition – Aggregation.
(10)

POLYMORPHISM:Basics of polymorphism – Types of polymorphism: Compile and Run Time Polymorphism - Virtual function
– Object Slicing – Virtual Destructor – Dynamic binding.
(4)

TEMPLATES & EXCEPTION HANDLING:Introduction to Templates, Generic Functions and Generic Classes – Exception
Handling – Examples.
(4)

STREAMS: String I/O -Character I/O - Object I/O - I/O with multiple Objects - File pointers - Disk I/O with member functions.
(3)

113
 Total L: 45
REFERENCES:

1. BjarneStroustrup, ―The C++ Programming Language‖, Addison Wesley, 2012.

2. Stanley B Lippman,JoseeLajoie,, Barbara E.Moo ―The C++ Primer‖, Addison Wesley, 2013.
3. Scott Meyers,―Effective C++‖, Addison Wesley, 2005.

114
 17SA17 PROFESSIONAL COMMUNICATION
0021
Reading Compression : Reading for Critical Purposes
(2)

Scientific Style : Clarity – Simplicity – Exactness – Brevity – Unity – Coherence-Objectivity. Formal and Informal Writing
(4)

Presentation Skills
(2)

Introduction to Soft Skills

(2)

Interpersonal - Intrapersonal Communication

(2)

Meetings
(2)

Professional Report Writing

(4)

Professional Values and Ethics – Case analysis

(4)

PRACTICALS
Short Speeches, Group Discussions, Meetings
(8)

Total P:
30
REFERENCES:

1. Course materials prepared by the faculty, Department of English

2. Meenakshi Raman and Sangeeta Sharma, ―Technical Communication: Principles and Practice‖. Oxford University Press,
UK,
2015.
3. Dhanavel S.P., ― English and Soft Skills‖, Orient Black Swan, Hyderbad, 2010.
4. Murphy Herta.Hildelrandt, Herbert W and Thomas Jane P, ―Effective Business Communication‖, Tata Mc.Graw – Hill
Publishing Company Limited, New Delhi,2008.
5 Priyadarshi Patnaik, ―Group Discussion and Interview Skills‖, Indian Institute of Technology, Kharagpur, 2011.

17SA18 UNIX AND OBJECT ORIENTED PROGRAMMING LAB

0042
UNIX

1. Shell Script for command line arguments

2. Shell script for string handling
3. Shell script using if.. else and switch case statements
4. Using Looping structures in shell script
5. Menu driven programming using shell script
6. Shell script for file handling

C++

1. Programs on classes and objects

2. Array of objects
3. Programs using static members and member functions
4. Constructor and destructors
5. Programs with function having arguments and return type as objects.
6. Friend functions, friend class
7. Types of inheritance
8. Static and dynamic polymorphism
9. Virtual function, pure virtual functions, virtual base class
10. I/O Manipulators
11. Templates
12. Exception handling and File handling
Total
P: 60

115
116
 SEMESTER-2

17SA21 COMPLEX ANALYSIS

3003

ANALYTIC FUNCTIONS AND FUNDAMENTAL THEOREMS: Analytic functions, harmonic conjugates, elementary functions,
Mobius Transformation, conformal mappings, Cauchy‘s theorem and Integral formula, Morera‘s theorem, Cauchy‘s theorem
for triangle, rectangle, Cauchy‘s theorem in a disk. Zeros of Analytic function. the index of a closed curve, counting of zeros.
principles of analytic continuation. Liouville‘s Theorem, fundamental theorem of algebra.
(14)

SERIES: Uniform convergence, power series, radius of convergences, power series representation of analytic function, relation
between power series and analytic function, Taylor‘s series, Laurent‘s series.
(11)

RESIDUES AND POLES: Rational Functions, singularities, poles, classification of singularities, characterization of removable
singularities, poles. behavior of an analytic functions at an essential singular point.
(8)

COMPLEX INTEGRATION : Entire and meromorphic functions, The residue theorem, evaluation of definite integrals,
Argument principle, Rouche‘s Theorem, Schwartz lemma, Open mapping and Maximum modulus theorem and applications,
Convex functions, Hadmard‘s Three circle theorem.
(12)

Total
L: 45

REFERENCES:

1. J. B. Conway : Functions of one complex variable, Narosa, 1995.

2. L.V. Ahlfors : Complex Analysis, McGraw Hill, 1993.
3 .Churchill, R.V. and Brown, J.W., Complex Variables and Applications McGraw Hill Publishing Company, 2004.

17SA22 LINEAR ALGEBRA

3003
VECTOR SPACES: Linear spaces, subspaces, linear dependence, linear independence; span, basis, dimension, dimensions
of sums of subspaces.
(8)

LINEAR TRANSFORMATIONS: Introduction Null Space and the range Space , rank and nullity, dimension theorem.
Isomorphisms between vector Spaces, matrix representation of a linear Transformation, matrix for the composition and the
Inverse, similarity transformation, linear functionals, dual spaces.
(12)

EIGENVALUES AND EIGEN VECTORS: Eigenvalues and eigenvectors, characteristic polynomial, Cayley-Hamilton theorem,
diagonalization, invariant Subspaces.
(7)

RATIONAL AND JORDAN FORMS: Cyclic subspaces and Annihilators, cyclic decompositions and the rational form, Jordon
form, Minimal polynomial.
(7)

INNER PRODUCT SAPCES: Inner Products and norms, Gram-schmidt orthogonalization process, orthogonal complements,
QR-decomposition, Bessel's Inequality, Parseval's Indentity, best approximation, orthogonal projection, spectral theorem,
singular value decomposition and pseudo inverse.
(11)

Total L: 45
REFERENCES:

1. Stephen H. Friedberg, ―Linear Algebra‖, Prentice Hall, 2004.

2. Kenneth Hoffman, ―Linear Algebra‖, Prentice Hall,, 2001.
3. Gilbert Strang, ―Linear Algebra and Its Applications‖, Thomson Learning, 2012.

17SA23 PROBABILITY AND STATISTICS

3003
CONCEPTOF PROBABILITY: Introduction - Sample space and events - Axiomatic approach to probability – Conditional
Probability and Independence- Law of multiplication - Law of total probability and Bayes‘ Theorem.
(7)

117
RANDOM VARIABLES: Discrete and continuous random variables - probability mass function and density function -
distribution function - Expectation and variance. Special Discrete distributions: Binomial, Poisson and Geometric –Special
Continuous distributions: Uniform, Normal, Exponential and Weibull - Joint probability distributions - marginal and conditional
distributions – Independent random variables, Conditional expectation. (12)
LIMIT THEOREMS: Moments and moment generating functions- Sums of independent random variables - Limit theorems:
Markov and Chebyshev inequalities, Law of Large numbers, Central Limit Theorem. (6)
CORRELATION AND REGRESSION: introduction - Estimation using the regression line - Correlation analysis -Limitations,
errors, and caveats of using regression and correlation analyses - Multiple regression and correlation analysis - Inferences
about population parameters – Modeling techniques. (6)
STATISTICAL INFERENCE: Sampling distribution - Estimation: Point estimation, interval estimation - Criteria of a good
estimator –Interval estimation of mean, proportion, and variance (single sample and two samples) - Maximum likelihood
estimator. Hypothesis Testing: General concepts - Errors in Hypothesis testing - One-and two-tailed tests - Tests concerning
mean, proportion, and variance - Tests for Goodness of fit and independence of attributes.
(10)
ANALYSIS OF VARIANCE: Introduction to design of experiments, Analysis of variance - Completely Randomized Design and
Randomized Block Design. (4)
Total L:45
REFERENCES:

1. Saeed Ghahramani, ―Fundamentals of Probability with Stochastic Processes‖, Pearson education,2012.

2. Ronald E. Walpole, Ronald E. Walpole, Ronald E. Walpole, Ronald E. Walpole, ‗Probability and Statistics for Engineers
and Scientists‘, Prentice Hall, 2012
3. Richard I. Levin, David S. Rubin, ‗Statistics for Management ‗, Pearson Education , 2012

17SA24 DATA STRUCTURES AND ALGORITHMS

4004
INTRODUCTION: Software Development process – Abstraction - Data structures - Abstract Data Types - Primitive data
structures - Analysis of algorithms- Best, worst and average case time complexities –notations.
(6)

ARRAYS: Operations - Implementation of one, two, three and multi dimensioned arrays – Sparse and dense matrices -
Applications.
(5)

STACKS: Primitive operations - Sequential implementation - Applications: Subroutine handling - Recursion – Expression
Processing.
(5)

QUEUES: Primitive operations - sequential implementation - Priority Queues - Dequeues.

(4)
LISTS: Primitive Operations - Singly linked lists, Doubly linked lists, Circular lists, Multiply linked lists - Applications: Addition of
Polynomials; Sparse Matrix representation and Operations. – Linked Stacks - Linked queues - Linked Priority queues -
Dynamic Storage Management.
(10)

TREES: Terminologies – Binary tree: Properties - Sequential and linked representation - Common binary tree operations -
Traversals - Expression trees - Infix, Postfix and Prefix expressions - Threaded trees - Heaps, Max heap, Min heap (10)

DICTIONARY DATA STRUCTURES: Binary Search Trees-Search, Insertion, Deletion-Time Complexity. AVL Tree- Insertion-
Rotation-Deletion-Complexity. Hash Tables-hash functions-collision handling techniques and resolution. (10)

SORTING AND SEARCHING: Insertion sort, selection sort, bubble sort, heap sort, count sort and radix sort - Linear Search,
Binary Search-Time Complexity
(4)
GRAPHS: Introduction-representations -Adjacency matrix, packed adjacency list and linked adjacency list– Graph search
methods-Breadth first and depth first traversals.
(6)

Total L: 60
REFERENCES:

1. SahniSartaj, ―Data Structures, Algorithms and Applications in C++‖,Silicon Press, 2009.

2. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C++‖, Pearson, 2014.

118
3. Aaron M Tanenbaum, Moshe J Augenstein and YedidyahLangsam, ―Data structures using C and C++‖, Pearson
Education, 2012.
4. Thomas H.Corman, Charles E.Leiserson, Ronald L.Rivest, Clifford Stein, ―Introduction to Algorithms‖, MIT Press,2011

17SA25 DATABASE MANAGEMENT SYSTEM

3003
BASIC CONCEPTS: Introduction to databases – Conventional file processing – Purpose of database system – Characteristics
of database approach – Advantages of using DBMS – Database concept and architecture – Data Abstraction – Data Models –
Instances and Schema – Data Independence – Schema Architecture – Components of a DBMS.
(8)

DATA MODELING: Introduction – Data associations – Entities, attributes, relationships – Type role and structural constraints –
Weak and Strong entity types – Design of Entity Relationship data models (ERD) – Generalization – Aggregation – Conversion
of ERD into tables – Applications – Introduction to Network data model and Hierarchical data model.
(6)

FILE ORGANIZATION: Storage device characteristics – Constituents of a file – Operations on file – Serial files – Sequential
files – Index sequential files – Direct files – Primary and Secondary Key Retrieval – Types of indexes - Indexing using Tree
Structures.
(6)

RELATIONAL MODEL: Introduction to Relational Data Model – Basic concepts – Enforcing Data Integrity constraints –
Relational Algebra Operations – Extended Relational Algebra Operations
(6)

RELATIONAL DATABASE MANIPULATION: Introduction to Structured Query Language (SQL) – SQL Commands for
defining Database, Constructing database, Manipulations on database – Basic data retrieval operations – Advanced Queries
in SQL – Functions in SQL – Aggregation – Categorization – Updates in SQL – Views in SQL –– PL/SQL Basics – Procedures
– Functions – Triggers.
(5)

DATA BASE DESIGN THEORY: Data base design process – Relational Database Design – Relation Schema – Anomalies in
a database – Functional dependencies – Axioms – Normal forms based on primary keys – Second Normal form, Third Normal
form, Boyce – Codd Normal form – Examples – Multi-valued dependencies – Fourth Normal form – Reduction of an E-R
schema to Tables – Practical database design tuning.
(8)
TRANSACTION PROCESSING AND CONCURRENCY CONTROL: Transactions, Locking techniques, Concurrent access,
Deadlock handling
(3)

DATABASE SECURITY, INTEGRITY CONTROL: Security and Integrity threats – Defense mechanisms – Discretionary
Access Control and Mandatory Access Control.
(3)

Total L: 45
REFERENCES:

1. Silberschatz A., Korth H and Sudarshan S., ―Database System Concepts‖, Tata McGraw Hill, 2011.
2. Elmasri R and Navathe S.B, ―Fundamentals of Database Systems‖, Pearson Education, 2009.
3. Date C J, Kannan A, Swamynathan S, ―An Introduction to Database Systems‖, Pearson Education, 2009.
4. Raghu Ramakrishnan and Johannes Gehrke, ―Database Management System (Digitized)‖, Tata McGraw Hill, 2007.
5. Graeme C Simsion,And Graham C. Witt,―Data Modeling Essentials‖,Morgan Kaufmann, 2006 ,

17SA27 DATA STRUCTURES AND ALGORITHMS LAB

00
42
Implementation of the following problems:

1. Sparse and dense Matrix operations using arrays.

2. Library of string operations - representing strings using arrays.
3. Stack and Queue using array.
4. Linked Lists: Singly linked, Doubly linked and Circular lists.
5. Linked Stacks and Queues.
6. Conversion and Manipulation of Expressions.
7. Binary trees and Threaded trees

119
8. Hash Table linear probing and chaining.
9. BST, AVL tree implementation
10. Graph Traversal Total
P:60

17SA28 DATABASE MANAGEMENT SYSTEM LAB

0021
SQL – ORACLE, SQL SERVER

1. Working with DDL and DML commands of SQL for creation and manipulation of single, multiple tables.
2. Working with PL/SQL- Triggers and stored procedures.
3. Developing a Package using a database.
Total
P: 30

120
 SEMESTER-3

17SA31 GRAPH THEORY

3003
BASIC CONCEPTS: Graphs - directed and undirected, subgraphs, graph models, degree of a vertex, Hand-shaking lemma,
degree sequence, Havel-Hakimi theorem. Walk, path, connectivity, distance, diameter. Isomorphic graphs, planar graphs.
Trees – spanning trees.
(7)

CONNECTIVITY: Vertex and edge connectivity, Vertex and edge cuts, relationship between vertex and edge connectivity,
bounds for connectivity. Constructing reliable network- Harary‘s k-connected graphs.
(8)

MATCHING: Matching, Bipartite matching, Hall‘s theorem, Perfect matching, Tutte‘s 1-factor theorem, augmenting path
algorithm, Job assignment problem.
(8)

EULERIAN AND HAMILTONIAN GRAPHS: Eulerian graphs, Hamiltonian graphs, conditions for existence - Dirac‘s and Ore‘s
theorems. Modeling Link verification problem, Travelling salesman problem.
(8)

COLORING: Vertex-coloring – upper chromatic number, bounds using clique number, (G), Welsh – Powell theorem.
Sequential and largest degree first algorithms, applications to frequency assignment.
(7)

DOMINATION: Dominating set, domination number, bounds. Types – independent, total, k-distance, connected, irredundant
dominations, applications to networks.
(7)

Total L: 45
REFERENCES:

1. Balakrishnan R and Ranganathan K, ―A Textbook of Graph Theory‖, Springer-Verlag, 2012.

2. Bondy J.A. and Murty U.S.R., Graph Theory, Springer, 2013.
3. Douglas B West, ―Introduction to Graph Theory‖, Prentice Hall, New Delhi, 2011.
4. Jonathan Gross and Jay Yellen, ―Graph Theory and its Applications‖, CRC Press, Boca Raton, 2006.

17SA32 OPTIMIZATION TECHNIQUES

3003
LINEAR PROGRAMMING: Formulation, graphical method, simplex method, two phase method, simplex multipliers, dual and
primal, dual simplex method, revised simplex method, Karmarker‘s algorithm.
(12)

NON-LINEAR PROGRAMMING: Interval halving method, Fibonacci method, pattern search method – Hooke and Jeeves
method, Gradient of a function – Steepest descent method, conjugate gradient method, Fletcher – Reeves method.
(8)

DYNAMIC PROGRAMMING: Principle of optimality, backward and forward induction methods, calculus method of solution,
tabular method of solution, shortest path network problems, applications in production.
(7)

CPM AND PERT: Calculations on CPM networks, various floats for activities, critical path, updating a project, operation time
cost trade off curve, project time cost trade off curve, selection of schedule based on cost analysis arrow networks, time
estimates, earliest expected time, latest allowable occurrence time and slack of events, critical path, probability of meeting
scheduled date of completion of project.
(7)

DECISION MAKING: Decisions under uncertainty, under certainty and under risk, decision trees, expected value of perfect
information and imperfect information.
(6)

ANT COLONY OPTIMIZATION: Ant‘s foraging behavior and optimization, artificial ants and minimum cost paths, traveling
sales man problem, ACO algorithm for traveling sales man problem .
(5)

Total L: 45
REFERENCES:

1. Hamdy A Taha, ―Operations Research – An Introduction‖, Pearson Education, 2010

121
2. Singiresu S Rao, ―Engineering Optimization Theory and Practice‖, John Wiley, 2014.
3. Hillier F and Lieberman G J, ―Introduction to Operations Research‖, Tata McGraw Hill, 2012.
4. Kambo N S, ―Mathematical Programming Techniques‖, East West Press, 2006.
5. Kalyanmoy Deb, ―Optimization for Engineering Design, Algorithms and Examples‖, Prentice Hall, 2010.
6. Marco Dorigo and Thomas Stutzle, ―Ant Colony Optimization‖ Prentice Hall, 2005.

17SA33 TOPOLOGY AND FUNCTIONAL ANALYSIS

4004
TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS: Topological spaces, basis for a topology, subspace topology,
order topology, closed sets and limit points, Hausdroff spaces, product topology, metric topology- continuous functions.
(12)

CONNECTEDNESS AND COMPACTNESS: Connected spaces, connected sub sets of the real line, components and local
connectedness, compact spaces, compact sub sets of the real line, local compactness.
(12)

COUNTABILITY AND SEPARATION AXIOMS:Countability axioms. separation axioms, normal spaces, Urysohn‘s Lemma,
Tietze extension theorem, Uryshon‘smetrization theorem, Tychonoff theorem.
(14)

BANACH SPACES: Definition and examples, continuous linear transformations. Hahn-Banach theorem, the natural
imbedding of a normed space, the open mapping theorem, the closed graph theorem. The Conjugate of an operator.
(12)

HILBERT SPACES: Definition and simple properties, orthogonal complements, orthonormal sets- Bessel‘s inequality,
conjugate space, adjoint of an operator, self - adjoint operators, normal and unitary operators, projections.
(10)

Total L: 60
REFERENCES:

1. James R Munkres, ―Topology - A First Course‖, Prentice Hall, 2011.

2. George F Simmons, ―Introduction to Topology and Modern Analysis‖, Tata McGraw Hill, 2004.
3. Erwin Kreyszig, ―Introductory Function Analysis with Applications‖, John Wiley and Sons, 2005.
4. Limaye B V, ―An Introduction to Functional Analysis‖, New Age International, 1996.

17SA34 TRANSFORMS AND ITS APPLICATIONS

3003

TRANSFORM METHODS: Concept of Transformation - Examples for Transformations. (2)

LAPLACE TRANSFORM: Definition - Transforms of Standard Functions - Transform of unit step function - Dirac delta
function. – Transforms of derivatives and integrals -Transforms of Periodic functions - Inverse Laplace transform- Convolution
Theorem. Method of solving ordinary linear differential equations with constant coefficient and solving integral equations by
Laplace transform technique. (8)
FOURIER SERIES: Even and odd functions, Dirichlet‘s conditions, statement of Fourier theorem, Fourier coefficients, change
of scale, Half-range sine and cosine series, RMS value, Parseval‘s theorem, (8)
FOURIER TRANSFORM : Fourier integrals - Fourier transform- Fourier sine and cosine transform - Transforms of standard
functions - Properties, Convolution theorem ( Statement only) – Discrete Fourier and Fast Fourier Transforms – Discrete
Convolution – Periodic sequence and circular convolution – Discrete Fourier Transform – decimation–in-time algorithm –
Decimation-in-frequency algorithm – Computation of inverse DFT. (12)
Z-TRANSFORM: Z - transform of standard functions, inverse Z-transform – properties of Z – transform – Difference equations
– Modeling, Solution of difference equations.
(8)

WAVELET TRANSFORM: Continuous wavelet transform, admissibility condition, Haar-wavelet, Mexican-hat-wavelet, Morlet-
wavelet. Convolution. Inverse transform. Comparison with Fourier transform. Application – detection of signal changes.
(7)

Total: L: 45
REFERENCES:

122
1. EwinKreyszig, ―Advanced Engineering Mathematics‖, John Wiley & Sons, 2011.
2. Ray Wylie C, Louis C Barret, ―Advanced Engineering Mathematics‖, McGraw Hill, 2003.
3. Hans-Georg Stark, Wavelets and Signal Processing, Springer, 2009.
4. Michael D. Greenberg, ―Advanced Engineering Mathematics‖, Pearson Education, 2009.
5. Roland E. Thomas and Albert J. Rosa, ―The Design and Analysis of Linear Circuits‖, John Wiley & Sons, 2011.

123
 17SA35 MACHINE LEARNING
3003
INTRODUCTION: Overview of machine learning, related areas, applications, software tools
(4)

PARAMETRIC REGRESSION: linear regression, polynomial regression, locally weighted regression, numerical optimization,
gradient descent, kernel methods.
(8)

GENERATIVE LEARNING: Gaussian parameter estimation, maximum likelihood estimation, Bayesian estimation
(6)

DISCRIMINATIVE LEARNING: linear discrimination, logistic regression, logit and logistic functions
(6)

NEURAL NETWORKS: the perceptron algorithm, multilayer perceptions, back propagation, nonlinear regression, multiclass
discrimination, training procedures, localized network structure, dimensionality reduction interpretation-Support vector
machines
(7)

GRAPHICAL AND SEQUENTIAL MODELS: Bayesian networks, conditional independence, Markov random fields, inference
in graphical models, belief propagation, Markov models, hidden Markov models, decoding states from observations, learning
HMM parameters.
(7)

DIMENSIONALITY REDUCTION: Feature selection, principal component analysis, linear discriminant analysis, factor analysis,
independent component analysis, multidimensional scaling, manifold learning. (7)

Total L: 45
REFERENCES:

1. Alpaydin E., Machine Learning, MIT Press, 2010.

2. Bishop C, Pattern Recognition and Machine Learning, Springer, 2007.
3. Duda R, Hart E, and Stork D, Pattern Classification, Wileye, 2001.
4. Mitchell T, Machine Learning, McGraw-Hill, 1997.
5. Trevor Hastie, Robert Tibshirani and Jerome Friedman, ―The Elements of Statistical Learning‖, Springer, 2009.

17SA37 MATHEMATICAL COMPUTING LAB ( R AND PYTHON)

00
21
Implementation of the following problems using R:

1. Classification and tabulation of data and Graphical and diagrammatic presentation of data.
2. Perform calculations that measure the central tendency and dispersion of data and Implementation of measures of
Skewness, moments and kurtosis.
3. Determination of point and interval estimates.
4. Solving linear regression, polynomial regression and non-linear regression based problems and solving multiple
regression and correlation analysis based problems.
5. Solving the problems based on Time series analysis and forecasting and implementing statistical quality control charts.
Exercises pertaining to the following outlines are to be experimented using Python:

6. Write a program that asks the user about textbook prices and reports how overpriced the textbooks are.
7. Create a new function called clubhouseAnimate( objlist ) that loops through the window objects in the
list and randomly
8. Switches them to either yellow (200, 190, 100) or dark (40, 50, 60). You can use a slice like mylist[1:] to loop over
all the elements in a list except the first one

9. Create a main function that creates a GraphWin, calls clubhouseInit and assigns its return value to a variable like
cbhouse.
10. Then loop over the variable and call the draw method on each primitive object. Then call the getMouse and close methods
of your GraphWin object. Test your clubhouse.
11. Problems to practice various image drawing functions

124
12. Problems to practice lists and objects collections
13. Problems to practice python function and parameters
14. Problems to practice classes, dictionaries and inheritance
15. Problems to practice command line arguments
16. Problems to Create your own Python module packages containing functions and data
17. Problems to Import your own and other Python modules and use contained objects
18. Problems to understand the use local, global and built-in names within functions
Total
P: 30

17SA38 JAVA LAB

0042
1. Implementing Object Oriented Concepts.
2. Implementing Control Statements
3. Implementation of Interface and Package program.
4. Program to handle Built-in and User-defined Exception
5. Multithreading
6. Implementation of Collection interfaces
7. Streams Handling.
8. Swing user interface design
9. Design Client/Server application using Socket Programming
10. Implementation of JDBC & Servlets.
Total P: 60

17SA39 MINI – PROJECT & SEMINAR

00
63

Mini – project is to be done during the summer vacation at the end of the second semester and a seminar is to be conducted
during the third semester.

SEMESTER - 4

17SA40 PROJECT WORK

0 0 24
12

Every candidate shall undertake a project work during the fourth semester. The project work shall be undertaken in an
industrial / research organization or in the college in consultation with the faculty guide and the Head of the Department. In
case of the project work at industrial / research organization, the same shall be jointly supervised by a faculty guide and an
expert from the organization.
ELECTIVES

17SA61 ALGEBRAIC TOPOLOGY

3204
n
ALGEBRAIC TOPOLOGY: Homotopy of Paths- The Fundamental Groups- Circle , group of S , Covering spaces- Retraction s
of fixed points- The fundamental theorem of Algebra
(12+8)
SEPARATION THEOREMS IN PLANE: The Jordan Separation Theorem—Invariance of domain-Jordan Curve Theorem-
Imbedding graphs in a plane- Winding number of simple closed curve
(10+7)
CLASSIFICATION OF SURFACES: Fundamental Groups of Surfaces-Homology of Surfaces- Cutting and pasting- The
classification theorem- Constructing compact surfaces
(12+8)

125
SURFACES AND COMPLEXES Two dimensional Manifolds-Searching triangulation- Self-intersection- Surface simplifications-
Simple Complexes- Convex systems-Delaunay Complexes, Alpha complexes
(11+7)

Total: L: 45+T:
30=75

REFERENCES:

1. James R. Munkres, Topology, PHI Learning , 2011

2. Herbert Edlesbrunner and John Harer, Computational Topology – An Introduction, AMS,2010
3. William Massey, Basic Course in Algebraic Topology, Springer,2007
4. Joesph J Rotman, Introduction to Algebraic Topology, Springer, 2004

17SA62 ARTIFICIAL INTELLIGENCE

3204
INTRODUCTION: The foundations of AI - The History of AI- Intelligent agents- Agent based system. (3)

PROBLEM SOLVING: Searching for solution- Uninformed/Blind search - Informed/ Heuristic search - A* search - Hill-climbing
search -Constraint satisfaction problem.
(6)

KNOWLEDGE REPRESENTATION AND REASONING: Logics – First order logic, Inference in first order logic, Knowledge
representation. (6)

PLANNING: The planning problem - Planning with state space search - Partial order search - Planning with proportional logic -
Planning and acting in the real world. Adversarial planning. (7)

UNCERTAIN KNOWLEDGE AND PROBABILISTIC REASONING: Uncertainty-Probabilistic reasoning - Semantics of

Bayesian network -Approximate inference in Bayesian network, Exact inference in Bayesian network - Probabilistic reasoning
over time.
(9)

LEARNING: Learning from observation - Knowledge in learning -Statistical learning methods - Reinforcement learning.
(8)

DECISION-MAKING: basics of utility theory, decision theory, sequential decision problems, elementary game theory, sample
applications.
(6)

Total: L: 45+T:
30=75
Tutorial Practices:

1. A* algorithm for 8 –puzzle and Missionaries and Cannibals problem.

2. Hill climbing and genetic algorithm
3. Constraint satisfaction techniques,
4. Simple games – minimax and expectimax
5. Logic based exercises.
6. Applications of sequential decision making and multi agent decision making

REFERENCES:

1. Stuart Russell and Peter Norvig, ―Artificial Intelligence: A Modern Approach‖, Pearson Education, 2014.
2. David Pool, Alan Mackworth, ―Artificial Intelligence: Foundations of Computational agents‖, Cambridge University,
2011.

17SA63 COMPUTATIONAL FINANCE

3204

INTRODUCTION: Computational finance - Cash Flow Streams - Investments and the Market – Forwards, Futures, and Options
–
No arbitrage and the Law of One Price–Forwards–Futures–Option type, style, and payoff–Put-Call Parity for European
options–Put-Call Parity bounds for American options
(5)

126
MATHEMATICAL PRELIMINARIES : Univariate distributions - quantiles of a distribution, Value-at-Risk – Bivariate
distributions - Covariance, correlation, autocorrelation, linear combinations of random variables - Time series analysis:
Covariance stationarity, autocorrelations, MA(1) and AR(1) models – Descriptive statistics - Stochastic calculus – Martingales
and Brownian motion. (10)
PORTFOLIO THEORY - Introduction - Review of constrained optimization methods, Markowitz algorithm, Markowitz Algorithm
using the solver and matrix algebra – Markowitz algorithm with no short sales constraints- Portfolio risk budgeting– Statistical
analysis of efficient portfolios.
(10)

BASIC OPTIONS THEORY – Definitions – Pay off diagrams – Single period binomial options theory – Multi period binomial
options theory – Real options-Simulation methods for options pricing
(10)

THE CAPITAL ASSET PRICING (CAP) AND RISK BUDGETING : Mean variance portfolio theory – Asset returns – Variance
as a risk measure - The one and two fund theorems – The capital market line – CAP as a pricing formula – Systematic and
unsystematic risk – Euler‘s theorem – Asset contributions to volatility –Beta as a measure of portfolio risk-limitations
(10)

Total: L: 45+T: 30=75

Tutorial Practices:

1. Obtaining financial data, computing returns, plotting and basic analysis

2. Working with time series data
3. Linear time series modeling andforecasting
4. Modeling volatility: Volatility forecasting for risk management
5. Portfolio optimization: Mean-variance model
6. Tangency portfolio and Capital MarketLine
7. Asset Pricing model: Capital Asset Pricing Model, Beta estimation
8. Estimating the Term Structureof Interest Rates
9. Derivatives Pricing: The Black-Scholes model, The Cox-Ross-Rubinstein model

REFERENCES:

1. David Ruppert, ―Statistics and Data Analysis for Financial Engineering‖, Springer 2013.
2. John C. Hull, ‗Options, Futures and Other Derivatives‘, Pearson Education, 2016
3. MarekCapinski and Tomasz Zastawniak, ‗Mathematics for Finance‘, Springer, 2003
4. Donald E. Fischer, Ronald J. Jordan, ‗Security Analysis and Portfolio Management‘, Pearson Education, 1995
5. Steven E Shreve, ―Stochastic Calculus for Finance – I‖ , Springer,2005.
6. Sheldon M. Ross, ‗An Elementary Introduction to Mathematical Finance‘, Cambridge University Press, 2011.

17SA64 DATA MINING

3204
INTRODUCTION: Data mining, kinds of data, kinds of patterns, major issues in data mining; Data objects and attribute types,
measuring data similarity and dissimilarity.
(6)

DATA PREPROCESSING: Data preprocessing, data cleaning, data integration, data reduction.
(5)

MINING FREQUENT PATTERNS, ASSOCIATIONS AND CORRELATIONS: Basic concepts, frequent item set mining
methods, apriori algorithm, FP tree, pattern evaluation methods.
(9)

CLASSIFICATION: Basic concepts, decision tree induction, Bayes classification methods, model evaluation and selection,
metrics for evaluating classifier performance, Holdout methods and Random sub sampling, Cross-validation and ROC Curves,
Techniques to improve classification accuracy, Bagging, Boosting and AdaBoost.
(9)

CLUSTER ANALYSIS: Cluster analysis, partitioning methods, K-means, K-medoids, hierarchical methods, agglomerative
versus divisive hierarchical clustering, density-based methods.
(9)

TRENDS IN DATA MINING: Mining distributed, heterogeneousand legacy databases, Multimedia data mining, Data mining
and the World Wide Web, Security and Privacy issues for data mining.
(7)

127
 Total: L: 45+T: 30=75

Tutorial Practices:

1. Implementation of data mining techniques using WEKA.

2. Implementation of Association rule mining using Apriori algorithm and FP Growth algorithm
3. Classification rules using Decision Tree classifier, Ensemble of Classifiers.
4. Implementation of clustering algorithms
5. Case studies using R programming

REFERENCES:

1. Jiawei Han, MichelineKamber and Jian Pei, ―Data Mining – Concepts and Techniques‖, Reed Elsevier India, 2012.
2. Tan, Steinbach and Kumar, ―Introduction to Data Mining‖, Pearson Education, 2013.
3. Trevor Hastie, Robert Tibshirani and Jerome Freidman,‖The Elements of Statistical Learning: Data Mining, Inference, and
Prediction‖, Springer Series in Statistics, 2009.
4. Ian Witten, Frank Eibe and Mark A Hall, "Data Mining: Practical Machine Learning Tools and Techniques‖, Elsevier, 2011.

17SA65 DESIGN AND ANALYSIS OF ALGORITHMS

3204

INTRODUCTION: Algorithm – analysis of algorithms – best case and worst case complexities. Asymptotic notations-Master‘s
Theorem
(6)

DIVIDE AND CONQUER: Method – examples – Merge sort, Quick sort, Binary Search, Closest Pair
(6)
GREEDY METHOD: Optimization problems – method – examples – Minimum cost spanning tree (Kruskal‘s and prim‘s
algorithms, Topological sorting, Fractional knapsack
(8)
DYNAMIC PROGRAMMING: Method – examples – All pairs shortest path problem –0/1 Knapsack-Traveling salesman
problem.

(6)

NETWORK FLOW: Flows and Cuts-Max flow mincut theorem-Ford Fulkerson‘s Algorithm
(5)

NP-HARD, NP-COMPLETE CLASSES: Basic concepts – Non deterministic algorithms – satisfiability problem – NP-hard and
NP-complete Problems – Cooks theorem (statement only)- Reduction- Vertex cover
(6)

BACK TRACKING: Method – Examples – Eight queen‘s problem, Hamiltonian Cycles.

(4)

BRANCH &BOUND: Method – Example – 0/1 knapsack-Traveling salesman problem.

(4)

Total: L: 45+T: 30=75

Tutorial Practices:
Implementation of the following problems:

1. Divide and Conquer versions of Merge sort, Quick sort, binary search and closest pair
2. Greedy method implementation of Topological sort, Minimum cost spanning tree.
3. Dynamic Programming implementation of Traveling Salesperson problem.
4. Eight queen's problem backtracking algorithm.
5. Knapsack using LC branch and bound algorithm.

REFERENCES:

1. Thomas H Cormen, Charles E Leiserson, and Ronald L Rivest ―Introduction to Algorithms‖ , Prentice Hall, 2011.
2. Jon Kleinberg and Eve Tardos― Algorithm Design‖, Pearson Education, 2006.
3. AnanyLevitin, ― Introduction to design and analysis of algorithm‖, Addison -Wesley, 2011.
4 SanjoyDasgupta, Christos Papadimitriou, UmeshVazirani , ―Algorithms‖,Tata McGraw Hill, 2008.

17SA66 DIGITAL IMAGE PROCESSING AND COMPUTER VISON

3204

128
DIGITAL IMAGE PROCESSING: Elements of a Digital image processing system – Structure of the Human eye – Image
formation and contrast sensitivity – Sampling and Quantization – Neighbours of a pixel – Distance measures – Photographic
firm structure and exposure – Film characteristics – Linear scanner – Video camera – Image processing applications.
(6)

IMAGE TRANSFORMS: Introduction to Fourier transform – DFT – Properties of two dimensional FT – Separability,
Translation, Periodicity, Rotation, Average value – FFT algorithm – Walsh transform – Hadamard transform – Discrete Cosine
transform. (5)

IMAGE ENHANCEMENT: Definition – Spatial domain methods – Frequency domain methods – Histogram modification
technique – Neighborhood averaging – Media filtering – Lowpass filtering – Averaging of multiple images – Image sharpening
by differentiation and high pass filtering.
(8)

IMAGE RESTORATION: Definition – Degradation model – Discrete formulation – Circulant matrices – Block circulant matrices
– Effect of diagnolization of circulant and block circulant matrices – Unconstrained and constrained restorations – Inverse
filtering – Wiener filter – Restoration inspatial domain.
(8)

IMAGE ENCODING: Objective and fidelity criteria – Basic encoding process – The mapping – The quantizer – The coder –
Differential encoding – Contour encoding – Runlength encoding – Image encoding relative to fidelity criterion – Differential
pulse code modulation.
(8)

IMAGE ANALYSIS AND COMPUTER VISION: Typical computer vision system – Image analysis techniques – Spatial feature
extraction – Amplitude and Histogram features. Transform features – Edge detection – Gradient operators – Boundary
extraction – Edge linking – Boundary representation – Boundary matching – Shape representation.
(10)

Total: L: 45+T: 30=75

Tutorial Practices:

1. Basic image processing techniques like sampling and quantization

2. Implementation of Image segmentation and edge detection.
3. Implementation of Histogram equalization.
4. Implementation of 2-D DFT and DCT.
5. Implementation of feature extraction.
6. Implementation of image filtering methods in spatial and frequency domain.
7. Image restoration.
8. Implementation of image classification and clustering.
9. Developing simple image analysis applications

REFERENCES:

1. Rafael C Gonzalez and Richard E Woods, ―Digital Image Processing‖, Prentice Hall, 2011.
2. Kenneth R Castleman, ―Digital Image Processing‖, Pearson Education, 2007.
3. Anil K Jain. ―Fundamentals of Digital Image Processing‖, Prentice Hall, 2001.

17SA67 GAME THEORY

3204
INTRODUCTION: Basic concepts -Theory of rational choice – Interacting decision makers. (2)

STRATEGIC GAMES AND NASHEQUILIBRIUM: Strategic games: Examples –Nash equilibrium: concept and examples -Best
response – Dominated actions –Symmetric games and symmetric equilibria- Illustrations: Cournot‘sand Bertrand‘s models of
duopoly,Electoral competition, War of Attrition , Auctions, Accident Laws .
(8+5)

MIXED STRATEGY NASHEQUILIBRIUM::Introduction, Strategic games with randomization- Mixed strategy Nash equilibrium:
concept and examples - Dominated Actions -Formation of Players‘ beliefs - Illustrations: Expert diagnosis, Reporting a crime.
(6+4)
EXTENSIVE GAMES WITH PERFECT INFORMATION: Strategies and outcomes – Nash equilibrium – Sub game perfect
equilibrium –Backward induction - Illustrations: Stackelberg‘s model of duopoly, Buying votes, Ultimatum game. (6+5)
GAMES WITH IMPERFECT INFORMATION: Bayesian games – Examples – Strategic information – Transmission – Agenda
Control with imperfect Information – Signaling games - Education as a signal of ability. (6+5)

129
REPEATED GAMES: Nash equilibrium in repeated games, finitely and infinitely repeated Prisoner's Dilemma - – Sub game –
Perfect equilibria and the one – deviation – Property – General results – Finitely replaced games – Variation on a theme:
Imperfect observability.
(6+4)
BARGAINING: Rubinstein Bargaining Model with Alternating Offers -Nash Bargaining Solution- Relation of Axiomatic and
Strategic Model- Illustration: Trade in market.
(5+3)
AUCTION AND MECHANISM DESIGN: introduction- The Vickery auction- Sponsored Search auction- Social Choice theory-
VCG mechanism.
(6+4)
Total: L: 45+T: 30=75
REFERENCES:

1. Martin J Osborne, ―An Introduction to Game Theory‖, Oxford University Press, 2004.
2. YoavShoham, Kevin Leyton-Brown, ‗Multiagent Systems: Algorithmic, Game Theoretic and Logical Foundations‘,
Cambridge University Press, 2009.
3. Vijay Krishna, ―Auction Theory‖, Academic Press, 2009.

17SA68 INTELLIGENT INFORMATION RETRIEVAL

3204

INTRODUCTION: Overview of IR systems - Historical perspectives - Goals of IR - The impact of the web on IR - The role of
artificial intelligence (AI) in IR – Experimental evaluation of IR: Performance metrics: recall, precision, and F-measure;
evaluations on benchmark text collections - Document representation: Statistical characteristics of text. Basic Query
Processing: Query Operations and Languages- Relevance feedback, Query expansion, Query languages - Data Structure and
File Organization for IR – Automatic Indexing and Indexing Models.
(12)

RETRIEVAL MODELS: Similarity Measures and Ranking - Boolean Matching - Vector Space Models - Probabilistic Models –
ranked retrieval; text-similarity metrics - TF-IDF (term frequency/inverse document frequency) weighting - cosine similarity –
Basic Tokenizing, Indexing, and Implementation of Vector-Space Retrieval: Simple tokenizing, stop-word removal, and
stemming; inverted indices; efficient processing with sparse vectors; Java implementation.
(8)

TEXT REPRESENTATION: Word statistics; Zipf‘s law; Porter stemmer; morphology; index term selection; using thesauri.
Metadata and Markup languages (SGML, HTML, XML).
(5)

SEARCH AND FILTERING TECHNIQUES: Relevance Feedback - User Profiles - Collaborative Filtering - Document and Term
Clustering, Document Categorization. Web Search: IR Systems and the WWW - Search engines; spidering; metacrawlers;
directed spidering; link analysis (e.g. hubs and authorities, Google Page Rank); shopping agents - Heterogeneous Information
Sources - Intelligent Web Agents
(8)

TEXT CATEGORIZATION AND CLUSTERING: Categorization algorithms: Rocchio; naive Bayes; decision trees; and nearest
neighbor. Clustering algorithms: agglomerative clustering; k-means; expectation maximization (EM). Applications to
information filtering; organization; and relevance feedback.
(4)

RECOMMENDER SYSTEMS: Collaborative filtering and content-based recommendation of documents and products.
Information Extraction and Integration : Extracting data from text; XML; semantic web; collecting and integrating specialized
information on the web.
(6)

WEB MINING AND ITS APPLICATIONS

(2)

Total: L: 45+T:
30=75
Tutorial Practices:

1. Different retrieval models namely Boolean, Vector space and Probability based retrieval.
2. Query refinement techniques.
3. Evaluation of the retrieval algorithms.
4. Classification and Clustering techniques.
5. Recommender systems- Collaborative and Content Based Filtering.
6. Information Extraction techniques.
7. Web based retrieval - Link based retrieval, combining content and link information.

130
REFERENCES:

1. Christopher D. Manning, Prabhakar Raghavan and HinrichSchütze, ―Introduction to Information Retrieval‖, Cambridge
University Press. 2012.
2. Ricardo Baeza-Yates and BerthierRibeiro-Neto,‖ Modern Information Retrieval‖, Addison Wesley, 2010.
3. D A Grossman and O Freider, ― Information retrieval: Algorithms and Heuristics‖, Springer, 2004.
4. CroftB., Metzler D., Strohman T., Information Retrieval in Practice, Pearson Education,2010. (Digitized).

17SA69 MATHEMATICAL MODELING

3204

INTRODUCTION TO MODELING: Modeling process, Overview of different kinds of model.

(2)

EMPIRICAL MODELING WITH DATA FITTING: Error function, least squares method; fitting data with polynomials and
splines. (4)

CAUSAL MODELING AND FORECASTING: Introduction, Modeling the causal time series, forecasting by regression analysis,
predictions by regression. Planning, development and maintenance of linear models, trend analysis, modeling seasonality
andtrend, trend removal and cyclical analysis, decomposition analysis. Modeling financial time series. Econometrics and time
seriesmodels. Non seasonal models: ARIMA process for univariate and multivariate. (12)

PORTFOLIO MODELING AND ANALYSIS:Portfolios, returns and risk, risk-reward analysis, asset pricing models, mean
variance portfolio optimization, Markowitz model and efficient frontier calculation algorithm, Capital Asset Pricing Models
(CAPM). (5)

DISCRETE-TIME FINANCE: Pricing by arbitrage, risk-neutral probability measures, valuation of contingent claims, and
fundamental theorem of asset pricing, Cox-Ross-Rubinstein (CRR) model, pricing and hedging of European and American
derivatives as well as fixed-income derivatives in CRR model, general results related to prices of derivatives. (12)

MODELING WITH BIOINFORMATICS: Introduction, Biological data- types, mode of collection, documentation and
submission. Sequence alignment- Definition, significance, dot matrix method, dynamic programming- Global and local
alignment tools, scoring matrices and gap penalties. Multiple sequence alignment: Iterative methods. (10)

Total: L: 45+T: 30=75

Tutorial Practices:

1 .Least square method for fitting data

2. Modeling financial time series
3 . ARIMA process
4. Markowitz model for portfolio modeling
5. Capital asset pricing models
6. CRR model
7. Sequence alignment by using dynamic programming technique
8. Multiple sequence alignment

REFERENCES:

1. Giordano F R, Weir M D, and Fox W P,―A First Course in Mathematical Modeling‖. Brooks/Cole, Belmont, 2014.
2. Christoffersen P, ― Elements of Financial Risk Management‖, Academic Press,2012.
3. Capinski M. and ZastawniakT,―Mathematics for Finance: An Introduction to Financial Engineering‖, Springer, 2011.
4. Mount. DW, ―Bioinformatics Sequence and genome analysis ‖, Cold Spring Harbor Laboratory, Press, 2006.
5. HamdyATaha, ―Operation Research- An Introduction‖, Pearson Education, 2012.

17SA70 OPERATING SYSTEMS

3204
INTRODUCTION: Abstract view of an operating system - Operating Systems Objectives and Functions – Evolution of
Operating Systems - Dual-mode operation - Protecting I/O, memory, CPU, Kernels and micro-kernels – system calls- Structure
of Operating System – Components of Computers – various components of operating systems.
(5)

PROCESS DESCRIPTION AND CONTROL: Job/process concepts - Process Creation – Process Termination - Process
states – Process Description – Process Control.
(5)

PROCESS AND THREADS: Relationship between process and threads – Thread State – Thread Synchronization – Types of
Thread – Multithreading model
(3)

131
PROCESS SCHEDULING: Scheduling basics - CPU-I/O interleaving - (non-)preemption - context switching - Types of
Scheduling – Scheduling Criteria – Scheduling Algorithms.
(4)

PROCESS SYNCHRONIZATION AND DEADLOCK: Concurrent Process – Principles of Concurrency – Race Condition -
Mutual Exclusion – Critical section problems – Software support – Hardware Support – Operating System Support – Deadlock:
Deadlock Prevention, Avoidance and Detection and recovery.
(4)

MEMORY MANAGEMENT: Memory hierarchy – Linking and Loading the process – Memory Management requirement - Fixed
partitioning - Dynamic partitioning – Buddy Systems – Simple paging – Multilevel paging – Inverted paging – Simple
Segmentation – segmentation and paging.
(8)

VIRTUAL MEMORY MANAGEMENT: Need for Virtual Memory management – Demand Paging – Copy on write - Page Fault
handling – Demand Segmentation – Combined demand segmentation and paging - Thrashing- working set model. (4)

FILE SYSTEM MANAGEMENT: Files – Access methods - File System Architecture – Functions of File Management –
Directory and disk structure – file sharing – File system implementation – directory implementation - File Allocation – free space
management.(5)

I/O MANAGEMENT AND DISK SCHEDULING: Organization of I/O function – Evolution of I/O function – Types of I/O devices
– Logical Structure of I/O functions – I/O Buffering – Disk I/O – Disk Scheduling algorithms – Disk Cache. (5)

CASE STUDIES: UNIX, Linux, Windows NT.

(2)

Total: L: 45+T: 30=75

Tutorial Practices:
1. Practicing UNIX Commands
2. Writing SHELL Scripts
3. Writing programs using UNIX System Calls
4. Process Creation and Execution
5. Thread Creation and Execution
6. Process / Thread Synchronization using semaphore
7. Developing Application using Inter Process communication (using sharedmemory, pipes or message queues)
8. Implementation of Memory Management Schemes
9. Implementation of file allocation technique (Linked, Indexed, Contiguous)

REFERENCES:

1. Silberschatz A, Galvin PB and Gagne G, ―Operating System Concepts Essentials‖,John Wiley,2014.

2. William Stallings, ―Operating Systems‖, Pearson Education,2014.
3. Andrew S Tanenbaum, "Modern Operating System", Pearson Education, 2015.
4. Elmasri E, Carrick AG and Levine D, ―Operating Systems: A Spiral Approach‖, Tata McGraw Hill, 2012.
5. McHoes A M and Flynn I M, ―Understanding Operating Systems‖, Cengage Learning, 2013.
6. Dhamdhere D M, ―Operating Systems: A Concept-based Approach‖, Tata McGraw-Hill,2012.
7. UreshVahalia,―Unix Internals‖, Pearson Education, 2010.
8. DiazC, ―Introduction to Unix/Linux‖, Thomson Brooks/Cole, 2007.

17SA71 PREDICTIVE ANALYTICS

3204

LINEAR REGRESSION: Coefficient of determination, Significance test, Residual analysis, Confidence and Prediction
intervals.
(10+5)

MULTIPLE LINEAR REGRESSION: Coefficient of determination, Interpretation of regression coefficients, Categorical

variables, heteroscedasticity, Multi-co linearity outliers, Auto regression and Transformation of variables, Regression, Model
Building.(10+5)

LOGISTIC AND MULTINOMIAL REGRESSION: Logistic function, Estimation of probability using Logistic regression, variance
Wald Test, HosmerLemshow Test, Classification Table, Gini Co-efficient. (10+5)

132
FORECASTING: Moving average, Exponential Smoothing, Casual Models. (10+5)

TIME SERIES ANALYSIS: Moving Average Models, ARIMA models, Multivariate Models
(5+5)

CASE STUDIES (5)

Total: L: 45+T:
30=75
REFERENCES:

1. Max Kuhn and Kjell Johnson, ―Applied Predictive Modeling‖, Springer, 2013
2. Anderson, Sweeney and Williams ―Statistics for business and economics‖, Cengage Learning, 2011.
3. Richard A. Johnson, Irwin Miller and John Freund, ―Probability and Statistics for Engineers‖, Pearson Education, 2014.

17SA72 STATISTICAL LEARNING

3204

STATISTICAL LEARNING :Introduction – Linear regression – Multiple linear regression – Polynomial regression - Assessing
model accuracy – Introduction to R with Case study
(8+5)

CLASSIFICATION: K-Nearest Neighbour as a statistical learning - Logistic regression – multiple logistic regression - Linear
Discriminant analysis – Quadratic discriminant analysis – Comparison of classification methods –Logistic regression, LDA,
QDA and KNN
(10+5)

LINEAR MODEL SELECTION AND REGULARIZATION: Subset selection – Shrinkage methods – Dimension reduction
methods – considerations in high dimensions
(6+5)

MOVING BEYOND NON LINEARITY: Polynomial regression – Step functions – Basis functions – Regression splines –
Smoothing splines – Local regression – Generalized Additive models
(8+5)

TREE BASED METHODS: Classification tree – Regression trees –Random forests - Bagging – Boosting. (8+5)

SUPPORT VECTOR MACHINE: Maximal margin classifier – Classification with non linear decision boundaries – SVMs with
more than one classes
(5+5)

Total: L: 45+T: 30=75

REFERENCES:
1. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibeshirani, An introduction to Statistical learning , Springer 2013.
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, Elements of Statistical Learning: Data Mining, Inference and
Prediction,
Springer 2013.
3. Vladimir N Vapnik, Statistical learning theory, Wiley -1998.

17SA73 STOCHASTIC DIFFERENTIAL EQUATIONS

3204

MATHEMATICAL PRELIMINARIES: Probability spaces - Random variables - Stochastic processes – Brownian motion.
(7+6)

ITO STOCHASTIC CALCULUS: Ito Integrals - Construction of its integrals - Properties

(9+6)

THE ITO FORMULA AND THE MARTINGALE REPRESENTATION THEOREM: The one-dimensional Ito formula - The multi-
dimensional Ito formula – The Martingale representation theorem.
(9+6)

STOCHASTIC DIFFERENTIAL EQUATIONS: Construction of stochastic differential equations - an existence and uniqueness
result- weak and strong solutions.
(10+6)

133
METHOD OF SOLVING STOCHASTIC DIFFERENTIAL EQUATIONS: Linear stochastic differential equations - Reducible
stochastic differential equations - Some explicitly solvable equations.
(10+6)

Total: L: 45+T: 30=75

REFERENCES:

1. Peter E Kloeden and Eckhard Platen,‖ Numerical Solution of Stochastic Differential Equations", Springer, 1999.
2. BerntOksendal , "Stochastic Differential Equations -An Introduction with Applications", Springer, 2003.
3. Sasha Cyganowski, Peter Kloeden and Jerry Ombach, "From elementary Probability to Stochastic Differential Equations
with Maple", Springer, 2002.

17SA74 STOCHASTIC MODELS

3204

STOCHASTIC PROCESSES: Introduction – Classification of Stochastic Processes – Markov Chain: Introduction -Transition
Probability Matrices – Chapman Kolmogorov Equations - Classification of States – Limit Theorems – Branching Processes –
Time Reversible Markov chains – Markov Decision Processes - Applications.
(13+8)

CONTINUOUS TIME MARKOV CHAINS: Introduction – Poisson Process - Birth and Death Processes – Kolmogorov
Differential Equations – Pure Birth Process - Pure Death Process - Applications.
(10+7)

RENEWAL THEORY: Introduction – Distribution - Renewal Theorems - Residual and Excess Life Times -Alternating Renewal
Process - Renewal Reward Processes – Regenerative Processes.
(9+6)
QUEUEING MODELS: Single and Multi-server Poisson Queues - Single Server Queue with Poisson input and general service
M / G/1 – General input and exponential service – G/M/1 Queueing model.
(9+6)
BROWNIAN MOTION: First Passage time distribution – The maximum of a Brownian Motion – The Zeros of Brownian
Motion
Brownian Motion with Drift – Geometric Brownian Motion.
(4+3)
Total: L: 45+T: 30=75
REFERENCES:

1. Saeed Ghahramani, ―Fundamentals of Probability with Stochastic Processes‖, Pearson, 2014.

2. Sheldon M Ross, ―Introduction to Probability Models‖, Academic Press, 2014.
3. Roy D.Yates and David J Goodman, ― Probability and Stochastic Processes – A friendly Introduction for Electrical and
Computer Engineers‖, John Wiley & Sons, 2014..

17SA75 SECURITY IN COMPUTING

3 2 0 4

INTRODUCTION: Security goals – Attacks and countermeasures - Services and mechanisms - Information security -
Computer Security – Network Security - Threats and Risk Assessment
(5+3)

INFORMATION SECURITY: Access Control and Authorization: Access Rights - Access Control Techniques- Access Control
Systems - Authorization - Types of Authorization Systems –Centralized/Decentralized - Implicit /Explicit - Authentication :
Authentication Elements - Authentication Methods :Password -Public-Key Authentication -Remote Authentication - Anonymous
Authentication - Digital Signature-Based Authentication - Wireless Authentication -Developing an Authentication Policy. (7+5)

COMPUTER & NETWORK SECURITY PROTOCOLS: Virus and other malicious codes –Defense Mechanisms - Application
Layer Security: PGP and S/MIME, Transport Layer security :SSL,Network layer security: IPSec and VPNs-Security in the link
layer, (8+5)

SYSTEM SECURITY: Intruders- Intrusion detection – Audit record- types of intrusion detection system – NIDS- HIDS- hybrid
system - Statistical Anomaly detection – Rule based IDS- Distributed Intrusion detection system – Honey pots -Response to
System Intrusion-Intrusion Prevention Systems (IPSs)
(8+5)

IoT SECURITY: IoT threats – Attacks & Privacy preservation: Attacks – Defenses- privacy preservation on IoT – Authentication
- IoT data security – Security protocols for IoT access networks – Security and impact of IoT on mobile network
(5+4)

134
COMPUTER AND NETWORK FORENSICS: Computer forensics: Elements – investigative procedures – Anaysis of Evidence-
Network forensics- Intrusion Anlaysis – Damage assessment – forensic tools
(4+3)

CASE STUDIES: Malware Analysis – Security in Windows/Android /iOS - Wireless Network Security -Security and Privacy
challenges in Social Networks-Cloud Security.
(8+5)

Total: L: 45+T: 30=75

REFERENCES:
1. Behrouz Forouzan and Debdeep Mukhopadhyay, ―Cryptography and Network Security‖, Tata McGraw Hill, New Delhi,
2010.
2. Roberta Bragg, Mark Rhodes Ousley and Keith Strassbery, ―The complete reference, Network Security‖, Tata McGraw
Hill, New Delhi, 2008.
3. Joseph Migga Kizza, ―A Guide to Computer Network Security‖,Springer-Verlag London Limited ,2009.
4. William Stallings,‖Network security Essentials: Applications and standards‖ ,Fourth edition, Prentice Hall, 2011
5. Fe Hu,‖Security and Privacy in Internet of Things:Models,algorithms and Implementations ―, CRC Press, 2016

17SA76 EPIDEMIC MODELS

3204

INTRODUCTION: The epidemic in a closed population – Initial growth-the final size. Heterogeneity: Differences in infectivity,
differences in infectivity and susceptibility.
(8+5)

STRUCTURED POPULATIONS: The concept of state-i-states, p-states, recapitulation and problem formulation.
(8+5)

THE BASIC REPRODUCTION RATIO: The definition of R0, general h-state, on conditions that simplify the computation of R0,
sub models for the kernel, extended example, pair formulation models. Partially vaccinated populations, the intrinsic growth
rate r, some generalities, separable mixing.
(15+11)

MACROPARASITES: Introduction, counting parasite load, the calculation of R0 for life cycles, seasonality and R0, a
pathological model.
(8+5)

CONTACT: Introduction, Contact duration, consistency conditions, effects of subdivision, network models.
(6+4)

Total: L: 45+T:
30=75
REFERENCES:

1. O.Diekmann, J.A.P. Heesterbeek, ―Mathematical Epidemiology of Infectious Diseases: Model building, Analysis and
Interpretation‖, John Wiley &Sons, New York, USA, 2000.
2. Roy M. Anderson and Robert M. May, ―Infectious diseases of humans; dynamic and control‖ Oxford university press,
1992.
3. Diekmann O., Heesterbeek, J.A.P. and Britton, T. Mathematical tools for understanding infectious disease dynamics.
Princeton, Univ.Press(2012).

17SA77 GEOMETRY OF LOCALLY FINITE SPACES

3204

AXIOMATIC APPROACH TO DIGITAL TOPOLOGY: Axioms of Digital Topology, Relation between the suggested and
classical Axioms, Deducing the properties of ALF spaces from the axioms.
(8+5)

ABSTACT CELL COMPLEXES: Topology of complexes, Cartesian complexes and combinatorial coordinates, AC complexes
compared with other Locally Finite Spaces.
(10+7)

COMBINOTORIAL HOMEOMORPHISM: Definition of combinatorial homeomorphism, balls and spheres, generalized

boundary and
boundary of space, orientation of AC complexes, combinatorial manifolds, block complexes, consistency of the (m,n)-
adjacencies
(10+7)

MAPPINGS AMONG LOCALLY FINITE SPACES: Connected –Preserving Mappings (CPM), the combinatorial
homeomorphism, properties of manifolds and block complexes.
(8+5)

135
HOMOLOGY: Homology of groups, matrix reduction, relative homology, exact sequences, co-homolog
(9+6)

Total: L: 45+T:
30=75

REFERENCES:

1. Vladimir A. Kovalevsky, Geometry of Locally Finite Spaces: Computer Agreeable Topology and Algorithms for computer
imaginary, House Dr. Baerbel Kovalevski,2008.
2. Allen Hatcher, Algebraic Topology, Cambridge University Press, 2002
3. Herbert Edlesbrunner and John Harer, Computational Topology An Introduction, AMS,2010.

15SA78 SOFT COMPUTING

3204
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING: Subject of AI – Problem solving by intelligent search – Breadth First
Search, Depth First Search, Iterative Deepening, Hill Climbing, Iterative Deepening, A*, Best First Search.
(7)

GENETIC ALGORITHM: Basic Concepts – Encoding – Binary, Permutation, Tree, Value – Fitness Function – Reproduction –
Roulette Wheel, Boltzmann, Tournament, Rank, Elitism – Operators - Crossover – Single point, Two point, Multi point,
Uniform, Matrix, Partially Matched, Order and Cycle – Mutation – Flip, Swap, Inverse – Application.
(8)

FUZZY SET THEORY: Basic Definitions and Terminologies – Set theory operations – Membership function formulation and
parameterization – Fuzzy rules and reasoning – Extension principle and fuzzy relations, Fuzzy if then rules, Fuzzy reasoning –
Fuzzy Inference Systems – Mamdani fuzzy model, Sugeno Fuzzy models, Tsukamoto fuzzy models.
(13)

NEURAL NETWORKS– Fundamentals – Neural Network Architecture – Learning methods - Simple neural nets – McCulloch
Pitts – Linear separability – Hebb Net – Perceptron – Standard Back Propagation Network – Radial Basis Function Network -
Pattern Association – Hebb rule – Hetero associative memory – Auto associative memory – Iterative Associative net – Discrete
Hopfield Net – Bidirectional Associative Memory – Competitive net – Kohonen Self Organizing Map – Adaptive Resonance
Theory. (17)

Total: L: 45+T: 30=75

REFERENCES:
1. AmitKonar, ―Artificial Intelligence and Soft Computing‖, CRC Press, 2008.
2. Stuart Russell, Peter Norvig, ―Artificial Intelligence: A modern Approach‖, Pearson Education, 2014.
3. Rajasekaran S,VijayalaskhmiPai G A, ―Neural Networks, Fuzzy Logic and Genetic Algorithms‖, Prentice Hall, 2006.
4. David E Goldberg, ―Genetic Algorithms in search, optimization and machine learning‖, Pearson Education, 2007.
5. JangJSR, SunCT and Mizutani E, ―Neuro-fuzzy and Soft Computing‖, Pearson Education, 2004.
6. LaureneFausett,―Fundamentals of Neural Networks‖, Pearson Education, 2011.

Tutorial Practices:

1. Define an application and implement using Fuzzy Logic.

2. Define an application and implement using Genetic Algorithm.
3. Define an application and implement using any type of Neural Network.

Note: The applications should be based on Research Publications.

136