SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY · 2018-04-02 · SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF COMPUTING B.E. / B. Tech REGULAR V REGULATIONS 2015 Project

REGULATIONS 2015

SATHYABAMA

INSTITUTE OF SCIENCE AND TECHNOLOGY (Established under section 3 of UGC Act, 1956)

Jeppiaar Nagar, Rajiv Gandhi Salai, Chennai - 600 119.

SYLLABUS

FACULTY OF COMPUTING

BACHELOR OF ENGINEERING IN COMPUTER SCIENCE AND

ENGINEERING

BACHELOR OF TECHNOLOGY IN INFORMATION TECHNOLOGY

SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF COMPUTING

B.E. / B. Tech REGULAR I REGULATIONS 2015

SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY

R E G U L A T I O N S – 2 0 1 5

CHO I CE BAS E D CRE DI T S Y S T EM

Effective from the academic year 2015-2016 and applicable to the students admitted to the Degree of Bachelor of Engineering / Technology. (Eight Semesters)

1. NOMENCLATURE

Refers to the Bachelor of Engineering / Technology Stream that a student has chosen for study. Eg. B.E in Mechanical Engineering

Refers to the course (Subject) that a student would have to undergo during the study in the Institution.

Refers to the Starting and Completion year of a Programme of study. Eg. Batch of 2015–2019 refers to students belonging to a 4 year Degree programme admitted in 2015 and completing in 2019.

Each Programme and Department of the Institution is grouped under various Faculty. Eg. Faculty of Computing consists of Departments of Computer Science, Information Technology and Computer Applications. This Faculty offers various Undergraduate and Postgraduate Programmes in Engineering like B.E (Computer Science), B.Tech (Information Technology),M.E (Computer Science), M.Tech (Information Technology)

Refers to the Head of a Group of Departments under which various UG and PG Programmes are offered.

Refers to the Head of a Department (HoD) offering various UG and PG programmes. He/She will be the Head of all staff members and Students belonging to the Department

2. STRUCTURE OF PROGRAMME

2.1. Every Programme will have a curriculum with syllabi consisting of theory and practicals such as:

(i) General Foundation courses comprising English, Mathematics, Basic Sciences and Engineering Sciences.

(ii) Core courses belonging to the Major Programme of study.

(iii) Electives offered by the Faculty and the Department related to the Major programme of study.

(iv) Electives to be chosen from a group of courses offered, which can be chosen by any student of any stream.

(v) Laboratory courses such as Workshop practice, Computer Practice, Engineering Graphics, etc.

(vi) Professional Training Courses during the semester vacation.

(vii) Project Work

2.2. Each semester curriculum shall normally have a blend of lecture courses not exceeding 6 and practical courses not exceeding 2.

Programme :

Course :

Batch :

Faculty :

Faculty Head :

HoD :

\

B.E. / B. Tech REGULAR II REGULATIONS 2015


2.3. Each course is normally assigned certain number of credits as follows:

Lecture Hours (Theory) : 1 credit per lecture hour per week, 1 credit per tutorial hour per week, Laboratory Hours : 1 credit for 2 Practical hours, 2 credits for 3 or 4 hours of practicals per

week.

Project Work : 1 credit for 2 hours of project work per week Professional Training : 5 credits for minimum of 3 weeks of training during summer vacations

2.4. The medium of instruction, examinations and project report will be in English Language throughout the Programme

2.5. For the award of the degree, a student has to earn the total number of credits as specified in the curriculum of the relevant branch of study.

3. DURATION OF THE PROGRAMME

A student is normally expected to complete the B.E/B.Tech. Programme in 8 semesters but in any case not more than 12 consecutive semesters from the time of commencement of the course (not more than 10 semesters for those who join 3rd semester under Lateral entry system) The Head of the Department shall ensure that every teacher imparts instruction as per the number of hours specified in the syllabus and that the teacher teaches the full content of the specified syllabus for the course being taught.

4. REQUIREMENTS FOR COMPLETION OF A SEMESTER

A candidate who has fulfilled the following conditions shall be deemed to have satisfied the requirement for completion of a semester.

4.1 He/She secures not less than 90% of overall attendance in that semester.

4.2 Candidates who do not have the requisite attendance for the semester will not be permitted to write the semester Examinations.

5. FACULTY HEAD

Each Faculty is headed by a Faculty Head which comprises of many Departments and Courses offered by them. The Faculty Head is responsible for all activities taking place inside the Faculty in coordination with all Department Heads and all staff members belonging to the faculty. The Faculty Head will be appointed by the Institution on rotational basis. The Faculty Head shall act as a linkage between the HoD’s, faculty members and the students. The Faculty Head makes a review of all the academic activities of Staff, Students and Research on a regular time interval and takes steps to improve the morale of all staff and students.

6. HEAD OF THE DEPARTMENT

Each Department offering various UG and PG programmes is headed by a Head (HoD). The HoD is responsible for allotting courses to each staff member uniformly in consultation with other HoD’s and Faculty Heads. The HoD is responsible for streamlined teaching of courses to students, improvement and Assessment of Teaching Quality within the Department on a continuous basis, Assessment of staff members, transparent conduct of Continuous Assessment Examinations, Interacting with Parents, ensuring that all academic and non academic activities of staff and students are monitored and steps taken for their improvement.

III


7. BATCH COORDINATOR

The Head of the Department shall appoint a Batch coordinator for each batch of students admitted in to a programme, throughout their period of study. The Batch coordinator shall act as a linkage between the HoD, faculty members and the students. The Batch coordinator gets information about the Syllabus coverage by the staff members, requirements of the students academically and otherwise, attendance and progress of the students from the respective Class Counselors. The Batch Coordinator also informs the students of the academic schedule including the dates of assessments and syllabus coverage for each assessment, weightage for each assessment, their Continuous assessment Marks and attendance % details before the commencement of End Semester examinations.

8. CLASS COUNSELOR

There shall be a class counselor for each class. The class counselor will be one among the teachers of the Department. He / She will be appointed by the HoD of the department concerned. The responsibilities for the class Counselor shall be:

To act as the channel of communication between the HoD, Faculty Head, Batch Coordinator, Course Coordinator, staff and students of the respective class.

To collect and maintain various statistical details of students.

To help the Batch Coordinator in planning and conduct of the Classes.

To monitor the academic performance of the students including attendance and to inform the Batch Coordinator.

To take care of the students’ welfare activities like industrial visits, Seminars, awards etc.

9. COURSE COORDINATOR FOR EACH COURSE

• Each theory course offered to more than one class or branch or group of branches, shall have a “Course coordinator” comprising all the teachers teaching the course, with one of the senior staff amongst them normally nominated as course coordinator, by the faculty head in consultation with the respective HoD’s.

• The “Course Coordinator” shall meet the teachers handling the course, as often as possible and ensure a

Common Teaching Methodology is followed for the course, Study materials are prepared by the staff members and communicated to the students periodically, involving students in course based projects and assignments, common question paper for continuous assessment tests, uniform evaluation of continuous assessments Answer sheets by arriving at a common scheme of evaluation.

• The Course coordinator is responsible for evaluating the Performance of the students in the Continuous

Assessments and End Semester exams and analyse them to find suitable methodologies for improvement in the performance. The analysis should be submitted to the HoD and Faculty Head for suitable action.

10. EXAMINATIONS

The end semester examinations shall normally be conducted between October and December during the odd semesters and between March and May in the even semesters. The maximum marks for each theory and


B.E. / B. Tech REGULAR IV REGULATIONS 2015

practical course (including the project work and Viva Voce examination in the final Semester) shall be 100 with the following breakup.

(i) Theory Courses

Continuous Assessment : 50 Marks End Semester Exams : 50 Marks

(ii) For Practical courses

Continuous Assessment : 50 Marks End Semester Exams : 50 Marks

11. CONTINUOUS ASSESSMENT EXAMS

a. Theory courses

There will be a Minimum of two Continuous Assessment Exams, for each Theory course. Each Assessment Exam will be conducted for a Maximum of 50 Marks. The total marks secured in the Two Assessment Exams out of 100, will be converted to 45 Marks. The % -of attendance secured by the candidate in a course in a semester will carry a weightage of 5 Marks, which will be added to the Continuous Assessment Marks for each course.

The Continuous assessment marks obtained by the candidate in the first appearance shall be retained and considered valid for all subsequent attempts, till the candidate secures a pass.

b. Practical courses

For Practical Courses, the student will be evaluated on a continuous basis for 25 Marks (which will include performing all experiments, submitting Observation and Record Note Book in scheduled Format and Time), 20 Marks for Model Exam at the end of the semester and 5 Marks for Attendance in the course.

For Practical courses, if a student has been absent for some Practical Classes or has performed poorly, then the student will have to get permission from the Lab incharge and batch coordinator to do the experiments, so that he/she meets all the requirements for the course and thereby allowed to appear for Model and End Semester Exams.

If a student has not done all the experiments assigned for that Lab, before the scheduled date or has attendance percentage less than 90%, the student will not be allowed to appear for the Model and end semester Practical Exam. Such students will have to redo the course again by doing all the experiments in the next semester when the course is offered.

12. ELECTIVE COURSES

Every student has the option of choosing four elective courses during the period of study. These electives will be offered in the Prefinal and Final year of study. The student has to select atleast two electives offered by the respective department. The student also has the choice of selecting the other two electives from electives offered by Departments within the faculty in that semester and / or from the electives which can be opted as elective by all undergraduate branches of the Institution.

13. FINAL YEAR PROJECT WORK

Project work is to be undergone by each student in the final year. The Project work has been divided in to two Phases (Phase 1 and 2). Project work Phase 1 is to be done in the Pre-final Semester and Phase 2 during the Final Semester.


B.E. / B. Tech REGULAR V REGULATIONS 2015

Project work may be allotted to a single or two students as a Group. In special cases, the number of students in a Project Group cannot exceed Three, if it can be justified by the Project Supervisor and HoD, that the Project Work Content is large enough.

For Project work, Assessment is done on a continuous basis by 3 Reviews for 50 Marks and Final Viva voce carries 50 Marks.

There shall be three Project Reviews (Conducted during the Pre-final semester and Final Semester) to be conducted by a review committee. The student shall make presentation on the progress made, before the committee. The Head of the Department shall constitute the review committee for each branch in consultation with Faculty Head. . The members of the review committee will evaluate the progress of the Project and award marks.

PROJECT REVIEWS FINAL PROJECT

VIVA VOCE 1 2 3

Max. Marks 5 15 30 50

The total marks obtained in the three reviews, rounded to the nearest integer is the Continuous Assessment marks out of 50. There shall be a viva-voce examination for final Semester Examination conducted by one internal examiner, one external examiner and the supervisor concerned.

A student is expected to attend all the Project Reviews conducted by the Institution on the scheduled dates. It is mandatory for every student to attend the Reviews, even if they are working on a project in an industry based outside Chennai city. It is their duty to inform the organization about the project reviews and its importance, and get permission to attend the same. If a student does not attend any of the Project Reviews, he / she shall not be allowed for the successive reviews and thereby not allowed to appear for the Final viva voce.

The final Project viva-voce examination shall carry 50 marks. Marks are awarded to each student of the project group based on the individual performance in the viva-voce examination. The external examiner shall be appointed by the Controller of Examinations. The Internal and External Examiner will evaluate the Project for 20 Marks each. The project report shall carry a maximum of 10 marks.

The candidate is expected to submit the project report as per the guidelines of the Institution on or before the last day of submission. If a candidate fails to submit the project report on or before the specified deadline, he / she can be granted an extension of time up to a maximum limit of 5 days for the submission of project work, by the Head of the Department.

If he / she fails to submit the project report, even beyond the extended time, then he / she is deemed to have failed in the Project Work and shall register for the same in the subsequent semester and re-do the project after obtaining permission from the HoD and Faculty Head.

14. PASSING REQUIRMENTS

A candidate should secure not less than 50% of total marks prescribed for the courses, subject to securing a minimum of 30% marks out of Max. Mark in End Semester Exams. Then he / she shall be declared to have passed in the Examination.

If a candidate fails to secure a pass in a particular course, it is mandatory that he / she shall register and reappear for the examination in that course during the next semester when examination is conducted in that course. It is mandatory that he / she should continue to register and reappear for the examination till he / she secures a pass.


B.E. / B. Tech REGULAR VI REGULATIONS 2015

15. AWARD OF GRADES

All assessments of a course will be done on absolute marks basis. However, for the purpose of reporting the performance of a candidate, letter grades, each carrying certain number of points, will be awarded as per the range of total marks (out of 100) obtained by the candidate in each course as detailed below:

RANGE OF MARKS FOR GRADES

Range of Marks Grade Grade Points (GP)

90-100 A++ 10

80-89 A+ 9

70-79 B++ 8

60-69 B+ 7

50-59 C 6

00-49 (Reappear) RA 0

ABSENT AAA 0

Withdrawal W 0

Authorised Break of Study ABS 0

CUMULATIVE GRADE POINT AVERAGE CAL CULATION The CGPA calculation on a 10 Point scale is used to describe the overall performance of a student in all

courses from first semester to the last semester. RA, AAA and W grades will be excluded for calculating GPA and CGPA.

ΣiCiGPi CGPA = ΣiCi

where Ci – Credits for the course GPi – Grade Point for the course

Σi – Sum of all courses successfully cleared during all the semesters

Final Degree is awarded based on the following:

CGPA ≥ 9.0 – First Class - Exemplary

CGPA ≥ 7.50 < 9.00 – First Class with Distinction

CGPA ≥ 6.00 < 7.50 – First Class

CGPA ≥ 5.00 < 6.00 – Second Class

Minimum requirements for award of Degree, a student should have obtained a minimum of 5.0 CGPA.

16. GRADE SHEET

After revaluation results are declared, Grade Sheets will be issued to each student which will contain the following details:

Name of the Candidate with Date of Birth and Photograph.

The programme and degree in which the candidate has studied

The list of courses enrolled during the semester and the grade secured

The Grade Point Average (GPA) for the semester.


B.E. / B. Tech REGULAR VII REGULATIONS 2015

17. ELIGIBILITY FOR THE AWARD OF DEGREE

A student shall be declared to be eligible for the award of the B.E/B.Tech. degree, provided the student has successfully completed all the requirements of the programme, and has passed all the prescribed examinations in all the 8 semesters within the maximum period specified in clause 3.

i) Successfully gained the required number of total credits as specified in the curriculum corresponding to his/her programme within the stipulated time.

ii) Successfully completed the programme requirements and has passed all the courses prescribed in all the semesters within a maximum period of 6 years (5 Years for Lateral Entry Candidates) reckoned from the commencement of the first semester to which the candidate was admitted.

iii) Successfully completed any additional courses prescribed by the Institution.

iv) No disciplinary action pending against the student.

v) The award of Degree must have been approved by the Board of Management of the Institution.

18. CLASSIFICATION OF THE DEGREE AWARDED

1. A candidate who qualifies for the award of the Degree having passed the examination in all the courses of all the 8 semesters in his/her first appearance within a maximum of 8 consecutive semesters (maximum of 6 semesters for Lateral entry students who join the course in the third semester) securing a overall CGPA of not less than 9.0 (Calculated from 1s t semester) shall be declared to have passed the examination in First Class - EXEMPLARY. Authorized Break of Study vide Clause 20, will be considered as an Appearance for Examinations, for award of First Class – Exemplary. Withdrawal from a course shall not be considered as an appearance for deciding the eligibility of a candidate for First Class – Exemplary

2. A candidate who qualifies for the award of the Degree having passed the examination in all the courses of all the 8 semesters in his/her first appearance within a maximum of 8 consecutive semesters (maximum of 6 semesters for Lateral entry students who join the course in the third semester) securing a overall CGPA of not less than 7.5 (Calculated from 1s t semester) shall be declared to have passed the examination in First Class with Distinction. Authorized Break of Study vide Clause 20, will be considered as an Appearance for Examinations, for award of First Class with Distinction. Withdrawal shall not be considered as an appearance for deciding the eligibility of a candidate for First Class with Distinction.

3. A candidate who qualifies for the award of the Degree having passed the examination in all the courses of all the 8 semesters within a maximum period of 8 consecutive semesters (maximum of 6 semesters for Lateral entry students who join the course in the third semester) after his/her commencement of study securing a overall CGPA of not less than 6.0 (Calculated from 1s t semester), shall be declared to have passed the examination in First Class. Authorized break of study vide Clause 20 (if availed of) or prevention from writing End semester examination due to lack of attendance will not be considered as Appearance in Examinations. For award of First class, the extra number of semesters than can be provided (in addition to four years for Normal B.E / B.Tech and 3 years for Lateral Entry)will be equal to the Number of semesters availed for Authorized Break of Study or Lack of Attendance. Withdrawal shall not be considered as an appearance for deciding the eligibility of a candidate for First Class.

4. All other candidates who qualify for the award of the Degree having passed the examination in all the courses of all the 8 semesters within a maximum period of 12 consecutive semesters (10 consecutive semesters for Lateral Entry students, who join the course in the third semester) after his/her commencement of study securing a overall CGPA of not less than 5.0, (Calculated from 1st semester) shall be declared to have passed the examination in Second Class.


B.E. / B. Tech REGULAR VIII REGULATIONS 2015

5. A candidate who is absent in semester examination in a course/project work after having registered for the same, shall be considered to have appeared in that examination for the purpose of classification.

6. A candidate can apply for revaluation of his/her semester examination answer paper in a theory course, immediately after the declaration of results, on payment of a prescribed fee along with application to the Controller of Examinations through the HoD. The Controller of Examination will arrange for the revaluation and the result will be intimated to the candidate concerned through the Head of the Department. Revaluation is not permitted for practical courses and for project work.

19. WITHDRAWAL FROM EXAMINATIONS

A candidate may, for valid reasons, (medically unfit / unexpected family situations) be granted Permission to withdraw from appearing for the examination in any course or courses in any one of the semester examination during the entire duration of the degree programme.

Withdrawal application shall be valid only if the candidate is otherwise normally eligible (if he/she satisfies Attendance requirements and should not be involved in Disciplinary issues or Malpractice in Exams) to write the examination and if it is made within FIVE days before the commencement of the examination in that course or courses and also recommended by the Faculty Head through HoD.

Notwithstanding the requirement of mandatory FIVE days notice, applications for withdrawal for special cases under extraordinary conditions will be considered based on the merit of the case.

Withdrawal shall not be considered as an appearance for deciding the eligibility of a candidate for First Class – Exemplary, First Class with Distinction and First Class.

Withdrawal is NOT permitted for arrears examinations of the previous semesters.

20. AUTHORIZED BREAK OF STUDY

This shall be granted by the Institution Management, only once during the full duration of study, for valid reasons for a maximum of one year during the entire period of study of the degree programme.

A candidate is normally not permitted to temporarily break the period of study. However, if a candidate would like to discontinue the programme temporarily in the middle of duration of study for valid reasons (such as accident or hospitalization due to prolonged ill health), he / she shall apply through the Faculty Head in advance (Not later than the Reopening day of that semester) through the Head of the Department stating the reasons. He /She should also mention clearly, the Joining date and Semester for Continuation of Studies after completion of break of Study. In such cases, he/she will attend classes along with the Junior Batches. A student who availed break of study has to rejoin only in the same semester from where he left.

The authorized break of study will not be counted towards the duration specified for passing all the courses for the purpose of classification only for First Class.

The total period for completion of the programme shall not exceed more than 12 consecutive semesters from the time of commencement of the course (not more than 10 semesters for those who join 3rd semester under Lateral entry system) irrespective of the period of break of study in order that he / she may be eligible for the award of the degree

If any student is not allowed to appear for Examinations for not satisfying Academic requirements and Disciplinary reasons, (Except due to Lack of Attendance), the period spent in that semester shall NOT be considered as permitted ‘Break of Study’ and is NOT applicable for Authorized Break of Study.


B.E. / B. Tech REGULAR IX REGULATIONS 2015

In extraordinary situations, a candidate may apply for additional break of study not exceeding another one Semester by paying prescribed fee for break of study. Such extended break of study shall be counted for the purpose of classification of First Class Degree.

If the candidate has not reported back to the department, even after the extended Break of Study, the name of the candidate shall be deleted permanently from the Institution enrollment. Such candidates are not entitled to seek readmission under any circumstances.

21. PROFESSIONAL TRAINING

Every student is required to undergo Industrial Visits during every semester of the Programme. HoDs shall take efforts to send the students to industrial visits in every semester.

The students will have to undergo Professional training for a Minimum period of 3 weeks during the semester Holidays at the end of second year and Third Year respectively.

This could be internship in a industry approved by the Faculty Head or Professional Enrichment courses (like attending Summer Schools, Winter Schools, Workshops) offered on Campus or in Registered Off Campus recognised Training Centres approved by the Faculty Head for a minimum period of 3 weeks.

A report on Training undergone by the student, duly attested by the Coordinator concerned from the industry / Organisation, in which the student has undergone training and the Head of the Department concerned, shall be submitted after the completion of training. The evaluation of report and viva voce examination can be computed as per norms for the final Semester examination.

The evaluation of training will be made by a three member committee constituted by Head of the Department in consultation with Batch Coordinator and respective Training Coordinator. A presentation should be made by the student before the Committee, based on the Industrial Training or Professional Enrichment undergone.

22. NON CREDIT COURSES

Every student has the opportunity to enroll in any of the following Non Credit Courses, during the programme. The student will have to register for the courses with the respective coordinator before the end of First Semester.

National Cadet Corps (NCC)

National Service Scheme (NSS) x

Youth Red Cross (YRC)

SPORTS CONTRIBUTION: The student is involved in any sport and represents the Institution in Tournaments.

PROFESSIONAL CLUBS: Any student can also involve in any of the Professional Clubs available in the Institution .

The above contribution should be completed by the end of sixth Semester (end of Pre-final year) as per the requirements. The Contribution and the Performance of the candidate, will be Printed in the Final Semester Grade sheet and Consolidate Grade Sheet under the Category “NON CREDIT COURSES” indicated as SATISFACTORY or NOT SATISFACTORY.

23. OPPORTUNITY TO GAIN EXPOSURE OUTSIDE THE INSTITUTION

This is facilitated by the “Centre for Academic Partnerships” of Sathyabama Institute of Science And Technology consisting of a team of experienced faculty members involved in forging Partnerships with Leading Universities, Educational Institutions, Industrial and Research establishments in India and Abroad.


B.E. / B. Tech REGULAR X REGULATIONS 2015

A student can be selected, to get Professional Exposure in his/her area of Expertise in any Reputed Research Organization or Educational Institution of repute or any Universities in India and abroad.

This is possible only with the List of Research Organizations, Educational Institutions in India and abroad approved by Sathyabama Institute of Science And Technology.

A student should have got a minimum of 6 CGPA without any arrears at the time of applying and at the time of undergoing such courses outside, to avail this facility.

The student can have the option of spending not more than three to Six months in the Final year or Pre-final year of his/her Degree. During this period, the student can do his/her Project work or register for courses which will be approved by the Centre for Academic Partnerships (CAP), under the Guidance of a Project Supervisor who is employed in the Organization and Co-guided by a staff member from our Institution.

Applications for the above should be submitted by the students to the Centre for Academic Partnerships (CAP), in the required format, with complete details of Institution, Courses and Equivalence Details and approved by the Faculty Head.

The Centre will go through the applications and select the students based on their Academic Performance and enthusiasm to undergo such courses. This will be communicated to the Universities Concerned by the Centre.

The performance of the student in the courses, registered in that Institute or University will be communicated officially to Centre for Academic Partnerships (CAP).

The students who undergo training outside the Institution (either in India or Abroad) is expected to abide by all Rules and Regulations to be followed as per Indian and the respective Country Laws, and also should take care of Financial, Travel and Accommodation expenses.

24. DISCIPLINE

Every student is required to observe disciplined and decorous behaviour both inside and outside the Institution and not to indulge in any activity which will tend to bring down the prestige of the Institution. If a student indulges in malpractice in any of the theory / practical examination, continuous assessment examinations he/she shall be liable for punitive action as prescribed by the Institution from time to time.

25. REVISION OF REGULATIONS AND CURRICULUM

The Institution may from time to time revise, amend or change the regulations, scheme of examinations and syllabi if found necessary.


B.E. / B. Tech REGULAR XIII REGULATIONS 2015

PROGRAMME : B.E

COMPUTER SCIENCE AND ENGINEERING

CURRICULUM

SEMESTER 1

Sl. No. COURSE CODE TITLE L T P C PAGE No.

THEORY

1. SMT1101 Engineering Mathematics – I 3 1 0 4 2

2. SPH1101 Physics of Engineering Materials 3 0 0 3 10

3. SCY1101 Engineering Chemistry 3 0 0 3 15

4. SEE1102 Basic Electrical Engineering 3 0 0 3 22

5. SCS1101 Problem Solving Techniques 3 0 0 3 28

6. SCS1102 Fundamentals of Programming 3 0 0 3 29

PRACTICAL

1. SME4053 Engineering Graphics 0 0 4 2 62

2. SCS4101 Programming in C lab 0 0 4 2 65

TOTAL CREDITS 23

SEMESTER 2


THEORY

1. SHS1101 English for Science and Technology 3 0 0 3 01

2. SMT1105 Engineering Mathematics – II 3 1 0 4 03

3. SPH1102 Physics of Electronic Devices / 3 0 0 3 12

SPH 1103 Engineering Physics/ 3 0 0 3 13

SPH 1104 Applied Biophysics 3 0 0 3 14

4. SCY1102 Chemistry of Electronic Materials / 3 0 0 3 16

SCY1103 Chemistry of Industrial Materials / 3 0 0 3 17

SCY1104 Bio Organic Chemistry / 3 0 0 3 18

SCY1105 Physical Chemistry 3 0 0 3 19

5. SCH1101 Environmental Science and Engineering 3 0 0 3 20

6. SCS1103 Data Structures 3 0 0 3 30

PRACTICAL SPH4051 Engineering Physics Lab 0 0 2 1 61

1.

2. SCY4051 Engineering Chemistry Lab 0 0 2 1 61

3. SCS4102 Data Structures Lab 0 0 4 2 65

TOTAL CREDITS 23


B.E. / B. Tech REGULAR XIV REGULATIONS 2015

SEMESTER 3


THEORY 1. SMT1203 Discrete Mathematics and Numerical Methods

3 1 0 4 04

2. SEC1101 Electronic Devices 3 0 0 3 23

3. SCS1201 Advanced Data Structures 3 0 0 3 31

4. SCS1202 Object Oriented Programming 3 0 0 3 32

5. SCS1203 Fundamentals of Digital Systems 3 0 0 3 33

6. SCS1204 Theory of computation / 3 1 0 4 34

SCS1208 Foundation for System Programming 3 1 0 4 38

PRACTICAL 1. SEC4085 Electronic Devices & Digital Systems Lab

0 0 4 2 63

2. SCS4201 Object Oriented Programming Lab 0 0 4 2 66

TOTAL CREDITS 24

SEMESTER 4


THEORY 1. SMT1205 Probability and Statistics /

3 1 0 4 05

SMT1206 Number Theory And Linear Algebra / 3 1 0 4 06

SMT1207 Graph Theory / 3 1 0 4 07

SMT1208 Applied Statistics / 3 1 0 4 08

SMT1209 Foundations Of Mathematics 3 1 0 4 09

2. SEC1312 Microprocessor and Microcontroller Based Systems 3 0 0 3 25

3. SCS1205 Object Oriented Analysis and Design 3 0 0 3 35

4. SCS1206 Design and Analysis of Algorithm 3 0 0 3 36

5. SCS1207 Computer Architecture & Organisation 3 0 0 3 37

PRACTICAL 1. SIT4201 Programming in Java (50 Theory+ 50 Laboratory)

2 0 4 4. 71

2. SEC4087 Microprocessor and Microcontroller Lab 0 0 4 2 64

3. SCS4202 Object Oriented Analysis and Design Lab 0 0 4 2 67

4. S11PT1 Professional Training – 1 0 0 5 5

TOTAL CREDITS 29

SEMESTER 5


THEORY

1. SCS1301 Operating System 3 0 0 3 39

2. SCS1302 Computer Graphics and Multimedia Systems 3 0 0 3 40

3. SCS1303 Compiler Design / 3 0 0 3 41

SCS1304 System Software 3 0 0 3 42

4. SCS1305 Software Engineering 3 0 0 3 43

5. SCS1306 Database Management System 3 0 0 3 44

PRACTICAL 1. SCS4301 Operating System Lab 0 0 4 2 68

2. SCS4302 RDBMS Lab 0 0 4 2 68

3. SCS4303 Compiler Lab 0 0 4 2 69

TOTAL CREDITS 21


B.E. / B. Tech REGULAR XIII REGULATIONS 2015

SEMESTER 6


THEORY

1. SIT1305 Machine Learning / 3 1 0 4 56

SCS1307 Computational Intelligence 3 1 0 4 45

2. SCS1308 Number Theory and Cryptography / 3 1 0 4 46

SCS1309 Network Security 3 1 0 4 47

3. SIT1301 Data Mining & Data Warehousing / 3 0 0 3 52

SIT1306 Data Mining / 3 0 0 3 57

SIT1307 Data Warehousing 3 0 0 3 58

4. SIT1304 Cloud Computing 3 0 0 3 55

5. SCS1310 Computer Networks / 3 1 0 4 48

SCS1311 Network Programming and Management 3 1 0 4 49

6. Elective – 1 3 0 0 3

PRACTICAL

1. SSIT4302 Cloud Computing Lab 0 0 4 2 73

2. SCS4304 Networking Lab 0 0 4 2 69


TOTAL CREDITS 30

SEMESTER 7


THEORY

1. SBA1101

Principles of Management and Professional Ethics 3 0 0 3 26

2. SCS1401 Rich Internet Applications 3 0 0 3 51

3. S IT1402 Mobile Application Development 3 0 0 3 60

4. Elective – 2 3 0 0 3

PRACTICAL

1. SCS4401 Distributed Computing Lab 0 0 4 2 70

2. SIT4402 Mobile Application Development Lab 0 0 4 2 74

3. Project Work (Phase 1)

TOTAL CREDITS 16

SEMESTER 8


THEORY

1. SPR1307 Resource Management Techniques 2 1 0 1 0 3 27

2. Elective – 3 3 0 0 0 0 3

3. Elective – 4 3 0 0 0 0 3

PRACTICAL

S11PROJ Project Work (Phase 1 & 2) 0 0 30 0 30 15

TOTAL CREDITS 24

TOTAL CREDITS FOR THE PROGRAMME 190



ELECTIVE COURSES (GROUP A)


1. SEC1606

Digital Image Processing 3 0 0 3 105

2. SEC1401 Principles Of Digital Signal Processing

3 0 0 3 104

3. SEC1615 Nano Electronics 3 0 0 3 107

4. SCS1601 Natural Language Processing

3 0 0 3 75

5. SCS1602 Design Thinking

3 0 0 3 76

6. S IT1604 Virtualization Techniques

3 0 0 3 91

7. S IT1606 Bigdata

3 0 0 3 93

8. S IT1608 Green Computing

3 0 0 3 95

9. SIT1616 Hardware Peripherals and Interfacing

3 0 0 3 101

10. SIT1617 Mobile Computing

3 0 0 3 102

11. SIT1618 Open Source System 3 0 0 3 103

Sl. No. COURSE CODE

ELECTIVE COURSES (GROUP B) TITLE L T P C PAGE No.

1. SCS1603 Software Project management

3 0 0 3 77

2. SCS1604 Software Architecture 3 0 0 3 78

3. SCS1605 Design Patterns

3 0 0 3 79

4. SCS1606 Software Quality Management

3 0 0 3 80

5. SCS1607 Unified Modeling Language

3 0 0 3 81

6. SCS1608 Software Quality Assurance and Testing

3 0 0 3 82

7. SCS1613 Distributed Database 3 0 0 3 83


B.E. / B. Tech REGULAR XV REGULATIONS 2015

P R O G R A M M E : B . T E C H

I N F O R M A T I O N T E C H N O L O G Y

CURRICULUM

S E M E S T E R 1

.0Sl. No. COURSE CODE TITLE L T P C PAGE No.

THEORY

1.

SMT1101 Engineering Mathematics – I 3 1 0 4 2

2. SPH 1101 Physics of Engineering Materials 3 0 0 3 10

3. SCY1101 Engineering Chemistry 3 0 0 3 15

4. SEE1102 Basic Electrical Engineering 3 0 0 3 22

5. SCS1101 Problem Solving Techniques 3 0 0 3 28 6. SCS1102 Fundamentals of Programming 3 0 0 3 29

PRACTICAL

1.

SME4053 Engineering Graphics 0 0 4 2 62

2. SCS4101 Programming in C Lab 0 0 4 2 65

TOTAL CREDITS 23

Sl. No. COURSE CODE

S E M E S T E R 2

TITLE

C PAGE No. L T P

THEORY

1. SHS1101 English for Science and Technologyin 3 0 0 3 1

2. SMT1105 Engineering Mathematics – II 3 1 0 4 3

3. SPH1102 Physics of Electronic Devices / 3 0 0 3 12

SPH 1103 Engineering Physics/ 3 0 0 3 13

SPH 1104 Applied Biophysics 3 0 0 3 14

4. SCY1102 Chemistry of Electronic Materials / 3 0 0 3 16

SCY1103 Chemistry of Industrial Materials / 3 0 0 3 17

SCY1104 Bio Organic Chemistry / 3 0 0 3 18

SCY1105 Physical Chemistry 3 0 0 3 19

5. SCH1101 Environmental Science and Engineering 3 0 0 3 20 6. SCS1103 Data Structures 3 0 0 3 30

PRACTICAL

SPH4051 Engineering Physics Lab 0 0 2 1 61 1.

2. SCY4051 Engineering Chemistry Lab 0 0 2 1 61

3. SCS4102 Data Structures Lab 0 0 4 2 65

TOTAL CREDITS 23

L - LECTURE HOURS, T – TUTORIAL HOURS, P – PRACTICAL HOURS, C – CREDITS


B.E. / B. Tech REGULAR XVI REGULATIONS 2015

S E M E S T E R 3


THEORY

1. SMT1203 Discrete Mathematics and Numerical Methods 3 1 0 4 04

2. SEC1214 Basic Analog and Digital Communication 3 0 0 3 24

3. SCS1201 Advanced Data Structures 3 0 0 3 31

4. SCS1202 Object Oriented Programming 3 0 0 3 32

5. SCS1203 Fundamentals of Digital Systems 3 0 0 3 33

6. SCS1204 Theory of computation / 3 1 0 4 34

SCS1208 Foundation for System Programming 3 1 0 4 38

PRACTICAL

1. SEC4088 Digital Systems Lab 0 0 4 2 63

2. SCS4201 Object Oriented Programming Lab 0 0 4 2 66

TOTAL CREDITS

24

Sl. No. COURSE CODE

S E M E S T E R 4

TITLE

C PAGE No. L T P

THEORY 1. SMT1205 Probability and Statistics / 3 1 0 4 05

SMT1206 Number Theory And Linear Algebra / 3 1 0 4 06 SMT1207 Graph Theory / 3 1 0 4 07 SMT1208 Applied Statistics / 3 1 0 4 08

SMT1209 Foundations of Mathematics 3 1 0 4 09

2. SEC1312 Microprocessor and Microcontroller Based Systems 3 0 0 3 25

3. SCS1205 Object Oriented Analysis and Design 3 0 0 3 35

4. SCS1206 Design and Analysis of Algorithm 3 0 0 3 36

5. SCS1207 Computer Architecture & Organisation 3 0 0 3 37

PRACTICAL

SIT4201 Programming in Java (50 Theory+ 50 Laboratory) 2 0 4 4. 71 1.

2. SEC4523 Microprocessor and Microcontroller Lab 0 0 4 2 64

3. SCS4304 Networking Lab 0 0 4 2 67


TOTAL CREDITS

29

Sl. No. COURSE CODE

S E M E S T E R 5

TITLE

C PAGE No. L T P

THEORY

SCS1301 Operating System 3 0 0 3 39 1.

2. SCS1302 Computer Graphics and Multimedia Systems 3 0 0 3 40

3. SCS1303 Compiler Design / 3 0 0 3 41

SCS1304 System Software 3 0 0 3 42

4. SCS1305 Software Engineering 3 0 0 3 43

5. SCS1306 Database Management System 3 0 0 3 44

6. SCS1314 Data Communication and Computer Networks 3 0 0 3 50

PRACTICAL

SCS4301 Operating System Lab 0 0 4 2 68 1.

2. SCS4302 RDBMS Lab 0 0 4 2 68

TOTAL CREDITS

22


B.E. / B. Tech REGULAR XVII REGULATIONS 2015

S E M E S T E R 6


THEORY

1. SIT1301 Data Mining & Data Warehousing / 3 0 0 3 52

S IT1306 Data Mining / 3 0 0 3 57

S IT1307 Data Warehousing 3 0 0 3 58

2. SIT1302 Internet Programming 3 0 0 3 53

3. SIT1303 Data Analytics 3 0 0 4 54

4. SIT1304 Cloud Computing 3 0 0 3 55

5. SCS1308 Number Theory and Cryptography / 3 1 0 4 46

SCS1309 Network Security 3 1 0 4 47

6. Elective – 1 3 0 0 3

PRACTICAL

S IT4301 Internet Programming Lab 0 0 4 2 72 1.

2. S IT4302 Cloud Computing Lab 0 0 4 2 73


TOTAL CREDITS 29

Sl. No. COURSE CODE

S E M E S T E R 7

TITLE L T P C PAGE No.

THEORY

SBA1101 Principles of Management and Professional Ethics 3 0 0 3 26 1.

2. SIT1401 Human Computer Interaction 3 0 0 3 59

3. S IT1402 Mobile Application Development 3 0 0 3 60

4. Elective – 2 3 0 0 3

PRACTICAL

SIT4401 Human Computer Interaction Lab 0 0 4 2 73 1.

2. SIT4402 Mobile Application Development Lab 0 0 4 2 74

3. Project Work (Phase 1)

TOTAL CREDITS 16

Sl. No. COURSE CODE

S E M E S T E R 8


THEORY

SPR1307 Resource Management Techniques 2 1 0 3 27 1.

2. Elective – 3 3 0 0 3

3. Elective – 4 3 0 0 3

PRACTICAL

S12PROJ Project Work (Phase 1 & 2) 0 0 30 15

1.

TOTAL CREDITS 24

TOTAL CREDITS FOR THE PROGRAMME 190


B.E. / B. Tech REGULAR XVIII REGULATIONS 2015

ELECTIVE COURSES (GROUP A)


1. SEC1401 Principles of Digital Signal Processing 3 0 0 3 104

2 SCS1614 Advanced Database Technologies 3 0 0 3 84

3. SCS1615 Advanced Computer Networks 3 0 0 3 85

4. SEC1608 Embedded Systems 3 0 0 3 106

5. SCS1616 Soft Computing 3 0 0 3 86

6. SCS1617 Wireless Sensor Networks 3 0 0 3 87

7. SIT1601 UNIX Internals 3 0 0 3 88

8. S IT1602 Enterprise Application Development 3 0 0 3 89

9. S IT1603 Pervasive Computing 3 0 0 3 90

10. S IT1604 Virtualization Techniques 3 0 0 3 91

Sl. No. COURSE CODE

ELECTIVE COURSES (GROUP B)


1. S IT1605 .NET Programming 3 0 0 3 92

2. S IT1606 Big Data 3 0 0 3 93

3. S IT1607 High Speed Networks 3 0 0 3 94

3. S IT1608 Green Computing 3 0 0 3 95

4. S IT1609 Game Programming 3 0 0 3 96

4. SIT1610 Social Network Analysis 3 0 0 3 97

5. SIT1611 Software Quality Assurance 3 0 0 3 98

6. SIT1612 Cyber Forensics 3 0 0 3 99

7. SIT1613 Automation techniques in Robotics 3 0 0 3 100

8. SIT1616 Hardware Peripherals and Interfacing 3 0 0 3 101

9. SIT1617 Mobile Computing 3 0 0 3 102

10. SIT1618 Open Source Systems 3 0 0 3 103



ELECTIVES

Sl. No. COURSE CODE TITLE L T P C Page No.

1. SBI 1101 Introduction to Bioinformatics 3 0 0 3 108

2. SBI 1605 Python 3 0 0 3 109

3. SBM 1304 Biomaterials 3 0 0 3 110

4. SBM 1404 Hospital Management 3 0 0 3 111

5. SBM 1606 Biomems and Nanotechnology 3 0 0 3 112

6. SBI 1207 PERL Programming 3 0 0 3 113

7. SBT1610 GMP and Quality Concepts 3 0 0 3 114

8. SBT 1611 Biology for Engineers 3 0 0 3 115

9. SCH 1616 Environmental Impact Assessment 3 0 0 3 116

10. SCI 1619 Disaster Management 3 0 0 3 117

11. SCY 1601 Spectroscopy 3 0 0 3 118

12. SCY 1602 Energy Sources 3 0 0 3 119

13. SHS 1601 Life and Employability Skills 3 0 0 3 120

14. SHS 1602 Technical Writing for Scientists 3 0 0 3 121

15. SHS 1603 Professional Communication & Advanced Rhetoric 3 0 0 3 122

16. SIT 1606 Big Data 3 0 0 3 93

17. SIT 1608 Green Computing 3 0 0 3 95

18. SIT 1609 Game Programming 3 0 0 3 96

19. SPH 1601 Energy Physics 3 0 0 3 123

20. SPH 1602 Geophysics 3 0 0 3 124

21. SPH 1603 Space Physics 3 0 0 3 125

22. SPH 1604 Astrophysics 3 0 0 3 126

23. SPH 1605 Atomic and Nuclear Physics 3 0 0 3 127

1


SHS1101 ENGLISH FOR SCIENCE AND TECHNOLOGY L T P Credits Total Marks

(Common to ALL branches of B.E / B.Tech) 3 0 0 3 100

COURSE OBJECTIVE To equip the learners with English communicative skills to handle the present and future needs by exposing

them to situations and tasks in the areas of LSRW, genre and register related to EST by following content based teaching.

UNIT 1 BASIC COMMUNICATION 9 Hrs. Listening for specific information, Self Introduction, Reading Comprehension, Kinds of Sentences, Parts of Speech, Tenses & its Types, Impersonal Passive, Elements of Effective Writing, Letter Writing, Concord, Prefixes & Suffixes

UNIT 2 NUANCES OF EST 9 Hrs. Listening for inference, Describing a process, Cloze Reading and its types, Transcoding - Encoding &

Decoding, Flow Chart, Bar chart, Pie Chart, Tabular Column, Tree Diagram, Technical Definitions, Connectives & Discourse Markers, Word Association- connotations

UNIT 3 EST NOW AND THEN 9 Hrs. Listening and Note taking, Role-play, Reading and interpreting visual material (pictures/newspapers) Essay Writing - Note Making - WH questions - Question Tags - Types of sentences - Compound Nouns, Technical Definitions.

UNIT 4 APPLICATIONS OF EST 9 Hrs. Listening and Classifying information, Group discussion, Reading and identifying the topic sentence, - Writing a

Project Proposal, Recommendations and Instructions - Manual Writing, Use of abbreviations and acronyms, Editing (Spelling, Grammar, Punctuation) Idioms & Phrases. UNIT 5 PREPARING FOR FUTURE 9 Hrs.

Listening and summarizing, Making presentations on given topics - Giving impromptu talks Reading and Summarizing, E-mail writing, Rearranging the Jumbled sentences Reported Speech, Homophones/Homonyms, Creative Writing & Poster making using similes/metaphors.

Max. 45 Hours TEXT / REFERENCE BOOKS 1. Sangeetha Sharma & Meenakshi Raman, “Technical Communication, Principles and Practice, Oxford University Press, New

Delhi, 2011. 2. Sanjay Kumar & Pushp Lata, “Communication Skills”, 2n d Edition, Oxford University Press, New Delhi, 2011. 3. Nira Konar, “Communication Skills for Professionals”, PHI Publishers, Eastern Economy Edition, New Delhi, 2011. 4. Sharon J Gerson & Steven M Gerson, “Technical Communication”, Process and Product, 8th Edition, Orient Longman, 2013. 5. Tyagi Kavita and Misra Padma, “Basic Technical Communication”, PHI Publishers, Eastern Economy Edition, New Delhi, 2011. 6. Nagini,P S et al. “Excellence Through communication”, Shri Jai Publications, Chennai, 2005.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice; with equal distribution to each unit -(10 x 2) 20 Marks

(Task types can include Multiple choice, open ended, gap filling, completion and rewriting the sentences, matching type etc.)

PART B : 2 questions from each unit with internal choice; each carrying 12 marks (5 X 10) 80 Marks (Questions types should testing vocabulary, grammar, reading and writing with equal distribution to all. For example Reading Comprehension type can include skimming, scanning, comprehensive with evaluative, inferential and hypothetical question/ fixed type questions or cloze exercise , Academic paragraph writing based on Flow chart, Tree diagram, Bar diagram, Table and Pie chart to describe process, comparative and contrast, differentiate , Formal letter writing - Application for a Job & Resume Preparation/ Email- Letter inviting a dignitary-Accepting/Declining (or) Rearranging the jumbled sentences in the right order, (or) Requesting for Practical Training/ Letter to the Editor. Writing a Project Proposal / Project Report (or) Essay Writing- Writing an Essay on a given topic, Summary writing or Making notes in the standard format with title. Grammar Rearranging the jumbled sentences in the right order or editing the paragraph for errors based on syllabus)


B.E. / B. Tech REGULAR 2 REGULATIONS 2015

SMT1101 ENGINEERING MATHEMATICS - I L T P

Credits Total Marks

(Common to ALL branches except BIO GROUPS) 3 1 0 4 100

COURSE OBJECTIVE The ability to identify, reflect upon, evaluate and apply different types of information and knowledge to form

independent judgments. Analytical, logical thinking and conclusions based on quantitative information will be the main objective of learning this subject.

UNIT 1 MATRICES 12 Hrs.

Characteristic equation of a square matrix - Eigen values and Eigen vectors of a real matrix- properties of Eigen values- Cayley-Hamilton theorem (without proof) - verification , finding inverse and power of a matrix - Diagonalisation of a matrix using orthogonal transformation - Reduction of quadratic form to canonical form by orthogonal transformation.

UNIT 2 GEOMETRICAL APPLICATIONS OF DIFFERENTIAL CALCULUS 13 Hrs. Curvature -centre, radius and circle of curvature in Cartesian coordinates - Evolutes - Envelope of family of curves with one and two parameters. - Evolute as envelope of normals.

UNIT 3 FUNCTIONS OF SEVERAL VARIABLES 11 Hrs. Introduction to partial derivatives - Jacobians - Taylor’s expansion - Maxima and minima of functions of two variables - Constrained maxima and minima using Lagrange’s multiplier method.

UNIT 4 ORDINARY DIFFERENTIAL EQUATIONS 11 Hrs. First order exact differential equations - Second order linear differential equations with constant coefficients -

Particular Integral for eax, sinax or cosax, xn, xneax, eaxsinbx or eaxcosbx - Equations reducible to linear equations with constant co-efficients using x = et - Simultaneous first order linear equations with constant coefficients - Method of Variation of Parameters

UNIT 5 THREE DIMENSIONAL ANALYTICAL GEOMETRY 13 Hrs. Direction cosines and ratios - Plane - Plane through intersection of two planes - Straight Line - Coplanar lines -

Planes and Straight lines - Shortest distance between two Skew lines - Sphere -Plane section of a sphere - Great Circle.

Max. 60 Hours

TEXT / REFERENCE BOOKS

1. Veerarajan T. “Engineering Mathematics for First Year”, II Edition, Tata McGraw Hill Publishers, 2008.

2. Kandaswamy P & Co, “Engineering Mathematics for First Year”, IX revised edition, S.Chand & Co Pub, 2010.

3. Moorthy M.B.K, Senthilvadivu K, “Engineering Mathematics-I”, Revised Edition, VRB Pub., 2010.

4. Arumugam S & Co. “Engineering Mathematics Vol-I”, Revised Edition, SciTech Pub., 2010.

5. Venkataraman M.K, “Engineering Mathematics - First Year”, (2nd edition), National Publishing Co, 2000.

6. Kreyszig. E, “Advanced Engineering Mathematics”, 10th edition, John Wiley & Sons, Singapore, 2012.

7. Grewal B. S, “Higher Engineering Mathematics”, 41th Edition, Khanna Publications, Delhi, 2011.

END SEMESTER EXAM QUESTION PAPER PATTERN

Max. Marks : 100 Exam Duration : 3 Hrs.

PART A : 10 questions of 2 marks each - No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SMT1105 ENGINEERING MATHEMATICS - II L T P Credits Total Marks

(Common to ALL branches except BIO Groups) 3 1 0 4 100

COURSE OBJECTIVE Analytical, logical thinking and conclusions based on quantitative information will be the main objective of

learning this subject.

UNIT 1 MULTIPLE INTEGRALS 13 Hrs.

Double integrals in cartesian and polar co-ordinates - Change the order of integration - Change of variables from cartesian to polar coordinates- Area of plane curves using double integrals- Triple integrals - Volume using triple integrals in cartesian co-ordinates (simple applications).

UNIT 2 BETA AND GAMMA INTEGRALS 11 Hrs.

Properties of definite Integrals and problems - Beta and Gamma integrals - Relation between them - Properties of Beta and Gamma integrals with proofs - Evaluation of definite integrals in terms of Beta and Gamma function - Simple applications (evaluation of double integrals).

UNIT 3 VECTOR CALCULUS 12 Hrs.

Gradient, divergence and curl - Directional derivative - Irrotational and Solenoidal vector fields - Vector Integration - Simple problems on line, surface and volume Integrals, Green’s theorem in a plane, Gauss divergence theorem and Stoke’s theorem (without proofs)- Simple applications involving cubes and rectangular parallelopipeds.

UNIT 4 LAPLACE TRANSFORMS 14 Hrs. Laplace transform - Transforms of standard functions - properties- Transforms of derivatives and integrals -

Transforms of the type eatf(t), tf(t), f(t)/t - Transform of periodic functions - Transform of unit step function and impulse function - Inverse Laplace transforms - Convolution theorem - Initial and final value theorems

UNIT 5 APPLICATIONS OF LAPLACE TRANSFORM 10 Hrs. Llinear ordinary differential equation with constant co-efficients - Integral equations - Integral equations of convolution type -simultaneous linear differential equations with constant co-efficients.

Max. 60 Hours


1. Kreyszig. E, Advanced Engineering Mathematics, 10th edition, John Wiley & Sons, Singapore, 2012. 2. Grewal B. S, Higher Engineering Mathematics, 41th Edition, Khanna Publications, Delhi,201 1.

3. Bali N.P and Manish Goyal, A Text book of Engineering Mathematics, Eigth Edition, Laxmi Publications Pvt Ltd., 2011.

4. Venkatraman M.K, Engineering Mathematics, National Publishing Company, 2000.

5. NarayananS., Manicavachagom Pillay T.K., Ramanaiah G., Advanced Mathematics for Engineering students, Volume I, 2n d Edition, S. Viswanathan Printers and Publishers, 1992.



PART A : 10 questions of 2 marks each - No choice 20 Marks

PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SMT1203

DISCRETE MATHEMATICS AND NUMERCIAL METHODS

L T P Credits Total Marks

(Common to CSE & IT)

3 1 0 4 100



UNIT 1 LOGIC 11 Hrs. Statements - Truth tables - Connectives - Equivalent Propositions - Tautological Implications - Normal forms - Predicate Calculus, Inference theory for Propositional Calculus and Predicate Calculus.

UNIT 2 SET THEORY AND GROUP THEORY 13 Hrs.

Basic concepts of Set theory - Laws of Set theory - Partition of set, Relations - Types of Relations: Equivalence relation, Partial ordering relation - Graphs of relation - Hasse diagram, Functions: Injective, Surjective, Bijective functions, Compositions of functions, Identity and Inverse functions. Groups - Properties of groups - Semi group and Monoid (definition and examples only) -Subgroups.

UNIT 3 GRAPH THEORY 13 Hrs. Introduction to graphs - Graph terminology - representation of graphs - Graph isomorphism - Connectivity - Euler & Hamilton paths - Tree - Binary tree - Expression tree.

UNIT 4 INTERPOLATION, NUMERICAL DIFFERENTIATION & INTEGRATION 11 Hrs.

Interpolation - Gregory Newton’s Forward and Backward Interpolation for equal intervals - Lagrange’s Interpolation for unequal intervals - Inverse Interpolation - Numerical differentiation: Newton’s forward and backward formula to compute the derivatives - Numerical Integration: Trapezoidal rule, Simpson’s 1/3rd rule and Simpson’s 3/8th rule.

UNIT 5 NUMERICAL METHODS FOR SOLVING EQUATIONS 12 Hrs.

Numerical Solution of algebraic and transcendental equations: Regula Falsi method, Newton Raphson method & Secant method. Numerical Solution of simultaneous linear algebraic equations: Gauss elimination method, Gauss Jordan method, Gauss Jacobi method & Gauss Seidel method.

Max. 60 Hours


1. Tremblay. S. Manohar. R. Discrete mathematics structure with application to computer science, McGraw-Hill, 1975.

2. Kenneth H. Rosen, Discrete mathematics and its applications, 6th Edition, McGraw- Hill, 2007.

3. Venkatraman M K, Discrete Structures, National Pub. Co, Madras. 1992.

4 Kandaswamy P & Co., Numerical Methods, S.Chand Publications, Chennai 2009.

5. Venkataraman M K, Numerical Methods in Science and Engineering, National Pub. Co, Madras. 1992

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs.





SMT1205 PROBABILITY AND STATISTICS L T P Credits Total Marks

(Common to CSE & IT) 3 1 0 4 100


independent judgments.

UNIT 1 PROBABILITY CONCEPTS AND RANDOM VARIABLE 13 Hrs..

Probability Space - Events - Axiomatic approach to Probability - Conditional Probability - Independent Events - Baye’s Theorem - Random Variables - Functions of Random Variables and their Probability Distribution.

UNIT 2 PROBABILITY DISTRIBUTION 13 Hrs. Discrete Distributions: Binomial, Poisson and Geometric - Continuous Distributions: Uniform, Exponential and Normal - Applications only (no derivation).

UNIT 3 TWO DIMENSIONAL RANDOM VARIABLES 11 Hrs. Joint Probability distributions - Marginal and Conditional Distributions -Transformation of Random Variables

UNIT 4 CORRELATION AND REGRESSION 11 Hrs. Correlation - Linear regression - Multiple and Partial Correlation - Curve Fitting - Method of Least Squares - Fitting of the Curve of the form y = a + bx , y = a + bx + cx2, z = ax + by + c.

UNIT 5 ANALYSIS OF VARIANCE AND STATISTICAL QUALITY CONTROL 12 Hrs. Review of F-test - Design of experiments: Completely Randomized Design, Randomized Block Design and Latin Square Design with their Analysis of Variance - Statistical Quality Control:, R, p, np, c - charts.

Max. 60 Hours

TEXT / REFERENCE BOOKS 1. Hong R.V and Tanis E.A, Probability and Statistical Inference, Macmillan.

2. Miller I. and Frund J.E, Probability and Statistics for Engineers.

3. Kossack.C.F. and Henschkee, C.I. Introduction to Statistics and Computer Programming.

4. HOGG and CRAIG, Introduction to Mathematical Statistics.

5. Veerarajan. T., Probability, Statistics and Random Processes, Tata McGraw-Hill, New Delhi.






SMT1206 NUMBER THEORY AND LINEAR ALGEBRA L T P Credits Total Marks

(Common to ALL Branches B.E. / B.Tech) 3 1 0 4 100


independent judgments. Analytical, logical thinking and conclusions based on quantitative information will be the main objective of learning this subject.

UNIT 1 NUMBER THEORY - I 12 Hrs.

Divisibility theory in the integers - the division algorithm, the greatest common divisor, the Euclidean algorithm, the Diophantine equation ax + by = c. Primes and their distribution. The fundamental theorem of arithmetic. The sieve of Eratosthenes. The theory of congruences. Basic properties of congruence. Binary and decimal representation of integers. Linear congruences and Chinese remainder theorem.

(Sections 2.2, 2.3, 2.4, 2.5, 3.1, 3.2, 4.2, 4.3 & 4.4 of Text 1).

UNIT 2 NUMBER THEORY - II 12 Hrs. Fermat's little theorem and pseudo primes Wilson's theorem. The sum and number of divisors. The greatest

integer function. Euler's phi-function. Euler's generalization of Fermat's theorem. Properties of the phi-function. (Sections 5.2, 5.3, 6.1, 6.3, 7.2, 7.3 and 7.4 of Text 1) (Theorems 7.6 and 7.7 only).

UNIT 3 MATRIX THEORY - I 12 Hrs. Rank of a matrix - Elementary transformation, reduction to normal form, row reduced echelon form. Computing the inverse of a non singular matrix using elementary row transformation. (Section 4.1 to 4.13 of Text 2)

UNIT 4 MATRIX THEORY - II 12 Hrs.

System of linear homogeneous equations. Null space and nullity of matrix. Sylvester's law of nullity. Range of a matrix. Systems of linear non homogeneous equations. Characteristic roots and characteristic vectors of a square matrix.

UNIT 5 FUNDAMENTAL THEOREMS ON MATRIX THEORY 12 Hrs. Characteristic roots of Hermitian, Skew Hermitian and Unitary matrices. Characteristic equation of a matrix Cayley-Hamilton theorem.(Sections 6.1 to 6.6 and 11.1 to 11.3 and 11.11).

Max. 60 Hours


1. David M. Burton : Elementary Number Theory, Sixth Edn., TMH.

2. Shanti Narayanan & Mittal : A Text Book of Matrices, Revised edn., S. Chand.

3. C.Y. Hsiung : Elementary Theory of Numbers. Allied Publishers.

4. Neville Robbins : Beginning Number Theory, Second Ed. Narosa.

5. George E. Andrews : Number Theory, HPC.

6. Kenneth Hoffman & Ray Kunze : Linear Algebra, Pearson Education.






SMT1207 GRAPH THEORY L T P Credits Total Marks


COURSE OBJECTIVES The ability to assess and interpret complex situations in mathematical methods of solution is the main objective

of this subject.

UNIT 1 GRAPHS AND CONNECTIVITY 12 Hrs.

Definition of Simple and multiple graphs, Isomorphic graphs, Ramsey numbers, Independent sets and Coverings, Intersection graphs and line graphs, Operation on graphs, Walks, Trials and Paths, Connected components, Blocks, Connectivity sections 2.4, 2.5, 2.6, 2.7, 2.9, 4.0, 4.1, 4.2, 4.3, 4.4.

UNIT 2 EULER TOURS AND HAMILTON CYCLES 12 Hrs. Eulerian paths, Eulerian circuits, Hamiltonian paths, Hamiltonian cycles (omit Fleury's Algorithm), Applications, The Chinese postman problem, The Travelling salesman problem, Trees.

Sections : 5.0, 5.1, 5.2 (only upto and not including Theorem 5.5), 6.0, 6.1, 6.2.

UNIT 3 MATCHINGS AND PLANAR GRAPHS 12 Hrs. Matchings and Planarity Sections 7.0, 7.1, 7.2, 8.0, 8.1, 8.2

UNIT 4 GRAPH COLOURING 12 Hrs. Colourability, Chromatic numbers, Five colour theorem.

UNIT 5 DIRECTED GRAPHS 12 Hrs. Chromatic polynomials, Directed graphs, Paths and Connectedness. Sections: 9.0, 9.1, 9.2, 9.4, 10.0, 10.1, 10.2.

Max. 60 Hours


1. S. Arumugham & S. Ramachandran : Invitation to Graph Theory, Scitech Publications, Chennai-17.

2. R.J. Wilson: Introduction to Graph Theory, 4th ed., LPE, Pearson Education.

3. J.A. Bondy & U.S.R. Murty : Graph Theory with Applications.

4. J. Clark & D.A. Holton: A First Look at Graph Theory, Allied Publishers.

5. N. Deo : Graph Theory with Application to Engineering and Computer Science, PHI.


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice 20 Marks




SMT1208 APPLIED STATISTICS L T P Credits Total Marks




UNIT 1 DESCRIPTIVE STATISTICS 12 Hrs. Univariate data : Skewness and kurtosis- Pearson's and Bowley's coefficient of skewness- moment measures of skewness and kurtosis.

UNIT 2 CORRELATION AND REGRESSION ANALYSIS 14 Hrs.

Analysis bi-variate data: Curve fitting-fitting of straight lines,parabola,power curve and exponential curve. Correlation- Pearson's correlation coefficient and rank correlation coefficient - partial and multiple correlation-formula for calculation in 3 variable cases-Testing the significance of observed simple correlation coefficient. Regression-simple linear regression,the two regression lines, regression coefficients and their properties.

UNIT 3 TIME SERIES ANALYSIS 10 Hrs. Time series:Components of time series-measurement of trend by fitting polynomials-computing moving averages-seasonal indices-simple average-ratio to moving average.

UNIT 4 STATISTICAL QUALITY CONTROL 12 Hrs.

Statistical Quality control: Concept of statistical quality control,assignable and chance causes,process control. Construction of control charts,3 sigma limits. Control chart for variables-X-bar chart and R chart. Control chart for attributes -p chart, d chart and c chart.

UNIT 5 DESIGN OF EXPERIMENTS 12 Hrs. Analysis of variance : One way and two wayclassifications. Null hypotheses , total, between and within sum of squares. Assumptions-ANNOVATable.

Max. 60 Hours


1. Veerarajan. T., “Probability, Statistics and Random Processes”, Tata McGraw-Hill, New Delhi.

2. Goon A.M ,Gupta M.K.& Das Gupta:Fundementals of Statistics .Vol.I The World Press,Calcutta

3. S.C.Gupta & V.K.Kapoor:Fundementals of Applied Statistics Sultan Chand & Sons

4. S.P.Gupta:Statistical Methods, Sultan Chand, New Delhi.






SMT1209 FOUNDATIONS OF MATHEMATICS L T P Credits Total Marks


COURSE OBJECTIVE Understand the basic rules of logic, including the role of axioms or assumptions and appreciate the role of

mathematical proof in formal deductive reasoning and able to distinguish a coherent argument from a fallacious one, both in mathematical reasoning and in everyday life.

UNIT 1 SET THEORY - I 13 Hrs.

Pre-requisites: Sets, subsets, Set operations and the laws of set theory and Venn diagrams. Examples of finite and infinite sets. Finite sets and the counting principle. Empty set, properties of empty set. Standard set operations. Classes of sets. Power set of a set (Quick review). Cartesian product of two and more sets, relations. Difference and Symmetric difference of two sets. Set identities, Generalized union and intersections (As in section 1.7 of Text book 1).

UNIT 2 SET THEORY - II 12 Hrs. Relations: Product set, Relations (Directed graph of relations on set is omitted). Composition of relations, Types

of relations, Partitions, Equivalence relations with example of congruence modulo relation, Partial ordering relations, n-ary relations. (As in Chapter 3 of text book 2 excluding 3.7).

UNIT 3 TYPES OF FUNCTION 13 Hrs. Functions Pre-requisites: Basic ideas such as domain, co-domain and range of functions. Equality of functions,

Injection, Surjection and Bijection (Quick review). Syllabus: Identity function, constant functions, product (composition) of functions, theorems on one-one and onto functions, Mathematical functions, Recursively defined functions (As in Chapter 4 of text book 2). Indexed collection of sets, Operations on indexed collection of sets (As in 5.1, 5.2 and 5.3 of text book 2). Special kinds of functions, Associated functions, Algorithms and functions, Complexity of Algorithms (As in Chapter 5.7 of text book 2). Equipotent sets, Denumerable and countable sets, Cardinal numbers (Definitions and examples only as in 6.1, 6.2, 6.3 and 6.5 of text book 2).

UNIT 4 BASIC LOGIC - I 11 Hrs. Basic Logic-1 Introduction, propositions, truth table, negation, conjunction and disjunction. Implications,

biconditional propositions, converse, contra positive and inverse propositions and precedence of logical operators. Propositional equivalence: Logical equivalences. Predicates and quantifiers: Introduction, Quantifiers, Binding variables and Negations. (As in Chapter 1 of Text book 1).

UNIT 5 BASIC LOGIC - II 11 Hrs. Basic Logic-2 Methods of proof: Rules of inference, valid arguments, methods of proving theorems; direct proof,

proof by contradiction, proof by cases, proofs by equivalence, existence proofs, uniqueness proofs and counter examples. (As in Chapter 1 of Text book 1).

Max. 60 Hours


1. K.H. Rosen: Discrete Mathematics and its Applications (fifth edition), Tata McGraw Hill Publishing Company, New Delhi. 2. S. Lipschutz: Set Theory and related topics (Second Edition), Schaum Outline Series, Tata McGraw-Hill Publishing Company,

New Delhi.

3. P.R. Halmos: Naive Set Theory, Springer. 4. E. Kamke, Theory of Sets, Dover Publishers.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SPH1101 PHYSICS OF ENGINEERING MATERIALS L T P Credits Total Marks

(Common to ALL Branches of B.E/ B. Tech.) 3 0 0 3 100

COURSE OBJECTIVE To expose the students to different classes of materials and present the fundamentals of materials science; to

develop the understanding of the behaviour of materials, their properties and structures; to facilitate selection of suitable material for particular engineering application.

UNIT 1 CHARACTERIZATION OF MATERIALS 9 Hrs. Introduction, Structural characterization - X-ray diffraction, Bragg’s law, Determination of crystal structure -

powder X-ray diffractometer (Debye Scherrer camera) and Single crystal XRD with principle, construction and working, Microstructural characterization - Introduction, electromagnetic lens system, Determination of surface morphology by Scanning Electron Microscope (SEM), Transmission Electron Microscope (TEM) and Atomic Force Microscope (AFM) with principle, construction and working. Microhardness testing -Determination of microhardness by Vickers hardness test, Knoop hardness test and Nanohardness test with principle, construction, and working.

UNIT 2 MAGNETIC MATERIALS 9 Hrs.

Introduction, Origin of magnetic moment - orbital, spin and nuclear magnetic moments; Bohr magneton; Classification of magnetic materials based on spin- dia, para, ferro, antiferro and ferri- Curie temperature, Neel temperature.; Magnetic domains- Domain theory of Ferro magnetism (Weiss theory) - Observation of domain (bitter powder pattern), Energies involved in domain formation - magnetostatic energy, anisotropic energy, magnetostrictive energy and domain wall energy; Hysteresis Curve -based on domain theory; Types of magnetic materials - soft and hard magnetic materials; Magnetic bubbles - formation and propagation of magnetic bubbles-T-bar, read/write operation.

UNIT 3 SUPERCONDUCTING MATERIALS 9 Hrs.

Introduction to superconductivity- Properties of superconductor - electrical resistance, Meissner Effect, effect of heavy magnetic field, effect of heavy current (Silsbee’s rule), effect of high pressure , isotope effect, entropy, specific heat capacity, energy gap, London Penetration depth, Coherence Length, Ginzburg Landau Parameter, Flux Quantization and thermal conductivity. Theory of superconductivity - London Theory (Macroscopic), Bardeen, Cooper and Schrieffer Theory (Microscopic) - explanation based on formation of Cooper pairs and existence of energy gap. Types of superconductors - Type I and Type II superconductors, D.C. and A.C Josephson Effect, I-V Characteristics and applications of Josephson junction. Applications - cryotron, magnetic levitation train and SQUIDS.

UNIT 4 OPTICAL MATERIALS 9 Hrs.

Introduction, refractive index, absorption and dispersion, reflections. Classification of optical materials, absorption in metals, semiconductors and insulators (dielectrics), Excitons- Frenkel and Mott-Wannier excitons, Point detects -Frankel and Schottky defects, Traps - trapping and recombination centres - Colour Centres - types - F - Centre, R-Centre, V-Centre (V1 and V2), M -Centre. Luminescence - Principle and classification - Mechanism and working of Photo luminescence (Fluorescence and Phosphorescence).

UNIT 5 SEMICONDUCTING MATERIALS 9 Hrs.

Introduction - Band theory (qualitative), types of semiconductors- intrinsic semiconductor - carrier concentration and Fermi level in intrinsic semiconductor - extrinsic semiconductor - carrier concentration and Fermi level in extrinsic semiconductor (p type and n type) - Experimental determination Band gap of semiconductor -Hall Effect - experimental determination of Hall Voltage, Applications of Hall effect.

Max. 45 Hours




1. Willam D Callister, “Materials Science and Engineering an introduction”, 6th Edition, john-Wiley and Sons, 2004.

2. Avadhanulu M.N.and Kshirsagar P.G., “Engineering Physics”, 2nd Edition, S.Chand and Company, 2007.

3. Rajendran.V, Marikani.A, “Materials Science”, 8th Reprint, Tata McGraw-Hill, 2008.

4. Sankar B.N. and Pillai S.O, “A text book of Engineering Physics”, 1st Edition, New Age international Publishers, 2007.

5. Arumugam.M, “Semiconductor Physics and Optoelectronics”, 1st Edition, Anuradha Publishers, 2003.

6. Wilson.J and Hawkes. J.F.B., “Optoelectronics - An introduction”, 2nd Edition, Prentice-Hall of India, 2001.

7. Gaur. R.K and Gupta. S.L., “Engineering Physics”, 8th Edition, Dhanbat Rai Publications, 2007.

8. Cullity B.D., “Principles of X-ray diffraction”, 3rd Edition, Prentice Hall, 2001.

9. Mott.W, “Micro indentation Hardness Testing”, Butterworth Scientific publication, London, 1965.


PART A : 10 questions of 2 marks each - No choice; 2 questions from each of the five units 20 Marks

PART B : 2 questions from each unit of internal choice; each carrying 12 marks 80 Marks (Applications” mentioned in the syllabus refer to the basic applications and not to any specific case.) (Maximum of 20 % problems may be asked.)



SPH1102 PHYSICS OF ELECTRONIC DEVICES L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE x To provide the students the fundamental knowledge in fibre optics, digital electronics and devices such as sensors

devices, display devices and nano-devices to enable understanding of its applications.

UNIT 1 FIBRE OPTICS 9 Hrs. Introduction - principle of optical fibre transmission- fibre geometry - acceptance angle and numerical aperture -

derivation, types of rays - Types of optical fibres -.Optical fibre materials - plastic and glass fibres- Manufacturing processes - Double crucible technique and vapour phase deposition technique. Transmission characteristics of optical fibres - attenuation and distortion. Fibre splicing - fusion and mechanical splicing. Fibre connectors - butt joint and expanded beam connectors. Optical fibre communication system (block diagram) - advantages and its general applications. Problems of Part-A type

UNIT 2 DIGITAL ELECTRONICS 9 Hrs. Number systems - Binary, decimal, Hexadecimal and Octadecimal - Conversion from one number system to

another. Binary addition, Subtraction - Subtraction by 1’s & 2’s complement, BCD addition, Excess 3 code and gray code, ASCII code.

UNIT 3 SENSOR DEVICES 9 Hrs. Introduction - voltage and current sensors, Light Dependent Resistor (LDR), photodiode, strain gauges,

thermistor, pressure sensor - Bourdon tube, temperature sensor - thermocouple, magnetic sensor - Hall effect sensor, nanosensors and their applications.

UNIT 4 DISPLAY DEVICES 9 Hrs. Introduction, luminescence, electroluminescence, active display devices, cathode ray tube, light emitting diode,

LED materials, passive display devices, liquid crystal displays-working, comparison LED and LCD, plasma display, dynamic scattering display, Touch screen.

UNIT 5 NANO DEVICES 9 Hrs. Definition, Fabrication-Top down approach and bottom up approach. Nanomagnets - Particulate Nanomagnets,

Geometrical Nanomagnets, Magneto Resistance - Ordinary Magneto Resistance, Giant Magneto Resistance, Tunneling Magneto Resistance, Injection Laser - Quantum Cascade Laser - Optical Memories and Coulomb Blockade Devices.

Max. 45 Hours TEXT / REFERENCE BOOKS 1. Gerd Keiser, “Optical fibre communication”, 4th Edition, Tata Mc Graw Hill, 2011. 2. John M. Senior, “Optical fibre communications - Principle and Practice”, 2nd Edition, Pearson Education, 2006. 3. Franz J.H, Jain V.K, “Optical communication - Components and Systems”, 1st Edition, Narosa Publications, 2001. 4. Rajagopal.K, “Text book of Engineering Physics”, Part-I, 1st Edition, Prentice Hall of India, 2008 5. Leach, Malvino and Goutam Saha, “Digital Principles and applications”, 7th Edition, McGraw Hill, 2011.

6. William H. Gothman, “Digital electronics - An introduction to theory and practice”, 2nd Edition, PHL of India, 2007. 7. Rajendran.V,.Marikani.A, “Materials Science”, 8th Reprint, Tata McGraw-Hill, 2008. 8. Avadhanulu. M.N. and. Kshirsagar. P.G, “Engineering Physics”, 2nd Edition, S. Chand & Company, 2007. 9. Neubert H.K.P, “On Teaching Sensor Technology”, Royal Aircraft Establishment, Great Britain, 1971. 10. Cooper W.D. and Helfrick A.P, Electronic measurement and Techniques, Prentice hall, 3rd Revised Edition, 1985. 11. Wilson J and Hawkers J F B, “Optoelectronics - An introduction”, 2nd Edition, Prentice-Hall of India, 2001. 12. Bhattacharya. P, “Semiconductor optoelectronic devices”, 2nd Edition, Prentice Hall of India, 1996. 13. Pole. Jr. C.P., Owens, F.J., “Introduction to Nanotechnology”, Wiley, 1s t Edition, New York, 2003


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice; 2 questions from each of the five units. 20 Marks PART B : 2 questions from each unit of internal choice; each carrying 12 marks. 80 Marks

(Applications” mentioned in the syllabus refer to the basic applications and not to any specific case.) (Maximum of 20 % problems may be asked.)



SPH1103 ENGINEERING PHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE To provide the students with fundamental knowledge in Cryogenics and Acoustics, Properties of Matter such as

Elasticity and Viscosity; and enable them to apply relevant principles to solve real world engineering problems.

UNIT 1 LOW TEMPERATURE PHYSICS 9 Hrs. Properties of cryogenic fluids- oxygen, nitrogen, helium and hydrogen - Joule Thomson effect - Porous plug

experiment -Production of low temperatures- adiabatic demagnetisation of a paramagnetic salt - Cascade process - Practical applications of low temperatures -Refrigeration and Air conditioning machines - Super fluidity and its applications ( elementary ideas only)

UNIT 2 ELASTICITY 9 Hrs. Introduction-stress and strain diagram -Hooke’s law- types of elasticity- Young’s modulus, Bulk modulus,

Rigidity modulus. Poisson ratio - Twisting couple on a cylinder (wire) - torsional pendulum - determination of rigidity modulus. Bending of beams - expression for bending moment of a beam - expression for the depression of the cantilever loaded at the free end - uniform and non-uniform bending-theory and experiment- I form of girders.

UNIT 3 VISCOSITY 9 Hrs. Streamline and turbulent motion, coefficient of viscosity - equation of continuity, Euler’s equation, critical

velocity, Reynolds’s number, Poiseuille’s equation for flow of a liquid through a capillary tube - Stoke’s law (statement only)- terminal velocity, Bernoulli’s theorem and applications, Lift of an Aeroplane, Atomizer, Venturi meter, filter pump and Pitot’s tube.

UNIT 4 METAL ALLOYS 9 Hrs. Introduction, classification of metal alloys-Ferrous and Non Ferrous Alloys, Ferrous Alloys- classification,

composition, properties and applications; Synthesization of alloy steels-Electric Arc Furnace process (Heroult furnace); Non-Ferrous Alloys - Aluminium, Copper, Titanium, Magnesium alloys - composition, properties and applications. Shape Memory Alloys - Shape memory effect, mechanism, transformation temperature, types of SMA - one way and two way shape memory effect; General applications of SMA. UNIT 5 ACOUSTICS OF BUILDINGS 9 Hrs.

Introduction - musical sound and noise, characteristics of musical sound - pitch, loudness, quality - Weber-Fechner law, decibel scale, sound intensity level and sound pressure level. Sound absorption-OWU, sound absorption coefficient and its measurements - Reverberation - Reverberation time - Standard Reverberation time - Sabine’s formula to determine the Reverberation time (Jaegar method), Factors affecting the acoustics of a building and the remedies, Principles to be followed in the acoustical design of a good auditorium.

Max. 45 Hours TEXT / REFERENCE BOOKS 1. Mathur D.S, Heat and Thermodynamics, Reprint, S. Chand and Co. 2004. 2. Christian Enss and Siegfried Hunklinger, Low temperature Physics, 1st Edition, Springer, 2005. 3. Mathur D.S, Elements of Properties of Matter, Reprint, S.Chand and Co. 2005. 4. Srinivasan M.R, Physics for Engineers, 2nd Edition, New Age international Publishers, 2005. 5. Gaur. R.K. and Gupta. S.L., Engineering Physics, 8th Edition, Dhanbat Rai Publications, 2007. 6. Avadhanulu. M.N. and. Kshirsagar. P.G, Engineering Physics, 2nd Edition, S. Chand and Company, 2007. 7. Willam D Callister, Materials Science and Engineering an introduction, 6th Edition, john-Wiley and Sons, 2004. 8. Rajendran.V, Marikani A., Materials Science, 8th Reprint, Tata McGraw-Hill, 2008. 9. Rajagopal.K, Text book of Engineering Physics, Part-I, 1st Edition, Prentice Hall of India, 2008 10. Kinsler L.E, Frey A.R., Coppens A.B. and Sanders J.V., Fundamentals of Acoustics, 4th Edition, John-Wiley and sons, 2005.



PART A : 10 questions of 2 marks each - No choice; 2 questions from each of the five units. 20 Marks

PART B : 2 questions from each unit of internal choice; each carrying 12 marks. 80 Marks (Applications” mentioned in the syllabus refer to the ba8sic applications and not to any specific case.) (Maximum of 20 % problems may be asked.)



SPH1104 APPLIED BIOPHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To expose the students of biology to some fundamental physics required for study of the measurements of physical properties related to biological systems.

UNIT 1 PROPERTIES OF MATTER 9 Hrs.

Viscosity-Newton’s formula-coefficient of viscosity-Factors affecting viscosity-capillary flow method-Stokes method-Biological significance of viscosity-Surface tension-Kinetic theory of surface tension-Factors affecting surface tension-Capillary rise method-Drop weight method-Interfacial surface tension-Biological significance of surface tension.

UNIT 2 LASER PHYSICS 9 Hrs.

Absorption, spontaneous emission and stimulated emission-characteristics of laser light-Einstein’s A and B coefficients-principle of laser action-He-Ne laser-CO2 laser-Ruby laser-Nd-YAG Laser-semiconductor laser-applications of laser.

UNIT 3 MICROSCOPES 9 Hrs.

Characteristics of light-magnification-Compound microscope-Phase contrast microscope-interference microscope-ultraviolet microscope-Fluorescent microscope-electron microscope-Transmission Electron microscope-Scanning electron microscope-Uses.

UNIT 4 RADIATION BIOLOGY 9 Hrs.

Radioactivity-Natural radioactivity-induced radioactivity-Half life-mean life-Radioactive disintegration-units of radioactivity-GM counter-Proportional counter-Scintillation counter-uses of radio isotopes: diagnostic and therapeutic-archeological dating by C14 method-Biological effects of radiation.

UNIT 5 BIOLOGICAL TRANSDUCERS 9 Hrs. Bio-medical instrumentation-transducers-electrodes and bio amplifiers-physiological transducer-pressure transducer-temperature transducer-pulse sensors-respiration sensors-bio-chemical transducers.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. M. A. Subramaniam, Biophysics-principles and techniques, MJP publishers, 2005

2. S. Armugam, Biomedical instrumentation, Anuratha Agencies, 2ndEd., 2006

3. J. Kumar, S. Moorthy Babu, S. Vasudevan, Engineering Physics, Vijay Nicole Imprints Pvt. Ltd, 2006

4. Vasantha Pattabhi, N. Gautham, Biophysics, Narosa Publishing House, 2002

5. Vatsala Piramal, Biophysics, Dominant Publishers and Distributors, 2006

6. D.S.Mathur, Properties of matter, S.Chand Publishing, 11thEd.2005

7. P. Narayanan, Essentials of Biophysics, New Age International, 2ndEd. 2007



PART A : 10 questions of 2 marks each - No choice; 2 questions from each of the five units. 20 Marks

PART B : 2 questions from each unit of internal choice; each carrying 12 marks. 80 Marks (Applications” mentioned in the syllabus refer to the basic applications and not to any specific case.) (Maximum of 20 % problems may be asked)



SCY1101 ENGINEERING CHEMISTRY L T P Credits Total Marks


COURSE OBJECTIVES

To understand the properties and various synthetic methods for the preparation of nanomaterials and their applications.

To know about the quality parameters of water and methods to estimate the toxic elements and softening methods.

To give an overview about types of batteries and fuel cells, corrosion mechanisms and preventive methods.

To have a basic idea about polymers and various moulding techniques.

UNIT 1 SYNTHESIS OF NANOMATERIALS 9 Hrs. Introduction: Nanomaterials: Definition - Classification based on dimensions - Size dependent properties. Types

of nanomaterials: Nanoparticles: Synthesis by chemical reduction method. Nanoporous materials: Synthesis by sol-gel method. Nanowires: Synthesis by VLS mechanism. Carbon Nanotubes (CNTs): Single walled and multi walled nanotubes - Mechanical and electrical properties of CNTs - Applications of CNTs - Synthesis of CNTs by electric arc discharge method and laser ablation method.

UNIT 2 WATER TECHNOLOGY 9 Hrs. Introduction: Water quality parameters - Contamination of water by arsenic, lead, fluoride, mercury and their

removal. Hardness: Types - Expression - Units. Estimation of hardness of water by EDTA method - Problems. Estimation of iron, calcium and magnesium: AAS method. Water softening: Zeolite process - Demineralization process. Desalination: Reverse osmosis - Electrodialysis.

UNIT 3 ELECTROCHEMICAL POWER SOURCES 9 Hrs. Electrochemistry: Galvanic cell - Electrochemical cell representation - EMF series and its significance. Batteries:

Terminology - Lead-acid accumulator - Nickel-cadmium batteries. Lithium batteries: Li/SOCl2 cell - Li/I2 cell - Lithium ion batteries. Fuel Cells: Hydrogen-oxygen fuel cells - Solid oxide fuel cell (SOFC).

UNIT 4 CORROSION SCIENCE 9 Hrs. Introduction: Definition. Types: Dry corrosion: Mechanism - Pilling-Bedworth rule - Wet Corrosion: Mechanism.

Types: Galvanic corrosion and differential aeration cell corrosion. Galvanic series and its significance. Factors influencing corrosion. Corrosion prevention: Material selection and design - Cathodic protection. Protective coatings: Paints - Constituents. Mechanism of drying of drying oils.

UNIT 5 POLYMER CHEMISTRY 9 Hrs. Introduction to polymers: Nomenclature - Functionality. Types of polymerization. Mechanism of polymerization:

Free radical mechanism - Cationic mechanism - Anionic mechanism. Plastics: Types - Thermoplastics and thermosetting plastics. Properties: Strength - Crystalline and amorphous state - Average molecular weight - Polydispersity. Compounding of plastics. Moulding of plastics: Compression moulding - Injection moulding - Extrusion moulding. Introduction to conducting polymers. Max. 45 Hours TEXT / REFERENCE BOOKS 1. Jain P.C. and Monica Jain, “Engineering Chemistry”, 15th Edition Dhanpat Rai Publishing Co., 2009. 2. Dara S.S., “Text Book of Engineering Chemistry”, S. Chand & Co, 2008. 3. Sheik Mideen A., “Engineering Chemistry (I & II)”, 13th Edition, Shruthi Publishers, 2010. 4. Kuriakose J.C. and Rajaram J., “Chemistry in Engineering and Technology". Vol.1 & 2, 5th reprint, Tata McGraw Hill Publishing

Company (P) Ltd., 2010. 5. Sharma B.K., “Engineering Chemistry”, 2nd Edition, Krishna Prakasam Media (P) Ltd., 2001. 6. Mars G Fontana, “Corrosion Engineering”, 3rd Edition, Tata McGraw Hill, 2008. 7. David Linden, Thomas B Reddy, “Handbook of Batteries”, 4th Edition, McGraw-Hill, 2010.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 Questions of 2 marks each-No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks. 80 Marks

(Out of 80 marks, maximum of 10% problems may be asked)



SCY1102 CHEMISTRY OF ELECTRONIC MATERIALS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To know the nature of conducting polymer materials used in electronic industry and to understand the recent analytical techniques for their characterization.

To give an idea on the application of computer science in chemistry and the importance of insulating materials in electrical and electronic industries.

UNIT 1 INTRODUCTION TO MOLECULAR ELECTRONICS 9 Hrs. Introduction: Charge transport carriers: Soliton - Polaron and bipolaron. Conducting polymers: Polyacetylene -

Polyaniline. Applications of conducting polymers. Polymer Structures for LEDs: Polyphenylenes - Polythiophene. Photoresists for electronics. Molecular devices based on conducting polymers.

UNIT 2 INSTRUMENTAL METHODS OF ANALYSIS 9 Hrs. Introduction - Absorption of radiation. UV-Visible spectrophotometer: Instrumentation - Applications. IR

spectrophotometer - Instrumentation - Applications. Thermal methods of analysis: Thermogravimetry (TGA) - Differential Thermal Analysis (DTA) - Differential Scanning Calorimetry (DSC). Sensors: Oxygen sensors - Glucose sensor. Cyclic Voltammetry for Redox systems.

UNIT 3 THIN FILM TECHNIQUES 9 Hrs. Introduction: Lithography. Thin-film deposition: Chemical vapour deposition - Physical vapour deposition: Pulsed

laser and atomic layer deposition. Epitaxy: Vapour phase epitaxy - Liquid phase epitaxy - Molecular beam epitaxy. Evaporation: Thermal vaporation and e-beam evaporation. Sputtering techniques: Direct current (DC) sputtering and radio frequency (RF) sputtering. Preparation of Si/Ge semiconductors - Czochralski crystal growth technique: Doping of semiconductors by Ion implantation.

UNIT 4 INSULATING MATERIALS 9 Hrs. Electrical Insulating Materials: Introduction - Requirements. Classification based on substances: Gaseous, liquid

and solid insulating materials. Preparation, properties and applications of SF6, Epoxy resin, ceramic products: white wares and glass - Transformer oil. Electrical resistivity: Factors influencing electrical resistivity of materials - Composition, properties and applications of high resistivity materials: Manganin - Constantan - Molybdenum disilcide - Nichrome.

UNIT 5 CHEMIN FORMATICS 9 Hrs. Introduction: Computer representation of chemical compounds: Line notations - Wiswesser line notation - ROSDAL

notation - SMILES coding - Advantages and disadvantages of different types of notations. Standard structure exchange formats: Structure of Mol files and SD files. Chemical structure drawing softwares. Molecule editors: CACTVS molecule editor - Chemdraw - ChemSketch - Chemwindow. Searching chemical structure: Similarity search.

Max. 45 Hours


1. Ziaie B., “Introduction to Micro/Nanofabrication”, Springer, 2010. 2. Andrew Leach, “An Introduction to Cheminformatics”, Springer, 2009. 3. Johann Gasteiger and Thomas Engel (Ed.), “Cheminformatics: A Textbook”, Wiley-VCH, 2003.

4. Hagen Klauk, “Organic Electronics: Materials, Manufacturing and Applications”, Wiley, 2006. 5. Dara S.S., “Text Book of Engineering Chemistry”, S. Chand & Co, 2008. 6. Sheik Mideen A., “Engineering Chemistry (I & II)”, 13th Edition, Shruthi Publishers, 2010. 7. Douglas A. Skoog and Donald M. West, “Principles of Instrumental Analysis”, 6th Edition, Cengage Learning, 2006.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 Questions of 2 marks each-No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks




SCY1103 CHEMISTRY OF INDUSTRIAL MATERIALS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To know the different types of coal, their analysis and gaseous fuels.

To have a basic understanding about terms related to phase rule and its applications to various systems.

To understand the requirements, classification of explosives and propellants used in aerospace industries.

To provide an idea about lubrication mechanisms, properties and to learn the science of composites and abrasives.

UNIT 1 FUELS 9 Hrs. Fuels: Introduction - Classification of fuels - Characteristics of a fuel - Determination of calorific value of a fuel

by Bomb calorimeter. Coal: Classification of coals based on energy content. Chemistry and analysis of coal: Proximate analysis and ultimate analysis. Manufacture of metallurgical coke: Otto-Hoffmann’s method. Cracking: Fluidized bed catalytic cracking. Knocking in compression ignition and spark ignition engines. Gaseous fuels: CNG - LPG - Producer gas. Ethanol as a fuel.

UNIT 2 PHASE EQUILIBRIA 9 Hrs. Introduction: Definition of phase rule - Terms involved in phase rule with examples. One component system:

Water system. Two component alloy systems: Classification - Reduced phase rule - Thermal analysis. Simple eutectic system: Lead-silver system. Congruent system: Zinc-magnesium system. Incongruent system: Sodium-potassium system.

UNIT 3 EXPLOSIVES AND ROCKET PROPELLANTS 9 Hrs. Explosives: Requirements - Classification of explosives: Low explosives - Primary explosives - High explosives.

Assessment of explosives: Sand bomb test - Drop height - Velocity of detonation. Rocket propellants: Types of rocket engines - Basic principle of rocket propulsion system - Specific impulse (IS P ) - Thrust: Momentum thrust and pressure thrust. Requirements of a good propellant. Classification of chemical propellants - Liquid fuels - Liquid oxidizers - Solid fuels - Solid oxidizers. UNIT 4 LUBRICANTS 9 Hrs.

Introduction: Requirements and functions of lubricants. Mechanism of lubrication: Hydrodynamic lubrication - Boundary lubrication - Extreme pressure lubrication. Properties of lubricants: Viscosity index - Cloud point - Pour point - Flash point - Fire point - Oiliness - Sligh oxidation test - Aniline point. Classification of lubricants: Liquid lubricants - Semisolid lubricants - Solid lubricants.

UNIT 5 COMPOSITES AND ABRASIVES 9 Hrs. Introduction: Definition. Constituents of composites: Matrix phase and dispersed phase - Examples. Metal matrix composites: Al matrix; Mg matrix and Ti matrix composites. Ceramic matrix composites: SiC marix and Alumina matrix composites. Polymer matrix composites: Fiber reinforced plastics (FRP) and its types. Application of composites. Cermets: Oxide base cermets - Carbide base cermets - Properties and applications. Abrasives: Definition - Properties: Moh’s scale of Hardness. Classification: Natural and synthetic abrasives. Manufacture of abrasive paper and abrasive cloth. Max. 45 Hours


Max. Marks : 100 PART A : 10 Questions of 2 marks each-No choice PART B : 2 questions from each unit of internal choice, each carrying 16 marks.


TEXT/REFERENCE BOOKS 1. Jain P. C., and Monica Jain, Engineering Chemistry, 15th Edition, Dhanpat Rai Publishing Co., 2009. 2. Sheik Mideen A., Engineering Chemistry (I & II), 13th Edition, Shruthi Publishers, 2010. 3. Dara.S.S., Text Book of Engineering Chemistry, S.Chand & Co, 2009.

4. Kuriakose J. C., and Rajaram. J, Chemistry in Engineering and Technology, Vol.1 & 2, Tata McGraw Hill Publishing Company (P) Ltd., 2009.

5. Puri Br., Sharma Lr., Madhan S Pathania, Principles of Physical Chemistry, 41st Edition, Vishal Publishing Co., 2004. 6. Uppal M.M., Engineering Chemistry, 6th Edition, Khanna Publishers, 2006. 7. Agarwal O.P., Engineering Chemistry, 3rd Edition, Khanna Pubishers., 2003.

Exam Duration : 3 Hrs. 20 Marks 60 Marks



SCY1104 BIO ORGANIC CHEMISTRY L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the fundamentals of classification, synthesis, properties and structural elucidation of carbohydrates, amino

acids and proteins.

To know the classification and properties of lipids and enzymes.

To have overall idea about the structure and biological aspects of steroids, hormones, vitamins and nucleic acids.

UNIT 1 CARBOHYDRATES 9 Hrs. Introduction: Classification: Sugars and Non-sugars. Building up of the sugar series: Aldoses. Conversion of higher

to lower homologue and vice versa: Ascending and descending series - Kiliani Fischer synthesis - Ruff degradation. Glucose: Physical properties - Chemical properties: Epimerization - Mutarotation. Structural elucidation of glucose: Open chain and closed chain structure. Structure and biological importance of disaccharides: Sucrose - Maltose - Lactose. Structure and biological importance of polysaccharides: Starch - Cellulose - Chitin - Heparin - Peptidoglycan.

UNIT 2 AMINOACIDS AND PROTEINS 9 Hrs. Aminoacids: Classification - α, β, and γ aminoacid - acidic, basic and neutral amino acids - Essential and non

essential amino acids. Preparation: HVZ reaction - Strecker synthesis - Gabriel Phthalimide synthesis. Physical properties: Isoelectric point. Chemical properties: Reaction of amino group - Carboxyl group and both. Proteins: Classification based on shape and solubility - Classification based on increasing complexity of structure. Structure of proteins: Primary - Secondary - Tertiary - Quaternary.

UNIT 3 LIPIDS AND ENZYMES 9 Hrs. Lipids: Occurrence and classification of lipids - Simple lipids: Fats - Distinction between fats and oils - Occurrence

- Properties: Hydrolysis - Auto oxidation - Addition reactions. Analysis of fats and oils: Saponification value and Iodine number. Compound Lipids and Derived lipids.

Enzymes: Classification and nomenclature - Enzyme Kinetics: Michaelis-Menton equation. Enzyme activity - Mechanism of enzyme action.

UNIT 4 STEROIDS, HORMONES AND VITAMINS 9 Hrs. Steroids: Introduction - Nomenclature. Cholesterol: Constitution (excluding synthesis) and biological importance.

Hormones: Introduction - Difference between hormones and vitamins. Classification - Structure and functions of steroid hormones: Androsterone - Progesterone - Testosterone - Estrone. Adrenocortical hormones: Cortisone. Vitamins: Structure and importance of Vitamin D - Folic acid - Nicotinamide.

UNIT 5 NUCLEIC ACIDS 9 Hrs. Introduction: Purines and Pyrimidines - Nucleosides and Nucleotides - Nitrogeneous bases - Structure of nucleic

acids - DNA, RNA, m-RNA, t-RNA, r-RNA - 70s and 80s - Biological importance of nucleic acids - Sequencing of nucleic

acids - Maxam-Gilbert’s method and Sanger’s method. Max. 45 Hours TEXT / REFERENCE BOOKS 1. Jain J. l., Nitin Jain, Sunjay Jain, Fundamentals of Biochemistry, 6 th Edition, S. Chand and Sons, 2013. 2. David L. Nelson, Michael M. Cox, Lehninger Principles of Biochemistry, 6th Edition, W. H. Freeman, 2013. 3. Gurdeep R Chatwal, Organic Chemistry of Natural Products Vol II , 2nd Revised Edition, Himalaya Publishing House, 1986. 4. Tewari K.S., Vishnoi N.K. and Mehrotra S.N., A Text Book of Organic Chemistry, 2nd Revised Edition, Vikas Publications, 2004. 5. Rastogi S.C., Biochemistry, 6 th Reprint, Tata McGraw Hill Publishing Limited, 2007. 6. Styer L., Biochemistry, . 4th Edition, W.H. Freeman & Co, 1995.


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 Questions of 2 marks each-No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks. 80 Marks




SCY1105 PHYSICAL CHEMISTRY L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the fundamentals related to the phase diagrams and their applications.

To know about the types and properties of solutions.

To expose the students for various separation techniques for the purification of compounds.

To provide an idea about the chemical kinetics in terms of order, molecularity and their derivations involved.

To give an overview about the advanced electrochemical applications.

UNIT 1 PHASE RULE 9 Hrs. Phase diagram - Information from phase diagram - Terminology used in phase diagram. Gibb’s phase rule -

Derivation. One component system: Water system. Two component alloy systems: Classification - Reduced phase rule - Thermal analysis. Simple eutectic system: Lead-silver system. Congruent System: Zinc-magnesium system. Incongruent system: Sodium-potassium system. Phase diagram of simple three component system.

UNIT 2 SOLUTIONS 9 Hrs. Introduction: Solid solution - Hume Rothery’s rule. Types of solid solutions: Liquid solutions: Solubility of partially

miscible liquids - Phenol-water system. Colligative properties: Lowering of vapour pressure. Raoult’s law: Derivation - Osmotic pressure - Isotonic solution - Relationship between osmotic pressure and vapour pressure. Depression in freezing point - Derivation. Elevation in boiling point - Derivation - Problems.

UNIT 3 SEPARATION TECHNIQUES 9 Hrs.

Distillation techniques: Fractional distillation - Steam distillation - Vacuum distillation. Chromatography: Elution analysis - Paper chromatography - Thin layer chromatography - Liquid chromatography - High performance liquid chromatography (HPLC) - Gas chromatography (GC).

UNIT 4 CHEMICAL KINETICS 9 Hrs.

Introduction: First and second order reactions: Integration - Integration of nt h order reaction. Methods of determining order and molecularity. Collision theory of bimolecular gaseous reactions - Activated complex of bimolecular reactions - Lindemann theory of unimolecular equation - Kinetics of complex reactions: Reversible reaction - Consecutive reaction - Chain reactions - Autocatalysis - Problems.

UNIT 5 ADVANCED ELECTROCHEMISTRY 9 Hrs. Introduction: Cell constant - Equivalent conductance - Molar conductance. Ionic mobility: Transport number -

Moving boundary method - Hittorff’s method. Debye Huckel theory of strong electrolytes. Concentration cells: Types - Concentration cells without transference and with transference. Potentiometric tritrations: Redox titration. Polarography - Applications of polarography.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Puri B.R., Sharma L. R., Madan. S.Pathania, Principles of Physical Chemistry, 41st Edition , Vishal Publishing co., 2004.

2. Keith J. Laidler, Chemical Kinetics, Third Edition, Pearson education limited, 2004. 3. Atkins P. W., Physical Chemistry, 6th edition, Oxford University press, 1998. 4. Barrow G. M., Physical Chemistry, 5th edition, McGraw-Hill, 1988. 5. Glasstone S., A Text book of Physical Chemistry, Macmillan Ltd, 1976.

6. Jayakumar V., Engineering Metallurgy, ARS publications, 2012.


PART A : 10 Questions of 2 marks each-No choice 20 Marks

PART B : 2 questions from each unit of internal choice, each carrying 16 marks. 80 Marks (Out of 80 marks, maximum of 10% problems may be asked)



SCH1101 ENVIRONMENTAL SCIENCE AND ENGINEERING L T P Credits Total Marks


COURSE OBJECTIVE

To impart knowledge on the issues related to environment and to emphasize the importance of a clean environment

UNIT 1 INTRODUCTION TO ENVIRONMENTAL STUDIES AND NATURAL RESOURCES 10 Hrs.

Definition, scope and importance, need for public awareness, forest resources: use and over-exploitation, deforestation, case studies. Timber extraction, mining, dams, floods, drought, conflicts over water, dams-benefits and problems, mineral resources: use effects on forests and tribal people. water resources: use and over-utilization of surface and ground water, exploitation, environmental effects of extracting and using mineral resources, case studies food resources: world food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. Energy resources: growing energy needs, renewable and non renewable energy sources, use of alternate energy sources: Case studies. Land resources: land as a resource, land degradation, man induced landslides, soil erosion and desertification, role of an individual in conservation of natural resources, equitable use of resources for sustainable lifestyles.

UNIT 2 ECOSYSTEMS AND BIODIVERSITY 10 Hrs.

Concept of an ecosystem, structure and function of an ecosystem - producers, consumers and decomposers - energy flow in the ecosystem, ecological succession, food chains, food webs and ecological pyramids. Introduction, types, characteristic features, structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries). Introduction to biodiversity, definition: genetic, species and ecosystem diversity - biogeographical classification of India - value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values, biodiversity at global, national and local levels. India as a mega-diversity nation, hot-spots of biodiversity, threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts, endangered and endemic species of India, conservation of biodiversity, in-situ and ex-situ conservation of biodiversity.

UNIT 3 ENVIRONMENTAL POLLUTION 9 Hrs. Definition - causes, effects and control measures of: (a) air pollution (b) water pollution (c) soil pollution (d)

marine pollution (e) noise pollution (f) thermal pollution (g) nuclear hazards. Solid waste management: causes, effects and control measures of urban and industrial wastes, role of an individual in prevention of pollution, pollution case studies, disaster management: floods, earthquake, cyclone and landslides.

UNIT 4 SOCIAL ISSUES AND THE ENVIRONMENT 8 Hrs.

From unsustainable to sustainable development, urban problems related to energy, water conservation, rain water harvesting, watershed management, resettlement and rehabilitation of people; its problems and concerns, case studies, environmental ethics: issues and possible solutions, climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust, case studies. Wasteland reclamation, consumerism and waste products - environment protection act: air (prevention and control of pollution) act - water (prevention and control of pollution) act, wildlife protection act; forest conservation act. Issues involved in enforcement of environmental legislation, Key initiatives of Rio declaration, Vienna convention, Kyoto protocol, Johannesburg summit and public awareness.

UNIT 5 HUMAN POPULATION AND THE ENVIRONMENT 8 Hrs. Population growth, variation among nations, population explosion, family welfare programme, environment and human

health, human rights, value education, HIV / AIDS, women and child welfare, role of information



technology in environment and human health, case studies. Visit to a local area to document environmental assets-river/forest/grassland/hill/mountain. Visit to a local polluted site-urban/rural/ industrial/agricultural-study of common plants, insects, birds-study of simple ecosystems, pond, river, hill slopes etc.

Max. 45 Hours


1. Meenakshi. P, “Elements of Environmental Science and Engineering”, 1st Edition, Prentice Hall of India, New Delhi, 2009.

2. Ravikrishnan. A, “Environmental Science & Engineering”, 3rd Edition, Sri Krishna Publications, Chennai, 2008.

3. Wrigh. R. T & Nebel B.J, “Environmental science-towards a sustainable future by Richard”, 8th edition, Prentice Hall of India,

NewDelhi, 2006.

4. Erach Bharucha, “Text Book of Environmental Studies”, 2n d Edition, University Press, Chennai, 2006


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No Choice 20 Marks

PART B : 5 questions from each of the five units of internal choice, each carrying 12 marks each 80 Marks



SEE1102 BASIC ELECTRICAL ENGINEERING L T P Credits Total Marks

(Common to CSE &IT) 3 0 0 3 100

UNIT 1 D.C.CIRCUITS 9 Hrs. Basic electrical quantities: Current, Voltage, Power, Energy, Ohm’s Law, Resistors - Series and parallel combinations - Kirchoff’s laws - Node and Mesh Analysis for simple resistive circuit-Star delta Transformation.

UNIT 2 A.C.CIRCUITS 9 Hrs.

Sinusoidal functions - RMS (effective) and Average values- Phasor representation - J operator - Sinusoidal excitation applied to purely resistive, inductive and capacitive circuits - RL, RC and RLC series and parallel circuits - Power and power factor.

UNIT 3 NETWORK THEOREMS (DC CIRCUITS) 9 Hrs. Superposition Theorem - Reciprocity Theorem - Thevenin’s Theorem - Norton’s Theorem - Maximum Power Transfer Theorem.

UNIT 4 MAGNETIC CIRCUITS 9 Hrs. Definition of MMF, Flux and reluctance - Leakage factor - Reluctances in series and parallel (series and parallel

magnetic circuits) - Electromagnetic induction - Fleming’s rule - Lenz’s law - Faraday’s laws - Statically and dynamically induced EMF - Self and mutual inductance- Analogy of electric and magnetic circuits.

UNIT 5 INTRODUCTION TO MACHINES 9 Hrs. Construction and principle of DC Generator - Emf equation - Types, Principle of DC Motor - Types, Construction and principle of single phase Transformer, Stepper motor, AC and DC servomotor.

Max. 45 Hours.


1. B.N.Mittle, Aravind Mittle, “Basic Electrical Engineering” , Tata McGraw Hill”, 2nd Edition Sep 2011.

2. B.L.Theraja & A.K.Theraja, “A Text Book of Electrical Technology, VOl II”, S.Chand & Company Ltd., 2009.

3. Smarajit Ghosh, “Fundamentals of Electrical and Electronics Engineering” , 2nd Edition, PHI Learning Private Ltd, 2010.

4. Wadhwa. C.L, “Basic Electrical Engineering” , 4th Edition, New Age International, 2007.

5. Sivanagaraju S, G.Kishor & Srinivasa Rao. C, “Electrical Circuit Analysis”, 1st Edition, Cengage Learning, 2010.

6. Nitin Saxena, “ Electrical Engineering”, 2nd Edition, Laxmi Publications Pvt Ltd, 2010.

END SEMESTER EXAM QUESTION PAPER PATTERN:

Max. Marks : 100 Exam Duration : 3 Hrs


PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks (Distribution may be 40% Theory & 60 % Numerical)



SEC1101 ELECTRONIC DEVICES L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To acquaint the students with the construction, theory and operation of the basic electronic devices such as PN junction diode, Bipolar and Field effect Transistors, special semiconductor devices and oscilloscopes. On completion of this course the student will recognize

Acquire knowledge about the semiconductor diode

Acquire knowledge about Transistors

Acquire knowledge about Oscilloscopes

UNIT 1 SEMICONDUCTOR DIODE 9 Hrs. Intrinsic and Extrinsic semiconductor - Charge density, Mobility and Conductivity in Semiconductor, Drift and

diffusion current, Continuity equation, PN junction - Energy band diagram of PN junction, Current components in PN junction, Junction capacitance - Application of diode - Diode switch, Clipper, Clamper and Voltage multipliers - Zener diode - Zener voltage regulators.

UNIT 2 BIPOLAR JUNCTION TRANSISTOR 9 Hrs. Construction and Operation of NPN and PNP transistor - Current components in a transistor, Eber moll’s

Equation-Characteristics of CE,CB,CC configuration - Base width modulation, Transistor breakdown, Transistor biasing - Bias Stabilization and Compensation, Thermal runway problems, Heat sinks, Switching characteristics.

UNIT 3 FIELD EFFECT TRANSISTOR 9 Hrs. JFET- Construction, Operation and Characteristics, Expression for pinch off voltage and drain current -

MOSFET- Enhancement and Depletion mode operation and characteristics, Handling precautions of MOSFET, Gate capacitance- FET as VVR - Comparison of MOSFET and JFET - Comparison of BJT and JFET.

UNIT 4 SPECIAL SEMICONDUCTOR DEVICES 9 Hrs. SCR- UJT- Diac- Triac - Schotty barrier diode-Varactor diode - PIN diode - Tunnel diode - Gunn diode - Laser diode-Operation, Characteristics and Applications.

UNIT 5 PRINCIPLES OF CRT 9 Hrs. Force on charged particle in electric field and magnetic field - Motion of charged particle in electric and

magnetic field -Oscilloscopes-Features ans uses, Types and models-CRO, Dual beam oscilloscope, Analog Oscilloscope, Digital oscilloscope Principles of CRT - Deflection and focusing of electron beam in CRT -Orientation of electric and magnetic field in CRT - Applications of CRO.

Max. 45 Hours


1. Millman and Halkias, Electronic devices and circuits, 2nd Edition, McGraw Hill Publication, 2007.

2. G.K.Mithal, Basic Electronic Devices and circuits, 2nd Edition, G.K.Publishers Pvt. Ltd., 1998.

3. David Bell,Fundamentals of Electronic Devices and Circuits, 5th Edition, Oxford University Press 2008

4. Yang, “Fundamentals of Semiconductor devices”, McGraw Hill International Edition, 1978.

5. Theodre. F. Boghert, ‘Electronic Devices & Circuits’, Pearson Education, VI Edition, 2003.

6. Allen Mottershead, ‘Electronic Devices and Circuits - An Introduction’, Prentice Hall of India Private Limited, New Delhi, 2003

7. Ben G Streetman and Sanjay Banerjee, Solid State Electronic Devices, 6th Edition, Pearson Education, 2005.

8. Roody and Coolen, Electronic Communications, 4th Edition, Pearson Education, Reprint 2007.

9. A.S. Sedra and K.C. Smith, Microelectronic Circuits, Saunder's College Publishing

END SEMESTER EXAM QUESTION PAPER PATTERN: Max. Marks : 100 Exam Duration : 3 Hrs.





SEC1214 BASICS OF ANALOG AND DIGITAL L T P Credist Total Marks

COMMUNICATION 3 0 0 3 100

COURSE OBJECTIVES

On completion of this course the student can understand

The basics of various analog modulation techniques, transmitters, receivers, the concepts of analog communication systems

The principles of sampling & quantization, the various Base Band signaling schemes, the concepts of digital modulation and spread spectrum techniques

UNIT 1 BASICS OF COMMUNICATION 9 Hrs. Review of time and frequency domain description of signals – Communication system- point to point and broad

cast – Basic model of a communication system: transmitter, receiver and channel -Noise, bandwidth and information capacity – Need for modulation types of modulation– classification of communication based on modulation and channel – Base band and Pass band transmission sampling and quantization- Sampling theorem-Nyquist rate- Sampling process -Natural Sampling-Flat Sampling – Aliasing - Signal Reconstruction-Quantization - Uniform & non-uniform quantization - quantization noise- Bandwidth _Noise trade off UNIT 2 AMPLITUDE MODULATION AND DEMODULATION 9 Hrs.

STD-AM (DSB-FC) Mathematical representation – waveform, frequency spectrum, bandwidth, power relations and Modulation index-Various schemes of AM,: DSB-SC, SSB-SC and VSB-Comparison of various schemes. AM Generation (Modulators): DSB-FC; Collector and base modulator circuits – DSB-SC; Balanced modulator circuit using FET – SSB: Phase shift method and Filter method –- AM transmitter: Low and high level Modulation. AM Detection (Demodulators) – Envelope detector, Significance of RC time constant UNIT 3 ANGLE (FM & PM) MODULATION AND DEMODULATION 9 Hrs.

FM: Mathematical representation, waveform, frequency spectrum, modulation index, FM: Narrowband and Wideband – Comparison of NFM and WFM -Comparison of FM and AM Phase modulation (PM):-Relation between FM and PM – Conversion: FM to PM and PM to FM - Conversion: AM to

PM -FM Generation: Direct method using Varactor diode and indirect method (Armstrong modulator) – Pre-emphasis – FM stereo broadcast transmitter. FM Detector: Foster seelay discriminator and Ratio detector – De- emphasis- FM stereo broadcast receiver UNIT 4 PULSE MODULATION & MULTIPLEXING 9 Hrs.

Analog pulse modulation – Concepts of PAM, PWM (PDM) and PPM – Modulators and demodulators. Multiplexing- classifications: Frequency Division Multiplexing, Time Division Multiplexing and Quadrature Multiplexing

– Comparison of multiplexing- Applications of analog pulse modulation Digital pulse modulation- Concepts of PCM- Generation and demodulation of PCM- Differential PCM- Delta modulation-–Linear prediction - Adaptive Delta Modulation - Applications of digital pulse modulation

UNIT 5 DIGITAL MODULATION TECHNIQUES 9 Hrs. Introduction – ASK- FSK – PSK- coherent modulation techniques-BFSK-BPSK-signal space diagram-probability

of error-Coherent Quadrature modulation techniques- QPSK-signal space diagram-probability of error-Non coherent modulation techniques-M-ary modulation techniques –QAM Spread spectrum communication- Pseudo- noise sequences – Direct sequence spread spectrum –Frequency hop spread spectrum- Use of spread spectrum with code division multiple access.

Max. 45 Hours TEXT / REFERENCE BOOKS 1. Wayne Thomasi, "Advanced Electronic Communication Systems", 6th Edition, PHI Publishers, 2003. 2. Dennis Reddy and John Coolen, "Electronic Communications", 4th Edition, Prentice Hall Publishers, 1995. 3. Kennedy, "Electronic Communications Systems", 4th Edition, McGraw-Hill Publishers, 1992. 4. Simon Haykins, “Communication Systems” John Wiley, 5th Edition, March 2009. 5. John G. Proakis, Masoud Salehi, “Digital Communication”, McGraw Hill 5th edition November 6, 2007. 6. Bernard Sklar, “Digital Communication, Fundamentals and Application”, Pearson Education Asia, 2nd Edition, Jan. 21, 2001.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each- No choice . 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SEC1312

MICROPROCESSOR AND MICROCONTROLLER BASED SYSTEMS L T P Credits Total Marks

(FOR CSE & IT) 3 0 0 3 100

COURSE OBJECTIVE To understand the operation of microprocessors and microcontrollers, machine language programming,

interfacing techniques and their applications.

UNIT 1 BASIC CONCEPTS 9 Hrs. 8085 Microprocessor - Architecture and its operation, Concept of instruction execution and timing diagrams, fundamentals of memory interface - Addressing modes

UNIT 2 8085 INSTRUCTION SET AND ASSEMBLY LANGUAGE PROGRAMMING 9 Hrs.

Instruction classifications, Writing and executing simple programs - Arithmetic and logic operations - Data transfer - Branching - Looping – Indexing - Counter and time delays - Writing subroutine - Conditional call and return instruction, simple programs.

UNIT 3 INTERFACING 9 Hrs. Basic Interface concepts, memory mapped I/O and I/O mapped I/O, Interrupt and vectored interrupt,

Programmable peripheral interface 8255 - Programmable Interval timer 8253 - Programmable interrupt controller 8259 - Programmable DMA controller 8257.

UNIT 4 8086 ARCHITECTURE 9 Hrs. Architecture – Minimum mode and Maximum mode operation – Address Generation - Addressing modes - Overview of 8086 instruction set - Instruction format - Assembler Directives – Designing a Single Board Computer.

UNIT 5 8051 MICROCONTROLLER 9 Hrs.

Introduction - Architecture of 8051 - Memory organization - Addressing modes - Instruction set – Assembly Language Programming - Jump, Loop and Call Instructions - Arithmetic and Logic Instructions - Bit Operations - Programs - Case study - Microcontroller based Washing Machine.

Max. 45 Hours


1. Ramesh Goankar, "Microprocessor architecture programming and applications with 8085 / 8088", 5th Edition, Penram International Publishing.

2. A.K.Ray and Bhurchandi, "Advanced Microprocessor", 1st Edition, TMH Publication

3. Kenneth J.Ayala, "The 8051 microcontroller Architecture, Programming and applications" 2nd Edition ,Penram international

4. Doughlas V.Hall, "Microprocessors and Digital system", 2nd Editon, Mc Graw Hill,1983

5. Md.Rafiquzzaman, "Microprocessors and Microcomputer based system design", 2nd Editon,Universal Book Stall, 1992.

6. Hardware Reference Manual for 80X86 family", Intel Corporation, 1990.

7. Muhammad Ali Mazidi and Janice Gillispie Mazidi, "The 8051 Microcontroller and Embedded Systems", 2nd Edition, Pearson



PART A : 10 Questions of 2 marks each-No choice 20 Marks PART B : 2 Questions from each unit with internal choice, each carrying 12 marks 80 Marks



SBA1101 PRINCIPLES OF MANAGEMENT AND PROFESSIONAL L T P Credits Total Marks

ETHICS 3 0 0 3 100

COURSE OBJECTIVE To familiarize engineering students with the concepts of Management useful for Managing their own enterprise

or to work in a professional organization in Managerial capacity and to provide them an ethical outlook.

UNIT 1 MANAGEMENT FUNCTIONS & STRUCTURE 9 Hrs.

Management - Definition -Role of managers- Levels of management-Basic Function - Contribution of Taylor & Fayol. Types of structures - Line, staff, Functional, Committee and Project & Matrix - Structures. Departmentalization - Centralization - Decentralization - Span of control. Management by COURSE OBJECTIVES (MBO)- Management by Exception (MBE).

UNIT 2 MANAGEMENT OF ORGINASATION 9 Hrs.

Forms of Business / Industrial Ownership - Sole Trader, Partnership, Joint stock Company, Performance Appraisal - Basic Principles - Pitfalls - Methods to Overcome. Industrial Safety - Causes of Accidents - Cost of Accidents - Measures to avoid Accidents. Plant Layout & Maintenance - Need, Types & Managerial Aspects.

UNIT 3 ORGANISATIONAL BEHAVIOUR 9 Hrs.

Organisational Behaviour - Definition - Nature & Scope - Contributing Disciplines - Importance of OB to Managers. Personality - Definition - Theories - Factors Influencing Personality. Motivation - Definition - Theories. Transactional Analysis. Morale & Job Satisfaction - Factors Influencing Job Satisfaction.

UNIT 4 GROUP DYNAMICS 9 Hrs.

Group - Definition - Types - Determinants of Group Cohesiveness. Communication - Process - Barriers - Effective Communication. Leadership-Definition- leadership styles- Theories of leadership - Factors Contributing to Effective Leadership. Trade Unions- Role of Trade Union in Organizations - Types and Functions o f Trade Unions.

UNIT 5 PROFESSIONAL ETHICS 9 Hrs.

Ethics in Workplace - Formulation of Ethics - Managerial Ethics - Managing Ethical Behaviour - Codes of Ethics - Encouraging Ethical Behaviour - Ethical Leadership - Ethical Decision making. Corporate Social Responsibility (CSR) - Intellectual Property Rights (IPR)- Meaning- Laws relating to Intellectual Property Rights (IPRs)

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Gupta C.B., Management Theory and Practice, 14th Edition, Sultan Chand & Sons, 2009.

2. Dr. Prasad L.M., Principle & Practice of Management, 7th Edition, Sultan Chand & Sons, 2008.

3. Aswathappa, Organisational Behaviour, 8th Edition, Himalaya Publishing House, 2010.

4. Dr. Prasad L.M., Organisational Behaviour, 4th Edition, Sultan Chand & Sons, 2008.

5. Harold Koontz, Principles of Management, 1st Edition, Tata McGraw Hill, 2004.






SPR1307 RESOURCE MANAGEMENT TECHNIQUES L T P Credits Total Marks

2 1 0 3 100

COURSE OBJECTIVE To introduce the various optimization techniques and their advancements and to make use of the above

techniques while modeling and solving the engineering problems of different fields.

UNIT 1 INTRODUCTION AND LINEAR PROGRAMMING 9 Hrs.

Operations Research(OR)-Nature-Characteristics-Phases.-Role of OR in Decision making- Outline of OR Models Linear Programming – Formulation of L.P.problems –Solution by graphical method, simplex method, Two Phase Method, Big M methods, Dual Simplex method

UNIT 2 TRANSPORTATION AND ASSIGNMENT MODEL 9 Hrs.

Transportation problem – Initial Basic feasible solution- Northwest corner method, Least Cost method, Vogel’s approximation method – Test for optimality-MODI method. Assignment problems- Hungarian assignment models-Travelling salesman problems

UNIT 3 RESOURCE SCHEDULING AND NETWORK ANALYSIS 9 Hrs.

Problem of Sequencing – Problem with N jobs and 2 machines N Jobs 3 machines N Jobs and m machines and 2 Jobs m machines (Graphical method). Project Management -Basic concepts–Network construction and scheduling Critical Path Method (CPM) & Program evaluation review technique (PERT) and resource leveling by network techniques, time – Cost trade off.

UNIT 4 INVENTORY CONTROL 9 Hrs.

Inventory Control – Various Types of inventory models – deterministic inventory models – Production model, Purchase model– with and without shortage- Economic Order Quantity (EOQ) – Buffer stock – Shortage quantity, Probabilistic inventory models – Quantity Discount and Price Breaks

UNIT 5 QUEUEING THEORY AND REPLACEMENT MODELS 9 Hrs.

Queuing theory – Poisson arrivals and exponential service times, Single channel models only, Replacement policy for items whose maintenance cost increases with time- Consideration of time value of money - Replacement policy- Individual, Group replacement of items that fail completely and suddenly.

Max. 45 Hours


1. R.Panneerselvam,”operation research”, 2nd Edn., Prentice Hall, 2001.

2. S.D Sharma,”operation research Theory,Methods and Application”, 17th Edn., Kedar Nath Ram Nath Publication, 2010.

3. Nita H Shah, Ravi M Gor & Hardik Soni, ”operation research”, 4th Edn., PHI, 2010.

4 .Hamdy A.Taha,” Opeartion Research”, 8th Edn, PHI, 2008

5. Hiller & Liberman., Introduction to Operations Research, 5th Edition, Mc Graw Hill, 2001

6. Ravindran,Phillips &Solberg, “Operations Research: principles and practice”, 2nd Edn., Wiley India Lts, 2007

7. Ronald L. Rardin,” Optimization in Operations Research”, Prentice Hall, 1998


PART A : 10 questions of 2 marks each – No choice 20 Marks




SCS1101 PROBLEM SOLVING TECHNIQUES L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand the basics of solving a problem through computing

To study different algorithms for solving a given problem.

UNIT 1 PROGRAMMING TECHNIQUES 9 Hrs. Steps Involved in Computer Programming - Problem Definition - Outlining The Solution - Flow Chart - Developing Algorithms - Efficiency of Algorithms - Analysis of Algorithms - Step Count & Operation Count

UNIT 2 FUNDAMENTAL ALGORITHMS 9 Hrs. Exchanging the Values - Counting - Summation of Set of Number - Factorial Computation - Sine Computation - Fibonacci Sequence - Reversing the Digits of an Integer - Base Conversion - Character to Number Conversion.

UNIT 3 FACTORING METHODS 9 Hrs.

Finding the Square Root of a Number - Smallest Divisor of an Integer - GCD of Two Integers - Generating Prime Numbers - Computing the Prime Factors of an Integer - Generation of Pseudo - Random Numbers - Raising a Number to a Large Power - Computing the Nth Fibonacci Number.

UNIT 4 ARRAY TECHNIQUES 9 Hrs.

Array Order Reversal - Array Counting or Histogramming - Finding the Maximum Number in a Set - Removal of Duplicates from an Ordered Array - Partitioning an Array - Finding the kth Smallest Element - Longest Monotone Subsequence.

UNIT 5 DESIGN OF ALGORITHMS- BACKTRACKING, BRANCH AND BOUND, SEARCHING 9 Hrs. Backtracking - 8 Queens - Hamiltonian Circuit Problem, Branch and Bound - Travelling Salesman Problem, Searching - water jug problem, tic-tac-toe problem.

Max. 45 Hours

TEXT / REFFERENCE BOOKS 1. Dromey.R.G, ”How to Solve it by Computer”, Prentice-Hall of India, Eighth Indian Reprint,1996.

2. Ellis Horowitz,sartaj Sahni ,”Fundamentals of Data Structures”, Computer Science Press,1983.


PART A : 10 questions of 2 marks each- No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SCS1102 FUNDAMENTALS OF PROGRAMMING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To introduce the fundamental concepts of programming to the students and familiarize them with art of writing programs.

UNIT 1 INTRODUCTION 9 Hrs. Introduction: Algorithms & flowcharts - Overview of C - Features of C - Structure of C program - Compilation &

execution of C program - Identifiers, variables, expression, keywords, data types, constants, scope and life of variables, and local and global variables – Operators: arithmetic, logical, relational, conditional and bitwise operators– Special operators: sizeof () & comma (,) operator – Precedence and associativity of operators & Type conversion in expressions – Input and output statements.

UNIT 2 CONTROLS STRUCTURES AND FUNCTIONS 9 Hrs.

Control structures: Conditional statements – Looping statements – Functions: Library Functions - User Defined – Function Prototype - Function Definition – Types of Functions – Functions with and without Arguments-Functions with no return and with Return Values - Nested Functions - Recursion.

UNIT 3 ARRAYS AND STRINGS 9 Hrs. Arrays: Single and Multidimensional Arrays – Array Declaration and Initialization of Arrays – Array as Function Arguments.

Strings: Declaration – Initialization and String Handling Functions. Structure and Union: Definition and Declaration – Nested Structures – Array of Structures – Structure as

Function Argument – Function that Returns Structure – Union.

UNIT 4 STORAGE CLASS AND POINTERS 9 Hrs. Storage Class Specifier: Auto, Extern, Static, & Register.

Pointers: The ‘&’ and ’ *’ Operators – Pointers Expressions – Arrays Using Pointers – Structures Using Pointers – Functions Using Pointer – Function as Arguments – Command Line Arguments.

UNIT 5 MEMORY MANAGEMENT 9 Hrs. DMA functions: malloc(), calloc(), sizeof(), free() and realloc(). Preprocessor directives.

File management: File operations - opening & closing a file, input and output statements, Control statements.

Max. 45 Hours TEXT / REFERENCE BOOKS

1. Balaguruswami. E., ‘Programming in C’, TMH Publications,1997.

2. Yashavant P. Kanetkar, ‘LET US C’, Fifth Edition.

3. Gottfried, ‘Programming with C’, Schaums Outline Series, TMH publications,1997.

4. Mahapatra, ‘Thinking in C’, PHI publications,2nd Edition.

5. Stevens , ‘Graphics programming in C’, BPB publication,2006

6. Subburaj. R , ‘Programming in C’, Vikas Publishing, First Edition, 2000.


Max Marks : 80 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each- No choice 20 Marks




SCS1103 DATA STRUCTURES L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand the searching and sorting techniques.

To familiarize with stacks, queues and linked lists.

UNIT 1 INTRODUCTION 9 Hrs.

Introduction to algorithms - Recursion - Definition - Design Methodology and Implementation of recursive algorithms - Linear and binary recursion - recursive algorithms for factorial function - Fibonacci sequence - Tower of Hanoi - Tail recursion – Data Structures - Need - classification - operations - Array - characteristics - types - storage representations.

UNIT 2 SEARCHING AND SORTING TECHNIQUES 9 Hrs. Basic concepts - List Searches using Linear Search - Binary Search - Fibonacci Search - Sorting Techniques - Insertion sort - Heap sort - Bubble sort - Quick sort - Merge sort - Analysis of sorting techniques.

UNIT 3 STACKS 9 Hrs

Basic Stack Operations - Representation of a Stack using Arrays - Algorithm for Stack Operations - Stack Applications: Reversing list - Factorial Calculation - Infix to postfix Transformation - Evaluating Arithmetic Expressions.

UNIT 4 QUEUES 9 Hrs Basic Queue Operations - Representation of a Queue using array - Implementation of Queue Operations using

Stack - Applications of Queues - Round robin Algorithm - Enqueue - Dequeue - Circular Queues - Priority Queues.

UNIT 5 LINKED LISTS 9 Hrs

Introduction - Single linked list - Representation of a linked list in memory - Operations on a singly linked list - Merging two singly linked lists into one list - Reversing a singly linked list - Applications of singly linked list to represent polynomial expressions and sparse matrix manipulation - Advantages and disadvantages of singly linked list - Circular linked list - Doubly linked list - Circular Doubly Linked List.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Jean-Paul Tremblay, Paul G. Sorenson,’An Introduction to Data Structures with Application’,, TMH, 2n d Edition.

2. Naps, Thomas L., and Bhagat Singh, “Introduction to Data Structure with Pascal”, West Publishing Co., 1986.

3. Richard F, Gilberg, Forouzan, “Data Structures”, Cengage, 2nd Edition.


Max Marks : 80 Exam Duration : 3 Hrs.

PART A : 10 questions of 2 marks each- No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks - 80 Marks



SCS1201 ADVANCED DATA STRUCTURES L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To understand the advanced concepts such as trees, graphs, sets and tables.

UNIT 1 BASIC TREE CONCEPTS 9 Hrs.

Trees- Ordinary and Binary trees terminology, Properties of Binary trees, Implementation using Array and Linked list - Binary tree ADT representations, recursive and non recursive traversals - Binary Search tree - Insertion and Deletion.

UNIT 2 ADVANCED TREE CONCEPTS 9 Hrs. Threaded Binary Trees, AVL Tree, B-tree Insertion and deletion, Splay trees - Heap trees - Heapify Procedure, Tries .

UNIT 3 GRAPH CONCEPTS 9 Hrs. Terminology, Representation using Array and Linked List - Types of graphs - Graph traversals - BFS and DFS - Applications.

UNIT 4 ADVANCED GRAPH CONCEPTS 9 Hrs. Minimum Spanning Tree - Kruskal’s, Prim’s and Sollin’s Algorithm - Shortest path using Dijkstra’s, Bellman Ford and Floyd Warshall Algorithm

UNIT 5 TABLES AND SETS 9 Hrs. Rectangular tables - Jagged tables - Inverted tables - Symbol tables - Static tree tables - Dynamic tree tables - Hash tables. Sets: Representation - Operations on sets - Applications.

Max. 45 Hours


1. Ellis Horowitz and Sartaj Sahni “Fundamentals of Data Structures” Galgotia Book Source, Pvt. Ltd., 2004.

2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 2005.

3. Naps, Thomas L., and Bhagat Singh. “Introduction to Data Structure with Pascal”. West Publishing Co., 1986.

4. Jean Paul Tremblay and Paul G. Sorenson, “An Introduction to Data Structures with Applications”, Tata McGraw-Hill, Second edition, 2001.

5. Aaron M Tanenbaum, Moshe J Augenstein and Yedidyah Langsam, "Data Structures using C and C++", Pearson Education, 2004.

6. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, First Edition Reprint 2003.

7. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India Edition, 2005.


PART A : 10 questions of 2 marks each- No choice 20 Marks




SCS1202 OBJECT ORIENTED PROGRAMMING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand the fundamental concepts of object oriented programming.

Be familiar with concepts like abstraction, inheritance, polymorphism.

To understand the concept of Classes.

UNIT 1 INTRODUCTION TO OBJECT ORIENTED PROGRAMMING 9 Hrs. Object Oriented Programming Paradigms - Comparison of Programming Paradigms - Basic Object Oriented

Programming concepts - Comparison with C - Overview of C++ - Pointers - Functions - Scope and Namespaces - Source files and programs.

UNIT 2 CLASSES AND OBJECTS 9 Hrs. Working with classes - Classes and objects - Class specification - Defining class members - Objects Accessing member functions - Inline Functions - Data hiding - Class member accessibility - Empty classes.

UNIT 3 CONSTRUCTORS AND OVERLOADING 9 Hrs. Default constructors - Parameterized constructors - Constructor overloading - Copy constructors - new, delete

operators-”this” pointer - friend classes and friend functions - Function overloading- Unary Operator overloading - Binary Operator overloading.

UNIT 4 INHERITANCE 9 Hrs. Base class and derived class relationship - Derived class declaration - Forms of inheritance - Inheritance and

member accessibility - Constructors in derived class - Destructors in derived class - Multiple inheritance - Multi level inheritance - Hybrid inheritance - Virtual base classes - Member function overriding - Virtual functions - Abstract classes - Pure Virtual functions.

UNIT 5 I/O AND LIBRARY ORGANIZATION 9 Hrs. I/O Stream - File I/O - Exception Handling - Templates - STL - Library Organization and Containers - Standard Containers -

Overview of Standard Algorithms - Iterators and Allocators.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Balagurusamy, ”Object Oriented Programming with C++”, Tata McGraw Hill,4th Edition,2010. 2. Venu Gopal K.R, Ravishankar.T, and Raj kumar, ”Mastering C++”, Tata McGraw Hill,1999. 3. Bjarne Stroustrup, ”The C++ programming language”, Addision Wesley, 3rd Edition,1998. 4. John R Hubbard, “Programming with C++”, Schaums Outline Series, McGraw Hill, 2nd edition, 2009. 5. James Martin & James J.Odell,”Object Oriented methods - A foundation”,Prentice Hall,1 997.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each- No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SCS1203 FUNDAMENTALS OF DIGITAL SYSTEMS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To have a detailed knowledge about the fundamentals of Digital Electronics.

To understand basics of Logic Gates.

To develop ability to understand Combinational Logic.

To develop ability to understand Sequential Logic.

Also to have a knowledge about Memory units.

UNIT 1 NUMBER SYSTEMS,COMPLIMENTS AND CODES 9 Hrs. Number Systems - Binary Numbers - Number base conversions - Octal and Hexa Decimal Numbers -

Complements - Signed Binary Numbers - Binary Arithmetic - Binary Codes - Decimal Code - Error Detection code - Gray Code- Reflection and Self Complementary codes - BCD number representation - Alphanumeric codes ASCII/EBCDIC - Hamming Code- Generation, Error Correction.

UNIT 2 BOOLEAN ALGEBRA AND LOGIC GATES 9 Hrs.

Axiomatic definitions of Boolean Algebra - Basic Theorems and Properties of Boolean Algebra - Boolean Functions- Canonical and Standard forms - Digital Logic Gates- Simplification of Boolean Expressions:The map method- SOP and POS - NAND and NOR implementation - Don’t Cares - The Tabulation Method - Determination and Selection of Prime Implicants

UNIT3 COMBINATIONAL LOGIC 9 Hrs. Design Procedure - Adder - Subtracter - Code Conversion - Analysis Procedure - Multilevel NAND/NOR circuits

- Exclusive OR functions - Binary adder and subtractor- Decimal adder - BCD adder - Magnitude Comparator - Decoders - Demultiplexer - Encoder - Multiplexers

UNIT 4 SYNCHRONOUS SEQUENTIAL LOGIC 9 Hrs.

Flip Flops - Analysis of clocked sequential circuit - Reduction and Assignments - Flip flop excitation tables - Design Procedure - Design of counters - Registers - Shift registers - Synchronous Counters - Timing sequences - Algorithmic State Machines - ASM chart - timing considerations - control implementation.

UNIT 5 ASYNCHRONOUS SEQUENTIAL LOGIC AND MEMORY 9 Hrs. Circuits with Latches - Analysis procedure and Design Procedure - Reduction of state and Flow tables - Race - Free State Assignment

Max. 45 Hours


1. Morris Mano, “Digital Logic & Computer Design”, Prentice Hall India, 2006.

2 Thomas L Floyd, "Digital Fundamentals", 10th Edition, Pearson Education, 2009.

3 Thomas.C.Bartee, “Computer Architecture & Logic Design”, McGraw-Hill, 1991.

4 P.Malvino and D.P.Leach, “Digital Principles and Applications”, 6th Edition, McGraw-Hill, 2006.

5 Thomas C. Bartee, "Computer Architecture Logic Design", 3rd Edition, 2002.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each- No choice 20 Marks




SCS1204 THEORY OF COMPUTATION L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES To have an understanding of finite state automata and pushdown

automata.

To understand regular languages and context free languages.

To study the Turing machine and classes of problems.

UNIT 1 FINITE AUTOMATA AND REGULAR LANGUAGES 15 Hrs.

Finite automata and regular languages - Regular languages and regular expressions - Finite automata - Union, intersections, and complements of automata - Non-determinism and Kleene’s theorem - Non-deterministic finite automata and NFA with transition - Pumping lemma for Regular Languages

UNIT 2 CONTEXT-FREE LANGUAGES AND NORMAL FORMS 12 Hrs.

Context-free grammars - Definition - More examples - Including some familiar languages - Union, concatenations, and *’s of CFLs - Derivation trees and ambiguity - Unambiguous CFG for algebraic expressions - Normal Forms - CNF - GNF- Pumping Lemma for CFL.

UNIT 3 PUSH DOWN AUTOMATA 12 Hrs. Pushdown automata - Introduction - Definition - Deterministic pushdown automata - PDA corresponding to a given context-free grammar – Context-free Grammar corresponding to PDA.

UNIT 4 TURING MACHINES 14 Hrs. Turing machines - Models of computation and the Turing thesis - Definition of TM and TM as language acceptor - Non-deterministic TM and Deterministic TM – Universal TM

UNIT 5 RECURSIVE LANGUAGE AND UNSOLVABLE PROBLEMS 7 Hrs. Recursively enumerable and recursive languages - Recursively enumerable and recursive sets - Enumerating a language - Not all languages are recursively enumerable.

Unsolvable problem - An unsolvable decision problem - Reducing one problem to another (halting problem) - Other unsolvable problems in TM - Rice’s theorem and more unsolvable problems.

Max. 60 Hours

TEXT / REFERENCE BOOKS 1. John C. Martin, “Theory of Computation”, 3r d Edition. Tata McGraw Hill, 2003.

2. Bernard M.Moret, “The Theory of Computation”, Addison Wesley, 2002 Reprint.






SCS1205 OBJECT ORIENTED ANALYSIS AND DESIGN L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand objects, classes and inheritance.

To understand utilization of software objects to build software projects .

To use UML in requirements elicitation and designing.

To understand concepts of relationships and aggregations.

UNIT 1 AN OVERVIEW OF OBJECT ORIENTED SYSTEM DEVELOPMENT 9 Hrs. Introduction - Object Oriented System Development Methodology - Why Object Orientation - Overview of

Unified Approach - Object Basics: Object Oriented Philosophy - Objects - Classes - Attributes - Object Behavior and Methods, Encapsulation and Information Hiding - Class Hierarchy - Polymorphism - Object Relationships and Associations - Aggregations and Object Containment - Object Identity - Static and Dynamic Binding - Persistence. Object Oriented Systems Development Life Cycle: Software Development Process - Building High Quality Software - Usecase Driven Approach - Reusability. UNIT 2 OBJECT ORIENTED METHODOLOGIES 9 Hrs

Rumbaugh et al.’s Object Modeling Technique - Booch Methodology - Jacobson et al. Methodologies - Patterns - Framework - Unified approach - Unified Modeling Language:Static and Dynamic Model - UML Diagrams - UML Class Diagram - UML Usecase Diagram - UML Dynamic Modeling - UML Extensibility - UML Metamodel.

UNIT 3 OBJECT ORIENTED ANALYSIS 9 Hrs. Business Object Analysis - Use Case Driven Object Oriented Analysis - Business Process Modeling - Use Case

model - Developing Effective Documentation - Object Analysis Classification: Classification Theory - Noun Phrase Approach - Common Class Patterns Approach - Use-Case Driven Approach - Classes Responsibilities and Collaborators - Naming Classes - Identifying Object Relationships, Attributes and Methods: Association - Super-Subclass Relationships - A-part of Relationships. UNIT 4 OBJECT ORIENTED DESIGN 9 Hrs.

Object Oriented Design Process - Object Oriented Design Axioms - Corollaries - Designing Classes: Object Constraint Language - Process of Designing Class - Class Visibility - Refining Attributes - Access Layer: Object Store and Persistence - Database Management System - Logical and Physical Database Organization and Access Control - Distributed Databases and Client Server Computing - Object Oriented Database Management System - Object Relational Systems - Designing Access Layer Classes - View Layer: Designing View Layer Classes - Macro Level Process - Micro Level Process - Purpose of View Layer Interface - Prototyping the user interface. UNIT 5 SOFTWARE QUALITY 9 Hrs.

Software Quality Assurance: Quality Assurance Test - Testing Strategies - Impact of Object Oriented Testing - Test Cases - Test Plan - Myers Debugging Principle - System Usability and Measuring User Satisfaction: Usability Testing - User Satisfaction Testing

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Ali Bahrami, “Object oriented systems development using the unified modeling language”, 1st Edition, McGraw- Hill, 1998. 2 Grady Booch, James Rumbaugh, and Ivar Jacobson,“The Unified Modeling Language User Guide”, 3rd Edition Addison Wesley,

2007. 3 John Deacon, “Object Oriented Analysis and Design”, 1st Edition, Addison Wesley, 2005. 4 Bernd Oestereich, “Developing Software with UML, Object - Oriented Analysis and Design in Practice”, Addison-Wesley, 2000.


PART B : 2 questions from each unit of internal choice, each carrying 16 marks. 80 Marks



SCS1206 DESIGN AND ANALYSIS OF ALGORITHM L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand different methodologies for analyzing algorithms. To learn about various algorithm design techniques and their

applications.

To know about the limitations of algorithms.

UNIT 1 INTRODUCTION 9 Hrs. Fundamentals of Algorithmic Problem Solving - Time Complexity - Space complexity with examples - Growth of

Functions - Asymptotic Notations: Big Oh, Little Oh, Omega, Theta - Properties - Complexity Analysis Examples - Performance measurement - Instance Size, Test Data, Experiment setup.

UNIT 2 MATHEMATICAL FOUNDATIONS 9 Hrs. Solving Recurrence Equations - Substitution Method - Recursion Tree Method - Master Method - Best Case -

Worst Case - Average Case Analysis - Sorting in Linear Time - Lower bounds for Sorting - Counting Sort - Radix Sort - Bucket Sort

UNIT 3 DESIGN OF ALGORITHMS - BRUTE FORCE AND DIVIDE-AND-CONQUER 9 Hrs. Brute Force - Travelling Salesman Problem - Knapsack Problem - Assignment Problem - Closest Pair and

Convex Hull Problems - Divide and Conquer Approach - Binary Search - Quick Sort - Merge Sort - Strassen’s Matrix Multiplication.

UNIT 4 DESIGN OF ALGORITHMS - DYNAMIC PROGRAMMING AND GREEDY APPROACH 9 Hrs. Dynamic Programming - Floyd Warshall Algorithm - Optimal Binary Search Algorithms - Greedy Approach - Huffman Code - Kruskal’s Algorithm - Prim’s Algorithm - Dijkstra’s Algorithm

UNIT 5 DESIGN OF ALGORITHMS - BACKTRACKING AND BRANCH AND BOUND 9 Hrs. Backtracking - 8 Queens - Hamiltonian Circuit Problem - Branch and Bound - Assignment Problem - Knapsack

Problem - Travelling Salesman Problem - NP Complete Problems - Clique Problem - Vertex Cover Problem

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Sartaj Sahni, “Data Structures, Algorithms, and Applications in C++”, McGraw Hill, 2n d Edition, 2005. 2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI

Learning Private Limited, 2012. 3 Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012. 4 Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, Reprint 2006. 5 Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009. 6 Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.






SCS1207

COMPUTER ARCHITECTURE AND ORGANISATION


3 0 0 3 100

COURSE OBJECTIVES To understand the organization of a computer, and the hardware - software

interface. To know about the various components of a computer and their internals.

To have an overview of pippelinig, vector processing and multiprocessors.


Central Processing unit - Introduction - General Register Organization - Stack organization - Basic computer Organization - Instruction codes - Computer Registers - Computer Instructions - Instruction Cycle - Arithmetic – Logic - Shift Microoperations - Arithmetic Logic Shift unit - Example Architectures: MIPS – Power – PC – RISC - CISC

UNIT 2 DATA PATH DESIGN 10 Hrs. Computer arithmetic : Addition - Subtraction - Multiplication and Division algorithms - Floating Point Arithmetic operations

Microprogrammed Control : Control memory - address sequencing - Microprogram Example - Design of Control unit - Example Processor design

UNIT 3 MEMORY ORGANISATION 8 Hrs. Memory Organization : Memory Hierarchy - Main memory - auxiliary Memory - Associative Memory - Cache Memory - Virtual memory

UNIT 4 IO ORGANISATION 9 Hrs Input - Output Organization : Peripheral Devices - I/O Interface - Modes of transfer - Priority Interrupt - DMA - IOP - Serial Communication

UNIT 5 MULTIPROCESSORS 8 Hrs. Characteristics of multiprocessors - Interconnection Structures - Interprocessor Arbitration - Interprocessor Communication and Synchronization - Cache coherance

Max. 45 Hours


1. M.Morris Mano, ‘Computer system Architecture”,Prentice-Hall Publishers,Third Edition.

2 John P Hayes , ‘Computer architecture and Organization’, McGraw Hill international edition, Third Edition.

3 Kai Hwang and Faye A Briggs ,‘Computer Architecture and Parallel Processing’, McGraw Hill international edition,1995.


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each- No choice 20 Marks




SCS1208 FOUNDATION FOR SYSTEM PROGRAMMING L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES To study the mathematical concepts required for designing system

software.

To study the basics of grammar and it’s importance for parser.

UNIT 1 BASICS OF MATHEMATICAL FOUNDATION RELATED TO COMPUTER SCIENCE 7 Hrs. Set theory - Elements of languages and its operations- Relations- Types of relations- Functions and its types - Mathematical induction- Applications of mathematical induction.

UNIT 2 APPLICATIONS OF FINITE AUTOMATA IN COMPUTER SCIENCE 15 Hrs.

Regular language - properties of regular languages- Applications of regular languages - representation of regular languages - Finite automata and its applications - how finite automata is used to represent the structure of lexical phase - finite automata to regular expression

UNIT 3 CONTEXT FREE GRAMMAR 15 Hrs. Conversion of regular language to CFG - Structure of CFG - applications of CFG in computer science- parsing using CFG- ambiguous and unambiguous grammar.

UNIT 4 PUSH DOWN AUTOMATA 8 Hrs. Applications of PDA- types of PDA - Design examples - CFG to PDA- PDA to CFG.

UNIT 5 TURING MACHINE 15 Hrs. Applications of turing machine in computer science- types of turing machine - Comparison of finite automata with turing machine - UTM - Design examples of turing machine.

Max. 60 Hours


1. John C. Martin, “Theory of Computation”, 3r d Edition. Tata McGraw Hill, 2003.

2. Bernard M.Moret, “The Theory of Computation”, Addison Wesley, 2002 Reprint.






SCS1301 OPERATING SYSTEM L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To have an overview of different types of operating systems.

To understand the concept of process management.

To understand the concept of storage management.

To understand the concept of I/O and file systems.

UNIT 1 INTRODUCTION 8 Hrs. Introduction - Operating system structures - System components - OS services - System calls - System

structure - Resources Processes - Threads - Objects - Device management - Different approaches - Buffering device drivers.

UNIT 2 PROCESS MANAGEMENT 9 Hrs.

Processes - Process concepts - Process scheduling - Operations on processes - Cooperating processes - CPU scheduling - Basic concepts - Scheduling criteria - Scheduling algorithms - Preemptive strategies - Non-preemptive strategies

UNIT 3 SYNCHRONIZATION AND DEADLOCKS 9 Hrs. The critical section problem - Semaphores - Classic problems of synchronization - Critical regions - Monitors-Dead locks - Deadlock characterization - Prevention - Avoidance - Detection - Recovery.

UNIT 4 MEMORY MANAGEMENT 9 Hrs.

Storage Management Strategies - Contiguous Vs. Non-Contiguous Storage Allocation - Fixed & Variable Partition Multiprogramming - Paging - Segmentation - Paging/Segmentation Systems - Page Replacement Strategies - Demand & Anticipatory Paging - File Concept - Access Methods - Directory Structure - File Sharing - Protection - File - System Structure - Implementation.

UNIT 5 I/O SYSTEM,LINUX & SHELL PROGRAMMING 10 Hrs.

Mass Storage Structure - Disk Structure- Disk Scheduling - Disk Management - Swap Space Management - RAID Structure - Shell Operation Commends - Linux File Structure - File Management Operation - Internet Service - Telnet - FTP - Filters & Regular Expressions - Shell Programming - Variable, Arithmetic Operations, Control Structures, Handling Date, Time & System Information.

Max. 45 Hours


1. Abraham Silberschatz, Peter Galvin and Gagne, “Operating System Concepts”, 6th Edition, Addison Wesley, 2002.

2. Harvey M.Deitel, ”Operating System”, 2nd Edition, Addison Wesley, 2000.

3 Gary Nutt, ”Operating System, A modern perspective”, 2nd Edition, Addison Wesley, 2000.

4 Richard Peterson, “Linux : The Complete Reference”, 6th Edition, Tata McGraw Hills, 2007.






SCS1302 COMPUTER GRAPHICS AND L T P Credits Total Marks

MULTIMEDIA SYSTEMS 3 0 0 3 100

COURSE OBJECTIVES

To gain knowledge to develop, design and implement two and three dimensional graphical structures.

To enable students to acquire knowledge of Multimedia compression and animations.

To learn creation, Management and Transmission of Multimedia objects.

UNIT 1 BASICS OF COMPUTER GRAPHICS 9 Hrs. Output Primitives: Survey of computer graphics - Overview of graphics systems - Line drawing algorithm - Circle drawing algorithm - Curve drawing algorithm - Attributes of output primitives - Anti-aliasing.

UNIT 2 2D TRANSFORMATIONS AND VIEWING 8 Hrs. Basic two dimensional transformations - Other transformations - 2D and 3D viewing - Line clipping - Polygon clipping - Logical classification - Input functions - Interactive picture construction techniques.

UNIT 3 3D CONCEPTS AND CURVES 10 Hrs. 3D object representation methods - B-REP , sweep representations, Three dimensional transformations. Curve

generation - cubic splines, Beziers, blending of curves- other interpolation techniques, Displaying Curves and Surfaces, Shape description requirement, parametric function. Three dimensional concepts – Introduction - Fractals and self similarity- Successive refinement of curves, Koch curve and peano curves.

UNIT 4 METHODS AND MODELS 8 Hrs. Visible surface detection methods - Illumination models - Halftone patterns - Dithering techniques - Polygon rendering methods - Ray tracing methods - Color models and color applications.

UNIT 5 MULTIMEDIA BASICS AND TOOLS 10 Hrs. Introduction to multimedia - Compression & Decompression - Data & File Format standards - Digital voice and

audio - Video image and animation. Introduction to Photoshop - Workplace - Tools - Navigating window - Importing and exporting images - Operations on Images - resize, crop, and rotate - Introduction to Flash - Elements of flash document - Drawing tools - Flash animations - Importing and exporting - Adding sounds - Publishing flash movies - Basic action scripts - GoTo, Play, Stop, Tell Target

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Donald Hearn, Pauline Baker M., "Computer Graphics”, 2nd Edition, Prentice Hall, 1994. 2. Tay Vaughan ,”Multimedia”, 5th Edition, Tata McGraw Hill, 2001.

3 Ze-Nian Li, Mark S. Drew ,”Fundamentals of Multimedia”, Prentice Hall of India, 2004.

4 D. McClelland, L.U.Fuller ,”Photoshop CS2 Bible”, Wiley Publishing, 2005.

5 James D. Foley, Andries van Dam, Steven K Feiner, John F. Hughes, “Computer Graphics Principles and Practice, 2nd

6 Edition in C, Audison Wesley, ISBN - 981 -235-974-5

7 William M. Newman, Roberet F. Sproull, “ Principles of Interactive Computer Graphics”, Second Edition, Tata McGraw-Hill Edition.




SCS1303 COMPILER DESIGN L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To study the basics and design of system

software.

To study the basic principles of compiler.

UNIT 1 INTRODUCTION 9 Hrs. Components of system software - editor - debugger - linker - loader - assembler - case study.

UNIT 2 BASICS OF COMPILER 9 Hrs. Compiler - Structure Of Compiler - Phases - Representation Of Lexical Phase Using Regular Expression - Representation Of Regular Expression - Finite Automata to Design Lexical Phase - Minimized DFA Algorithm.

UNIT 3 PARSER 9 Hrs. Types Of Parser - Shift Reduce Parsing - Operator Precedence Parsing - Recursive Decent Parser - Non-Recursive Decent Parser.

UNIT 4 INTERMEDIATE CODE GENERATION 9 Hrs. Intermediate code generation for assignment statements - boolean statements - switch case statement - symbol table generation.

UNIT 5 OPTIMIZATION 9 Hrs. Optimization - issues related to optimization - loop optimization - peep hole optimization - three address code generation algorithm - examples.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. D M. Dhamdhere , “System Programming”, 2nd Edition, Tata McGraw Hill Publishing, 1999.

2. Alfred V.Aho, Jeffery D.Ullman & Ravi Sethi, ” Compiler Principles, Techniques & Tools”, Addison- Wesley Publishing Company, 1986.

3 Alfred V. Aho,Jeffery D. Ullman, “Principles of Compiler Design”, Narosa Publihing House, 15th reprint, 1996.






SCS1304 SYSTEM SOFTWARE L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand, design and implement a lexical analyzer.

To understand, design and implement a parser.

To understand, design code generation schemes.

To understand optimization of codes and runtime environment.

To familiarize Assemblers, Macroprocessor and Loaders.

UNIT 1 COMPILERS - LEXICAL ANALYSIS 7 Hrs. Structure of compiler - Role of lexical analyzer - Regular expression - Finite automata - Regular expression to finite automata - Minimizing DFA - Introduction to LEX and YACC programming

UNIT 2 PARSER 8 Hrs. Context free grammar - Derivations - Parse trees - Capabilities of context free grammar - Types of parser - Shift reduce parsing - Operator precedence parsing - Recursive decent parser - Non-recursive decent parser.

UNIT 3 INTERMEDIATE CODE GENERATION 10 Hrs. Syntax directed translation scheme - Types of translation scheme - Implementation of desktop calculator -

Types of intermediate codes- Postfix notation - Parse trees - Syntax trees - Three address code - Quadruples - Triple - Translation of assignment statements - control flow statements - Backpatching - Boolean statements - Procedure call - switch case statements - Symbol table.

UNIT 4 CODE GENERATION AND OPTIMIZATION 10 Hrs.

Principles of source of optimization - Loop optimization - DAG representation of basic block - Value number and algebraic laws - Global data flow analysis - Dominators - Reducible flow graph - Depth first search - Loop invariant computations - Induction variable elimination - Peephole optimization - Issues in code generation- Code generation algorithm.

UNIT 5 ASSEMBLER, MACROPROCESSORS, LOADER 10 Hrs. Assembler - Elements of ALP - Pass structure of assembler - Design of two pass assembler. Macro definition

and call - Macro expansion - Nested macro call - Advanced macro facilities - Design of macro - Preprocessor - Relocation and linking concepts - Design of linker and loader.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. D M. Dhamdhere , “System Programming”, 2n d Edition, Tata McGraw Hill Publishing, 1999.

2. Alfred V. Aho,Jeffery D. Ullman, “Principles of Compiler Design”, Narosa Publihing House, 15th reprint, 1996. 3 Alfred V.Aho, Jeffery D.Ullman & Ravi Sethi, ” Compiler Principles, Techniques & Tools”, Addison- Wesley Publishing Company 1986.






SCS1305 SOFTWARE ENGINEERING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To gain knowledge of fundamental concepts of software engineering and design process.

To understand different notion of complexity at both the module and system level.

To be aware of some widely known design methods.

To understand the role and contents of testing activities in different life cycle phases.

UNIT 1 INTRODUCTION 9 Hrs S/W engineering paradigm - Life cycle models - Water fall - Incremental - Spiral - Evolutionary - Prototyping -

Object oriented system engineering - Computer based system - Verification - Validation - Life cycle process - Development process - System engineering hierarchy - Introduction to CMM - Levels of CMM.

UNIT 2 SOFTWARE ENGINEERING PROCESS 9 Hrs. Functional And Non-Functional - User - System - Requirement Engineering Process - Feasibility Studies -

Requirements - Elicitation - Validation and management - Fundamental of requirement analysis - Analysis principles-Software prototyping - Prototyping in the Software Process - Rapid Prototyping Techniques - User Interface Prototyping - Software Document Analysis and Modeling - Data - Functional and Behavioral Models - Structured Analysis and Data Dictionary.

UNIT 3 DESIGN PROCESS AND CONCEPTS 9 Hrs. Design process - Modular design - Design heuristic - Design model and document - Architectural design -

Software architecture - Data design - Architecture data - Transform and transaction mapping - User interface design - User interface design principles.

UNIT 4 BASIC CONCEPTS OF SOFTWARE TESTING 9 Hrs. Levels - Software Testing Fundamentals - Types of s/w test - White box testing- Basis path testing - Black box

testing - Control Structure testing- Regression testing - Testing in the large- S/W testing strategies - Strategic approach and issues - UNIT testing - Integration testing - Validation testing - System testing and debugging. Case studies - Writing black box and white box testing.

UNIT 5 COST ESTIMATION & MAINTENENCE 9 Hrs. Software cost estimation - COCOMO model - Quality management - Quality concepts- SQA - Software reviews

- Formal technical reviews - Formal approaches of SQA and software reliability - Software maintenance - SCM - Need for SCM - Version control - Introduction to SCM process - Software configuration items. Re-Engineering - Software reengineering - Reverse engineering - Restructuring - Forward engineering.

Max. 45 Hours


1. Pressman, “Software Engineering and Application”, 6th Edition, McGraw International Edition, 2005. 2 Shooman. M.C , ”Software Engineering Design”, McGraw International Edition, 1985. 3 Richard Fairley, ” Software Engineering - Design, Reliability And Management”, McGraw International Edition, 1983. 4 Sommerville, ”Software Engineering”, 6th Edition, Pearson Education, 2000.

5 Pfleeger, ”Software Engineering”, 6th Edition, Prentice Hall of India, 2005 6 Ghezzi, ”Software Engineering”, 2nd Edition, Prentice Hall of India, 2005.




SCS1306 DATABASE MANAGEMENT SYSTEM L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Design of database for any given problem.

Design Logical Database Schema and Mapping it to implementation level schema through Database Language Features.

Understand the practical problems of Concurrency control and its solutions Gain knowledge about failure and Recovery mechanisms.

UNIT 1 INTRODUCTION TO DATABASES 9 Hrs.

Databases and Databases users - Database system concepts and architecture - Data modeling using Entity Relationship (ER) Model. Relational Model - The Relational Data Model and Relational Database Constraints - The Relational Algebra and Relational Calculus.

UNIT 2 DATABASE DESIGN 9 Hrs. Overview of the QBE Language - Overview of the Hierarchical Data Model - Overview of the Network Data

Model - SQL-99: Schema Definition, Constraints, Queries, and Views- Functional Dependencies and Normalization for Relational Databases.

UNIT 3 QUERY PROCESSING 9 Hrs. Algorithms for Query Processing and Optimization - Introduction to Transaction Processing Concepts and Theory - Concurrency control techniques.

UNIT 4 RECOVERY AND SECURITY 9 Hrs. Database Recovery Techniques - Database Security - Distributed databases and Client- Server Architecture

UNIT 5 OBJECT DATABASE 9 Hrs. Concepts for Object Database - Enhanced Data Models for Advanced Application Emerging Database Technologies and Application

Max. 45 Hours


1. ElmasrI & Navathe - Fundamentals of Database Systems - 3rd Edition, 2nd Reprint, Addison Wesley, 2000

2. Abraham Silberschatz, Henry. F. Korth and S. Sudharshan “Database System Concepts”, 4 th Edition, 2002.

3 C. J. Date, “Introduction to database systems”, Addison Wesley, 7th Edition, 2001.

4 Jan L. Harrington, “Object oriented database design”, Harcourt India private limited 2000.




SCS1307 COMPUTATIONAL INTELLIGENCE L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES

To gain knowledge of the concepts, paradigms, algorithms, and implementation of Computational Intelligence and its constituent methodologies

To provide a strong foundation of fundamental concepts in Artificial Intelligence, ANN, Fuzzy systems, Genetic Algorithms and Swarm Intelligence.

UNIT 1 ARTIFICIAL INTELLIGENCE 12 Hrs. Introduction - Foundations of AI - History of AI - Intelligent agent - Types of agents - Structure - Problem solving agents - Uninformed and informed search strategies.

UNIT 2 ARTIFICIAL NEURAL NETWORKS 12 Hrs. Basic concepts - Single layer Perceptron - Multilayer Perceptron - Supervised and Unsupervised learning - Back Propagation Networks - Performance Issues.

UNIT 3 FUZZY SYSTEMS 12 Hrs. Introduction to fuzzy- Fuzzy sets and Fuzzy reasoning - Fuzzy matrices - Fuzzy Functions - Decomposition - Fuzzy rules and inferences - Fuzzy decision making.

UNIT 4 GENETIC ALGORITHMS 12 Hrs. Survival of the fittest - Fitness Computations - Cross over- Mutation - Reproduction - Rank method - Rank Space method.

UNIT 5 SWARM INTELLIGENCE 12 Hrs. `Particle swarm optimization - Global PSO- Local PSO - Ant colony Optimization - Simple Ant Colony - Ant System - Max, Min Ant System.

Max. 60 Hours


1. Stuart J.Russel, Peter Norvig, “ Artificial Intelligence A Modern Approach ”, 2nd Edition, Pearson Education, 2003.

2. Jang J.S.R., Sun C.T. And Mizutani E, "Neuro-Fuzzy and Soft computing", Prentice Hall 1998.

3. Timothy J. Ross, "Fuzzy logic with Engineering Applications", McGraw Hill, 1997.

4. Goldberg. D.E, “Genetic Algorithm: Search, Optimization and Machine Learning”, Addison Wesley, N.Y, 1989.

5. Andries. P. Engelbrecht , ”Computational Intelligence“, Wiley Publications, Second Edition.

6. Yagnanarayana.B., “Artificial Neural Networks”, Prentice Hall of India, 2006

7 Nilsson N.J., Artificial Intelligence - A New Synthesis, Harcourt Asia Pvt. Ltd.

8 Elain Rich & Kevin Knight, Artificial Intelligence, Tata McGraw Hill

9 Laurene Fausett, "Fundamentals of Neural Networks", Prentice Hall, 1994.

10 George Klir, Bo Yuan, Bo Yuan “Fuzzy Sets And Fuzzy Logic”, Prentice Hall of India Pvt Ltd., 1997

11 Kosko, B., “Neural Network and Fuzzy Systems”, Prentice Hall of India Pvt., Ltd., 1994.

12 Zimmerman H.J., “Fuzzy set theory - and its applications”, Kluwer Academic Publishers,1999




SCS1308 NUMBER THEORY AND CRYPTOGRAPHY L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES

To understand number theory used for network security.

To understand the design concept of cryptography and authentication.

To understand the design concepts of internet security.

To develop experiments on algorithm used for security.

UNIT 1 NUMBER THEORY 12 Hrs. Divisibility and the Division Algorithm - The Euclidean Algorithm - Modular Arithmetic - Groups, Rings, and

Fields - Finite Fields of the Form GF( p ) - Polynomial Arithmetic - Finite Fields of the Form GF(2n) - Finite Field Arithmetic

UNIT 2 NUMBER THEORY 12 Hrs.

Principles of Pseudorandom Number Generation - Pseudorandom Number Generators - Prime numbers - Fermat’s Theorem - Euler’s Theorem - Testing for Primality - The Chinese Remainder Theorem - Discrete Logarithms.

UNIT 3 INTRODUCTION TO CRYPTOGRAPHY 12 Hrs.

Services - Mechanisms and attacks - The OSI security architecture - A model for network security - Classical encryption technique - Symmetric cipher model - Substitution technique - Rotor machines - Steganography - Block Cipher principles

UNIT 4 ENCRYPTION ALGORITHMS AND KEY MANAGEMENT 12 Hrs.

Simplified DES - The Data Encryption Standard - The strength of DES - Confidentiality using symmetric encryption - Placement of encryption - Traffic confidentiality - Advanced Encryption Standard (AES) - Public key cryptography and RSA-

UNIT 5 AUTHENTICATION 12 Hrs.

Key Distribution - Key Management - Diffie-Hellman Key Exchange - Digital Signature Standard (DSS) Authentication requirements - Authentication functions - Message authentication codes - Hash functions - Security of hash functions and MAC’S - MD5 (Message Digest Algorithm) - HMAC - SHA1

Max. 60 Hours


1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March 2013. 2. Behrouz A. Forouzan, Debdeep Mukhopadhyay, “Cryptography and Network Security”, 2n d edition, McGraw Hill, 2012.

3. Behrouz A. Forouzan,” Introduction to Cryptography and Network security “ First Edition, Chegg Textbooks.






SCS1309 NETWORK SECURITY L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES

To know the basic concepts of network security and its various security issues.

To understand the design concept of cryptography and authentication.

To understand the design concepts of internet security.

To develop experiments on algorithm used for security.

UNIT 1 NETWORK SECURITY DESIGN 12 Hrs. Hacking - Vulnerabilities - Design Issues - Human Issues - Implementation Issues - Threats - Reconnaissance

Attacks - Access Attacks - Information Disclosure Attacks - Denial of Service Attacks - Threat Defense - Secure Communication - Network Security Best Practices - SAFE Campus Design.

UNIT 2 THREATS IN NETWORKS 12 Hrs. Network Security Controls - Firewalls - Intrusion Detection Systems - Secure Email - Intruder - Intrusion detection system - Virus and related threats - Countermeasures - Firewalls design principles - Trusted systems

UNIT 3 SECURITY PRACTICE 12 Hrs.

X.509 Authentication services - E-mail security - IP security - Web security- Network perimeter security - Secured router configuration – Firewall - Design principle - Trusted systems – VPN – IDS - IPS penetration testing - NAT - Implementation of cryptography and security

UNIT 4 NETWORK SECURITY PROTOCOLS 12 Hrs. SSH – RADIUS – SSL – Kerberos – TLS – IPSec - Voice over IP – IPSEC - X.509 Authentication service - Electronic mail security S/MME - Application security – SSL – PGP - SET.

UNIT 5 SECURITY SERVICES 12 Hrs. Computer Forensics and Cyber Laws - Data Recovery - Security Policies and Procedures - Security Lifestyle Managemen - Security Audit - Managed Security Services

Max. 60 Hours


1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March 2013.

2. Behrouz A. Forouzan, Debdeep Mukhopadhyay, Cryptography and Network Security, 2n d edition, McGraw Hill, 2012 .

3. William Stallings, “Network Security Essentials : Applications and Standards”, Fourth Edition, Pearson Education.







SCS1310 COMPUTER NETWORKS L T P Credits Total Marks

3 1 0 4 100 COURSE OBJECTIVES

Understand the division of network functionalities into layers.

Be familiar with the components required to build different types of networks.

Be exposed to the required functionality at each layer.

Learn the flow control and congestion control algorithms.

UNIT 1 FUNDAMENTALS & LINK LAYER Building a network - Requirements - Layering and protocols - Internet Architecture - Network

software - Performance - Framing - Error Detection - Flow control

12 Hrs.

UNIT 2 MEDIA ACCESS & INTERNETWORKING 12 Hrs. Media access control - Ethernet (802.3) - Wireless LANs - 802.11 - Bluetooth - Bridging - Basic Internetworking – IP – CIDR – ARP – DHCP -ICMP

UNIT 3 ROUTING 12 Hrs. Routing – RIP – OSPF - Metrics - Global Internet – Areas – BGP - IPv6 - Multicast - Addresses - Multicast routing – DVMRP – PIM.

UNIT 4 TRANSPORT LAYER 12 Hrs. Overview of Transport layer - UDP - Reliable byte stream (TCP) - Connection management - Flow control - Retransmission - TCP Congestion control - Congestion avoidance- QoS - Application requirements.

UNIT 5 APPLICATION LAYER 12 Hrs. Traditional applications - Electronic Mail – SMTP - POP3 – IMAP- MIME - HTTP - DNS- SNMP.

Max. 60 Hours


1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth Edition, Morgan Kaufmann Publishers, 2011.

2. James F. Kurose, Keith W. Ross, “Computer Networking - A Top-Down Approach Featuring the Internet”, Fifth Edition, Pearson Education, 2009.

3. Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall Publishers, 2010.

4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill Publisher, 2011.

5. Behrouz A. Forouzan, “Data communication and Networking”, Fourth Edition, Tata McGraw Hill, 2011.






SCS1311 NETWORK PROGRAMMING AND MANAGEMENT L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES

To know the importance of Socket Programming.

To learn about the different applications using Socket.

To understand the concept of managing simple networks.

UNIT 1 ELEMENTARY TCP SOCKETS 12 Hrs.

Introduction to Socket programming- Overview of TCP/IP protocols- Introduction to Sockets- Socket address structures - Byte ordering functions - address conversion functions - Elementary TCP Sockets – Socket - Connect – Bind – Listen – Accept – Read – Write - Close functions- Iterative server - concurrent server.

UNIT 2 APPLICATION DEVELOPMENT 12 Hrs.

TCP Echo Server - TCP Echo Client - Posix Signal handling - Server with multiple clients - boundary conditions:Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown - I/O multiplexing - I/O Models - select function - shutdown function - TCP echo Server (with multiplexing) - poll function - TCP echo Client (with Multiplexing).

UNIT 3 SOCKET OPTIONS, ELEMENTRY UDP SOCKETS 12 Hrs.

Socket options - getsocket and setsocket functions - generic socket options - IP socket options - ICMP socket options - TCP socket options - Elementary UDP sockets - UDP echo Server - UDP echo Client - Multiplexing - TCP and UDP sockets - Domain name system - gethostbyname function - IPv6 support in DNS - gethostbyaddr function - getservbyname and getservbyport functions.

UNIT 4 ADVANCED SOCKETS 12 Hrs.

IPv4 and IPv6 interoperability - Threaded servers - Thread creation and termination - TCP echo server using threads - Mutexes - condition variables - raw sockets - raw socket creation - raw socket output - raw socket input - ping program - trace route program.

UNIT 5 SIMPLE NETWORK MANAGEMENT 12 Hrs. SNMP network management concepts - SNMP management information - Standard MIB’s - SNMPv1 protocol and Practical issues - Introduction to RMON, SNMPv2 and SNMPv3.

Max. 60 Hours


1. W. Richard Stevens, “UNIX Network Programming Vol-I”, Second Edition, Pearson Education, 1998.

2. Mani Subramaniam, “Network Management: Principles and Practice“, Addison Wesley, First Edition, 2001.

3. William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, 3rd Edition, Addison Wesley, 1999.






SCS1314 DATA COMMUNICATION L T P Credits Total Marks

AND COMPUTER NETWORKS 3 0 0 3 100

COURSE OBJECTIVES

Recognize the individual components of the big picture of computer networks.

Outline the basic network configurations.

List the layers of the OSI model and Internet model and describe the duties of each layer.

UNIT 1 DATA COMMUNICATION 9 Hrs.

Introduction to data communication - Network protocols & standards - Line configuration - Topology - Transmission mode - Categories of networks - OSI model - Layers of OSI model - TCP/IP Model - Transmission media - Guided media - Unguided media.

UNIT 2 DATALINK LAYER 9 Hrs. Link layer services - Framing - Flow Control - Error control- Medium Access Control - Ethernet CSMA/CD - Token Ring - FDDI - Token Passing- Wireless LAN - CSMA/CA

UNIT 3 NETWORK LAYER 9 Hrs Circuit Switching - Packet Switching - Routing - Distance Vector Routing - Link State Routing - Addressing-Subnetting - IPV4- IPV6- ARP - RARP - ICMP - IGMP - DHCP.

UNIT 4 TRANSPORT LAYER 9 Hrs. TCP- UDP - Connection Management- Flow Control - Retransmission - Congestion Control - Detection and Avoidance.

UNIT 5 APPLICATION LAYER 9 Hrs. Networking Devices - Repeaters - Switches - Bridges - Routers - Gateways- Domain Name System - FTP - WWW and HTTP - SNMP - SMTP - POP3 - IMAP - MIME.

Max. 45 Hours


1. Behrouz A. Fourouzan, “Data Communication and Networking”, McGraw-Hill Education India Pvt. Ltd - New Delhi.

2. William Stallings, Data and Computer Communications (8th ed.), Pearson Education, 2007.

3. P.C. Gupta, Data Communications and Computer Networks, Prentice-Hall of India, 2006.

4. Andrew S. Tanenbaum, “Computer Networks”, Fourth Edition, Pearson.

5. L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach (3rd ed.), Morgan Kaufmann, 2003.


Max. Marks : 100 Exam Duration : 3 Hrs




SCS1401 RICH INTERNET APPLICATIONS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To study about Rich Internet Application, ext js and gwt.

UNIT 1 RICH INTERNET APPLICATION OVERVIEW 9 Hrs

Introduction to Web2.0 - Key characteristics of Rich Internet Application - Current Rich Internet Application platforms - Rich Internet Application benefits - Rich Internet Application patterns and best practices - Rich Internet Application architecture - Restful Web Services with Nodes.

UNIT 2 INTRODUCTION TO EXT JS 9 Hrs. Functions - Objects and Classes - Javascript in Web Browsers - Getting started with Ext JS - Creating your first Ext JS Application - MVC Basics.

UNIT 3 BUILDING RIA WITH EXT JS 9 Hrs. Fundamental Classes - Event Handling - Panels and Grids - Layouts and Widgets - Working with data.

UNIT 4 INTRODUCTION TO GWT 9 Hrs Overview - Why Gwt - GWT compiler - Cross browser compatibility. Basic GWT - GWT modules - Build and deploy simple GWT application - GWT Widget Library.

UNIT 5 BUILDING RIA WITH GWT 9 Hrs. GWT Panels and Layouts - Event Handling - Internationalisation - Advanced GWT - RPC and AJAX - Writing a service implementation - Handling browser back button functionality - MVP Design pattern.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Shreeraj Shah, “ Web 2.0 Security: Defending Ajax, RIA, and SOA ”, Course Technology PTR , 2007.

2. Krishna Sankar , Susan A. Bouchard, “ Enterprise Web 2.0 Fundamentals ”, Cisco Press , 2010.

3. David Flanagan, ” JavaScript: The Definitive Guide ” , 6th Edition, O'Reilly Media, Inc, March 2011.

4. Alessio Malizia , Ext JS Documentation Site “ Mobile 3D Graphics ”, Springer,2006.

5. Colin Ramsay , Shea Frederick , Steve Cutter' Blades, “ Learning Ext JS ”, Packt Publishing , 2008.

6. Jesus Garcia, “ Ext JS in Action ”, Manning Publications , 2010.

7. Federico Kerek , “ Essential GWT: Building for the Web with Google Web Toolkit 2 ”, Addison-Wesley Professional,201 0.






SIT1301 DATA MINING AND DATA WAREHOUSING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To understand the principles of Data warehousing and Data Mining.

To know the Architecture of a Data Mining system and Data pre-processing Methods.

To perform classification and prediction of data.

UNIT 1 DATA WAREHOUSING 9 Hrs. Data warehousing components - Building a data warehouse - Multi Dimensional Data Model - OLAP Operation

in the Multi-Dimensional Model - Three Tier Data Warehouse Architecture - Schemas for Multi-dimensional data Model - Online Analytical Processing (OLAP) - OLAP Vs OLTP Integrated OLAM and OLAP Architecture.

UNIT 2 DATA MINING 9 Hrs. Introduction - Data - Types of data - Steps in KDD - System Architecture - Data mining functionalities -

Classification of data mining systems - Data mining task primitives - Integration of a data mining system with a data warehouse - Issues - Data pre-processing - Data Mining Application

UNIT 3 ASSOCIATION RULE MINING 9 Hrs. Mining frequent patterns - Associations and correlations - Mining methods - Finding Frequent itemset using

Candidate Generation - Generating Association Rules from Frequent Itemsets - Mining Frequent itemset without Candidate Generation - Mining various kinds of association rules - Mining Multi-Level Association Rule-Mining Multi-Dimensional Association Rule-Mining Correlation analysis - Constraint based association mining.

UNIT 4 CLASSIFICATION AND PREDICTION 9 Hrs.

Classification and prediction - Issues Regarding Classification and Prediction - Classification by Decision Tree Induction - Bayesian classification - Baye’s Theorem - Naïve Bayesian Classification - Bayesian Belief Network - Rule based classification - Classification by Backpropagation - Support vector machines - Prediction - Linear Regression - Non Linear Regression.

UNIT 5 CLUSTERING, APPLICATIONS AND TRENDS IN DATA MINING 9 Hrs. Cluster analysis - Types of data in Cluster Analysis - Categorization of major clustering methods -- Partitioning

methods - K Means - K Medoids - Hierarchical methods - Density-based methods - Grid-based methods - Model based clustering methods -- Constraint Based cluster analysis - Outlier analysis - Data mining applications.

Max. 45 Hours


1. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, 2nd Edition, Elsevier, 2007

2. Alex Berson and Stephen J. Smith, “ Data Warehousing, Data Mining & OLAP”, Tata McGraw Hill, 2007.

3. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction To Data Mining”, Person Education, 2007.

4. K.P. Soman, Shyam Diwakar and V. Ajay, “Insight into Data mining Theory and Practice”, Easter Economy Edition, Prentice

Hall of India, 2006.

5. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Easter Economy Edition, Prentice Hall of India, 2006.

6. Daniel T.Larose, “Data Mining Methods and Models”, Wile-Interscience, 2006.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice 20 Marks




SIT1302 INTERNET PROGRAMMING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Introduce students to the major Internet programming concepts.

Provide students with a significant hands-on implementation experience of programming the Internet at different levels of abstraction.

Provide an opportunity for students to explore in detail an Internet technology of their choice and share their findings with the class.

UNIT 1 MARKUP LANGUAGE 9 Hrs.

Introduction to HTML - Structure of HTML, HTML elements - Mark up tags for inserting URL, Images, Tables, Frames - Form and its controls - Image maps - Client and Server Side – CSS – Inline – Internal and External - Multimedia components - Audio and Video - Dynamic HTML.

UNIT 2 JAVA SCRIPT 8 Hrs Introduction to JavaScript, Advantages, Data Types – Variables – Operators - Control Statements – Functions -

Objects – Array – Strings – Math – Boolean – Global - Date, and Number - Windows and Frames - Forms and Validation.

UNIT 3 XML TECHNOLOGIES 10 Hrs

Introduction to XML, XML structure – Elements - Well-formed XM -, XML Namespaces - Working with DTD - Adding DTDs to documents - Defining DTD entities - Defining Parameter entities - Working with attributes - Defining attributes - Defining multiple attributes - Using predefined attributes - CSS basics - Adding CSS to document - Need of XSL - XSL basics - XSL transformations - Introduction to Schemas - Defining simple elements and types - XML query.

UNIT 4 PHP 9 Hrs.

Introduction to PHP – Features - PHP Scripts - Data types – Variables – Operators - Controlling program flow - Working with arrays - Functions and classes - Working with files - Reading with Local and Remote files - Working with Database – Basics - Creating and populating database.

UNIT 5 ASP.NET 9 Hrs. Introducing ASP.NET - ASP.NET namespaces - Creating and deploying ASP.NET applications - Web forms -

Basic Web Controls - Working with events - Rich Web Controls : AdRotator Control - Calendar Control - Custom web Controls - Validation controls - Localising ASP.NET applications.

Max. 45 Hours


1. Thomas A. Powell, ”The Complete Reference HTML”, Tata McGraw Hill, 3rd Edition.

2. Thomas A. Powell and Fritz Schneider,”Java Script Complete Reference”, 2nd Edition, Tata McGraw Hill

3. Heather Williamson, ” XML Complete Reference”, Tata Mcgraw Hill,2001.

4. Jim Converse & Joyce Park, PHP & MySQL Bible, Wiley.




http://asp.net/

http://asp.net/

http://asp.net/

http://asp.net/

http://asp.net/



SIT1303 DATA ANALYTICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Understand the nature of data analytics in context.

Explore the transformed data to derive meaningful results.

To provide an overview of advanced machine learning, data mining and statistic techniques that arise in real data analytic applications.

UNIT 1 INTRODUCTION TO DATA ANALYTICS 10 Hrs.

Introduction-Data Analytics, Data mining and Knowledge discovery-Data and Relations-Dissimilarity measures - similarity measures - sequence relations - sampling and quantization - Analysis vs Reporting - Modern data analytic tools - Statistical Concepts - Probability - Sampling and Sampling distribution - statistical Inference - Prediction and prediction error – Resampling.

UNIT 2 DATA ANALYSIS 10 Hrs Linear Correlation - Regression Modeling - Multivariate analysis - Bayesian modeling - Inference and Bayesian

networks - Support vector and Kernel Methods - Analysis of time series: Linear system analysis, nonlinear dynamics - Rule induction - Basics of Fuzzy and Neural networks.

UNIT 3 CLASSIFICATION AND CLUSTERING METHODS 10 Hrs. Classification criteria - Naive Bayes classifier - Linear Discriminant Analysis - Support Vector Machine - Nearest

neighbor classifier - Learning vector Quantization - Decision Tress - Cluster Partitions - Sequential clustering - Prototype Based Clustering - Fuzzy Clustering - Relational Clustering - Self Organizing Map.

UNIT 4 DATA VISUALIZATION 8 Hrs. Introduction - Classification of Visual data analysis techniques - Data type to be visualized - Visualization

techniques - Interaction techniques - Principle Component Analysis, Multi dimensional Scaling, Sammon Sampling, Histograms - Spectral analysis

UNIT 5 FRAMEWORKS 7 Hrs.

Distributed File system - Physical organization of Computer nodes - Large scale file system organization - Map Reduce - The map task - Grouping and Aggregation - The reduce task - Combiners - Details of map reduce Execution - Coping with Node failures.

Max. 45 Hours


1. Michael Berthold, David J. Hand, Intelligent Data Analysis,Springer,2007

2. Thomas A. Runkler, Data Analytics, Models and Algorithms for Intelligent data Analysis,Springer 2012

3. Anand Rajaraman and Jeffery David Ullman, Mining of massive data sets, Cambridge University press,2012

4. Bill Franks, Taming the Big data tidal wave: Finding opportunities in Huge Data Streams with advanced analytics, John Wiley & sons,2012

5. Thomas H. Davenport, Jinho Kim Keeping up with the Quants: Your Guide to understanding and using Analytics,Harvard Business Press books,2013


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SIT1304 CLOUD COMPUTING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Gain knowledge in Basics of Cloud computing.

Understand Cloud Computing architecture and industry frameworks such as Map Reduce.

Discuss practical applications of cloud computing.

UNIT 1 UNDERSTANDING CLOUD COMPUTING 9 Hrs.

History of Cloud computing - Cloud Computing Architectural Framework - Types of Clouds - pros and cons of cloud computing - difference between web 2.0 and cloud - key challenges in cloud computing - Major Cloud players - Cloud Deployment Models - Virtualization in Cloud Computing - types of virtualization - Parallelization in Cloud Computing - cloud resource management - dynamic resource allocation - Optimal allocation of cloud models.

UNIT 2 CLOUD SERVICE MODELS 9 Hrs. Software as a Service (SaaS) - Infrastructure as a Service (IaaS)- Platform as a Service (PaaS)- Service Oriented Architecture (SoA) - Elastic Computing - On Demand Computing.

UNIT 3 CLOUD DEPLOYMENT MODELS 9 Hrs. Deployment of applications on the cloud - Hypervisor - Case studies - Xen, VMware, Eucalyptus, Amazon EC2, KVM, Virtual Box, Hyper-V.

UNIT 4 CLOUD COMPUTING FOR EVERYONE 9 Hrs. Cloud data centers - Energy efficiency in data centre - Mobile cloud computing service models - Collaboration

with services and applications: CRM management - Project management - Email - on line database - calendar - schedules - Word Processing - Presentation - Spreadsheet - Databases - Desktop - Social Networks and Groupware.

UNIT 5 CLOUD SECURITY 9 Hrs.

Cloud security - Security threats and solutions in clouds - Auditing protocols - dynamic auditing - storage security - Privacy preserving -- Fully Homo-morphic Encryption - big data security - Cloud availability - DoS attacks - Fault tolerance management in cloud computing - Cloud computing in India.

Max. 45 Hours


1. Cloud computing a practical approach - Anthony T.Velte, Toby J. Velte Robert Elsenpeter TATA McGraw - Hill, New Delhi - 2010

2. Cloud Computing: Web-Based Applications That Change the Way You Work and Collaborate Online - Michael Miller - Que 2008

3. Cloud Security: A Comprehensive Guide to Secure Cloud Computing, Ronald L. Krutz, Russell Dean Vines, Wiley-India, 2010






SIT1305 MACHINE LEARNING L T P Credits Total Marks

3 1 0 4 100

COURSE OBJECTIVES

To focus on the construction and study of algorithms that can learn from data.

To emphasize on the logical, knowledge-based approach.

To introduce the various local models of learning.

UNIT 1 INTRODUCTION TO MACHINE LEARNING 12 Hrs.

Machine learning - examples of machine learning applications - Learning associations - Classification - Regression - Unsupervised learning - Supervised Learning - Learning class from examples - PAC learning - Noise,model selection and generalization - Dimension of supervised machine learning algorithm.

UNIT 2 DECISION THEORY 12 Hrs.

Bayesian Decision Theory - Introduction - Classification - Discriminant function - Bayesian networks - Association rule - Parametric Methods - Introduction - Estimation - Classification - Regression - Multivariate Methods - Data Parameter estimation - Classification - Complexity - Features - Dimensionality Reduction - Analysis - Multidimensional scaling - Linear discriminant analysis.

UNIT 3 CLUSTERING & REGRESSION 12 Hrs.

Clustering - Mixture densities - k-means clustering - Supervised Learning after clustering - Hierarchical clustering - Nonparametric Methods - Density estimation - Generalization of multivariate data - Classification - Regression - Smoothing models - Decision Trees - Univariate trees - Multivariate trees - Learning rules from data - Linear Discrimination.

UNIT 4 MULTILAYER PERCEPTRONS 12 Hrs. Structure of brain - Neural networks as a parallel processing - Perceptron - Multilayer perceptron - Backpropagation - Training procedures - Tuning the network size - Learning time.

UNIT 5 LOCAL MODELS 12 Hrs.

Competitive learning - Adaptive resonance theory - Self organizing map - Basis functions - Learning vector quantization - Assessing and Comparing Classification Algorithms - Combining Multiple Learners - Reinforcement Learning.

Max. 60 Hours


1. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press,2004

2. Tom Mitchell, “Machine Learning”, McGraw Hill, 1997.

3. http://mitpress.mit.edu/catalog/item/default.asp? ttype=2&tid=1 0341 &mode=toc.





http://mitpress.mit.edu/catalog/item/default.asp?



SIT1306 DATA MINING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To provide a comprehensive introduction to techniques in data mining and knowledge discovery.

The material will be presented both from a database perspective and a machine learning perspective.

The course will cover both basic and advanced techniques for uncovering interesting data patterns hidden in

large data sets.

UNIT 1 DATA MINING 9 Hrs. Introduction : Basic Data Mining Tasks, Types of Data, Data Mining Issues, KDD, Data Mining Task Primitives, Classification of Data Mining, Data Pre-processing.

UNIT 2 ASSOCIATION RULES 9 Hrs. Association Rules : Basic Algorithms, Apriori, FP-Tree, Mining various kinds of Association Rules, Parallel and Distributed Algorithms, Advanced Association Rule Mining Techniques, Measuring the Quality of Rules.

UNIT 3 CLASSIFICATION 9 Hrs. Classification : Statistical-Based Algorithms, Distance-Based Algorithms, Decision Tree-Based Algorithms, Naive Bayesian Classification, Neural Network-Based Algorithms, Rule-Based Algorithms.

UNIT 4 CLUSTERING 9 Hrs. Clustering : Similarity and Distance Measures, Hierarchical Algorithms, Partitional Algorithms, Model based Clustering Algorithms, Clustering High Dimensional Data.

UNIT 5 ADVANCED TECHNIQUES 9 Hrs. Social impacts of data mining, Text Mining, Web Mining, Spatial Mining, Temporal Mining.

Max. 45 Hours

TEXT / REFERENCES BOOKS

1. J. Han and M. Kamber. Data Mining: Concepts and Techniques, 2nd Ed. Morgan Kaufman. 2006

2. M. H. Dunham. Data Mining: Introductory and Advanced Topics. Pearson Education. 2001.

3. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann. 2000.

4. D. Hand, H. Mannila and P. Smyth. Principles of Data Mining. Prentice-Hall. 2001.






SIT1307 DATA WAREHOUSING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Keeping analysis/reporting and production separate.

Data warehouse purpose for data consistency and quality.

Establish the foundation for decision support.

UNIT 1 BUSINESS PROCESS & MODELING 9 Hrs. Modeling Types : Process Modeling - Business Process Modeling - Data Modeling, Modeling Methods: IDEF - IDEFO - Data Modeling Methods, Business Process - Business Process Tools - Business Process Re engineering

UNIT 2 DATA MODELING 9 Hrs.

Data Model: ER diagram - Logical Data Model - Physical Data Model, Development Life cycle: Gathering business Requirements - conceptual - logical - physical, Data Modeling Standards: steps in creating data model - relational VS Dimensional.

UNIT 3 DATA WAREHOUSE ARCHITECTURE 9 Hrs. Data warehouse Architecture - System Process Architecture - design - data base schema-partitioning strategy - aggregations - detonating - meta data - data warehouse process managers

UNIT 4 HARDWARE AND OPERATIONAL DESIGN 9 Hrs. Hardware and operational design of warehouses - Hardware Architecture - Physical layout Security - Backup and recovery - Service level agreement - operating the data warehouse.

UNIT 5 PLANNING, TUNING AND TESTING 9 Hrs. Capacity Planning - Tuning the data Warehouse - Testing the data warehouses.

Max. 45 Hours


1. Data warehousing in the Real World - Sam Anahory, Dennis Murray - Pears Education

2. Data warehousing - Amilesh Sinha - Thomson Delman Learning

3. Data warehouse Lifecycle Toolkit - Ralph Kumball - John Wiley & Sons Inc. 1998

4. Decision support and Data warehouse systems by E.G. Mallach-Tata McGraw Hill







SIT1401 HUMAN COMPUTER INTERACTION L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Understand the basics of human and computational abilities and limitations.

Practice a variety of simple methods for evaluating the quality of a user interface.

Apply appropriate HCI techniques to design systems that are usable by people.

UNIT 1 FOUNDATIONS OF HCI 9 Hrs.

The Human: I/O channels - Memory - Reasoning and problem solving; The computer: Devices - Memory - processing and networks; Interaction: Models - Frameworks - Ergonomics - Styles - Elements - Interactivity - Paradigms.

UNIT 2 DESIGN & SOFTWARE PROCESS 9 Hrs. Interactive Design basics - process - scenarios - navigation - screen design - Iteration and prototyping. HCI in

software process - software life cycle - usability engineering - Prototyping in practice - design rationale. Design rules - principles, standards, guidelines, rules. Evaluation Techniques - Universal Design.

UNIT 3 MODELS AND THEORIES 9 Hrs. Cognitive models - Socio-Organizational issues and stake holder requirements - Communication and collaboration models - Hypertext, Multimedia and WWW.

UNIT 4 MOBILE HCI 9 Hrs. Mobile Ecosystem: Platforms, Application frameworks - Types of Mobile Applications: Widgets, Applications, Games - Mobile Information Architecture, Mobile 2.0, Mobile Design: Elements of Mobile Design, Tools.

UNIT 5 WEB INTERFACE DESIGN 9 Hrs. Designing Web Interfaces - Drag & Drop, Direct Selection, Contextual Tools, Overlays, Inlays and Virtual Pages, Process Flow. Case Studies.

Max. 45 Hours

TEXT / REFFERENCE BOOKS

1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, 3rd Edition, Pearson Education, 2004 (UNIT I, II & III).

2. Brian Fling, “Mobile Design and Development”, First Edition, O’Reilly Media Inc., 2009 (UNIT IV).

3. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O’Reilly, 2009 (UNIT V).






SIT1402 MOBILE APPLICATION DEVELOPMENT L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To develop applications for current and emerging mobile computing devices, performing tasks at all stages of the software development life-cycle.

To learn how to utilize rapid prototyping techniques to design and develop sophisticated mobile interfaces.

To design, implement and deploy mobile applications using an appropriate software development environment.

UNIT 1 INTRODUCTION AND UI INTERFACE 9 Hrs.

Introduction to mobile technologies, mobile operation systems, Mobile devices - pros and cons, Introduction to Android, Versions, Features, Architecture, UI Widgets and Events handling, Layouts, Required tools - Eclipse, ADT, AVD, Application structure, AndroidManifest file, Android design philosophy, Creating Android applications.

UNIT 2 BUILDING BLOCKS AND DATABASES 9 Hrs. Introduction to Activities and Intents - Understanding Activity life cycle, Linking Activities, Passing Data, Toast,

Displaying a Dialog Window and Notifications. Content Provider, Services, Broadcast receivers, accessing databases, sample applications, debugging and deploying app, publish in Playstore.

UNIT 3 OBJECTIVE C PROGRAMMING 9 Hrs.

Objective C - Data Types and Expressions, Decision Making and Looping, Objects and Classes, Property, Messaging, Categories and Extensions, Fast Enumeration - NSArray, NSDictionary, Methods and Selectors, Static & Dynamic objects, Exception handling, Memory management, Required Tools - Xcode, iOS Simulator, Instruments, ARC, frameworks.

UNIT 4 INTRODUCTION TO iOS 9 Hrs. Introduction to iPhone, History, Versions, Features, MVC Architecture, View Controller - Building the UI and

Event handling, Application life cycle, Tab Bars, Story Boards and Navigation Controllers, Table View, Push Notification, Database handling, Debugging and Deployment, Publishing app in Appstore, sample applications.

UNIT 5 WINDOWS MOBILE APP DEVELOPMENT 9 Hrs.

Introduction to Windows Phone 8, Application Life cycle, UI Designing and events, Building, Files and Storage, Network Communication, Push Notification, Background Agents, Maps and Locations, Data Access and storage, Introduction to silvelight and XAML, Running and Debugging the App, Deploying and Publishing.

Max. 45 Hours


1. Reto Meier, “Professional Android Application Development”, Wrox Edition.

2. http://www.tutorialspoint.com/android/index.htm

3. http://developer.android.com/training/index.html

4. Stephen G. Kochan, “Programming in Objective C”, Addition Wesley, 4th Edition.

5. David Mark, Jack Nutting and Jeff LaMarche, “Beginning iOS 5 Development”, Apress Edition.

6. Baijian Yang, Pei Zheng, Lionel M. Ni, “Professional Microsoft Smartphone Programming”, Wrox Edition.



http://www.tutorialspoint.com/android/index.htm

http://developer.android.com/training/index.html



SPH4051 ENGINEERING PHYSICS LAB L T P Credit Total Marks

0 0 2 1 50

COURSE OBJECTIVE

To make the students to understand a broad range of experimental techniques and to enable them to demonstrate their ability to use the techniques in conducting scientific experiments and observations.

SUGGESTED LIST OF EXPERIMENTS: (Any Six)

1. Quincke’s method – Determination of magnetic susceptibility of a liquid.

2. Semiconductor diode - Determination of the forbidden energy gap.

3. Optical Fibre – Determination of Numerical aperture and attenuation loss.

4. Torsional pendulum – Determination of Moment of inertia and Rigidity modulus of the wire.

5. Young’s modulus – non-uniform bending- Determination of Young’s modulus of the material of beam.

6. Spectrometer – Hallow prism – Determination of Refractive index of a liquid.

7. Copper Voltameter – determination of electrochemical equivalent of copper.

8. Lees Disc – Determination of thermal conductivity of bad conductor.

9. LASER grating – Determination of wavelength of laser light.

10. Newton’s Rings – Determination of Radius of Curvature of convex lens.

SCY4051 ENGINEERING CHEMISTRY LAB L T P Credit Total Marks

0 0 2 1 50

COURSE OBJECTIVES

x To develop the skills for the estimation of various compounds

x To expose the students to handle the analytical equipments.

SUGGESTED LIST OF EXPERIMENTS

1. Estimation of ferrous ion by potentiometric method.

2. Determination of pKa value of glycine using pH meter.

3. Estimation of mixture of acids by conductometric method.

4. Estimation of Nickel by using photocolorimeter.

5. Determination of viscosity of polymers by using Ostwald’s viscometer.

6. Estimation of total hardness of water sample by EDTA / AAS method.


1. Jeffery G. H., Bassett J., Mendham J., and Denney R. C., Vogel’s Textbook of Quantitative Chemical Analysis, Sixth edition, Pearsons Education, 2004

2. Dara S. S., Experiments and Calculations in Engineering Chemistry, S. Chand & Co. Limited, 2010



SME4053 ENGINEERING GRAPHICS L T P Credits Total Marks

0 0 4 2 100

COURSE OBJECTIVE

The student is expected to acquire the drafting proficiency depending on the operational function in order to perform the day to day activity.

FUNDAMENTALS

Use of drafting instruments – BIS – Letttering – Vertical and Inclined – Dimensioning – Aligned and Unidirectional systems – Scaling – Importance of graphics in engineering applications.

GEOMETRICAL CONSTRUCTIONS

Dividing a given straight line into any number of equal parts – Bisecting a given angle – Trisecting a right angle – Drawing a regular pentagon and hexagon given one side – Conic sections – Construction of ellipse, parabola and hyperbola by Eccentricity method.

PROJECTION OF POINTS AND LINES Types of projection - Introduction to orthographic projection – Orthographic projection of points lying in four

quadrants – Orthographic projection of lines in first quadrant – Parallel to both the planes – Perpendicular to one plane – Parallel to one plane and inclined to the other plane – Inclined to both the planes.

PROJECTION OF PLANES AND SOLIDS

Projection of rectangular, square and circular planes - Orthographic projection of prisms, pyramids, cone and cylinder in first quadrant – Axis perpendicular to HP – Axis perpendicular to VP – Axis inclined to only one plane of projection – Change of position method only.

SECTION OF SOLIDS AND DEVELOPMENT OF SURFACES

Sectioning of prisms, pyramids, cylinder and cone in simple vertical positions with cutting planes perpendicular to one plane and parallel or inclined to other plane - Need for development of surfaces – Development of prisms, pyramids, cylindrical and conical surfaces.

ISOMETRIC PROJECTION AND ORTHOGRAPHIC PROJECTION

Isometric scale – Isometric View and Isometric Projection of simple solids and combination of solids - Drawing orthographic views (plan, elevation and profile) of objects from their isometric views.


1. Natarajan, K.V,” A text book of Engineering Graphics”, Dhalakshmi Publishers, 2006

2. Bhatt, N.D. and Panchal, V.M., Engineering Drawing, Charotar Publishing House, 2010

3. Venugopal, K. and Prabhu Raja, V., Engineering Drawing and Graphics + AutoCAD, New Age International, 2009.

4. SP 46: Engineering Drawing Practice for schools and colleges, Bureau of Indian Standards.

END SEMESTER EXAMINATION QUESTION PAPER PATTERN

By using mini drafter 100 Marks Note: Only after submission of all drawing sheets prescribed by staff member, the students will be allowed for university practical examination.



SME4088 DIGITAL SYSTEMS LAB L T P Credits Total Marks

0 0 4 2 100


DESIGN AND VERIFICATION OF THE RESULTS

1. Verification of Boolean algebra 2. Verification of Logic Gates 3. Adder and Subtractor 4. Code Converter

5. Comparator 6. Parity generator and checker 7. Design and study of Multiplexer and emultiplexer 8. Encoder and Decoder 9. Counter Design using flip flop 10. Shift Register Design using flip flop

SME4085 ELECTRONIC DEVICES & L T P Credits Total Marks

DIGITAL SYSTEMS LAB 0 0 4 2 100


ELECTRONIC DEVICES 1 Study of circuit components and equipments (Component identification, color coding, checking diode,

BJT, FET, study of CRO, Audio Oscillator, Multimeter, LCR meter) 2 Characteristics of Semiconductor diode and Zener diode

3 Characteristics of CE configuration (h parameter determination) 4 Characteristics of CB configuration 5 Characteristics of JFET 6 Characteristics of CC configuration

7 Characteristics of SCR & UJT 8 Characteristics of Diac & Triac 9 Characteristics of MOSFET 10 Characteristics of Photo transistor 11 Characteristics of LDR

12 Switching Characteristic of BJT 13 Clippers and Clampers 14 Voltage multipliers

DIGITAL CIRCUITS

1. Verify the Basic gates / Boolean function using logic gates. 2. To Construct and verify the full and half adder using logic gates. 3. To Verify 2x4 Decoder and 4x2 Encoder functionally. 4. To construct and study the working of RS flip-flop, D flip-flop, T flip-flop, JK flip-flop

5. To verify various shift register (a) SISO (b) SIPO (c) PISO

(d) PIPO 6. Design a counter using suitable flip-flop

(a) MOD Counter (b) Ripple Counter (c) Up- Down Counter



SEC4087 MICROPROCESSOR AND L T P Credits Total Marks

MICROCONTROLLER LAB 0 0 4 2 100


MICROPROCESSOR- 8085

1. Programs using Arithmetic Operations.

2. Programs for Code Conversions.

3. Largest, Smallest and Sorting of an Array (8085).

MICROCONTROLLER- 8051 1. Data Transfer Programs

2. Programs using Logical Instructions.

3. Programs using Boolean Instructions.

4. Reading and Writing on a Parallel Port. 5. Stepper Motor Controller.

6. Timer in Different Modes.

7. Serial Communication Implementation.



SCS4101 PROGRAMMING IN C LAB L T P Credits Total Marks

0 0 4 2 100


1. Program to understand the basic data types and input/output functions.

2. Program for Looping and decision statements.

3. Program on Functions.

4. Program on Arrays.

5. Program on String Manipulations

6. Program on Structures and Union.

7. Program on Pointers.

8. Program to demonstrate the Command Line Arguments.

9. Program using Dynamic memory allocation.

10. Program to implement the Random Access in Files.

11. Program to implement math function.

12. Program to Implement sorting algorithms

13. Program to Implement searching algorithms

14. Programs to solve some of the Engineering applications.

SCS4102 DATA STRUCTURES LAB L T P Credits Total Marks

0 0 4 2 100


1. Program to insert and delete an element from an array.

2. Program to sort the elements using insertion sort.

3. Program to sort the elements using quick sort.

4. Program to sort the elements using merge sort.

5. Program to implement operations on a Singly linked list.

6. Program to implement operations on a doubly linked list.

7. Program to implement a Stack using an array.

8. Program to implement a Stack using a Linked list.

9. Program to implement Queue using an array.

10. Program to implement Queue using a Linked list.

11. Program to convert an infix expression to postfix expression.

12. Program to implement display elements of a queue according to their priority.



SCS4201 OBJECT ORIENTED PROGRAMMING LAB L T P Credits Total Marks

0 0 4 2 100


1. Develop a C++ program to implement a class, object creation, member function invocation concept.

2. Develop a C++ program to implement the various constructors and destructor concept.

3. Develop a C++ program to implement a friend function, Inline function.

4. Develop a C++ program to implement an operator (Unary & Binary) overloading concept.

5. Develop a C++ program to implement a function overloading concept.

6. Develop a C++ program to implement a run time polymorphism.

7. Develop a C++ program to implement the following inheritance types.

a. Single

b. Multiple

c. Multilevel

d. Hierarchical

e. Hybrid

8. Develop a C++ program to implement an Abstract class concept.

9. Develop a C++ program to implement a Virtual function.

10. Develop a C++ program to find the number of characters in a file.

11. Develop a C++ program to handle the exceptions.

Case Study

1. Categorization of living beings as humans, animals, birds, insects, etc.., using inheritance.

2. Develop user defined manipulator for the following named

a) Rupees for displaying Rs. and sets the precision to 2.

b) Dollar for displaying $.



SCS4202 OBJECT ORIENTED ANALYSIS AND DESIGN LAB L T P Credits Total Marks

0 0 4 2 100


1. Study experiment – Object Oriented Concepts

2. Study of UML diagrams – aim and scope of diagrams.

3. Study of CASE tools – ArgoUML, Rational ROSE, Altova UML

4. Practicing on the methods of identifying classes

a. Understand – what is a class?

b. Structure of Class – relate UML representation to programming

c. Identifying classes for project – application of CRC method, Noun Phrase Approach.

5. Understanding relationships

a. Association

b. Realization

c. Generalization

d. Aggregation

6. Practicing Class diagrams

a. Designing Classes

i. refining attributes and designing methods.

ii. roles, multiplicity, qualifier.

b. components

7. Identifying Use cases – scenario based approach

8. Understanding usecases

a. identifying regular flow and alternative flow of events

b. identifying constraints, pre and post conditions

9. Activity diagrams – components, understanding difference between flow chart and activity diagram.

10. Interaction diagrams – sequence diagrams, colloboration diagrams.

11. Deployment Diagram – scenarios of application.

a. Student Information System

b. Online Ticket Reservation system

c. Employee Payroll system

d. Online Banking Application

e. ATM processing

f. Stock Maintenance

g. Library Management System



SCS4301 OPERATING SYSTEM LAB L T P Credits Total Marks

0 0 4 2 100

SUGGESTED LIST OF EXPERIMENTS (Implement all the problems using UNIX System Calls)

1. Study of basic LINUX & vi Editor command

2. String and Numerical Handling Functions

3. Loop and Selection Constructs

4. File Handing Functions

5. Manipulate Date/Time/Calendar

6. Retrieve System information

7. Implementation of process scheduling mechanism – FCFS, SJF, Priority Queue.

8. Reader – Writer Problem.

9. Diner’s Philosopher Problem.

10. First Fit, Worst Fit, Best Fit allocation strategy.

11. Bankers Algorithm

12. Implement the producer consumer problem using Semaphore

13. Implement memory management Scheme

SCS4302 RDBMS LAB L T P Credits Total Marks

0 0 4 2 100

1. Data Definition Language (DDL)

2. Data Manipulation Language (DML)

3. Data Control Language (DCL)

4. Constraints and built-in Functions

5. Joins and Group-by Commands

6. PL/SQL Program using functions

7. PL/SQL Program to create Triggers

8. Consider any application and design using.

a. Normalization

b. Data Flow Diagram

c. Entity-Relation Diagram

d. Data Dictionary

e. Table Structure



SCS4303 COMPILER LAB L T P Credits Total Marks

0 0 4 2 100


1. Implement Token Separation for a given expression using LEX.

2. Use LEX tool to implement Lexical Analyzer.

3. Use LEX and YACC to implement parser.

4. Use LEX and YACC tool to implement Desktop Calculator.

5. Construction of NFA from a regular expression.

6. Construction of DFA from a regular expression.

7. Implement Recursive Descent Parser algorithm.

8. Implement Shift Reduce Parser algorithm.

9. Implement the backend of the compiler to produce three address code.

10. Implement Symbol Table management

11. Construct a simple compiler

SCS4304 NETWORKING LAB L T P Credits Total Marks

0 0 4 2 100


1. Creation of Date Server, and also print the client’s address on the Server.

2. Creation of UDP Server

3. Creation of Chat Program

4. Calculation of Checksum for packet data and file.

5. Program to implement HTTP Protocol

6. Creation of Mail Client

7. Creation of Web Server

8. Creation of TELNET Protocol

9. Implement FTP using TCP

10. WiFi Simulation

11. WiTotal Simulation

12. Router Configuration



SCS4401 DISTRIBUTED COMPUTING LAB L T P Credits Total Marks

0 0 4 2 100


1. Create a web page using HTML frames, Tables, ordered and unordered list.

2. Develop client side form validation using Jquery.

3. Create following web control using Google Web Tool Kit

a. Checkbox

b. Radio Button

c. Basic Button

d. Hyperlink

4. Create program to retrieve the Customer information using JSON & PHP

5. Creating and consuming a web service using .NET Platform

6. Implementing Semantic Elements in HTML5

a. <article>

b. <figure>

c. <footer>

d. <header>

e. <nav>

7. Create a program to retrieve Customer informations using JSON & PHP

8. Perform BIOS troubleshooting for clearing I/O devices

9. Develop an application to fetch information from a database with AJAX

10. Implementing Semantic Elements in HTML5

Using <article>,<figure>,<footer>,<header> and <nav>



SIT4201 PROGRAMMING IN JAVA L T P Credits Total Marks

(Theory 50 + Practical 50) 2 0 4 4 100

COURSE OBJECTIVES

To learn Object Oriented Programming concept using Java.

To learn the essentials of the Java Class Library.

To develop event driven graphical user Interface programming using OOP methodology

The course covers both theoretical and practical aspects. Marks split-up for the subject is 50% Theory and 50%

Practical. Award of marks for Theory section is based on the Continuous Internal Assessments and for the Laboratory

section practical examination will be conducted as per the regular University norms.

The following topics are to be covered for effective coverage of the course objective:

Class Fundamentals, Method Overriding, Inheritance, Packages, Exception Handling, Multithreading, Wrapper

Classes, Input and Output Stream Classes, Byte and Character Stream Classes, Utility Packages, Applets, Swings,

Database Connectivity, Regular Expressions, Networking, Java Beans

OUTCOME

Develop Java programs on Object Oriented Programming

Concepts x Use GUI for developing customer friendly

applications

To connect Java with different Databases

Handling networking concepts using Java classes for

networking x Usage of utility classes

Max. 45 Hours


1. Herbert Schildt, “Java The Complete Reference”, 9th Edition, McGraw Hill Education, 2014

2. http://docs.oracle.com/javase/tutorial/

http://docs.oracle.com/javase/tutorial/



SIT4301 INTERNET PROGRAMMING LAB L T P Credits Total Marks

0 0 4 2 100


1. Develop a static page using any 10 basic HTML elements.[ Tags – Heading, Table, Marquee, Image,

Style elements, etc.,]

2. Develop static pages (using Only HTML) of an online Book store. The website should contain the

following pages.

a. Home page

b. Registration and user Login

c. User Profile Page

d. Books catalog

e. Shopping Cart

f. Payment By credit card

g. Order Conformation

3. Mapping image on client & server side

4. Add a Cascading Style sheet (All types) for designing the web page.

5. Validate the Registration, user login, user profile and payment by credit card pages using JavaScript.

6. Create and save an XML document at the server, which contains users information. Write a program,

which takes User Id as an input and returns the user details by taking the user information from the XML

document.

7. Extracting contents of the XML document using CSS,XSLT,DOM parser

8. Simple applications using XQuery

9. Using ActiveX Components in server side scripting.

10. Create dynamic pages with database and server side scripting for any application

11. Programs using AJAX

12. Programs using Maps

13. Creation of Distributed Application using RMI

14. Usage of Cookie

15. Session Tracking using Servlets/JSP

16. Accessing Database in a Servlet/JSP

17. Database to Swing to Servlet/JSP communication



SIT4302 CLOUD COMPUTING LAB L T P Credits Total Marks

0 0 4 2 100


1. Study on Basics of Cloud computer and its Resources

2. Study about Google Apps and Microsoft Azure

3. Building a simple cloud application using Google App Engine and Microsoft Azure

4. Hosting cloud application using Google App Engine and Microsoft Azure

5. Setup a Private Cloud Using OpenStack or Eucalyptus. Develop simple applications and make it available to the intended user.

6. Install and configure OpenStack Object Storage - Swift in Ubuntu. Consider a huge storage requirements and store it in the cloud in a transparent manner.

7. Install and configure OpenStack Nova-Compute. Enable a connected user to get a virtual machine of a selected performance such as CPU, Memory.

8. Implementation of Map Reduce Job processing for clients request.

9. Designing SOA Application from System Description.

10. Exploring and trouble shooting a public cloud.

11. Implementation of virtual machines, and be able to list some of their configuration options in relation to the host server

SIT4401 HUMAN COMPUTER INTERACTION LAB L T P Credits Total Marks

0 0 4 2 100


1. Design a drop-down list or a menu in a GUI keeping in view the serial position effect

2. Design of a Mobile Keypad focusing on size, layout and devilling( a minimum of two different layouts)

3. Design of different icons in Graphical user Interface ( a minimum of four different icons)

4. Design UI screens for the elderly people with unsteady hands keeping in view the mouse sensitivity

5. Design a menu structure for ordering house- hold items from a mall directly to your home through a

mobile phone interface. Categorize the items into menus and submenus. (make use of Hick’s Law)

6. Design a UI for ATM Interface

7. Design a prototype of a TV remote Control Panel

8. Design a UI prototype of an Automatic vending machine for Drinks

9. Design a Mobile Interface for a Mall Map

10. Design a Mobile Interface screens for railway enquiry system

11. Design a Web Interface for Online banking system

12. Design a Web Interface for a University website



SIT4402 MOBILE APPLICATION DEVELOPMENT LAB L T P Credits Total Marks

0 0 4 2 100


1. To implement mobile application life cycle methods.

2. To implement simple calculator application.

3. To implement simple SMS application.

4. To implement authentication verification application without and with database.

5. To implement navigation application with multiple pages / activities.

6. To implement student placement registration form with database.

7. To implement a simple notification application.

8. To implement simple intent with data passing application.

9. To implement simple profile changer application through SMS.

10. To create mobile web browser application.

11. To create mobile e-mail application to sent a mail.

12. Mini project.

Note:

Above applications have to be created and deployed in Android OS, iPhone OS, and Windows Phone OS.

Environment Required: Android SDK in Linux Enviornment, Windows Phone OS SDK and iMac OS with

Xcode and Objective C.



SCS1601 NATURAL LANGUAGE PROCESSING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the way to measure one or more qualities of an algorithm or a system

To gain knowledge of the linguistics concerned with the interactions between computers and human.


An outline of English syntax - Grammars and parsing - Features and Augmented Grammar.

UNIT 2 SYNTACTIC PROCESSING 9 Hrs.

Grammar for natural language - Toward efficient parsing - Ambiguity resolution - Statistical Methods

UNIT 3 SEMANTIC INTERPRETATION 9 Hrs.

Semantic and logical form - Linking syntax and semantics - Ambiguity resolution - Other strategies for semantic

interpretation - Scoping for interpretation of noun phrases.

UNIT 4 CONTEXT AND WORLD KNOWLEDGE 9 Hrs.

Knowledge representation and reasoning - Local discourse context and reference.

UNIT 5 WORLD KNOWLEDGE AND SPOKEN LANGUAGE 9 Hrs. Using world knowledge - Discourse structure - Defining conversational agent - An introduction to logic model -

Theoretic semantics - Symbolic computation - Speech recognition and spoken Language.

Max. 45 Hours


1. Wendy G. Lehnert, Martin. H. Ringle, “Strategies for NLP”, Lawrence Associates, 1982.

2. James Allen, “Natural Language Understanding”, 2nd Edition, Benjamin/Cummings Publishing Company Inc, 1995.

3. Vibhu O. Mittal, “Generating Natural language Descriptions with integrated Text and Examples”, Lawrence Associates,1999.



PART B : 2 questions from each unit with internal choice, each carrying 12 marks 80 Marks



SCS1602 DESIGN THINKING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE To familiarize the students with the fundamentals of designing, design methodologies, architectural design and

structural design.

UNIT 1 INTRODUCTION TO DESIGN 9 Hrs.

Design Process : Design - Research- Ideate - Prototype - Select - Implement - Learn, Notion of Architecture -

Notion of Software Architecture - Architectural Styles - Description of Software Architecture -Visual Notation -

Examples.

UNIT 2 DESIGN FUNDAMENTALS 9 Hrs. The Basic Concepts of Design - Characteristics of Design Activities - Essential Elements of Design - The

Factors that Affect the Design - Design Principles Basic Rules of Software Design - Design Processes

UNIT 3 DESIGN METHODOLOGIES 9 Hrs.

Structured Design - Design Practices - Stepwise Refinement - Incremental Design - Structured System Analysis

and Design - Jackson Structured Programming - Jackson System Development - Designing with Objects - User

Interface Design.

UNIT 4 ARCHITECTURAL DESIGN 9 Hrs.

Typical Architectural Design - Data Flow - Independent Components - Call and Return - Using Styles in Design -

Choices of Style - Combination of Styles - Architectural Design Space - Theory of Design Spaces - Design Space of

Architectural Elements - Design Space of Architectural Styles.

UNIT 5 IMPLEMENTATION, DEPLOYMENT AND MAINTENANCE 9 Hrs. Mapping Design (Models) to Code - Testing - Usability - Deployment - Configuration Management -

Maintenance, Case Study.

Max. 45 Hours


1. David Budgen, "Software Design", Second Edition, Pearson Education, 2004.

2. Hong Zhu, “Software Design Methodology From Principles to Architectural Styles”, Elsevier, 2005.

3. John Robinson, “Software Design for Engineers and Scientists”, Newnes, 2004.

4. A. G. Suteliffe, "Human Computer Interface Design", Second Edition Macmillan, 1995

5. Bernd Bruegge, Alan H Dutoit, “Object-Oriented Software Engineering”, 2nd ed,Pearson Education, 2004.

6. Alistair Cockburn, “Agile Software Development”, 2nd ed, Pearson Education, 2007.



PART A : 10 questions of 2 marks each- No choice 20 Marks PART B : 2 questions from each unit with internal choice, each carrying 12 marks 80 Marks



SCS1603 SOFTWARE PROJECT MANAGEMENT L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the concept of software project management, Evaluation and

planning.

To gain an insight on the monitoring and control framework.

To learn how to manage people and teams.

UNIT 1 INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 9 Hrs. Project Definition - Contract Management - Activities Covered By Software Project Management - Overview Of

Project Planning - Stepwise Project Planning.

UNIT 2 PROJECT EVALUATION 9 Hrs. Strategic Assessment - Technical Assessment - Cost Benefit Analysis -Cash Flow Forecasting - Cost Benefit

Evaluation Techniques - Risk Evaluation.

UNIT 3 ACTIVITY PLANNING 9 Hrs. Objectives - Project Schedule - Sequencing and Scheduling Activities -Network Planning Models - Forward Pass

- Backward Pass - Activity Float - Shortening Project Duration - Activity on Arrow Networks - Risk Management - Nature Of Risk - Types Of Risk - Managing Risk - Hazard Identification - Hazard Analysis - Risk Planning And Control.

UNIT 4 MONITORING AND CONTROL 9 Hrs. Creating Framework - Collecting The Data - Visualizing Progress - Cost Monitoring - Earned Value - Prioritizing

Monitoring - Getting Project Back To Target - Change Control - Managing Contracts - Introduction - Types Of Contract - Stages In Contract Placement - Typical Terms Of A Contract - Contract Management - Acceptance.

UNIT 5 MANAGING PEOPLE AND ORGANIZING TEAMS 9 Hrs. Introduction - Understanding Behavior - Organizational Behaviour: A Background - Selecting The Right Person

For The Job - Instruction In The Best Methods - Motivation - The Oldman - Hackman Job Characteristics Model - Working In Groups - Becoming A Team -Decision Making - Leadership - Organizational Structures - Stress - Health And Safety - Case Studies.

Max. 45 Hours


1. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition, Tata McGraw Hill, 2004.

2. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001.

3. Royce, “Software Project Management”, Pearson Education, 1999.

4. Jalote, “Software Project Management in Practice”, Pearson Education, 2002.






SCS1604 SOFTWARE ARCHITECTURE L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES An ability to understand basic concepts of software architecture and styles

To understand difference between software architecture and software design

To develop ability to understand design patterns and their application

To understand utilization of formal models to build software projects

To understand the use of various Architecture Description Languages and their applications

UNIT 1 SOFTWARE PROCESS AND THE ROLE OF MODELING AND ANALYSIS 9 Hrs.

Analysis modeling and best practices, process, process modeling; process notations - traditional best practice

diagrams such as DFDs and ERDs.

UNIT 2 ARCHITECTURAL MODELING 9 Hrs. UML diagrams, Structural static modeling, behavioural modeling - interactions - use cases - use case,

interaction & Activity diagrams. Component and deployment diagrams - analysis case studies, analysis patterns.

UNIT 3 SOFTWARE ARCHITECTURE DESIGN 9 Hrs.

Design best practices, Design patterns - Creational patterns - structural patterns - behavioural patterns,

Component technology, object oriented frameworks, distributed objects, interoperability standards, case studies.

UNIT 4 SOFTWARE ARCHITECTURE 9 Hrs.

Architectural styles, architectural patterns, patterns and software architecture, analysis of architectures, formal

descriptions of software architectures.

UNIT 5 ARCHITECTURAL DESCRIPTION LANGUAGES ADL AND TOOLS 9 Hrs. Requirements of Architecture - Description languages, Tools for Architectural design, scalability and

interoperability issues, Web application architectures, case studies.

Max. 45 Hours


1. Grady Booch, James Rumbaugh, Ivar Jacobson, “The Unified Modeling Language User Guide”, Addison Wesley, 1999

2. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides, “Design Patterns, Elements of reusable Object Oriented

Software”, Addison Wesley, 1995.

3. Frank Buschmann et al, “Pattern Oriented Software Architecture, Volume 1: A system of patterns”, John Wiley and Sons,

1996.

4. Len Bass, Paul Clements, Rick Kazman, “Software Architecture in Practice”, Second Edition, Addison Wesley, 1998.

5. Mary Shaw and David Garlan, “Software Architecture Perspectives on an emerging Discipline”, Prentice Hall, 1996.







SCS1605 DESIGN PATTERNS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand various design patterns.

To apply design patterns to software design.

To understand pattern oriented software architecture

UNIT 1 INTRODUCTION TO DESIGN PATTERN AND DESIGNING DOCUMENT EDITOR 9 Hrs. Introduction-Design Pattern-Smalltalk MVC- -Describing Design Patterns- The Catalog -Organizing the Catalog-

Pattern Solve Design Problems - Select a Design Pattern - Use Design Pattern - Design Problems- What makes a pattern? - Pattern Categories - Relationship between Patterns - Patterns and Software Architecture

UNIT 2 DESIGN PATTERNS USING PATTERN ORIENTED SOFTWARE ARCHITECTURE 9 Hrs. Whole Part - Master Slave -Command Processor - View Handler - Forward Receiver - Client Dispatcher Server-

Document structure- Formatting-User interface- Look and Feel Standards- Multiple Window Systems-User Operations-Spelling Checking And Hyphenation.

UNIT 3 CREATIONAL PATTERNS & STRUCTURAL PATTERNS 9 Hrs. Abstract Factory-Builder-Factory Method-Prototype-Singleton- Discussion of Creational Patterns Structural Patterns - Adapter-Bridge-Composite-Decorator-Facade-Flyweight-Proxy- Discussion of Structural

Patterns.

UNIT 4 BEHAVIORAL PATTERNS 9 Hrs. Chain of Responsibility-Command-Interpreter-Iterator-Mediator-Memento-Observer-Strategy-Template Method-Visitor-

Discussion of Behavioral Patterns

UNIT 5 BEHAVIORAL PATTERNS AND EXPECTATONS 9 Hrs. State - Conclusion - The Pattern Community-An Invitation-A Parting Thought.

Max. 45 Hours


1. Erich Gamma, Richard Helm, Ralph Johnson, John Vissides, “Design Patterns - Elements Reusable Object Oriented Software”,201 1,Edition:12.

2. Eric Freeman, Elisabeth Robson, Bert Bates, Kathy Sierra. “Head First Design Patterns”, 2004, O'Reilly Media.

3. Wolfgang Pree. “Design Patterns for Object Oriented Software Development”,1995, Addison Wesley Publishing.

4. Frank Bachmann, Regine Meunier, Hans Rohnert “Pattern Oriented Software Architecture” - Volume 1, 1996.

5. William J Brown et al., "Anti-Patterns: Refactoring Software, Architectures and Projects in Crisis", John Wiley, 1998.

6. John Vlissides, “Pattern Hatching: Design Patterns Applied”, 1998, Addison-Wesley Publishing

END SEMESTER EXAM QUESTION PAPER PATTERN Max Marks : 80 Exam Duration : 3 Hrs.





SCS1606 SOFTWARE QUALITY MANAGEMENT L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the software quality models.

To gain knowledge on the various quality and defect analysis tools.

To understand quality control and management.

A brief study of the various quality standards.

UNIT 1 INTRODUCTION TO SOFTWARE QUALITY 9 Hrs. Software Quality - Hierarchical models of Boehm and McCall - Quality measurement - Metrics measurement

and analysis - Gilb’s approach - GQM Model.

UNIT 2 SOFTWARE QUALITY ASSURANCE 9 Hrs.

Quality tasks - SQA plan - Teams - Characteristics - Implementation - Documentation - Reviews and Audits - Tools for

Quality - Statistical Quality Assurance.

UNIT 3 QUALITY CONTROL 9 Hrs.

Ishikawa’s basic tools - CASE tools - Defect prevention and removal -Defect Classes ,Defect Analysis.

UNIT 4 QUALITY MANAGEMENT SYSTEM 9 Hrs.

Elements of QMS - Rayleigh model framework - Reliability Growth models for QMS - Complexity metrics and

models - Customer satisfaction analysis.

UNIT 5 QUALITY STANDARDS 9 Hrs. Need for standards - ISO 9000 Series - ISO 9000-3 for software development - CMM and CMMI - Six Sigma

concepts.

Max. 45 Hours


1. Allan C. Gillies, “Software Quality: Theory and Management”, Thomson Learning, 2003. (UI : Ch 1-4 ; UV : Ch 7-8)

2. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, Pearson Education (Singapore) Pte Ltd., 2002

3. Norman E. Fenton and Shari Lawrence Pfleeger, “Software Metrics” Thomson, 2003.

4. Mordechai Ben - Menachem and Garry S.Marliss, “Software Quality”, Thomson Asia Pte Ltd, 2003.

5. Mary Beth Chrissis, Mike Konrad and Sandy Shrum, “CMMI”, Pearson Education (Singapore) Pte Ltd, 2003.

6. ISO 9000-3 “Notes for the application of the ISO 9001 Standard to software development”.w


Max Marks : 80 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each- No choice 20 Marks




SCS1607 UNIFIED MODELING LANGUAGE L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the need for modelling.

To design software projects using UML diagrams.

To understand the different OO Modelling techniques.

To understand the difference between design and architecture.

UNIT 1 INTRODUCTION 9 Hrs. Importance of modeling - Principles of modeling - Object-oriented modeling - Overview of UML - Conceptual

model of UML - Architecture - Software development life cycle - Basic structural modeling - Classes - Relationships and

common mechanisms.

UNIT 2 BASIC AND ADVANCED STRUCTURAL MODELING 9 Hrs. Terms and Concepts - Common modeling techniques for diagrams - Class diagram Advanced classes - Advanced

relationships - Interfaces - Types and roles.

UNIT 3 ADVANCED STRUCTURAL MODELING AND BASIC BEHAVIORAL MODELING 9 Hrs. Modeling techniques for packages - Instances - Object diagrams - Interactions - Use cases - Use case diagrams - Interaction diagrams - Activity diagrams.

UNIT 4 ADVANCED BEHAVIORAL MODELING 9 Hrs.

Terms and concepts - Common modeling techniques for events and signals - State machines - Processes and

threads - Time and space -State chart diagrams

UNIT 5 ARCHITECTURAL MODELING 9 Hrs. Terms and concepts - Common modeling techniques for components - Deployment -Collaborations - Patterns

and frameworks - Component diagrams - Deployment diagrams - Systems and models -Applying the UML

Max. 45 Hours


1. Grady Booch, James Rumbaugh and Ivar Jacobson, “The Unified Modeling Language User Guide”, Addison Wesley, 1999.

2. http://www.sparxsystems.com.au/uml_tutorial.html





http://www.sparxsystems.com.au/uml_tutorial.html



SCS1608 SOFTWARE QUALITY ASSURANCE AND TESTING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the software quality assurance framework.

To understand the software testing strategy and environment.

To familiarize with the various software testing techniques and tools

UNIT 1 SOFTWARE QUALITY STANDARD 9 Hrs.

Software Quality Assurance Framework and Standards SQA Framework: Quality,Software Quality Assurance,

Components of Software Quality Assurance -Software QualityAssurance Plan:Steps to develop and implement a

Software Quality Assurance Plan -Quality Standards:ISO 9000 and Companion ISO Standards, CMM, CMMI, PCMM,

Malcom Balridge, 3Sigma, 6 Sigma.

UNIT 2 QUALITY MEASUREMENT AND METRICS 9 Hrs. Software Quality Assurance Metrics and Measurement Software Quality Metrics: Product Quality metrics, In-

Process Quality Metrics, Metrics for Software Maintenance, Examples of Metric Programs

Software Quality metrics methodology: Establish quality requirements, Identify Software quality metrics,

Implement the software quality metrics, analyze software metrics results, validate the software quality metrics -

Software quality indicators - Fundamentals in Measurement theory.

UNIT 3 SOFTWARE TESTINGS TRATEGIES 9 Hrs. Software Testing Strategy and Environment: Establishing testing policy, structured approach to testing, test

factors, Economics of System Development Life Cycle (SDLC) Testing

Software Testing Methodology: Defects, verification and validation, functional and structural testing, workbench

concept, eight considerations in developing testing methodologies, testing tactics checklist

UNIT 4 SOFTWARE TESTING TECHNIQUES 9 Hrs.

Software Testing Techniques: Black- Box, Boundary value, Bottom -up, Branch coverage, Cause -Effect

graphing, CRUD, Database, Exception, Gray - Box, Histograms, Inspections, JADs, Pareto Analysis, Prototyping,

Random Testing, Risk - based Testing, Regression Testing, Structured Walkthroughs, Thread Testing, Performance

Testing, White - Box Testing

UNIT 5 SOFTWARE TESTING TOOLS 9 Hrs. Software Testing Tools Taxonomy of Testing tools, Methodology to evaluate automated testing tools, Load

Runner, Win runner and Rational Testing Tools, Silk test, Java Testing Tools, JMetra, JUNIT and Cactus.

Max. 45 Hours


1. Effective Methods for Software Testing, 2nd Edition, William E. Perry , Second Edition, Wiley India, 2006.

2. Software Quality, Mordechai Ben-Menachem/Garry S. Marliss, Thomson Learning Publication, 1997.






SCS1613 DISTRIBUTED DATABASE L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the advantage of distributed database

To know the design issues involved in distributed database.

To understand distributed concurrency control techniques.

UNIT 1 INTRODUCTION TO DISTRIBUTED DATABASE 9 Hrs.

Introduction of Distributed Databases-Features of Distributed Databases-Distributed databases versus

Centralized Databases- Principles-- Levels Of Distribution-Transparency-Reference Architecture- Types of Data

Fragmentation- Integrity Constraints in Distributed Databases- Architectural Issues- Alternative Client/Server

Architecture.

UNIT 2 QUERIES AND OPTIMAZATION 9 Hrs.

Global Queries to Fragment Queries- Equivalence Transformations for Queries- Distributed Grouping and

Aggregate Function Evaluation- Parametric Queries- Optimization of Access Strategies- Framework for Query

Optimization- Join Queries- General Queries- Introduction to Distributed Transactions.

UNIT 3 MANAGEMENT OF DISTRIBUTED TRANSACTIONS 9 Hrs. Management of Distributed Transactions- Framework for Transaction Management-Supporting Atomicity of

Distributed Transactions- Concurrency Control for Distributed Transactions- Architectural Aspects of Distributed

Transactions-Concurrency Control- Foundation of Distributed Concurrency Control- Distributed Deadlocks-Concurrency

Control based on Timestamps- Optimistic Methods for Distributed Concurrency Control.

UNIT 4 RELIABILTY AND PROTECTION 9 Hrs.

Reliability- Basic Concepts- Reliability and concurrency Control- Determining a Consistent View of the Network-

Detection and Resolution of Inconsistency- Checkpoints and Cold Restart- Distributed Database Administration-

Catalog Management in Distributed Databases-Authorization and Protection

UNIT 5 DATABASE INTEGRATION AND MANAGEMENT 9 Hrs. Database Integration- Scheme Translation- Scheme Integration- Query Processing Query Processing Layers in

Distributed Multi-DBMSs- Query Optimization Issues- Transaction Management Transaction and Computation Model-

Multidatabase Concurrency Control- Multidatabase Recovery- Object Orientation And Interoperability- Object

Management Architecture - Distributed Component Model.

Max. 45 Hours


1. Distributed Database Principles & Systems, Stefano Ceri, Giuseppe Pelagatti, McGraw-Hill

2. Principles of Distributed Database Systems, M. Tamer Ozsu, Patrick Valduriez - Pearson Education.






SCS1614 ADVANCED DATABASE TECHNOLOGIES L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To initiate and develop the knowledge and skills required to develop business software Applications.

Hands-on experience with the Oracle family of databases, and define, design, and implement databases.

Students learn how to use object-oriented technologies to design relational databases, and how to design relational databases to support object-oriented applications.

UNIT 1 INTRODUCTION 9 Hrs. Data base system Architecture - Query Optimization Techniques - Transaction Management: Transaction

Processing Concepts - Concurrency Control - Recovery Techniques -Database Security.

UNIT 2 PARALLEL DBMS 9 Hrs. Architecture- Query evaluation - Query optimization - parallelizing Individual operations. Distributed DBMS:

Architecture - storing data - Cataloguing - Query processing -Transactions Concurrency and Recovery.

UNIT 3 DATABASE CONCEPTS 8 Hrs. Active Database Concepts and Triggers -Temporal Databases - Spatial Databases - Deductive Databases -

XML Databases: XML Data Model - Geographic Information Systems - Genome Data Management.

UNIT 4 OBJECT & MULTIMEDIA DATABASE SYSTEMS 9 Hrs. Object Databases - Advantages and disadvantages compared to Relational Databases - Abstract data types,

Objects identity and reference types-Inheritance Database design for ORDBMS ODMG data model and ODL OQL. MULTIMEDIA DATABASES: Nature of Multimedia data and applications Data management issues - Components of Multimedia database management system.

UNIT 5 BIG DATA & HADOOP 10 Hrs. Big Data - Introduction - Technologies - Reference Architecture - Hadoop - Introduction Hadoop Distributed File

System - Design of HDFS - HDFS Concepts - Interfaces for Hadoop File System - Map Reduce - A weather Data set - Analyzing the data with Hadoop -Anatomy of MapReduce Job Run.

Max. 45 Hours


1. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”, 3rd Edition McGraw Hill Publications.

2. Korth . H.Fand A.Silberschatz, “Database system concepts”, 3rd Ed ition, McGraw Hill Publications.

3. Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, V Ed., AddisonWesley, 2008.

4. Stenfno Ceri and Gieusppe pelagatti, “ Distributed database- principles and systems”,Third Edition

5. O’Reilly, “ Hadoop - The Definitive Guide “,O'Reilly Media

6. B.Prabakaran, “Multimedia Database Management Systems”, Kluwer Academic Publishers.

7. http://www.oracle.com/technetwork/topics/entarch/articles/info-mgmt-big-data-ref-arch-1 902853.pdf



PART B : 2 Questions from each unit with internal choice, each carrying 12 marks 80 Marks

http://www.oracle.com/technetwork/topics/entarch/articles/info-mgmt-big-data-ref-arch-1



SCS1615 ADVANCED COMPUTER NETWORKS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES Understand the fundamentals of next generation computer networks

Understand the principles of network security

Understand the issues of wireless networking, current standards, and new application areas

UNIT 1 INTRODUCTION 9 Hrs. Communicating in the New Era- IP Everywhere- Optical Anywhere- Wireless through the Air- Building Blocks for

Next-Generation Networks- IP Networks- Multiservice Networks- VPNs- Optical, Wire line & Wireless Networks-Using Next-Generation Network Services- Network Infrastructure Convergence- Services Convergence- IP Networks

UNIT 2 LAYER 2 AND LAYER 3 VPN 9 Hrs. Layer 2 Internetworking, VPN Service, Provisioning-Benefits of L2VPN,Inter-AS L2VPN,Supported IETF

Standards-Technology Overview-Intranet Corporate-Internet Access-Scaling MPLS VPNs to Multi-AS, Multi-Provider, and Hierarchical Networks-Heterogeneous Networks-Managed Central Services

UNIT 3 WIRE LINE & WIRELESS NETWORKS 9 Hrs. Narrowband-Squeezing Voice and Data-Residential Loop for Analog Transmission-Going Digital with PCM and

TDM-Narrowband Aggregation for DS1 and E1-ISDN-Frame Relay-Narrowband Aggregation Layer and Digital Loop Carriers-Broadband-Pushing Technology to the Edge-DSL-DSLAM Broadband Aggregation Layer-Wireless Optics-Fixed Wireless-Satellite Wireless.

UNIT 4 MULTISERVICE NETWORKS 9 Hrs. Global IP Networks-Global Capacity-Globally Resilient IP- Beyond IP- Multiservice Networks-The Origins of Multiservice ATM-Next-Generation Multiservice Networks-Next-Generation Multiservice ATM Switching-Multiprotocol Label Switching Networks Multiservice Core and Edge Switching -Frame-Based & cell based MPLS -MPLS Benefits and Services -Next-Generation Multiservice Routers- -MSSP- Multiservice Transport Platform (MSTP)- MPLS Security

UNIT 5 NETWORK SECURITY 9 Hrs. Network security at various layers. Secure-HTTP, SSL, ESP, Authentication header, Key distribution protocols.

Digital signatures, digital certificates

Max. 45 Hours

TEXT./ REFERENCE BOOKS

1. Azhar Sayeed, Monique Morrow “MPLS and Next-Generation Networks: Foundations for NGN and Enterprise Virtualization”

Cisco Press, Paperback, and Published November 2006, 300 pages.

2. Jyh-Cheng Chen, Tao Zhang “MPLS and IP-Based Next-Generation Wireless Networks: Systems, Architectures, and

Protocols” Hardcover. Year of Publication: 2003

3. Robert Wood “Next-Generation Network Services”, Cisco Press, Year of Publication, Nov 2005

4. W. Stallings.”Cryptography and Network Security: Principles and Practice”, 2nd Edition, Prentice Hall, 1998.






SCS1616 SOFT COMPUTING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE To understand the principle components like fuzzy logic, neural networks and genetic algorithm

UNIT 1 NEURAL NETWORKS 9 HRS.

Introduction to ANS - Adaline - Back propagation network - Hopfield network - Boltzman machine - Self

organizing maps.

UNIT 2 FUZZY LOGIC 9 Hrs.

Fuzzy sets - Fuzzy rules and fuzzy reasoning - Fuzzy inference system - Mamdani fuzzy model - Sugenofuzzy

model - Tsukamoto fuzzy model.

UNIT 3 NEURO FUZZY 9 Hrs.

Adaptive Neuro Fuzzy Inference System - Coactive neuro-fuzzy modelling - Classification and regression trees -

Data Clustering Algorithm - Rule based structure - Neuro - Fuzzy control I - Neuro -Fuzzy control II - Fuzzy decision

making. .

UNIT 4 GENETIC ALGORITHM 9 Hrs. Introduction - Implementation of GA - Reproduction - Crossover - Mutation - Coding - Fitness scaling -

Application of GA.

UNIT 5 ARTIFICIAL INTELLIGENCE 9 Hrs. Introduction - Searching techniques - First order Logic - Forward reasoning - Backward reasoning - Semantic -

Frames.

Max. 45 Hours


1. James A. Freeman, David M. Skapura, “Neural Networks, Algorithms, Applications and Programming Techniques”, Pearson

Education,1991.

2. George. J. Klir, Bo Yuan, “Fuzzy Sets and Fuzzy Logic - Theory and Application”, 1995.

3. J.S.R. Jang, C.T. Sun, E-Mizutani, “Neuro - Fuzzy and Soft Computing”, Prentice Hall of India, 1997.

4. David E. Goldberg, “Genetic Algorithms - In Search, Optimization and Machine Learning”, Pearson Education, 2005.

5. Stuart J. Russel, Peter Norvig, “Artificial Intelligence A Modern Approach”, 2nd Edition, Pearson Education, 2003.





SCS1617 WIRELESS SENSOR NETWORKS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the challenges of developing operating systems, wireless networking

Students will learn to design and implement a wireless sensor network system using motes (small devices that integrate a microcontroller and an 802.15.4 radio) or mobile phones

UNIT 1 OVERVIEW OF WIRELESS SENSOR NETWORKS 9 Hrs.

Challenges for Wireless Sensor Networks, Enabling Technologies for Wireless Sensor Networks - Examples of

available sensor nodes - Sample sensor networks applications - Design challenges.

UNIT 2 ARCHITECTURES 9 Hrs.

Single-Node Architecture - Hardware Components, Energy Consumption of Sensor Nodes, Operating Systems

and Execution Environments, Network Architecture - Contemporary network architectures - Operational and

computational models - Performance metrics.

UNIT 3 NETWORKING SENSORS 9 Hrs.

Physical Layer and Transceiver Design Considerations, MAC Protocols for Wireless Sensor Networks, Low Duty

Cycle Protocols And Wakeup Concepts - S-MAC , The Mediation Device Protocol, Wakeup Radio Concepts, Address

and Name Management, Assignment of MAC Addresses, Routing Protocols- Energy-Efficient Routing, Geographic

Routing.

UNIT 4 INFRASTRUCTURE ESTABLISHMENT & NETWORK BOOTSTRAPING 9 Hrs.

Sensor deployment mechanisms - Issues of coverage - Node discovery protocols - Localization schemes -

Network clustering.

UNIT 5 DEPENDABILITY ISSUES 9 Hrs. Security Challenges - Threat and attack models - Quality of service provisioning - Clock synchronization -

Supporting fault tolerant operation.

MAX.45 Hours


1. Holger Karl & Andreas Willig, "Protocols And Architectures for Wireless Sensor Networks”, John Wiley, 2005.

2. Feng Zhao & Leonidas J. Guibas, “Wireless Sensor Networks - An Information Processing Approach”, Elsevier, 2007.

3. Cauligi S. Raghavendra, Krishna Sivalingam,Taieb M. Znati, “Wireless Sensor Networks”, Springer 2005.

4. Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks- Technology, Protocols, And Applications”, John

Wiley, 2007.

5. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003.


PART A : 10 questions of 2 marks each- No choice 20 Marks PART B : 2 Questions from each unit with internal choice, each carrying 12 marks 80 Marks



S I T 1 6 0 1 UNIX INTERNALS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To introduce the architecture of the Unix Operating System.

To study system boot and the Init process.

To study IPC mechanisms

UNIT 1 SYSTEM ARCHITECTURE AND ADMINISTRATION 9 Hrs.

General review of the system - History - System structure - User perspective - Operating system services - Assumptions about hardware - Introduction to the kernel - Architecture system concepts - Data structures - System administration.

UNIT 2 BUFFER CACHE AND DISK BLOCKS 9 Hrs.

The buffer cache - Headers - Buffer pool - Buffer retrieval - Reading and writing disk blocks - Advantages and disadvantages - Internal representation of files - Inodes - Structure - Directories - Path name to Inode - Super block - Inode assignment - Allocation of disk blocks - Other file types.

UNIT 3 FILE SYSTEMS 9 Hrs.

System calls for the file system - Open - Read - Write - Lseek - Close - Create - Special files creation - Change drectory and change root - Change owner and change mode - Stat - Fstat - Pipes - Dup - Mount - Unmount - Link - Unlink - File system abstraction - Maintenance.

UNIT 4 PROCESS CONTROL 9 Hrs.

The system representation of processes - States - Transitions - System memory - Context of a process - Saving the context - Manipulation of a process address space - Sleep process control - signals - Process termination - Awaiting - Invoking other programs - The Shell - system Boot and the INIT process.

UNIT 5 MEMORY MANAGEMENT 9 Hrs. Memory management policies - Swapping - Demand paging - A Hybrid System - I/O subsystem - Driver interfaces - Disk drivers - Terminal drivers.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Maurice J. Bach, "The Design of the Unix Operating System", Pearson Education, 2002.

2. Uresh Vahalia, "UNIX Internals: The New Frontiers", Prentice Hall of India, 2000.

3. John Lion, "Lion’s Commentary on UNIX", 6th edition, Peer-to-Peer Communications, 2004.

4. Daniel P. Bovet & Marco Cesati, “Understanding the Linux Kernel”, O’REILLY, Shroff Publishers &Distributors Pvt. Ltd, 2000.

5. M. Beck et al, “Linux Kernel Programming”, Pearson Education Asia, 2002


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each - No choice - 20 Marks




S I T 1 6 0 2 ENTERPRISE APPLICATION DEVELOPMENT L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

How to integrate knowledge from different business functions to create a business plan

The process for developing large scale enterprise applications

How to hone their critical thinking and presentation skills by developing the business plan and presen ting their work to a professional audience

UNIT 1 XML 9 Hrs. XML - Document Type Definition - XML Schema - Document Object Model - XML Presentation: XSLT and CSS - XML Parsers: DOM and SAX.

UNIT 2 AJAX 9 Hrs. Javascript Fundamentals - Evolution of AJAX - AJAX framework - Web applications using AJAX - AJAX with JSP, PHP, ASP.NET and Database.

UNIT 3 ENTERPRISE JAVA BEANS 9 Hrs.

Overview of EJB - EJB Middleware Architecture - EJB Architecture - EJB Containers and its services - Design of EJB Tier - Session java Beans - Stateless and Stateful Beans, Entity Beans and Persistence - Container Vs Bean Managed Persistence, Message Driven Bean - Relationships, EJB Container Services.

UNIT 4 MODEL VIEW CONTROLLER FRAMEWORK 9 Hrs.

Java Server Faces: Features - Components - Tags. Struts: Overview of MVC architecture - Working Principle of Struts - Building Model Components - View Components - Controller Components - Forms with Struts - Presentation Tags

UNIT 5 OBJECTION / RELATIONAL MAPPING 9 Hrs.

Hibernate: ORM - Mapping Persistent Classes - Working with Persistent Objects - Concurrency - Transactions - Caching - Retrieval of Objects - Queries.Spring Framework: Architecture - Controllers - Containers - Spring JDBC Management

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Uttam Kumar Roy, “Web Technologies”, Oxford University Press, 2010.

2. Debu Panda, Reza Rahman, Ryan Cuprak, and Michael Remijan, “EJB 3 in Action”, 2nd Edition, Manning Publications Co, 2014.

3. Donald Brown Chad Michael Davis Scott Stanlick, “Struts 2 in Action”, DreamTech Press, 2008.

4. Paul Tepper Fisher, Brian D. Murphy, “Spring Persistence with Hibernate”, APress, 2010.

5. Joe Fawcett, Danny Ayers, Liam R. E. Quin, “Beginning XML”, 5th Edition, Wrox Publications, 2012.

6. www.w3schools.com.

7. www.tutorialspoint.com.




http://asp.net/

http://www.w3schools.com/

http://www.tutorialspoint.com/



S I T 1 6 0 3 PERVASIVE COMPUTING L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

To provide the student with knowledge and skills about a new trend in computing.

Creating a ubiquitous environment that combines processors, RFID’s & sensors with network technologies.

To make the students learn about intelligent software to create a congenial environment.


Pervasive Computing - Principles, Characteristics - interaction transparency, context aware, automated experience capture. Architecture for pervasive computing - Pervasive devices - embedded controls.- smart sensors and actuators - Context communication and access services

UNIT 2 PROTOCOLS 9 Hrs.

Open protocols - Service discovery technologies - SDP, Jini, SLP, UpnP protocols - datasynchronization - SyncML framework - Context aware mobile services - Context aware sensor networks, addressing and communications - Context aware security.

UNIT 3 TECHNOLOGIES 9 Hrs. Past, Present and Future - Device Technology - Device Connectivity - Web application Concepts - WAP and Beyond - Voice Technologies - Personal Digital Assistants.

UNIT 4 ARCHITECTURE 9 Hrs. Server side programming in Java - Pervasive Web application Architecture - Example Application - Access via PCs - Access via WAP - Access via PDA and Voice.

UNIT 5 EXAMPLES 9 Hrs.

Smart Tokens, Heating Ventilation and Air Conditioning, Set Top Boxes, Appliances and Home Networking, Residential Gateway, Automotive Computing, On Board Computing Systems, In Vehicle networks, Entertainment Systems.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Seng Loke, Context-Aware Computing Pervasive Systems, Auerbach Pub., New York, 2007.

2. Uwe Hansmann etl, Pervasive Computing, Springer, New York,2001.

3. Jochen Burkhardt,, Stefan Hepper, Klaus Rindtorff, Thomas Schaeck ”Pervasive Computing - Technology and Architecture of Mobile Internet Application”, Pearson Education, Sixth Edition 2009.






S I T 1 6 0 4 VIRTUALIZATION TECHNIQUES L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

OS-level and language-level virtual machines.

Virtual networking, Virtual machine mobility, Virtualization for cloud and grid computing, Virtualization for distributed system security.

Virtualization for autonomic service provisioning and power management.

UNIT 1 OVERVIEW OF VIRTUALIZATION 8 Hrs.

Basics of Virtualization - Virtualization Types - Desktop Virtualization - Network Virtualization - Server and Machine Virtualization - Storage Virtualization - System-level or Operating Virtualization - Application Virtualization - Virtualization Advantages - Virtual Machine Basics - Taxonomy of Virtual machines - Process Virtual Machines - System Virtual Machines - Hypervisor - Key Concepts

UNIT 2 SERVER CONSOLIDATION 8 Hrs.

Hardware Virtualization - Virtual Hardware Overview - Sever Virtualization - Physical and Logical Partitioning - Types of Server Virtualization - Business cases for Sever Virtualization - Uses of Virtual server Consolidation - Planning for Development - Selecting server Virtualization Platform

UNIT 3 NETWORK VIRTUALIZATION 10 Hrs.

Design of Scalable Enterprise Networks - Virtualizing the Campus WAN Design - WAN Architecture - WAN Virtualization - Virtual Enterprise Transport Virtualization - VLANs and Scalability - Theory Network Device Virtualization Layer 2 - VLANs Layer 3 VRFInstances Layer 2 - VFIs Virtual Firewall Contexts Network Device Virtualization - Data - Path Virtualization Layer 2: 802.1q - Trunking Generic Routing Encapsulation - IPsec L2TPv3 Label Switched Paths - Control - Plane Virtualization - Routing Protocols - VRF - Aware Routing Multi-Topology Routing.

UNIT 4 VIRTUALIZING STORAGE 10 Hrs.

SCSI - Speaking SCSI - Using SCSI buses - Fiber Channel - Fiber Channel Cables - Fiber Channel Hardware Devices - iSCSI Architecture - Securing iSCSI - SAN backup and recovery techniques - RAID - SNIA Shared Storage Model - Classical Storage Model - SNIA Shared Storage Model - Host based Architecture - Storage based architecture - Network based Architecture - Fault tolerance to SAN - Performing Backups - Virtual tape libraries.

UNIT 5 VIRTUAL MACHINES PRODUCTS 9 Hrs. Xen Virtual machine monitors - Xen API - VMware - VMware products - Vmware Features - Microsoft Virtual Server - Features of Microsoft Virtual Server.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. William von Hagen, Professional Xen Virtualization, Wrox Publications, January, 2008.

2. Chris Wolf, Erick M. Halter, Virtualization: From the Desktop to the Enterprise, APress 2005

3. Kumar Reddy, Victor Moreno, Network virtualization, Cisco Press, July, 2006.

4. James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes, Elsevier/Morgan Kaufmann, 2005.

5. David Marshall, Wade A. Reynolds, Advanced Server Virtualization: VMware and Microsoft Platform in the Virtual Data Center, Auerbach Publications, 2006.



PART A: 10 questions of 2 marks each - No choice - 20 Marks




S I T 1 6 0 5 .NET PROGRAMMING L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

Understand controls in windows applications and delegates, Events Generics

Understand data access with .Net.

Understand web services.


Overview of .NET - Advantages of .NET over the other languages - Overview of .NET binaries - Intermediate Language - Metadata - .NET Namespaces - Common language runtime - Common type system - Common language specification - C# fundamentals - C# class - object - string formatting - Types - scope - Constants - C# iteration - Control flow - Operators - Array - String - Enumerations - Structures - Custom namespaces

UNIT 2 ASSEMBLIES 9 Hrs.

Assemblies - Versioning - Attributes - Reflection - Viewing metadata - Type discovery - Reflecting on a type-Marshaling - Remoting - Understanding server object types - Specifying a server with an interface - Building a server - Building the client - Exception handling - Garbage collector.

UNIT 3 INTERFACE AND COLLECTIONS 9 Hrs.

Object oriented programming concepts - Class - Encapsulation - Inheritance - Polymorphic - Casting .Interfaces and collections - Enumerator - Clonable objects - Comparable objects - Collections - Indexes - Delegates - Events - Multithreaded programming.

UNIT 4 WINDOWS FORM CONTROLS AND IO NAME SPACE 9 Hrs.

Programming with windows form controls - Windows form control Hierarchy - Adding controls - Text Box - Check Boxes - Radio Buttons - Group Boxes - List Boxes - Combo Boxes - Track Bar - Calender - Spin Control - Panel - ToolTips - Error Provider - Dialog Boxes. Input and output - Introduction to System. IO.namespace - File and folder operations - Stream class.

UNIT 5 ADO.NET AND ASP .NET 9 Hrs.

Introduction to ADO .NET - Building data table - Data view - Data set - Data relations - ADO.NET managed Providers - OleDb managed provider - SQL. Web development and ASP.NET - Web applications and web servers - HTML form development - Client side scripting - GET and POST - ASP.NET application - ASP.NET namespaces - creating sample C# web Applications. Understanding Web Security - Windows authentication - Forms authentication - Web services - Web services - Web service clients - The City View application.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Andrew Troelsen, “C# and the .NET Platform”, A! Press, 2005.

2. Herbert Schildt, “The Complete Reference: C#”, Tata McGraw-Hill, 2004.

3. http://www.C.sharpcorner.com/tutorial.asp.

4. http://www.programmingtutorials.com /csharp.aspxal.as




http://ado.net/

http://ado.net/

http://asp.net/

http://asp.net/

http://asp.net/

http://www.c.sharpcorner.com/tutorial.asp.

http://www.programmingtutorials.com/

http://csharp.aspxal.as/



S I T 1 6 0 6 BIG DATA L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

To understand the dominant software systems and algorithms for coping with Big Data.

Apply appropriate analytic techniques and tools to analyze big data, create statistical models, and identify insights that can lead to actionable results

To explore the ethical implications of big data research, and particularly as they relate to the web

UNIT 1 INTRODUCTION 9 Hrs. Introduction to Big Data - Challenges of Conventional Systems - Nature of Data - Small data - Medium data - Big

Data - Small data vs Big data - Sources of Big Data - Big Data Characteristics - Big Data Analytics - Importance of Big Data, Big Data in the Enterprise - Big Data Enterprise Model - Building a Big Data Platform - Big data in Social and Behavioral sciences.

UNIT 2 HDFS, HADOOP AND HADOOP INFRASTRUCTURE 9 Hrs. Hadoop and Databases - Typical Datacenter Architecture - Adding Hadoop to the Mix - Key Benefit -· Flexibility:

Complex Data Processing - HDFS - Hadoop Infrastructure - Architecture - Different in Data Model and Computing Model - HDFS Files and Blocks, Components of HDFS - Hadoop framework - HDFS - Map Reduce Framework - Data Loading techniques - Hadoop Cluster Architecture - Hadoop Configuration files - Hadoop Cluster modes - Single Node - Multi Node - Fully distributed node.

UNIT 3 HADOOP MAP REDUCE FRAMEWORK 9 Hrs. Relationship between MapReduce and HDFS - Relationship between MapReduce and HDFS - Clients, Data Nodes, and HDFS Storage - MapReduce workloads.

Hadoop framework - Hadoop data types - Hadoop map reduce Paradigm - Map and Reduce Tasks - Map reduce Execution framework - Partitioners and Combiners - Input formats (Input Splits and Records, Text Input, Binary Input, Multiple Inputs)- Output Formats (TextOutput, BinaryOutPut, Multiple Output)- Hadoop Mapreduce programming - Advanced Map reduce concepts - Counters, Custom Writables - Unit testing framework - Error Handling - Tuning - Advanced Map reduce.

UNIT 4 HADOOP IMPLEMENTATION AND HADOOP ECO SYSTEM TOOLS 9 Hrs. Hadoop Implementation - · Job Execution - · Hadoop Data Types - · Job Configurations - · Input and Output Formats

ECO system tools - Pig's Data Model, Pig Latin, Developing & Testing Pig Latin Scripts - Writing Evaluation, Filter, Load & Store Functions - Hive - Hive Architecture - Comparison with Traditional Database - HiveQL: Data Types, Operators and Functions - Hive Tables - Querying Data - Advance Hive, NoSQL Databases - HBase - Loading Data in Hbase - Querying Data in Hbase

UNIT 5 HADOOP PROJECT ENVIRONMENT 9 Hrs. HBase: Introduction to HBase, Client API's and their features, Available Client, HBase Architecture, MapReduc e

Integration. HBase: Advanced Usage, Schema Design, Advance Indexing, Coprocessors, Hadoop 2.0 -MRv2 - YARN - NameNode High Availability, HDFS Federation, MRv2, YARN, Running MRv1 in YARN, Upgrade your existing MRv1 code to MRv2, Programming in YARN framework-cover Apache Oozie Workflow Scheduler for Hadoop

Max. 45 Hours

TEXT / REFERENCES BOOKS

1. WA Gmob, “Big Data and Hadoop”, Kindle Edition, 2013 2. Eric Miller, “A Overview of Map Reduce and its impact on Distributed Data”, Kindle Edition, 2012.

3. Strata, “ Big Data Now”, O’Reily Media Inc., Kindle Edition, 2012.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration: 3 Hrs. PART A: 10 questions of 2 marks each - No choice 20 Marks PART B : 2 Questions from each unit with internal choice, each carrying 12 marks 80 Marks



S I T 1 6 0 7 HIGH SPEED NETWORKS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

Students will be provided with an up-to-date survey of developments in High Speed Networks.

Enable the students to know techniques involved to support real-time traffic and congestion control.

Students will be provided with different levels of quality of service (Q.S) to different applications.

UNIT 1 HIGH SPEED NETWORKS 9 Hrs.

Frame Relay Networks - Asynchronous transfer mode - ATM Protocol Architecture, ATM logical Connection, ATM Cell - ATM Service Categories - AAL.. High Speed LAN’s: Fast Ethernet, Gigabit Ethernet, Fibre Channel - Wireless LAN’s: applications, requirements - Architecture of 802.11

UNIT 2 CONGESTION AND TRAFFIC MANAGEMENT 9 Hrs. Queuing Analysis - Queuing Models - Single Server Queues - Effects of Congestion - Congestion Control - Traffic

Management - Congestion Control in Packet Switching Networks - Frame Relay Congestion Control.

UNIT 3 TCP AND ATM CONGESTION CONTROL 9 Hrs.

TCP Flow control - TCP Congestion Control - Retransmission - Timer Management - Exponential RTO backoff - KARN’s Algorithm - Window management - Performance of TCP over ATM.Traffic and Congestion control in ATM - Requirements - Attributes - Traffic Management Frame work, Traffic Control - ABR traffic Management - ABR rate control, RM cell formats, ABR Capacity allocations - GFR traffic management.

UNIT 4 INTEGRATED AND DIFFERENTIATED SERVICES 9 Hrs. Integrated Services Architecture - Approach, Components, Services - Queuing Discipline, FQ, PS, BRFQ, GPS, WFQ - Random Early Detection, Differentiated Services.

UNIT 5 PROTOCOLS FOR QOS SUPPORT 9 Hrs. RSVP - Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms - Multiprotocol Label Switching -

Operations, Label Stacking, Protocol details - RTP - Protocol Architecture, Data Transfer Protocol, RTCP.

Max.45 Hours

TEXT / REFERENCE BOOKS 1. William Stallings, “High Speed Networks And Internet”, Pearson Education, Second Edition, 2002. [Chapter - 4-6, 8, 10, 12, 13,

17,18]

2. Warland & Pravin Varaiya, “High Performance Communication Networks”, Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.

3. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco Press, Volume 1 and 2, 2003


Max. Marks : 100 Exam Duration: 3 Hrs. PART A : 10 questions of 2 marks each - No choice - 20 Marks




S I T 1 6 0 8 GREEN COMPUTING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES

To study about existing green computing strategies

Fundamental challenges in achieving green operations of computing units

Assess enterprise-wide and personal computing and computing related energy consumption.

UNIT 1 GREEN COMPUTING FUNDAMENTALS 9 Hrs.

Green IT fundamentals: Business, IT, and the environment - Green computing: Carbon foot print - scoop on power - Green IT strategies: Drivers, Dimensions, and Goals - Environmentally responsible business: Policies, Practices and Metrics.

UNIT 2 GREEN ASSETS AND MODELING 9 Hrs.

Green Assets: Buildings, data centers, networks and devices - Green business process management: Modeling, optimization and collaboration - Green enterprise architecture - Environmental intelligence - Green supply chains - Green information systems: Design and development models.

UNIT 3 GRID FRAMEWORK 9 Hrs. Virtualizing of IT systems - Role of electric utilities, telecommuting, teleconferencing and teleporting - Materials recycling - Best ways for green PC - Green data center - Green grid framework

UNIT 4 GREEN COMPLIANCE 9 Hrs.

Socio-cultural aspects of green IT - Green enterprise transformation roadmap - Green Compliance: protocols, standards and audits - Emergent carbon issues: technologies and future. The Way Climate Savers Computing Initiative Do - The Climate Savers Computing Initiative - What Green Computing Impact Organization Supplies - Green Computers Initiatives - Green Computing Impact Organization Overview - Green Electronics Council - Going Green Can Be Truly Challenging - The Green Grid Framework - The CSCI Top Secrets Revealed - The EPEAT Standards - To Have a Green Computer - Green Computing Means to Save Your Money and Your Business - Finances - Green Computing Initiative Platforms.

UNIT 5 CASE STUDIES 9 Hrs. The Environmentally Responsible Business Strategies (ERBS) - Case study scenarios for trial runs - Case studies - Applying green IT strategies and applications to a home, hospital, packaging industry and telecom sector.

Max.45 Hours

TEXT / REFERENCE BOOKS 1. Bhuvan Unhelkar, “Green IT Strategies and Applications - Using Environmental Intelligence”, CRC Press, June 2011.

2. Woody Leonhard, Katherrine Murray, “Green Home computing for dummies”, August 2009.Warland & Pravin Varaiya, “High

Performance Communication Networks”, Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.

3. Jason Harris, “Green Computing and Green IT - Best Practices onregulations & industry”, Lulu.com, 2008.

4. Alin Gales, Michael Schaefer, Mike Ebbers, “Green Data Center:steps for the Journey”, Shoff/IBM rebook, 2011.

5. John Lamb, “The Greening of IT”, Pearson Education, 2009.


Max Marks : 80 Exam Duration: 3 Hrs. PART A : 10 questions of 2 marks each - No choice - 20 Marks


http://lulu.com/



S I T 1 6 0 9 GAME PROGRAMMING L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

To provide introductions to event driven programming, game engine scripting, game engine class structures.

Learning to plan and to report on a significant programming project.

Learn to work in programming in teams, and learn to use standard game development environments, in particular the Unity3d development platform.

UNIT 1 3D GRAPHICS FOR GAME PROGRAMMING 9 Hrs.

Cordinate Systems, Ray Tracing, Modeling in Game Production, Vertex Procesing, Rasterization, Fragment Procesing and Output Merging, Ilumination and Shaders, Parametric Curves and Surfaces, Shader Models, Image Texturing, Bump Maping, Advanced Texturing, Character Animation, Physics -based Simulation

UNIT 2 GAME DESIGN PRINCIPLES 9 Hrs. Character development, Story Teling, Naration, Game Balancing, Core mechanics, Principles of level design, Genres of Games, Colision Detection, Game Logic, Game AI, Path Finding.

UNIT 3 GAMING ENGINE DESIGN 9 Hrs. Renderers, Software Rendering, Hardware Rendering, and Controler based animation, Spatial Sorting, Level of detail, colision detection, standard objects, and physics

UNIT 4 GAMING PLATFORMS AND FRAMEWORKS 9 Hrs. Flash, DirectX, OpenGL, Java, Python, XNA with Visual Studio, Mobile Gaming for the Android, iOS, Game engines - Adventure Game Studio, DXStudio, Unity.

UNIT 5 GAME DEVELOPMENT 9 Hrs. Developing 2D and 3D interactive games using OpenGL, DirectX - Isometric and Tile Based Games, Puzle games, Single Player games, Multi Player games.

Max.45 Hours

TEXT / REFERENCE BOOKS 1. David H. Eberly, “3D Game Engine Design, Second Edit on: A Practical Ap roach to Real -Time Computer Graphics” Morgan

Kaufman, 2 Edition, 2006.

2. JungHyun Han, “3D Graphics for

3. Mike McShaf rfy, “Game Coding Complete”, Third Edition, Charles River Media, 2009.

4. Jonathan S. Harbour, “Beginning Game Programming”, Course Technology PTR, 3 edition, 2009.

5. Ernest Adams and Andrew Rolings, “Fundamentals of Game Design”, Prentice Hall 1st edition, 2006.






L T P C r e d i t s T o t a l M a r k s

S I T 1 6 1 0 SOCIAL NETWORK ANALYSIS 3 0 0 3 100

COURSE OBJECTIVES

To make the students be able to formulate meaningful research questions concerning social network analysis;

To formulate agent-based models which from local behaviour of agents can generate networks with diverse global structures;

To know how to conduct computer simulations to analyze properties of such models;

UNIT 1 INTRODUCTION 9 Hrs. Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web - Emergence of the Social Web

Social Network Analysis: Social Networks Perspective - Analysis of Network Data - Interpertation of Network Data - Social Network Analysis in the Social and Behavioral Sciences - Metrics in social network analysis.

UNIT 2 SOCIAL NETWORK ANALYSIS SOFTWARE, TOOLS AND LIBRARIES 9 Hrs. Modelling and aggregating social network data: Ontological representation of social individuals - Ontological

representation of social relationships - Aggregating and reasoning with social network data - Advanced representations. Social network analysis software - Tools - Libraries .

UNIT 3 CLIQUES, CLUSTERS AND COMPONENTS 9 Hrs. Components and Subgraphs: Sub graphs - Ego Networks, Triads, Cliques, Hierarchical Clustering, Triads,

Network Density and conflict. Density: Egocentric and Sociocentric - Digression on Absolute Density - Community structure and Density, Centrality : Local and Global - Centralization and Graph Centres, Cliques and their intersections, Components and Citation Circles - Positions, Sets and Clusters.

UNIT 4 PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES 9 Hrs. Development of Social Network Analysis - Understanding and predicting human behaviour for social

communities - User data management - Inference and Distribution - Enabling new human experiences - Reality mining - Context - Awareness - Privacy in online social networks - Trust in online environment - Trust models based on subjective logic - Trust network analysis - Trust transitivity analysis - Combining trust and reputation - Trust derivation based on trust comparisons - Attack spectrum and countermeasures.

UNIT 5 GRAPH DATA IN THE REAL WORLD AND APPLICATION OF SOCIAL NETWORKS 9 Hrs. Medium data - Tradition, Big Data, Small Data - Flat File Representations, Medium Data - Data Representation,

Working with 2-Mode Data, Social Networks and Big Data, Big Data at work. Visualizing online social networks, Advances in Network Visualization - Elites, Communities and Influence, Applications of Social Network Analysis.

Max.45 Hours


John Scott, “Social Network Analysis”, Third Edition, SAGE Publications Ltd 2013. 1. Maksim Tsvetovat, Alexander Kouznetsov, “ Social Network Analysis for Startups”, First Edition, O’Reilly Media, 2011. 2. Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer 2007. 3. David Knoke, Song Yang, “Social Network Analysis”, First Edition, SAGE Publication Ltd 2007. 4. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st Edition, Springer, 2010. 5. Guandong Xu,Yanchun Zhang and Lin Li, “Web Mining and Social Networking - Techniques and applications”,

First Edition Springer, 2011. 6. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic Web”, Springer, 2009.


Max Marks : 80 Exam Duration: 3 Hrs. PART A: 10 questions of 2 marks each - No choice 20 Marks




S I T 1 6 1 1 SOFTWARE QUALITY ASSURANCE L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

To introduce concepts of metrics, and models in software quality assurance.

To understand the components of software quality assurance systems before, during, and after software development.

To develop an understanding of software quality frameworks and approaches to assure software quality.

UNIT 1 QUALITY STANDARDS 9 Hrs.

Software Quality Assurance Framework and Standards SQA Framework: Quality,Software Quality Assurance, Components of Software Quality Assurance - Software QualityAssurance Plan:Steps to develop and implement a Software Quality Assurance Plan - Quality Standards:ISO 9000 and Companion ISO Standards, CMM, CMMI, PCMM, Malcom Balridge, 3Sigma, 6 Sigma.

UNIT 2 QUALITY METRICS AND MEASUREMENT 9 Hrs. Software Quality Assurance Metrics and Measurement Software Quality Metrics: Product Quality metrics, In -Process Quality Metrics, Metrics for Software Maintenance, Examples of Metric Programs

Software Quality metrics methodology: Establish quality requirements, Identify Software quality metrics, Implement the software quality metrics, analyze software metrics results, validate the software quality metrics - Software quality indicators - Fundamentals in Measurement theory.

UNIT 3 TESTING METHODOLOGY AND ENVIRONMENT 9 Hrs. Software Testing Strategy and Environment: Establishing testing policy, structured approach to testin g, test factors, Economics of System Development Life Cycle (SDLC) Testing

Software Testing Methodology: Defects, verification and validation, functional and structural testing, workbench concept, eight considerations in developing testing methodologies, testing tactics checklist

UNIT 4 TESTING STRATEGIES 9 Hrs.

Software Testing Techniques: Black - Box, Boundary value, Bottom - up, Branch coverage, Cause - Effect graphing, CRUD, Database, Exception, Gray - Box, Histograms, Inspections, JADs, Pareto Analysis, Prototyping, Random Testing, Risk - based Testing, Regression Testing, Structured Walkthroughs, Thread Testing, Performance Testing, White - Box Testing

UNIT 5 TESTING TOOLS 9 Hrs. Software Testing Tools Taxonomy of Testing tools, Methodology to evaluate automated testing tools, Load Runner, Win runner and Rational Testing Tools, Silk test, Java Testing Tools, JMetra, JUNIT and Cactus.

Max. 45 Hours.


1. Effective Methods for Software Testing, 2nd Edition, William E. Perry, Second Edition,Wiley India, 2006.

2. Software Quality, Mordechai Ben-Menachem/Garry S. Marliss,Thomson Learning publication,1997.






S I T 1 6 1 2 CYBER FORENSICS L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

Demonstrate a working knowledge of computers, storage devices, and digital data

Plan and prepare for an incident requiring computer forensic skills

Seize a computer from a crime scene without damaging it or risking it becoming inadmissible in a court of law

UNIT 1 INTRODUCTION TO COMPUTER FORENSICS 9 Hrs. Computer Forensics Fundamentals: What is Computer Forensics?, Use of Computer Forensics in Law

Enforcement, Computer Forensics Assistance to Human Resources/Employment Proceedings, Computer Forensics Services, Benefits of Professional Forensics Methodology, Steps taken by Computer Forensics Specialists Types of Computer Forensics Technology: Types of Military Computer Forensic Technology, Types of Law Enforcement - Computer Forensic Technology - Types of Business Computer Forensic Technology Computer Forensics Evidence and Capture: Data Recovery Defined - Data Back-up and Recovery - The Role of Back-up in Data Recovery - The Data - Recovery Solution

UNIT 2 MOBILE AND SMART PHONE FORENSICS 9 Hrs.

Introduction to Mobile Malware : Types of Attacks Taxonomy of Mobile Malware, Phishing, SMishing, and Vishing Malware Attack and Defense : Mobile Malware, Visual Payloads, Timeline of Mobile Malware, Hoaxes, and Threats, Overview of Mobile Malware Families, Taxonomy of Mobile Malware Threats, Hacking and Viruses in Mo bile :Introduction and Overview of Mobile Communication, Attacks in Mobile, Man in the Middle, Denial of Service, Wireless Spoofing, Prevention Techniques in Mobile System, Intrusion detection in wireless, Access Control and Authentication in Mobile

UNIT 3 NETWORK SECURITY 9 Hrs. IPSec Protocol - IP Authentication Header - IP ESP - Key Management Protocol for IPSec . Transport layer

Security: SSL protocol, Cryptographic Computations - TLS Protocol.SIM Security, Security of Mobile Networks, Security of GSM Networks, Security of 3G Networks, Security of Wireless Local Area Networks, Security of Ad-hoc Networks, Security Techniques for Mobile Services, End-to-End Security Services in Mobile Communications, Inter-system Roaming and Internetworking Security, Securing Mobile E-Services, Security of Satellite Services, Security of Mobile Sensor Networks, Application Level Security, Security of IP Based Applications, Security of Mobile Payments, Security of Multimedia Communications, Security of Mobile Voice Communication

UNIT 4 EVIDENCE COLLECTION AND FORENSICS TOOLS 9 Hrs. Forensics - Investigating Dead Virtual Environments Install Files, Remnants, Registry, Microsoft Disk Image

Formats, Data to Look for, Investigator Tips Forensics - Investigating Live Virtual Environments: Artifacts, Processes and Ports, Log Files, VM Memory Usage, Memory Analysis, ESXi Analysis, Microsoft Analysis Tools Processing Crime and Incident Scenes - Working with Windows and DOS Systems. Current Computer Forensics Tools: Software/ Hardware Tools.

UNIT 5 ANALYSIS AND VALIDATION 9 Hrs. Current Computer Forensic tools: evaluating computer forensic tool needs, validating and testing forensics

software computer forensics hardware tools, validating and testing forensics software Cell phone and mo bile device forensics: Understanding mobile device forensics, understanding acquisition procedures for cell phones arid mobile devices.

Max. 45 Hours


1. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”, Wiley Publications, 2003. 2. Nelson, Phillips, Enfinger, Steuart, “Computer Forensics and Investigations”, Cengage Learning, India Edition, 2008

3. John R.Vacca, “Computer Forensics”, Cengage Learning, 2005. 4. Richard E.Smith, “Internet Cryptography”, 3rd Edition Pearson Education, 2008.

5. Marjie T.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3rd Edition, Prentice Hall, 2013.

END SEMESTER EXAM QUESTION PAPER PATTERN Max Marks : 80 Exam Duration: 3 Hrs. PART A: 10 questions of 2 marks each - No choice 20 Marks PART B : 2 Questions from each unit with internal choice, each carrying 12 marks 80 Marks



S I T 1 6 1 3 AUTOMATION TECHNIQUES IN ROBOTICS L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

To simulate the robot functions and joint movements to learn a simulation package

Graphic animation sequences for robot movement.

To provide knowledge of sensors used in Robotics

UNIT 1 ROBOTIC MANIPULATION 9 Hrs.

Robotic manipulation: Automation and Robots - Robot Classification - Applications - RobotSpecifications - Notation. Direct Kinematics: The ARM Equation - Dot and Cross products - Coordinate frames - Rotations - Homogeneous coordinates - Link coordinates - The armequation - A five-axis articulated robot (Rhino XR-3) Inverse Kinematics: Solving the armequation - The inverse kinematics problem - General properties of solutions - Tool configuration - Inverse kinematics of a five-axis articulated robot (Rhino XR-3) - A roboticwork cell.

UNIT 2 DYNAMIC OF ROBOTS 12 Hrs.

Workspace analysis and trajectory planning: Workspace analysis - Work envelop of a fiveaxisarticulated robot - Workspace fixtures - The pick-and-place operation - Continuous-pathmotion - Interpolated motion - Straight-line motion. Differential motion and statics: The toolconfiguration Jacobian matrix - Joint-space singularities - Generalized Inverses - Resolved-Motion rate control:n<=6 - Rate control of redundant robots:n>6 - rate control using {1}-inverses .

UNIT 3 ROBOT CONTROL 6 Hrs. Robot control: The control problem - State equation - Constant solutions - Linear feedbacksystems - Single-axis PID control - PD-Gravity control - Computed-Torque control - Variable - Structure control - Impedance control

UNIT 4 SENSORS AND ACTUATORS 9 Hrs.

Actuators: Introduction - Characteristics of actuating systems - Comparison of actuatingsystems - Hydraulic devices - Pneumatic devices - Electric motors - Microprocessor control of electric motors - Magnetostricitve actuators - Shape-memory type metals - Speed reduction.Sensors: Introduction - Sensor characteristics - Position sensors - Velocity sensors - Acceleration sensors - Force and pressure sensors - Torque sensors - Microswitches - Light and Infrared sensors - Touch and Tactile sensors - Proximity sensors - Range-finders - Sniff sensors - Vision systems - Voice Recognition devices - Voice synthesizers - Remote center compliance device.

UNIT 5 VISION AND TASK PLANNING 9 Hrs.

Robot vision: Image representation - Template matching - Polyhedral objects - Shape analysis - Segmentation - Iterative processing - Perspective Transformations - Structured illumination - Camera calibration. Task planning: Task-level programming - Uncertainty - Configuration space - Gross-Motion planning - Grasp planning - Fine-Motion planning - Simulation of planar motion - A task-planning problem.

Max. 45 Hours


1. Robert J. Schilling, Fundamentals of Robotics - Analysis & Control, Prentice Hall of India Pvt Ltd., 2002.

2. Saeed B. Niku, “Introduction to Robotics - Analysis, Systems, Applications”, Prentice Hall of India Pvt. Ltd., 2010.






S I T 1 6 1 6 HARDWARE PERIPHERALS AND INTERFACING L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

To understand the components on the motherboard

To understand different storage media

To introduce the features of different I/O peripheral devices and their interfaces.

UNIT 1 CPU AND MEMORY 9 Hrs.

CPU Essentials - Processor Modes - Modern CPU Concepts - Architectural Performance Features - The Intel’s CPU - CPU Over Clocking - Over Clocking Requirements - Over Clocking The System - Over Clocking The Intel Processors - Essential Memory Concepts - Memory Organizations - Memory Packages - Modules - Logical Memory Organizations - Memory Considerations - Memory Types - Memory Techniques - Selecting And Installing Memory

UNIT 2 MOTHERBOARDS 9 Hrs.

Active Motherboards - Sockets And Slots - Intel D850GB - Pentium4 Mother Board - Expansion Slots - Form Factor - Upgrading A Mother Board - Chipsets - North Bridge - South Bridge - CMOS - CMOS Optimization Tactics - Configuring The Standard CMOS Setup - Motherboard BIOS - POST - BIOS Features - BIOS And Boot Sequences - BIOS Shortcomings And Compatibility Issues - Power Supplies And Power Management - Concepts Of Switching Regulation - Potential Power Problems - Power Management

UNIT 3 STORAGE DEVICES 9 Hrs.

The Floppy Drive - Magnetic Storage - Magnetic Recording Principles - Data And Disk Organization - Floppy Drive - Hard Drive - Data Organization And Hard Drive - Sector Layout - IDE Drive Standard And Features - Hard Drive Electronics - CD-ROM Drive - Construction - CDROM Electronics - DVD-ROM - DVD Media - DVD Drive And Decoder.

UNIT 4 I/O PERIPHERALS 9 Hrs.

Parallel Port - Signals And Timing Diagram - IEEE1284 Modes - Asynchronous Communication - Serial Port Signals - Video Adapters - Graphic Accelerators - 3D Graphics Accelerator Issues - Directx - Mice - Modems - Keyboards - Sound Boards - Audio Bench Marks.

UNIT 5 BUS ARCHITECTURE 9 Hrs. Buses - Industry Standard Architecture (Isa), Peripheral Component Interconnect (Pci) - Accelerated Graphics Port (Agp) - Plug-And-Play Devices - Scsi Concepts - Usb Architecture.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Stephen J.Bigelow, “Trouble Shooting, maintaining and Repairing PCs”, Tata McGraw -Hill, New Delhi, 2001.

2. Craig Zacker & John Rourke, “The complete reference:PC hardware”, Tata McGraw -Hill, New Delhi, 2001

3. Mike Meyers, “Introduction to PC Hardware and Trouble shooting”, Tata McGraw-Hill, New Delhi, 2003.

4. B.Govindarajulu, “IBM PC and Clones hardware trouble shooting and maintenance”, Tata McGraw -Hill, New Delhi, 2002


Max. Marks : 100 Exam Duration: 3 Hrs. PART A : 10 questions of 2 marks each - No choice - 20 Marks




S I T 1 6 1 7 MOBILE COMPUTING L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

Understand the basic concepts of Wireless Communication and be familiar with the network protocol stack.

Learn the basics of mobile telecommunication system.

Be exposed to Mobile Ad-Hoc networks and gain knowledge about different mobile platforms and application development.

UNIT 1 WIRELESS COMMUNICATION FUNDAMENTALS 9 Hrs.

Introduction - Wireless transmission - Frequencies for radio transmission - Signals - Antennas - Signal propagation - Multiplexing - Modulations - Spread spectrum - MAC - SDMA - FDMA - TDMA - CDMA - Cellular wireless networks.

UNIT 2 TELECOMMUNICATION NETWORKS 9 Hrs. Telecommunication systems - GSM - GPRS - DECT - UMTS - IMT-2000 - Satellite networks - Basics - Parameters and configurations.

UNIT 3 MOBILE NETWORK LAYER 9 Hrs. Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent advertisement and discovery, registration, tunneling and encapsulation, optimizations), Dynamic Host Configuration Protocol (DHCP).

UNIT 4 MOBILE AD HOC NETWORKS (MANETS): 9 Hrs. Overview, Properties of a MANET, spectrum of MANET applications, routing and various routing al gorithms, security in MANETs.

UNIT 5 PROTOCOLS AND TOOLS 9 Hrs. Wireless Application Protocol - WAP. (Introduction, protocol architecture, and treatment of protocols of all layers), Bluetooth (User scenarios, physical layer, MAC layer, networking, security , link management) and J2ME.

Max. 45 Hours

TEXT / REFERENCE BOOKS 1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition, 2004.

2. Stojmenovic and Cacute, “Handbook of Wireless Networks and Mobile Computing”, Wiley, 2002, ISBN 0471419028.

3. Reza Behravanfar, “Mobile Computing Principles: Designing and Developing Mobile Applications with UML and XML”, ISBN:

0521817331, Cambridge University Press, October 2004,

4. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden, Schwiebert, Loren, “Fundamentals of Mobile and Pervasive

Computing”, ISBN: 0071412379, McGraw-Hill Professional, 2005.

5. Hansmann, Merk, Nicklous, Stober, “Principles of Mobile Computing”, Springer, second edition, 2003.

6. Martyn Mallick, “Mobile and Wireless Design Essentials”, Wiley DreamTech, 2003.






S I T 1 6 1 8 OPEN SOURCE SYSTEMS L T P C r e d i t s T o t a l M a r k s

3 0 0 3 100

COURSE OBJECTIVES

Identify and discuss various software licensing models.

Understand the motivation ,theory, strengths and weakness of open source software.

Become familiar with Linux, MySql, PHP, Perl

UNIT 1 OVERVIEW OF FREE/OPEN SOURCE SOFTWARE 9 Hrs. Overview of Free/Open Source Software - Definition of FOSS & GNU - History of GNU/Linux and the free

software movement - Advantages of free software and GNU/Linux - FOSS usage - Trends and potential - global and Indian - GNU/Linux OS installation - Detect hardware - Configure disk partitions & file systems and install a GNU/Linux distribution - Basic shell commands - logging in, Listing files, editing files, copying/moving files, viewing file contents, changing file modes and permissions, process management - User and group management - File ownerships and permissions - PAM authentication - Introduction to common system configuration files & log files - Configuring networking - Basics of TCP/IP networking and routing - Connecting to the Internet (through dialup, DSL, Ethernet, leased line).

UNIT 2 ADDITIONAL HARDWARE AND E-MAIL SERVERS 9 Hrs. Configuring additional hardware - Sound cards - Displays & display cards - Network cards - Modems - USB

drives - CD writers - Understanding the OS boot up process - Performing every day tasks using gnu/Linux - Accessing the Internet - Playing music - Editing documents and spreadsheets - Sending and receiving email - Copy files from disks and over the network - Playing games - Writing CDs - X Window system configuration and utilities - Configure X windows - Detect display devices - Installing software - From source code as well as using binary packages - Setting up email servers - Using postfix - (SMTP services) - Courier (IMAP & POP3 services) - Squirrel mail (web mail services) - Setting up web servers - Using apache (HTTP services) - PHP (server-side scripting) - Perl (CGI support) - Setting up file services - Using samba (file and authentication services for windows networks) - Using NFS (file services for gnu/Linux / Unix networks) - Setting up proxy services - Using squid (http / ftp / https proxy services) - Setting up printer services - Using CUPS (print spooler) - Foomatic (printer database).

UNIT 3 SETTING UP A FIREWALL 9 Hrs. Using netfilter and ip tables - Using the GNU compiler collection - GNU compiler tools - The C preprocessor

(cpp) - The C compiler (gcc) and the C++ compiler (g++) - Assembler (gas) - Understanding build systems - Constructing make files and using make - Using autoconf and autogen to automatically generate make files tailored for different development environments - Using source code versioning and management tools - Using CVS to manage source code revisions, patch & diff.

UNIT 4 UNDERSTANDING THE GNU LIBC LIBRARIES AND LINKER 9 Hrs. Linking against object archives (.a libraries) and dynamic shared object libraries (.so libraries) - Generating

statically linked binaries and libraries - Generating dynamically linked libraries - Using the GNU debugging tools - Gdb to debug programs - Graphical debuggers like ddd - Memory debugging/profiling libraries mpatrol and valgrind - Review of common programming practicies and guidelines for GNU/Linux and FOSS - Introduction to Bash, sed & awk scripting.

UNIT 5 PROGRAMMING TECHNIQUES 9 Hrs. Application Programming - Basics of the X Windows server architecture - Qt programming - Gtk+ programming

- Python programming - Programming GUI applications with localisation support, Open Source Equivalent of existing commercial software.


1. N. B. Venkateshwarlu (Ed), “Introduction to Linux: Installation and Programming”, B S Publishers; 2005. (NRCFOSS Publicati on






SEC1401 PRINCIPLES OF DIGITAL SIGNAL PROCESSING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE To impart knowledge of signal representation in time domain, fourier transform, sampling theorem, linear time-

invariant system, discrete convolution, z-transform, discrete fourier transform, discrete filter design, finite word length

effects and multi-rate signal processing and to analyze signal processing and designing a signal processors

UNIT 1 SIGNALS AND SYSTEMS 9 Hrs.

Basic elements of DSP , concepts of frequency in Analog and Digital Signals ,sampling theorem , Discrete - time

signals and systems - Analysis of discrete time LTI systems - Z transform - Convolution (linear and circular) -

Correlation (auto and cross).

UNIT 2 DISCRETE FOURIER TRANSFORM (DFT) AND FAST FOURIER TRANSFORM (FFT) 9 Hrs.

DFT and its properties, Relation between DTFT and DFT, IDFT and its properties, FFT computations using

Decimation in time (DIT) algorithms and Decimation in frequency (DIF) algorithms ,Realization of recursive and non

recursive systems - Direct Form I and Form II - Cascade and parallel realization.

UNIT 3 DESIGN OF INFINITE IMPULSE RESPONSE (IIR) FILTER 9 Hrs.

Design of IIR filters using Impulse invariant and Bilinear transformation method. Review of Butterworth and

Chebyshev approximations, Frequency selective filters: Ideal filter characteristics, low pass, high pass and band pass

filters, Properties of IIR and FIR filters.

UNIT 4 DESIGN OF FINITE IMPULSE RESPONSE (FIR) FILTER 9 Hrs.

Structures of FIR, Linear phase FIR filter, Filter design using windowing techniques - Hamming, Hanning and

Rectangular window, Frequency sampling techniques, and Finite word length effects in digital Filters

UNIT 5 APPLICATIONS 9 Hrs.

Multirate signal processing, Speech compression, Adaptive filter, Musical sound processing, Image

enhancement


1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing - Principles, Algorithms & Applications”, Fourth edition,

Pearson education / Prentice Hall, 2007

2. Emmanuel C.Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second edition, Pearson Education / Prentice Hall, 2002.

3. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, “Discrete Time Signal Processing”, Pearson Education, 2nd edition,

2005

4. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2001


PART A : 10 Questions of 2 marks each-No choice 20 Marks




SEC1606 DIGITAL IMAGE PROCESSING L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To understand the basic principles and methods of digital image

processing

To have a comprehensive background in image filtering

To develop analytic skill to process images

UNIT 1 DIGITAL IMAGE FUNDAMENTALS 9 Hrs

Elements of Visual Perception; Image Sensing and Acquisition; Image Sampling and Quantization; Basic

Relationships between Pixels; Monochromatic Vision Models; Colour Vision Models; Colour Fundamentals; Colour

Models

UNIT 2 IMAGE ENHANCEMENT 9 Hrs.

Introduction; Point Processing - Image Negatives, Log transformations, Power Law Transformations, Piecewise-

Linear Transformation Functions; Arithmetic/Logic Operations - Image Subtraction, Image Averaging; Histogram

Processing - Histogram Equalization, Histogram Matching; Spatial filtering - Smoothing, Sharpening; Smoothing

Frequency Domain Filters - Ideal Low Pass, Butterworth Low Pass, Gaussian Low Pass; Sharpening Frequency

Domain Filters - Ideal High Pass, Butterworth High Pass, Gaussian High Pass.

UNIT 3 IMAGE RESTORATION 9 Hrs.

A Model of Image Degradation/Restoration Process; Noise Models; Inverse Filtering, Minimum Mean Square

Error Filtering, Constrained Least Square Filtering; Geometric Mean Filter; Geometric Transformations - Spatial

Transformations, Gray-Level Interpolation.

UNIT 4 MORPHOLOGICAL PROCESSING & SEGMENTATION 9 Hrs.

Morphological Image Processing - Logic Operations involving Binary Images; Dilation and Erosion; Opening and

Closing; Basic Morphological Algorithms - Boundary Extraction, Region Filling, Thickening, Thinning; Image

Segmentation - Detection of Discontinuities; Edge Linking; Boundary Detection; Thresholding - Global and Adaptive;

Region based Segmentation.

UNIT 5 COLOUR IMAGE PROCESSING & APPLICATIONS 9 Hrs. Conversion of Colour Models; Basic of Full-Colour Image Processing; Colour Transformations; Smoothing; Sharpening;

Segmentation; Applications of Image Processing - Motion Analysis, Image Fusion, Image Classification.

Max. 45 Hours.


1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”, 2nd Edition, Pearson Education, Inc., 2004

2. Anil K. Jain, “Fundamentals of Digital Image Processing”, PHI Learning Private Limited, New Delhi, 2002.

3. William K. Pratt, “Digital Image Processing”, 3rd Edition, John Wiley & Sons, Inc., 2001

4. Rafeal C.Gonzalez, Richard E.Woods and Steven L. Eddins, “Digital Image Processing using Matlab”, Pearson Education,

Inc., 2004.

5. Bernd Jähne, “Digital Image Processing”, 5th Revised and Extended Edition, Springer, 2002



PART A : 10 Questions of 2 marks each - No choice 20 Marks




SEC1608 EMBEDDED SYSTEMS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVES To study the basic introduction to Embedded System

To explain the various development tools in embedded System

To get a knowledge in embedded programming and acquire a knowledge in embedded system application

UNIT 1 INTRODUCTION TO EMBEDDED SYSTEM 8 Hrs. Embedded system- characteristics of embedded system- categories of embedded system- requirements

ofembedded systems- challenges and design issues of embedded system- trends in embedded system-

systemintegration- hardware and software PARTition- applications of embedded system- control system and industrial

automation-biomedical-data communication system-network information appliances- IVR systems- GPS systems.

UNIT 2 EMBEDDED SOFTWARE DEVELOPMENT AND TOOLS 8 Hrs. Software architectures, Round - Robin, Round-Robin with Interrupts, Function Queue Scheduling architecture,

Introduction to assembler - Compiler -n Cross compilers and Integrated Development Environment IDE, Linker/ Locators, Simulators, Getting Embedded software into target System- Debugging Strategies

UNIT 3 EMBEDDED NETWORKING 9 Hrs. Embedded Networking: Introduction, I/O Device Ports - Serial Bus communication protocols- RS232 standard -

RS485 - CAN Bus - RS485 - Serial Peripheral Interface (SPI) - InterIntegrated Circuits (I2C) - PC Parallel port communication Protocols -Bluetooth-network using ISA, PCI- Wireless and Mobile System Protocols.

UNIT 4 EMBEDDED PROGRAMMING 10 Hrs. Programming inassembly language (ALP) vs High Level Language - C Program Elements:- Macros

andfunctions, Use of Date Types, Structure, Pointers, Function Calls - Concepts of EmbeddedProgramming in C++:-Objected Oriented Programming, Embedded Programming in C++,‘C’ Program compilers - Cross compiler - Optimization of memory needs-Java programming advantages, disadvantages and J2ME concept.

UNIT 5 EMBEDDED SYSTEM TESTING/ AND APPLICATION 10 Hrs. Introduction to embedded system testing - Types of testing: Unit testing, Regression testing, Functional testing,

Coverage tests, Gray box test and performance testing - Embedded applications: Case study of Smart card, Interfacing stepper motor, RFID-system, Application, Tag Reader - Handheld Device - Washing Machine.

Max. 45 Hours


1. KVKK Prasad, Embedded / Real Time Systems -, Dreamtech Press, 2005.

2. David Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000.

3. Raj Kamal, ‘Embedded system-Architecture, Programming, Design’, Tata McGraw Hill,201 1.

4. Arnold Berger, “Embedded system design”, CMP books, 1st Edition, 2005

5. Wayne wolf, “Computers as components”, Morgan Kaufmann publishers, 2nd Edition, 2008.

6. Tammy Noergaard, “Embedded Systems Architecture”, Elsevier, 2006

7. Steve Heath, Embedded Systems Design, Second Edition, Elsevier India Pvt.Ltd.,2007.

8. Narayan and gong, “Specification and design of Embedded System”, Pearson Education, 2nd Edition, 1999.

9. Sriram V Iyer, Pankaj Gupta, TMH,2004

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 Questions of 2 marks each-No choice 20 Marks PART B : 2 Questions from each unit with internal choice, each carrying 12marks 80 Marks




SEC1615 NANOELECTRONICS 3 0 0 3 100

COURSE OBJECTIVES To understand the evolution and basics of Nanoelectronics

To understand the different physical deposition techniques for thin film

deposition

To learn the different types of chemical vapour decomposition techniques

To learn about the various characterization techniques

To understand the basics of elementary quantum devices

UNIT 1 FUNDAMENTALS OF NANOELECTRONICS 9 Hrs.

Moore’s Law, Wave functions, wave packets, Schrodinger’s wave equation, potential barriers and tunneling,

Fermi-Dirac statistics, Density of states, Limitations of conventional FET in nano scales, Quantum Well, Quantum wire,

Quantum dot, current flow in two terminal Quantum dots, ballistic transport, Single Electron Transistor

UNIT 2 PHYSICAL DEPOSITION (THIN FILM) TECHNIQUES 9 Hrs. Basics of physical methods, Glow discharge DC Sputtering, Triode sputtering, Getter sputtering, Radio

frequency sputtering, Magnetron sputtering, Ion beam sputtering, AC sputtering, Vacuum evaporation, Resistive heat

Evaporation, Flash Evaporation, Electron Beam Evaporation, LASER evaporation

UNIT 3 CHEMICAL DEPOSITION (THIN FILM) TECHNIQUES 9 Hrs.

Fundamentals of chemical methods, Chemical Vapour Deposition, LASER chemical Vapour Deposition, Photo

Chemical Vapour Deposition, Plasma enhanced Vapour Deposition, Metal Organo Chemical Vapour Deposition,

Chemical Bath Deposition, Electro less Deposition, Anodisation, Liquid Phase Epitaxy, Sol-Gel method, Spin Coating,

Spray-Pyrolysis Technique, Polymer Assisted Deposition

UNIT 4 THIN FILM CHARACTERIZATION TECHNIQUES 9 Hrs.

Cyclic Voltammetry and Linear Sweep Techniques, Thickness measurement Techniques, X-Ray Diffraction

Technique, Raman Spectral Study, Scanning Electron Microscopy, Energy Dispersive Analysis by X-rays

measurements, Atomic Force Microscopy

UNIT 5 NANOELECTRONIC DEVICES 9 Hrs. Digital and Switching abstraction, Quantum Cellular Automata (QCA), Realization of logic gates using QCA,

Types and synthesis of molecular bundles, principle and types of spin wave devices, Array minimum/ maximum

computation with spin wave devices. Max. 45 Hours


1. George W Hanson, Fundamentals of Nanoelectronics, Prentice Hall, 2008.

2. Karl Goser, Nanoelectronics and Nanosystems: From Transistors to Molecular and Quantum Devices, Springer, First edition,

2005

3. Rainer Waser (Ed), Nanoelectronics and Information Technology, Second Edition, Wiley VCH, 2003

4. Mary Eshaghian-Wilner, Bio inspired and Nano Scale Integrated Computing, Wiley, 2009



PART A : 10 Questions of 2 marks No choice 20 Marks




SBI1101 INTRODUCTION TO BIOINFORMATICS L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To enable the students to understand about tools used in Bioinformatics & how to use them. This will facilitate the students to undertake projects in the modern biology.


Introduction to bioinformatics, biological information, the Central Dogma, Bioinformatics: Definition and overview Bioinformatics, Branches of Bioinformatics, Aim, Scope and Research areas of Bioinformatics. Genome projects, human genome project- Databases and human chromosomes, role of Bioinformatics in biological sequences. Biological data- DNA sequence protein sequence, macromolecular structure. Challenges in bioinformatics.

UNIT 2 COMPUTING IN BIOINFORMATICS 9 Hrs. Introduction to internet-facilities used on the internet-www- web browsers, introduction to network basics-LAN,

wan, network topology, protocol. Basic principles of computing in bioinformatics - databases system, programming languages for bioinformatics- Perl, python. Introduction to computational biology.

UNIT 3 BIOLOGICAL DATABASES 9 Hrs. Databases and programs, Information retrieval from databases of nucleic acid and proteins. Pair wise alignment

and database searching, Multiple Sequence Alignment database searching, DNA analysis, protein analysis, Data information and Knowledge Management, Concepts in Bioinformatics, Databases and Data Warehouses in Bioinformatics. Challenges, combining multiple types of data, Information Retrieval system in bioinformatics

UNIT 4 TOOLS APPLICATIONS IN BIOINFORMATIC 9 Hrs.

Bio-algorithms and Tools- Identifying genes, Overview of sequence annotation. Gene prediction methods-Human variation and disease identification, Visualizing and comparing nucleic acids and Protein Introduction to Phylogenetic analysis definition, concepts of tree, steps in constructing Phylogenetic analysis. Introduction to microarray.

UNIT 5 SOFTWARES IN BIOINFORMATICS 9 Hrs. Basic software tools used in bioinformatics - Sequence analysis- GCG, Emboss - Cn3D viewer- Rasmol, Swiss pdb viewer, Pymol, Jmol. Modeling- Discovery studio 2.0, Docking -Auto dock,HEX.

Max. 45 Hours


Des Higgins and Willie Taylor, “Bioinformatics sequence structures and databases”, Oxford University press, 1st ed., 2000. Atwood, Paey Smith, “Introduction to bioinformatics”, 2001.

Arthur M.Lesk, “Introduction to bioinformatics”, 2002.

David W. Mount, “Bioinformatics: Sequences and genome analyses”, Cold Spring Harbor Laboratory press, 2000. Westhead, Parish and Twyman, “Instant notes: Bioinformatics”, 2003.







SB I1 6 05 PYTHON L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE To learn to appreciate the programming language that can be used for a wide variety of programming tasks and

to expose the student to the standard scripting language. At the end of the course, the student will be developing adequate skills in programming and will be known to understand the implementation of various applications using powerful assortment of built-in types in python.

UNIT 1 INTRODUCTION TO PYTHON 9 Hrs. Introduction to PYTHON- History -Features –installation - Setting up path -Working with Python -Basic Syntax --Operator

UNIT 2 VARIABLE AND DATA TYPES 9 Hrs. Native datatypes – Booleans –Numbers – Strings - Bytes and byte arrays-Lists- Tuples – Sets - Dictionaries

UNIT 3 REGULAR EXPRESSIONS 9 Hrs. Python regular expressions – Match function -Search function -Matching VS Searching -Modifiers -Patterns.

UNIT 4 CONTROL STATEMENTS 9 Hrs. Conditional Statements -If , If- else , Nested if-else , - Looping- For , While , Nested loops,- Control Statements- Break , Continue , Pass

UNIT 5 FUNCTIONS AND MODULES 9 Hrs. Functions - Defining a function -Calling a function -Types of functions -Function Arguments -Anonymous

functions -Global and local variables, Modules- Importing module -Math module -Random module -Packages – Composition

Max. 45 Hours

TEXT / REFERENCE BOOKS Hetland., “Beginning Python” , Apress, 2008

Mark Pilgrim, “Dive Into Python”, Apress, 2004

Martin C. Brown, “Python: The Complete Reference (English)” , McGraw-Hill/Osborne Media, 2001. Mark Summerfield , “Programming in Python 3”, 2nd ed (PIP3) , Addison Wesley ISBN: 0-321-68056-1


Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each – No choice 20 Marks




SB M1 3 0 4 BIOMATERIALS L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVES

The course provides an intriguing insight in chemistry, engineering, biology and medicine that has a significant impact on biomaterials.

It highlights the way in which modern biology and medicine is inextricably linked to scientific discipline and helping us to understand the complex world of biomaterials.

UNIT 1 INTRODUCTION AND METALS 9 Hrs. Biomaterials – Overview, Classification of biomaterials, Interfacial Phenomena and tissue response to

biomaterials, Metals and alloys for orthopedic implants-Stainless steel, Cobalt chromium alloy, Titanium and its alloys, Precious metal alloys, Other metal alloys. Dental implants – materials, types and designs

UNIT 2 REPLACEMENT AND FIXATION DEVICES 9 Hrs. Bioelectric effect, Wolff’s Law, Types of orthopedic fixation devices-pins, screws and plates, Intra Medullary and

spinal nails. Interface Problems with artificial joints and various fixation methods, Hard tissue replacements – total hip and knee joint replacements. Soft Tissue replacements- Sutures -Tapes, Staples, Adhesives. Maxillofacial Implants

UNIT 3 POLYMERS AND APPLICATIONS 9 Hrs. Polymers in biomedical use, Hydrogels, silicone rubber, biodegradable polymers, Polymer Sterilization, Deterioration of polymers

UNIT 4 BIOCERAMICS AND COMPOSITES 9 Hrs.

Bioceramics, types and – bioactive resorbable, non – resorbable, bioceramic coatings on metallic and implants and bone bonding reactions on implantation. Hydroxyapatite – properties and applications. Composites – Types and Applications, Bioglass

UNIT 5 OPTHALMOLOGY, CORROSION AND TESTS 9 Hrs.

Ophthalmology- Introduction, Contact lenses, Eye shields, Viscoelastic solutions, Vitreous implants, Acrylate adhesives, Scleral buclikng materials for retinal detachment, artificial tears. Corrosion, Biocompatibility and Hemocompatibility, Biological Tests. Material surface characterization

Max. 45 Hours


Sujata V Bhat, “Biomaterials”, Narosa Publishing House, New Delhi, 2002.

Rolando Barbucci, “Integrated Biomaterials Science”, Plenum Publishers, New York, 2002.

A.F. Von Recum, “Handbook of Biomaterials Evaluation – Scientific, Technical and Clinical Testing of Implant Materials”, 2nd Edition, Taylor & Francis, Philadelphia,1999.

J.B Park and R.S Lakes, “Biomaterials: An Introduction”, Second Edition, Plenum press, New York, 1992. Joseph D Bronzino, “The Biomedical Engineering Hand Book”, Vol – 11, CRC press, 2000.






SB M1 4 0 4 HOSPITAL MANAGEMENT L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVES

The paper provides opportunities for training and research in all aspects of hospital / health administration. It helps promotes scientific management of hospital and advancement of health care systems so as to make it rational, responsive and cost efficient.

The student is thus educated in the development of high quality of hospital care in the community and the country so as to provide a satisfactory environment to the patient and clinical research

UNIT 1 STANDARD OF HOSPITAL 9 Hrs. Concept of Hospital Management – Role of Administrator – Responsibilities of Administrator – Hospital Design – Outlines for establishing Departmental Zones – Hospital Engineering

UNIT 2 HOSPITAL ORGANIZATION 9 Hrs.

Organization of Out-Patient Services – Problems encountered in functioning of O.P Department – Organization of In- Patient Services – Casualty & Emergency Services - Organization and management of Operation theatres

UNIT 3 SERVICES IN HOSPITAL 9 Hrs. Organization of Ancillary Services: Lab Services – Department of Physiotherapy & Occupational Therapy – Organization of Blood Transfusion Services – Department of Radio – diagnosis – Hospital Pharmacy

UNIT 4 STERILIZATION AND HOSPITAL SAFETY 9 Hrs. Disease transmission, Sterilization and disinfection methods, Hospital safety – Radiation Safety, hazardous safety, safety disposal of biological waste - Maintenance of Equipments& Instruments.

UNIT 5 SUPPORTIVE SERVICES IN HOSPITAL 9 Hrs.

Organization and management of Nursing services and Dietary Services in hospital – House-keeping and maintenance –Medical Records -Staffing the hospital - Human resources management in hospital - Management Assisted by Computers: Reservation, Admission, Registration & Discharge Module

Max. 45 Hours


Dr. L.L. Rao, “Hospital Management.”

R. D. Lele, “Computers in Medicine”, Tata McGraw Hill, 2008 Mohan Bansal, “Medical informatics”, Tata McGraw Hill, 2005






SB M1 6 0 6 BIOMEMS AND NANOTECHNOLOGY L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To enable the student to acquire adequate knowledge on micro mechanical devices and their applications in drug delivery and nanotechnology.

UNIT 1 INTRODUCTION 9 Hrs. MEMS – definition. Origin of MEMS – Types – Materials used and their properties. MEMS Technology. Applications in health care. Integrated MEMS and microsystem.

UNIT 2 PROCESSING: MICRO MACHINING TECHNOLOGY 9 Hrs. Lithography- etching- Ion implantation- wafer bonding- Integrated processing- Bulk micro machining- surface micro machining- coating technology and CVD-LIGA process.

UNIT 3 MICROSYSTEMS AND MICROFLUIDS 9 Hrs.

General principles- Microsensors – Actuators- Electrostatic forces- Piezoelectric crystals – Intelligent materials and structures. Fundamentals of micro fluids, lab – on – a chip devices - Silicon and glass micromachining for micro total analysis systems.Surface chemistry in polymer microfluidic systems.

UNIT 4 APPLICATION IN MEDICINE 9 Hrs. Trends in MEMS for health care. Drug delivery systems - Biochip – Micro needles- Microelectrodes- Neural prosthesis – shape memory implants.

UNIT 5 BIOMEDICAL NANOTECHNOLOGY 9 Hrs. Nanotechnology- Medical applications of Nanotechnology- Drug synthesis and delivery- Nanofabrication methods – Nanomaterials in human body- Toxicity in nanomaterials.

Max. 45 Hours

TEXT / REFERENCE BOOKS Tai-Ran Hsu, “MEMS & Microsystem- Design and manufacture”, Mc. Graw Hill

Malsch, NeelinaH., ed., “Biomedical Nanotechnology”, Washington, DC: CRC Press, 2005

Marc J. Madou, “Fundamentals of Microfabrication and Nanotechnology”, 3rd Edition, Three-Volume Set,CRC Press Mohamed Gad-el-Hak, “The MEMS Handbook”, CRC Press, 2005

L.Yahia (Editor), L'HocineYahia, “Shape Memory Implants.”



PART A : 10 questions of 2 marks each – No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SBI1207 PERL PROGRAMMING L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To understand the basics of Perl programming and its role and applications in Bioinformatics discipline.

UNIT 1 INTRODUCTION TO PERL PROGRAMMING 9 Hrs.

Introduction to Perl for Bioinformatics- Comprehensive PERL Archive Network-Variables in Perl: Scalars, Arrays and Hashes. Basic structure of Perl language- a functional approach – constructing atgc.pl. tr/// function –text formatting – formatting numerical output with printf – trapping errors at run time – the s/// operator – the chop and chomp operators.

UNIT 2 INTRODUCTION TO ARRAYS AND HASHES 9 Hrs.

Introduction to arrays and Hashes Variables – Printing hash data, accessing and removing elements. Special variable $[ Accessing elements in an array. Function list – reverse- sort- join- split- pop- push- shift- unshift-split function–advanced array operation – copying and creating arrays – populating arrays with sequential data – qw function – determination of the size of an array –counting arrays – accessing first element in an array, accessing last element in an array, accessing other elements in an array – adding elements to the end of an array – adding elements– removing elements – appending elements ,altering elements – array slices – splicing array – sorting arrays – reversing arrays – arrays from strings. Merging arrays, Transforming strings to arrays, transforming arrays to strings (Split and join functions).

UNIT 3 PERL REGULAR EXPRESSIONS AND CONTROL STRUCTURES. 9 Hrs.

Perl regular expressions – special characters (+, *,?, [ ]) – regex operator – pattern modifier operator – conditional matching operator – range operator – match quantifiers – matching boundaries, grouping matching. Perl control statements – control structures – if statements – if-else – if-elsif – if-elsif-else – while loop – until loop –unless for loop – foreach loop –scoping of variables.

UNIT 4 FILES AND DIRECTORY MANIPULATIONS 9 Hrs. Files- Operating modes: read, write, append function- File variable, Die function– terminating a program,

Reading complete file, Reading a file line by line, Closing a file. File test operators (d, e, l, r, s, w, x, B, T)-Manipulation Functions –link, unlink, rename, truncate, removing files. Directory Manipulation functions – mkdir, chdir, opendir, readdir, closedir, rmdir, chmod.

UNIT 5 INTRODUCTION TO PERL MODULES 9 Hrs. Introduction to modules and Subroutines- BioPerl module, Getopt: Long module and LWP: Simple Module-Cwd

module – creating perl module tree, system function –Perl subroutines and functions. Introduction and applications of Common Gateway Interfaces (CGI).


Harshawardhan P Bal, “Perl Programming for Bioinformatics”, Tata McGraw Hill Publishing Company Limited, 2003. Tim Bunce and Alligator Descartes, “Programming the Perl DBI”, O'Reilly Media, USA, 2000.

Michael Moorhouse and Paul Berry, “Bioinformatics, Biocomputing and PERL”, John Wiley and Sons Ltd., UK, 2004. James Tisdall, “Beginning Perl for Bioinformatics”, O’Reilly & Associates, USA, 2001.

Steven Holzner,” PERL- Black Book”, Dreamtech Publications, 2nd Edition, 2001.




http://atgc.pl.tr/



SB T 16 1 0 GMP AND QUALITY CONCEPTS L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To introduce students about Good manufacturing practices quality concepts which would expose them to industrial scenario.


Basic Concepts: Quality concepts, Quality Control, Quality Assurance, Good Manufacturing Practices, Good Laboratory Practices, Responsibilities. Quality Control: Quality control laboratory: Responsibilities, good laboratory practices, routine controls, instruments, protocols.

UNIT 2 GMP 9 Hrs.

Good Manufacturing Practice. Legal requirements pertaining to GMP: GMP Guidelines, Standards, Regulatory agencies c) Basic Components of GMP: Organization & Personnel, Premises, Equipments, Raw Materials, Complaints and recalls, Specifications, Self inspection.

UNIT 3 GLP 9 Hrs. Good Laboratory Practice (GLP) – an overview and basic information, Scope. Principles of GLP: Test Facility

Organization and Personnel, Quality Assurance Programme, Facilities, Test Systems, Test and Reference Items, Standard Operating Procedures, Performance of the Study, Reporting of Study Result, Storage and Retention of Records and Materials.

UNIT 4 INSPECTION 9 Hrs.

Inspections, Quality Audit and Quality System Reviews: Inspections, role of quality audit, role of inspectors, methods of inspection- routine, concise, follow-up and special inspections, frequency and duration of inspections, preparations for inspections, conduct, report and regulatory actions.

UNIT 5 REGULATION 9 Hrs. Regulatory bodies – Need and role of regulatory bodies. Different regulatory bodies – FDA, HACCP and their scope. Importance of regulatory approval. ISO 9000 – regulations.

Max. 45 Hours


Sidney H. Willig, “Good manufacturing Practices for Pharmaceuticals, 5th Edition, Revised and Expanded”, Marcel Dekker, Inc. New York, 2005.

Jose Rodriguez-Perez, “The FDA and Worldwide Current Good Manufacturing Practices and Quality System requirements guidebook for finished pharmaceuticals”, American Society for Quality, ASQ Quality Press, Milwaukee, Wisconsin, 2014.







SB T1 6 1 1 BIOLOGY FOR ENGINEERS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To understand the essentials of basic biological principles

UNIT 1 INTRODUCTION TO CELLS 9 Hrs.

Cell-Functional unit of live organisms - Cell theory - Prokaryotic and eukaryotic cell - plant, animal, bacterial cell - cell components - functions- cell organization – tissues - basic types -cell division: Mitosis, meiosis, cell cycle regulation

UNIT 2 SOCIAL IMPORTANCE 9 Hrs. Application of biological sciences and biotechnology to the society - human health care and medicines - pharmaceuticals and nutraceuticals -food and agriculture- pollution management and environment - Biofuels

UNIT 3 INTRODUCTION TO BIOMOLECULES 9 Hrs. Biomolecules - classification, salient features - biological significance - carbohydrates, proteins and amino acids - lipids and fats - nucleic acids - vitamins-Enzymes

UNIT 4 HUMAN PHYSIOLOGY 9 Hrs.

Human Physiology - Different systems associated with human- Tissues, organ and physiology of the various systems: Digestive, respiratory, circulatory, skeletal, nervous, excretory and reproductive system - Artificial memory and neural net work

UNIT 5 MEDICAL IMPORTANCE 9 Hrs.

Infectious and non infectious diseases- causative agents, epidemiology, pathogenicity, control and prevention, treatment of AIDS, tuberculosis, Pathology of non infectious and genetic diseases and disorders - cancer, diabetes melites, cardiac diseases- neurological disorders-Parkinson’s disease

Max. 45 Hours


Satyanarayana, U. “Biotechnology”, 4th Edition, Books and Allied Pvt. Ltd. Kolkata, 2007. Lehninger A.L, Nelson D.L, Cox .M.M, “Principles of Biochemistry”,. CBS Publications 1993






SCH1 6 1 6 ENVIRONMENTAL IMPACT ASSESSMENT L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To provide a basic understanding of the EIA process as it is used for research, planning, project or program evaluation, monitoring, and regulatory enforcement and to introduce students to the legal, economic, administrative and technical process of preparing and/or evaluating environmental impact documents.


Historical development of Environmental Impact Assessment (EIA). EIA in Project Cycle. Legal and Regulatory aspects in India. Types and Limitations of EIA, Cross sectoral issues and terms of reference in EIA – Public Participation in EIA. EIA process.

UNIT 2 METHODS FOR EIA 9 Hrs. Methods of EIA – Check lists – Matrices – Networks – Cost-benefit analysis – Analysis of alternatives.

UNIT 3 PREDICTION AND ASSESSMENT 9 Hrs. Assessment of Impact on land, water, air, social & cultural activities and on flora & fauna- Mathematical models- Public participation – Rapid EIA.

UNIT 4 ENVIRONMENTAL MANAGEMENT PLAN 9 Hrs.

Environmental Management Plan – Preparation, Implementation and review – Mitigation and Rehabilitation Plans– Policy and guidelines for planning and monitoring programmes – Post project audit – Ethical and Quality aspects of Environmental Impact Assessment.

UNIT 5 LIFE CYCLE ASSESSMENT & EXECUTIVE SUMMARY 9 Hrs.

Life Cycle Assessment - Elements of LCA - Life Cycle Costing – Eco Labeling – Designs for the Environment - International Environmental Standards - ISO 14001 - Environmental Audit. Executive summary - Documentation of EIA findings, Planning, Organization of information and Visual display material, Report preparation.

Max. 45 Hours


Canter, L.W., “Environmental Impact Assessment”, McGraw Hill, New York. 1996

Y.Anjaneyulu: “Environmental Impact Assessment Methodologies”, BS Pub. 2002.

S.K.Shukla and Srivastava P.R., “Concepts in Environmental Impact Analysis”, Common Wealth Publishers, New Delhi, 1992. John G. Rau and David C Hooten (Ed), “Environmental Impact Analysis Handbook”,McGraw-Hill Book Company, 1990. Lawrence, D.P., “Environmental Impact Assessment – Practical solutions to recurrent problems”, Wiley-Interscience, New

Jersey, 2003.

“Environmental Assessment Source book”, Vol. I, II & III. The World Bank,Washington, D.C., 1991.

J.Petts, “Handbook of Environmental Impact Assessment”, Vol., I and II, Blackwell Science, London, 1999.

Judith Petts, “Handbook of Environmental Impact Assessment”, Vol. I & II”, Blackwell Science, 1999

World Bank –Source book on EIA







SCI1619 DISASTER MANAGEMENT L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To create an awareness towards natural and man-made disasters, disaster preparedness and disaster management

UNIT 1 INTRODUCTION TO DISASTERS 12 Hrs. Natural resources and its importance - understanding on fragile eco-system - characteristics and types of

Disasters, Geological and Mountain Area Disasters: Earthquakes, Volcanic eruption, landslides - Wind and Water Related Natural Disaster: Floods, Droughts, Cyclones, Tsunamis - Man Made Disasters: Forest fires, Nuclear, Biological and Chemical disaster - Causes and effects - Disaster Profile of India - Disaster Management cycle.

UNIT 2 DISASTER PREPAREDNESS 8 Hrs. Disaster management, mitigation and preparedness: Disaster Preparedness for People and Infrastructure,

CommUNITy based Disaster Preparedness Plan - Roles & Responsibilities of Different Agencies and Government: Education, Communication & Training, Central, State, District and local administration, Armed Forces, Police, Para Military Forces, International Agencies, and NGO’s - Disaster Mitigation: Strategies, Emerging Trends, Mitigation management and Role of Team and Coordination.

UNIT 3 REHABILITATION, RECONSTRUCTION & RECOVERY 10 Hrs. Damage assessment – Development of Physical and Economic Infrastructure - Nature of Damage to Houses

and Infrastructure due to Disasters - Funding Arrangements for Reconstruction - Monitoring and Evaluation of Rehabilitation Work: Training, Rescue and planning the rescue activities and rehabilitations - Role of Government and NGO’s - Participative Rehabilitation Process: Case Studies

UNIT 4 DISASTER RESPONSE AND DISASTER MANAGEMENT 8 Hrs. Disaster Response Plan: Communication, Participation and Activation of Emergency Preparedness Plans,

Search, Rescue, Evacuation and other logistic management - Human Behaviour and Response Management: Psychological Response and Psychological Rehabilitation, Trauma and Stress Management, rumour and Panic Management, Medical and Health Response to Different Disasters - Relief Measures: Minimum Standard of Relief, essential components of Relief Management, and funding.

UNIT 5 RISK ASSESSMENT AND VULNERABILITY ANALYSIS 7 Hrs. Hazard, Risk and Vulnerability: Concept and Relationship: Disaster Risk Reduction, People Participation in Risk

Assessment - Vulnerability Analysis, Vulnerability Identification - Vulnerability profile of India - Strategies for Survival - Social Infrastructure for Vulnerability Reduction.

Max. 45 Hours TEXT / REFERENCE BOOKS 1. Bryant Edwards, “Natural Hazards”, Cambridge University Press, U.K, 2005 2. Carter, W. Nick, “Disaster Management, Asian Development Bank”, Manila, 1991. 3. Government of India, “Vulnerability Atlas of India”, New Delhi, 1997. 4. Sahni, Pardeep et.al. (eds.), “Disaster Mitigation Experiences and Reflections”, Prentice Hall of India, New Delhi, 2002 5. Sahni, Pardeep and Ariyabandu, Madhavi Malalgoda, 2012: “Disaster risk reduction in South Asia”, Phi learning pvt. Ltd.-

publisher, New Delhi, 2012. 6. Sharma, R.K. & Sharma, G.,(ed), “Natural Disaster”, APH Publishing Corporation, New Delhi, 2005. 7. Taori, K, “Disaster Management through Panchayati Raj”, Concept Publishing Company, New Delhi, 2005. Websites 8. NOAA Coastal Services Center, “Linking People Information and Technology”, 9. “Risk and Vulnerability Assessment Tool”, at, http://www.csc.noaa.gov/rvat/criticalEdd.html

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each – No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks

http://www.csc.noaa.gov/rvat/criticalEdd.html



SCY1601 SPECTROSCOPY L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To make the students to understand the basic concepts about the analytical techniques

UNIT 1 UV-VIS SPECTROSCOPY 9 Hrs.

Principles of radiation – Frank condon principle – Various electronic transitions (185-800 nm) – Beer-Lambert law – Instrumentation of single beam and double beam spectrophotometer – Woodward and Fieser rule – Applications of UV-Visible spectroscopy.

UNIT 2 IR AND RAMAN SPECTROSCOPY 9 Hrs.

Principles of IR spectra – Instrumentation of IR spectroscopy – Force constant – Effect of hydrogen bonding – Applications of IR spectroscopy – Raman spectroscopy: Principle – Strokes line and antistrokes line – Instrumentation – Applications of Raman spectroscopy.

UNIT 3 1H NMR AND 1 3C SPECTROSCOPY 9 Hrs. General introduction and definition: Chemical shift – Spin-spin interaction – Shielding mechanism – Coupling constants. Nuclear overhauser effect (NOE). Instrumentation of 1H NMR and 13C spectroscopy.

UNIT 4 MASS SPECTROMETRY 9 Hrs. Principle of Mass spectra – Instrumentation – Principle of fragmentation – Nitrogen rule – McLafferty rearrangement – Representation of Mass spectrum – Applications of mass spectra.

UNIT 5 IMAGING TECHNIQUES 9 Hrs. Scanning electron microscopy – Energy dispesrve X-ray spectroscopy – Transmission electron microscopy – Atomic force microscopy – Scanning tunneling microscopy – X-ray photoelectron spectroscopy.

Max. 45 Hours


1. Banwell C.N., and McCash E. M., “Fundamentals of Molecular Spectroscopy”, 4th Edition, Tata McGraw Hill, 2000.

2. Silverstein R. M., and Webster F. X., “Spectroscopic Identification of Organic Compounds”, 6th Edition, John Wiley & Sons, 2003.

3. Levine I. N., “Molecular Spectroscopy”, John Wiley & Sons, 1974.

4. Williams D. H., and Fleming I., “Spectroscopic Methods in Organic Chemistry”, 4th Edition, Tata McGraw-Hill Publishing Company, 1988.

5. Kemp W., “Applications of Spectroscopy”, English Language Book Society, 1987.



PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks (10% problems may be asked)



S C Y 1 6 0 2 ENERGY SOURCES L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To know the various sources of energy available and to face the future challenges arising due to energy crisis.

UNIT 1 GLOBAL AND INDIAN ENERGY SCENARIO 9 Hrs. Bio-fuels - Nuclear energy - Their utilization pattern in the past, present and future projections of consumption pattern. Power sector reforms - Restructuring of energy supply sector - Energy strategy for future.

UNIT 2 HYDROGEN ENERGY 9 Hrs.

Hydrogen as a renewable energy source: Sources of Hydrogen – Fuel for Vehicles. Hydrogen Production: Direct electrolysis of water – Thermal decomposition of water – Biochemical methods of hydrogen production. Storage of Hydrogen: Gaseous, Cryogenic and Metal hydride.

UNIT 3 ELECROCHEMICAL ENERGY 9 Hrs.

Fuel cells: Principle of working, construction and applications of phosphoric acid fuel cell – Solid oxide fuel cell – Molten carbonate fuel cell – Polymer electrolyte membrane fuel cell. Batteries: Lead-acid battery – Nickel-cadmium battery – Lithium batteries – Nickel hydride batteries.

UNIT 4 BIOENERGY 9 Hrs. Thermo-chemical Conversion: Pyrolysis – Combustion – Gasification – Liquification. Bio-Chemical Conversion:

Aerobic and Anaerobic conversion – Fermentation. Ethanol as a fuel for I.C. engines. Isolation of methane from Biogas and packing and its utilization.

UNIT 5 NUCLEAR ENERGY 9 Hrs. Nuclear Energy – Nuclear Chain reaction – Fuel enrichment – Different Types of Nuclear Reactors: Pressurised water reactor – Boiling water reactor – Fast Breeder reactor. Nuclear waste disposal – Nuclear Fusion.

Max. 45 Hours


2. Culp A. W., “Principles of Energy Conversion”, 2nd Edition, McGraw-Hill, 1991.

3. Maths D. A., “Hydrogen Technology for Energy”, Noyes Data Corp., 1976.

4. Linden D., Handbook: “Batteries and Fuel cell”, Mc.Graw Hill, 1984.

5. Bansal N. K., and Kleeman M. K., “Renewable Sources of Energy and Conversion Systems”, Tata McGraw Hill, 1990.

6. White L. P., “Biomass as Fuel”, Academic Press, 1981.

7. Raymond Murray, Keith Holbert, “Nuclear Energy: An Introduction to the Concepts, Systems, and Applications of Nuclear Processes”, 7th Edition, Elsevier Science & Technology, 2014.

8. Arniker H. J., “Essentials of Nuclear Chemistry”, New Age Publications, 1996.




PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks (10% problems may be asked)



SHS1 6 0 1 LIFE AND EMPLOYABILITY SKILLS L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVES

The course aims at equipping students to be competent in facing the challenges in today's globalized context, by providing an insight to soft skills for success and life skills for survival at the workplace.

UNIT 1 ACHIEVEMENT MOTIVATION 9 Hrs. Time Management - Positive and negative aspects of time log - Formula for successful time management.

UNIT 2 SELF-AWARENESS AND EMPATHY 9 Hrs. Work-Life Balance – Project completion Techniques – Effective Planning and Organisation - Strategies to improve team communication.

UNIT 3 DECISION MAKING 9 Hrs. Decision making techniques- types of decisions- Setting Goals and Plans - Problem Solving Techniques.

UNIT 4 EFFECTIVE COMMNICATION 9 Hrs. Non-verbal communication - means of communication – Personality development – Language and body language for interviews- Self Empowerment.

UNIT 5 NEGOTIATION SKILLS 9 Hrs. Negotiation skills – skill acquisition strategies – effective persuading skills.

Max. 45 Hours


1. Gravells, Ann. “Delivering Employability Skills in the Lifelong Learning Sector Further Education and Skills”, United Kingdom: SAGE Publications Ltd, 2010.

2. Hind, David W.G., Stuart Moss, “Employability Skills,” Business Education Publishers Ltd., United Kingdom :Tyne & Wear, 2005.

3. Rao M.S., “Enhancing Employability: Connecting Campus with Corporate”, New Delhi: I K International Publishing House Pvt. Ltd, 2010






S H S 1 6 0 2 TECHNICAL WRITING FOR SCIENTISTS L T P Credi ts Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To provide with an introduction to professional writing as a disciplinary field.

UNIT 1 INTRODUCTION TO TECHNICAL WRITING 9 Hrs. Technical Writing – Principles and procedure of technical writing; Role of a Technical writer, Various forms of Technical Writing

UNIT 2 ONLINE TOOLS 9 Hrs. Printed documentation and Online Help Systems, Working with images and illustrations, designing graphic aids.

UNIT 3 PROCESS OF WRITING 9 Hrs. Collecting and Organizing information, Drafting information verbally and visually, Producing Information, Documentation Process.

UNIT 4 REACHING THE AUDIENCE 9 Hrs. Technical Writing Process Templates and Page design, Audience Profiling.

UNIT 5 PRESENTATION 9 Hrs. Writing specialized forms as abstracts, instructions, proposals and project and lab reports

Max. 45 Hours


1. Mike Markel's “Technical Communication”, New York: Bedford/St. Martin's, 2009

2. Joseph M. Williams book Style: “Toward Clarity and Grace”, Chicago, University of Chicago Press, 1995

END SEMESTER EXAM QUESTION PAPER PATTERN: Max. Marks : 100 Exam Duration : 3 Hrs.





S H S 1 6 0 3 PROFESSIONAL COMMUNICATION AND L T P Credi ts Total Marks

ADVANCED RHETORIC 3 0 0 3 100

COURSE OBJECTIVE

To educate the learners on written communication and provide exposure to practical aspects of writing for wider audience and for scientific community.

UNIT 1 BASICS OF PROFESSIONAL COMMUNICATION 9 Hrs.

Technical Writing and Business communication (process, networks, importance, cultural variations, today’s globalized workplaces), Practical aspects of communication, Principles and procedure of technical writing, Role of a Technical writer , attention to analyzing audience and purpose, Understanding and Inventing Pedagogies for Professional Writing.

UNIT 2 PROCESS OF PROFESSIONAL COMMUNICATION 9 Hrs. Technical Writing Process Today, Genres of Technical Communication, Writing Proposals, Formats for Letters, Memos, abstracts, instructions, and proposals, and Email Messages.

UNIT 3 PRACTICAL ASPECTS OFPROFESSIONAL COMMUNICATION 9 Hrs.

Drafting and Documentation, Collecting and Organizing information , Drafting information verbally and visually, Producing Information, Documentation Process, Argument, Persuasion, Propaganda, Audience and Style, Readers and Context of Use, The participatory model of writing.

UNIT 4 PROFESSIONAL ETHICS & STRATEGIES IN CHANGING SCENARIO 9 Hrs. Ethics in Professional Communication, Applying theory to practice- analysis of papers and speeches, Writing on

line-Principles while designing web sites, Creating effective presentation slides, Speech writing- basics, scrutiny and observation, Speech writing techniques and application.

UNIT 5 PROFESSIONAL COMMUNICATION & FUTURE 9 Hrs. Future of Technical Communication, multimedia genre, Identity, Authority, and Learning to Write in New Workplaces, Writing work, technology, and pedagogy in the present era

Max. 45 Hours TEXT / REFERENCE BOOKS 1.

2.

3.

4.

5.

6.

7.

8.

9.

Dubinsky, James, ed., “Teaching Technical Communication: Critical Issues for the Classroom”. Bedford, 2004

Hawk, Byron. "Toward a Post-Techne: or, Inventing Pedagogies for Professional Writing." (TCQ)

Mara, Andrew and Byron Hawk. "Posthuman Rhetorics and Technical Communication."

Henry, Jim. “Writing Workplace Cultures: An Archaeology of Professional Writing”. SIUP, 2000.

Johnson-Sheehan, Richard. “Technical Communication Today” 3rd ed. NY: Longman, 2010.

Locker, Kitty O. and Donna S. Kienzler., “Business and Administrative Communication”. 9th ed. McGraw Hill, 2010.

Mike Markel's Technical Communication, New York: Bedford/St. Martin's, 2009

Spilka, Rachel, ed. “Digital Literacy in/for Technical Communications”. Routledge, 2009.

Spinuzzi, Clay. “Tracing Genres through Organizations: A Sociocultural Approach to Information Design (Acting with

Technology)”. MIT, 2003






SPH1601 ENERGY PHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To expose the students to the basic principles of energy conversions, materials for energy conversion and energy storage devices.

UNIT 1 ENERGY AND THERMODYNAMICS 9 Hrs. Forms of Energy, Conservation of Energy, Entropy, Heat capacity, Thermodynamic cycles: Brayton, Carnot Diesel, Otto and Rankin cycle; Fossil fuels, time scale of fossil fuels and solar energy as an option,.

UNIT 2 ENERGY CONVERSION MATERIALS 9 Hrs. Single, poly – and amorphous silicon, GaAs, CdS, Cu2S, CuInSe2, CdTe etc. technologies for fabrication of

single and polycrystalline silicon solar cells, amorphous silicon solar cells and tandem cells, solar cell modules, photovoltaic systems, space quality solar cells

UNIT 3 PHOTOVOLTAIC CON VERTORS 9 Hrs. Introduction- Photovoltaic effect-conversion of solar energy into electrical energy- behaviour of solar cells-basic

structure and characteristics of solar cells-single, multi and thin film silicon solar cells-solar cell arrays- PV modules, generators-interfacing PV modules to loads, direct connection of load to PV modules and connection of PV modules to a battery and load together-energy storage alternatives to PV systems..

UNIT 4 THERMOELECTRIC CONVERTERS 9 Hrs. Thermoelectric effects, solid state description of thermoelectric effect, Kelvin’s thermodynamic relations,

analysis of thermoelectric generators, basic assumptions, temperature distribution and thermal energy transfer for generator, co-efficient of performance for thermoelectric cooling,.

UNIT 5 ENERGY STORAGE DEVICES 9 Hrs. Cuprates and MgB2 superconductors and their properties, superconducting wires, Role of superconductor in

Electric generator, Magnetic energy storage devices and power transmission. Energy storage systems, Faradaic and non-Faradaic processes, Types of capacitors and batteries, Comparison of capacitor and battery, Charge-discharge cycles, experimental evaluation using Cyclic voltammetry, and other techniques.


1. Richard C. Neville, “Solar energy conversion: The solar cell”, Elsevier Science; 2 edition, 1995

2. Peter Aue, “Advances in Energy systems and technology”, Academic Press, 1978. 3. Frank Kreith and Jang Kreider, “Principles of solar engineering”, CRC Press; 2 edition, 2000.

4. A. E. Dixon & J. D. Leslie, “Solar energy conversion”, Science Direct, 1999. 5. A.Goetzberger, V.U.Hoffmann, “Photovoltaic solar energy generation”, Springer-Verlag, 2005.

6. Castaner, S.Silvestre, “Modelling Photovoltaic systems”, Pspice John Wiley & Sons, 2002. 7. R.J.Komp, Practical Photovoltaics, “Electricity from solar cells”, 3rd edition, Aatec Publ., 2001.

8. R.Messeiger, J.Ventre, “Photovoltaic systems Engg”, 2nd edition, CRC Press, 2004. 9. Stanley W Angrist, “Direct energy conversion” (4th edition) –Allyn and Bacon, Inc., 1982

10. B. E. Conway, “Electrochemical supercapacitors”, Kluwer Academic Press. Springer US, Apr 30, 1999 11. David Linden, “Handbook of Batteries and Fuel Cells”, McGraw-Hill, 1984

12. A.G. Milnes and D. L. Feucht, “Heterojunction and metal – semiconductor junctions“, Academic Press, 1972.

13. B.G. Streetman, “Solid state electronic devices”, 5th Edition, Prentice Hall, 2000.

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each – No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks - 80 Marks

(10% problems may be asked)



SPH1602 GEOPHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To provide a qualitative idea on the fundamentals of seismology and theoretical understanding of various physical properties of earth.

UNIT 1 SEISMOLOGY 9 Hrs. Introduction-Seismology-P-waves-S waves, their velocities-the location of epicenters-Effect of Boundaries-Major discontinuities-.Seismic

energy sources-Detectors-Interpretation of time and distance curves.-Derivation of properties from the velocities.

UNIT 2 INTERNAL STRUCTURE OF EARTH 9 Hrs. Introduction-Seismic waves-Rayleigh waves and love waves-Study of earth by seismic waves-Earthquake seismology-Horizontal and vertical seismograph-Seismograph equation-Internal structure of earth..

UNIT 3 EARTHQUAKES AND GRAVITY 9 Hrs. Earthquakes: Focus, Magnitude, Frequency–Detection and prediction–Gravity–Absolute and relative measurements of gravity-Worden

gravimeter-Application of gravity methods.

UNIT 4 GEOMAGNETISM 9 Hrs. Geomagnetism-Definitions, magnetic field,-Measurements Proton precession m a g ne to m e te r , Alkali vapour magnetometer–Theory of Earth

magnetism-Dynamo theory of earth magnetism-Magnetic surveying-application.

UNIT 5 GEOCHRONOLOGY AND GEOTHERMAL PHYSICS 9 Hrs.

Geochronology-Radioactivity of the earth-Radioactive dating of rocks and minerals-Geological time scale Geothermal Physics: Flow of heat to the surface of earth–Sources of heat within earth--Process of heat transport-Internal temperature of earth..

Max. 45 Hours


1. Cook,A.H., “Physics of the Earth and Planets”, I Ed, McMillan Press, London ,1973

2. William Lourie, “Fundamentals of Geophysics”, II Ed, Cambrige University Press, 1982

3. Garland .G.D., “Introduction to Geophysics”, 11 Ed, WB Saunder Company, London.1979

4. Ramachandra Rao M.B., “Out lines of Geophysical prospecting-A manual for Geologists”, Prasaranga University of Mysore, Mysore, 1975

5. Telford, W.M. Geldart, L. P. Sheriff R.E. and Keys .D.A., “Applied Geophysics:, Oxford–IBH Publishing Co.Pvt.Ltd. New Delhi. 1976

6. Rama Rao.B.S., Murthy I.V.R., “Gravity and magnetic methods of prospecting”, Arnold Heinemann Publishers, New Delhi, 1978



PART B : 2 questions from each unit of internal choice, each carrying 16 marks - 80 Marks



S P H 1 6 0 3 SPACE PHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To provide the Windows to the Universe, Solar System, and Planetary Atmospheres and also to expose the students to the instruments related with space physics.

UNIT 1 ASTRONOMY FUNDAMENTALS, TELESCOPES FOR ASTRONOMY 9 Hrs.

Radiation from space, radiation laws, Basic terminology used in astronomy, Introduction to the various types of astronomy: optical, radio, IR, UV, X-ray, γ ray, Gravitational etc. Introduction to Optical, IR, X ray, γ ray telescopes, brief description of the various instruments.

UNIT 2 RADIO TELESCOPES AND RECEIVERS 9 Hrs. Antennas, Types of interferometers, array, Radio telescopes of the world including GMRT, OOTY, PRL, Radio telescope receivers, total power receiver, Dicke receiver, correlation receiver, noise temperature. Noise sources.

UNIT 3 SOLAR SYSTEM, TERRESTRIAL AND JOVIAN PLANETS 9 Hrs.

Origin of solar system, occurrence of planetary systems, celestial mechanics, properties of the sun. Orbital and physical characteristics, atmosphere, Studies of Mercury, Venus, Earth, Mars, Jupiter, Saturn, Uranus, Neptune and their moons. Recent explorations of various planets..

UNIT 4 SCINTILLATION, PLASMA, IONIZATION 9 Hrs.

Interplanetary scintillation, interstellar scintillation, methods for probing solar wind, use of IPS in measurement of solar wind, study of irregularities in the interplanetary medium, properties of plasma at different distances from earth, photoionisation, cosmic ray ionization, meteoric ionization, various resonances in plasma, various waves in plasma, measurement procedures.

UNIT 5 DIAGNOSTIC TECHNIQUES FOR PROBING IONOSPHERE 9 Hrs.

Radio wave propagation in absence and presence of magnetic field, Formation of Chapman layer, Appleton Hartree equation and its explanation, propogation of radio waves at different frequencies. Ground based, balloon based, space based techniques, Ionosonde, air glow, P.R.Radar, radio scintillation, magnetometer, Langmuir probe, electrostatic analyzer, mass spectrometer, radiosonde. Max. 45 Hours TEXT / REFERENCE BOOKS 1. Glasstone. Van Nostrand, “Sourcebook on the Space Sciences”, Princeton, N.J., 1965

2. John Daniel Kraus Cygnus, “Radio Astronomy: Quasar Books”; 2nd edition, 1986

3. W.N.Christiansen & J.A.Hogbom, “ Radiotelescopes, Radio Telescopes”, 1st edition, Cambridge University Press 1969

4. H.Karttunem, P.Kroger, H.Oja, M.Poutanen, K.J.Donner, “Fundamental Astronomy”, Springer-Verlag; 2nd edition, 1994

5. N.Henbest, M.Marten, “The new Astronomy”, Cambridge University Press, 1996

6. S.K.Alurkar, ”Solar and Interplanetary Disturbances”, World Scientific Publishing Company, 1997.

7. J.A.Ratcliffe, “An introduction to ionosphere and magnetosphere”, Cambridge : Cambridge University Press, 1972

8. A.Giraud, M.Petit, “Ionosphere techniques and phenomena”, First Edition, D. Reidel Pub Co, 1978.







SPH1604 ASTROPHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To provide qualitative description of interesting astronomical aspect and evolution of structures in the

Universe.

UNIT 1 GRAVITY 9 Hrs. Newtonian gravity and basic potential theory, Simple orbits – Kepler’s laws and precession, flat rotation curve of galaxies and implications for dark

matter, virial theorem and simple applications, role of gravity in different astrophysical systems,.

UNIT 2 RADIATIVE PROCESSES 9 Hrs. Overview of radiation theory and Larmor formula, Different radiative processes : Thomson and Compton scattering, Bremsstrahlu ng, Synchrotron

[detailed derivations are not expected] Radiative equilibrium, Planck spectrum and properties; line widths and transition rates in QT of radiation,

qualitative description of which radiative processes contribute in which waveband/ astrophysical system, distribution function for photons and its m o m e n t s ,

elementary notion of radiation transport through a slab, concept of opacities.

UNIT 3 GAS DYNAMICS 9 Hrs.

Equations of fluid dynamics; equation of state in different regimes [including degenerate systems]; Models for different systems in equilibrium, Application to White dwarfs/Neutron stars, Simple fluid flows including supersonic flow, example of SN explosions and its different phases.

UNIT 4 STELLAR SYSTEM 9 Hrs. Basic equations of stellar structure, Stellar energy sources; qualitative description of numerical solutions for stars of different mass, homologous stellar models, Stellar evolution, Evolution in the HR-Diagram.

UNIT 5 GALACTIC DYNAMICS 9 Hrs. Milky Way Galaxy, Spiral and Elliptical galaxies, Galaxies as self gravitating systems; spiral structure, Supermassive black holes, Active galactic nuclei.

Max. 45 Hours


1. Bradley W . Carroll, D.A.Ostlie, “Modern Astrophysics”, Addison-Weseley, 1996 .

2. Frank H. Shu,”The physical universe: An Introduction to Astronomy”, University Science books, 1 9 8 2 .

3. Frank H. Shu, “The Physics of Astrophysics”, V o l u m e I and II, University Science books, 2 0 1 0 .

4. T. Padmanabhan, “Theoretical Astophysics”, Volumes I, II and III, Cambridge University Press; First edition, 200 1.

5. Arnab Rai Choudhuri, “The Physics of fluids and plasmas”, Cambridge University Press, 19 98.

6. Martin. Harwitt, “Astrophysical concepts”, 3 rd edition, Springer Science & Business Media, 1 9 9 8 .

7. James Binney & Michael Merrifield, “Galactic Astronomy”, Princeton University Pre ss, 1 9 9 8 .

8. James Binney & Scott Tremaine, “Galactic dynamics”, 2nd edition, Princeton University Press, 2008.

9. A. K. Kembhavi and J. V . Narlikar, “Quasars and Active Galactic Nuclei”, Cambridge University Press, 199 9.

10. Bradley M. Peterson, “An Introduction to Active Galactic Nuclei”, Cambridge University Press, 199 7.



PART A : 10 questions of 2 marks each – No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks



SPH1605 ATOMIC AND NUCLEAR PHYSICS L T P Credits Total Marks

3 0 0 3 100

COURSE OBJECTIVE

To enable the students understand the laws that govern the structure and properties of the atom, molecules and the nucleus. Also to provide an introduction to the elementary particles.

UNIT 1 IONS, ELECTRONS AND ATOMIC STRUCTURE 9 Hrs. Detection of charged particles in electric and magnetic fields-Dunnigton's method for e/m-positive ray analysis:

Thomson's parabola method-Bohr's atom model-Sommerfeld's relativistic atom model-the Vector atom model and the quantum numbers-comparison with quantum model. Coupling schemes: L-S coupling and j-j coupling–Pauli’s exclusion principle-Magnetic moment due to (i) orbital motion of the electron (ii) due to spin-Stern and Gerlach experiment

UNIT 2 ATOMIC AND MOLECULAR SPECTRA 9 Hrs. Spin-orbit interaction in atomic spectra-fine structure and sodium doublet-Zeeman effect: experiment-classical

result-Quantum mechanical explanation-anomalous Zeeman effect-Paschen Back effect-Stark effect (qualitative) Origin of a pure rotational spectra of a rigid linear molecule-vibrating diatomic molecule as a quantum harmonic oscillator-pure vibrational spectra-Spectroscopy (Schematic): Ultraviolet-Infrared-absorption-Raman.

UNIT 3 PROPERTIES OF NUCLEI AND RADIOACTIVITY 9 Hrs. Isobars, isotopes, mirror nuclei-Nuclear mass and binding energy-Parity-Nuclear spin–Mass defect and packing

fraction-Stable nuclei–Nuclear size, nuclear magnetic moment-Electric quadrapole moment-Nuclear energy levels. Radioactivity: Range and stopping power of alpha particles.-Geiger-Nuttal law-Feature of alpha decay Tunnelling–Beta ray spectrum-Energetic of beta decay-Detection of neutrino-Gamma ray absorption in matter.

UNIT 4 NUCLEAR MODELS, FISSION AND FUSION 9 Hrs. Neutron: Discovery, Mass, Half life, Magnetic Moment, sources and detection–Shell model, Liquid drop theory-

Nuclear fission–Spontaneous fission and potential barrier-Self sustaining Chain Reaction–Neutron balance in Nuclear Reactor-Uncontrolled chain reaction-Nuclear Fusion–radiation hazards and safety measures-Controlled fusion-Fusion in stars..

UNIT 5 ELEMENTARY PARTICLE PHYSICS 9 Hrs. Discovery of cosmic rays-primary and secondary rays-cosmic ray showers-discovery of positron–the mesons–

origin of cosmic rays-the Big-Bang theory-thermal history of the Universe-Hubble’s law–the future of the universe-dark matter. Particles and anti-particles-antimatter-the fundamental interactions–elementary–particle quantum numbers–conservation laws and symmetry–the Quark model–quantum chromodynamics-the standard model– unification of interactions–Grand unified theories. (Qualitative).


1. R.Murugeshan and Kiruthiga Sivaprasath, “Modern Physics” 14thEd, S.Chand and Company Ltd, 2009

2. A.B. Gupta and Dipak Ghosh, “Atomic and Nuclear Physics”, Books and Allied(P)Ltd, Calcutta, 1997

3. Ronald Gautreau and William Savin, “Modern Physics, Schaum’s outline series, 2nd Ed., Tata McGraw Hill P.Ltd, 2004 4. K.Gopla Krishnan, Atomic and Nuclear Physics”, 3rd Ed. ,MacMillan India Ltd. 1994

5. H.S.Mani and Mehta ( G.K) , “Introduction to Modern Physics”, Affiliated EWast-West Press, 1989

6. R.P.Feynmann, R.B. Leighton and M.Sands , “The Feynmann Lectures on Physics”, Vol III, 7 th Indian reprint, Narosa Pub. Ltd, 1992

END SEMESTER EXAM QUESTION PAPER PATTERN Max. Marks : 100 Exam Duration : 3 Hrs. PART A : 10 questions of 2 marks each – No choice 20 Marks PART B : 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks

SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY · 2018-04-02 · SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF COMPUTING B.E. / B. Tech REGULAR V REGULATIONS 2015 Project

Documents