M.tech Syllabus

Lingayas University, Faridabad
M.Tech. (CS) (b) Non-Two-Letter Grade Courses (i) Seminar (ii) Teaching Practice * Some electives may be pre-requisite for another elective course. The exact credits offered for the programme for the above components, the term-wise distribution among them, as well as the syllabi of all postgraduate courses offered by the department are given in the Scheme of Studies and Syllabus. The minimum credit requirement for the M.Tech. Degree is 90. The Dissertation carries 11 credits and spreads over THREE Terms, (normally during 4th to 6th Terms for full time and 7th to 9th Terms for part time students or as recommended by BOS). The progress of the Dissertation shall be monitored by the guide. Under special circumstances a student can be allowed to undertake dissertation work in industry/research laboratory/other University. The place of work has to be approved by AC. A candidate shall submit 5 copies of the Dissertation duly recommended by the guide after assessment by the committee to the Chairman, DEC, on or before the specified date. The Report shall be in the format prescribed by the University. The earliest date for the submission of dissertation shall be three weeks before the closure of the trimester in which the dissertation work credits have been registered for, and is expected to be completed, or as announced by the DAA. Extension of time beyond the announced last date for submission of the Dissertation may be granted by the DAA on recommendation from the HOD. The final evaluation is done by a Dissertation Evaluation Committee (DEC) constituted by the pertinent BOS. There shall be an open seminar followed by a viva-voice examination as part of the final evaluation. After the final evaluation, appropriate double-letter grade is recommended to DAA, for necessary action. If in the opinion of DEC, the Dissertation needs some minor modifications DEC will report to DAA along with recommended grade. The DAA shall instruct the candidate suitably to incorporate the necessary modifications and to resubmit it to the Chairman, DEC. After such resubmission, the chairman, DEC will certify that the necessary modifications have been incorporated and recommend to DAA for the acceptance and award of the grade as recommended by DEC. The title of the Dissertation shall be indicated in the Transcript. The dissertation grades will be considered for TGPA and CGPA calculation. These are courses that must be completed by the student at appropriate time as suggested by the Faculty Advisor. The S grade is awarded for satisfactory completion of the course and N grade is awarded for noncompletion of the course. In case N grade is awarded, the student has to
Important Academic Rules M.Tech. Degree Programme In Computer Science & Engineering
DISSERTATION
GENERAL
The Regulations may evolve and get revised/refined or updated or amended or modified or changed through approvals from the Academic Council from time to time, and shall be binding on all parties concerned, including the Students, Faculty, Staff, Departments, University Authorities and officers. Further, any legal disputes shall be limited to the legal jurisdiction determined by the location of the University and not that of any other parties. If, at any time after admission, it is found that a candidate had not in fact fulfilled all the requirements stipulated in the offer of admission, in any form whatsoever, including possible misinformation etc., the matter will be reported to the AC, recommending revoking the admission of the candidate. The LU reserves the right to cancel the admission of any student at any stage of his study programme in the University on the grounds of unsatisfactory academic performance or indiscipline or any misconduct. Medium of Instruction shall be English. For full-time students, the duration of study shall be a minimum of Six Terms and a maximum of FOUR years. For part-time students, the duration will be a minimum of Nine Terms and a maximum of FIVE years. There are three types of student status in the M.Tech. Degree Programme: (a) Full-time student of GATE-Scholarship (FTG) (b) Full-time/Part-time sponsored student from Industry or other Organizations including Educational Institutions (FTS/PTS) (c) Full-time/Part time non-sponsored non-scholarship student (FTN/PTN) The course content for an M.Tech. Degree Programme will typically consist of the following components. (a) Two-Letter Grade Courses (i) Compulsory Courses (ii) Programme Core Courses (iii) Elective Courses* (iv) Dissertation 1
PROGRAMME
NON TWO-LETTER GRADE COURSES
Lingayas University, Faridabad re-register for the same course wherein he has no alternative options. However, he can opt for other courses if he has been provided with multiple options. The S and N grades do not carry grade-points and hence not included in the TGPS, CGPS computations.
M.Tech. (CS) Paid all required advance payments of the university and hostel for the current term. (d) Not been debarred from registering on any specific ground by the university. The students will be permitted to register for course(s) being offered in a term other than his normal suggested scheme provided that the time table permits. The registration in the critical cases will be done as per the priority given below: (a) Fulfillment of minimum credit requirement for continuation, (b) The completion of programme in minimum period needed for degree, (Those who need to improve TGPA/CGPA) (c) The fulfillment of pre-requisite requirement of courses. Students who do not register on the day announced for the purpose may be permitted LATE REGISTRATION up to the notified day in academic calendar on payment of late fee. REGISTRATION IN ABSENTIA will be allowed only in exceptional cases with the approval of the DAA after the recommendation of HOD through the guardian of the student. Credits will be awarded in registered courses only. (c)
ASSOCIATION
Every Post Graduate student of the University shall be associated with the Parent Department, throughout his study period. The schedule of academic activities for a term, including the dates of registration, mid-term examinations, end-term examination, inter-term vacation, etc. shall be referred to as the Academic Calendar of the term, and announced at least two weeks before the closing date of the previous term. In order to facilitate proper planning of the academic activities of a term, it is essential for the students to declare their intent to register for a course well in advance, before the actual start of the academic session, through the process of Pre-Registration, which is mandatory for all those students of second or subsequent term who propose to deviate from recommended scheme of studies. Pre-registration is an expression of intention of a student to pursue particular course(s) in the next term. It is an information for planning for next term. Every effort will be made to arrange for a course opted by the student. However, it is not obligatory on the part of the university to offer the course(s) and no course may be offered if the number of students opting for the course is less than 15 or 25 percent of the admission strength whichever is less. If a student fails to pre-register it will be presumed that he will follow suggested normal scheme of studies provided that he is progressing at a normal pace. For remaining students the HOD of the parent department will plan for courses as per the convenience of the department. Every Student after consulting his Faculty-Advisor is required to register for the approved courses with the HOD of parent department at the commencement of each term on the days fixed for such registration as notified in the academic calendar. A student shall register for courses from amongst the courses being offered in the term keeping in mind the minimum and maximum credits allowed for a degree and other requirements i.e. pre-requisite, if any, TGPA & CGPA after consulting the Faculty Advisor. No registration will be valid without the consent of HOD of the parent department. A student will be permitted to register in the next term as per the suggested normal scheme only if he fulfills the following Conditions: (a) Satisfied all the Academic Requirements to continue with the programme of studies without termination. (b) Cleared all university, library and hostel dues and fines (if any) of the previous term. 3
PRE-REGISTRATION
TEACHING PRACTICE
A Student is required to do two courses (one one-credit course and the other a twocredit course) for Teaching Practice under the guidance of HOD. Here the student is required to be engaged in teaching of two UG courses of his choice each for two hours per week in any of the two terms during the programme. A student has the option to ADD courses for registration till the date specified for late registration in the Academic Calendar. On recommendation of the Teaching Department as well as the Parent Department, a student has the option to DROP courses from registration until two weeks after the commencement of the classes in the term, as indicated in the Academic Calendar. A student can register for auditing a course, or a course can be converted from credit to audit or from audit to credit, with the consent of the Faculty Advisor and Course Instructor within two weeks after the commencement of the classes in the term as indicated in the Academic Calendar. However, CORE Courses shall not be available for audit. LU academic programmes are based primarily on the formal teachinglearning process. Attendance in classes, participating in classroom discussions and participating in the continuous evaluation process are the most essential requirements of any academic programme. Attendance will be counted for each course scheduled teaching days as per the academic calendar.
REGISTRATION- REVISION

REGISTRATION TO COURSES

ATTENDANCE REQUIREMENTS
Lingayas University, Faridabad The attendance requirement for appearing in end term examination shall be a minimum of 75% of the classes scheduled in each course. The leave of absence must be authorized as per regulations. A student short of attendance in a course (less than needed after leave of absence and condonation by VC) will be awarded FF grade in the course. All students must attend all lecture, tutorial and practical classes in a course. The attendance will be counted course wise. To account for approved leave of absence e.g. representing the University in sports, games or athletics; professional society activities, placement activities, NCC/NSS activities, etc. and/or any other such contingencies like medical emergencies, etc., the attendance requirement shall be a minimum of 75% of the classes scheduled in each course to appear in the examination. A student with less attendance in a course during a trimester, in lectures, tutorials and practicals taken together as applicable, shall be awarded FF grade in that course, irrespective of his academic performance, and irrespective of the nature of absence. If the period of leave is more than three days and less than two weeks, prior application for leave shall have to be submitted to the HOD concerned, with the recommendation of the Faculty-Advisor, stating fully the reasons for the leave requested, along with supporting documents. If the period of leave is two weeks or more, prior application for leave shall have to be made to the DAA with the recommendations of the Faculty-Advisor, HOD concerned stating fully the reasons for the leave requested, along with the supporting documents. The DAA may, on receipt of such application, grant leave or decide whether the student be asked to withdraw from the course for that particular term because of long absence. If a student fails to apply and get sanction for absence as in (a) and (b) above, his parent/guardian may apply to the VC with reasons duly recommended by the faculty advisor, HOD and DAA and explain in person to the VC the reasons for not applying in time. The VC will consider on merit and decide to grant the leave or withdrawal from the course for that particular term subject to any condition that he may like to impose. The decision of the VC shall be final and binding. A student who has been absent during Mid-term Examination due to illness and/or any exigencies may give a request for make-up examination within one week after the Mid-term Examination to the HOD with necessary supporting documents in person. The HOD may consider such requests depending on the merits of the case, and after consultation with the course instructor, may permit the Make-up examination for the Student concerned. However, no makeup examination will be permitted if the attendance in the course is less than 60% till the date of examination. 5
M.Tech. (CS) In case of absence from End-term Examination of a course(s) on Medical ground and/or other special circumstances, the student can apply for award of I grade in the course(s) with necessary supporting documents and certifications by an authorized person to the HOD within one week after the End-term Examination. The HOD may consider the request, depending on the merit of the case, and after consultation with the Course(s) Instructor(s)/ faculty advisor permit the MET Examination for the student concerned. The student may subsequently complete all course requirements within the date stipulated by BOS (which may possibly be extended till first week of trimester under special circumstances) and I grade will then be converted to an appropriate Double-letter grade, as per Clause No: G5.9. All the details of such a decision with date of finalizing the grade shall be communicated to DAA. If such an application for the I grade is not made by the student then a double-letter grade will be awarded based on his term performance.
LEAVE OF ABSENCE

COURSE CREDIT ASSIGNMENT

Every Course comprises of specific Lecture-Tutorial-Practical (L-T-P) Schedule. The credits for various courses are shown in the Schemes of Studies & syllabus. The Academic Performance Evaluation of a Student shall be according to a Letter Grading System, based on the Class Performance Distribution. The double-letter grade (AA, AB, BB, BC, CC, CD, DD, FF) indicates the level of academic achievement, assessed on a decimal (0-10) scale. Letter-Grades and Grade-Points: LETTER-GRADE GRADE-POINTS AA 10 AB 9 BB 8 BC 7 CC 6 CD 5 DD 4 FF 0 I U W S N REMARKS
ABSENCE DURING EXAMINATIONS
Fail Incomplete Audited Withdrawal Satisfactory Unsatisfactory
DESCRIPTION OF GRADES An 'AA' grade stands for outstanding performance, relative to the class which may include performance with previous batches. The Course Instructor is supposed to take utmost care in awarding of this highest double-letter grade. The 'DD' grade stands for marginal performance and is the minimum passing double-letter grade. 6
Lingayas University, Faridabad The `FF grade denotes very poor performance, i.e. failure in a course, and the Course Instructor is supposed to take utmost care while awarding this lowest double-letter grade. A student, who obtains 'FF' grade in a core course, has to repeat (reregister) that core course, in subsequent trimesters/sessions whenever the course is offered, until a passing grade is obtained. However, for an elective course in which FF grade has been obtained, the student may either repeat the same course, or register for any other elective course. An I' grade denotes incomplete performance in any course due to absence at the end term examination (see also Clause No: G7.4). When the I' grade is converted to a regular double letter grade, a penalty of ONE Grade-Point is imposed, by awarding the double-letter grade that is immediately below the one that the student would have otherwise received except when the student has 95% attendance record in the subject concerned. For example, if on the basis of the performance including MET Examination, a student gets AB grade, he hill be awarded BB grade if not under exception rule. U grade is awarded in a course that the student opts to register for audit. It is not mandatory for the student to go through the entire regular process of evaluation in an audit course. However, the student has to go through some process of minimal level of evaluation and also the minimum attendance requirement, as stipulated by the Course Instructor and approved by the corresponding BOS, for getting the U grade awarded in a course, failing which that course will not be listed in the Grade Card. A W' grade is awarded when the student withdraws from the course. Withdrawal from a course is permitted only under extremely exceptional circumstances (like medical emergencies, family tragedies and/or other unavoidable contingencies) and has to be recommended by the HOD and approved by the DAA. However, no withdrawal is permitted after the finalization of the grades in the term. S/N These grades are awarded for the Mandatory Learning Courses. The 'S' grade denotes satisfactory performance and completion of a course. The `N' grade is awarded for noncompletion of course requirements and the student will have to register for the course until he obtains the S' grade. A student requires feedback on the progress of his learning. For this purpose, the Instructor will conduct at least two quizzes for a theory course in a term-one before Mid-term Examination and the other there after. The quizzes will form a component of class work, the other components being tutorials, home assignments or any other mode. For a laboratory course, the continuous assessments feed back will be given through the laboratory records which are required to be submitted after performing the experiment in the next laboratory class. The double-letter grade awarded to a student in a course other than a practical course i.e. 0-0-P course for which he has registered, shall 7
M.Tech. (CS) be based on his performance in quizzes, tutorials, assignments etc., as applicable, in addition to one mid-term examination and end-term examination. The weightage of these components of continuous evaluation may be as follows: End-term Examination Mid-term Examinations Quizzes, Tutorials, Assignments, etc. (Several over the term) Total : : : : 50% 30% 20% 100%
The double letter grade awarded to the student in a practical course i.e. 0-0-P course will be based on his performance in regular conduct of experiments, viva voce, laboratory report, quizzes etc., in addition, to term practical examination. The weightage of the components of continuous evaluation may be as follows: Conduct of Experiments (as per syllabus) : 40% Lab Record : 10% Quizzes/Viva Voice : 20% End-term Examination : 30% Total : 100% The University shall conduct the End-term examination for all theory courses being taught in the term. The answer books of all Mid-term Examination and End-term Examination will be shown to the students within three days of the last paper. It is the responsibility of the student to check this evaluation and affix his signature in confirmation. If the student finds some discrepancy, he should bring it to the notice of the Course Coordinator. The Course Coordinator will look into the complaint and remove the doubts of the student and proceed with the work of grading. If a student is not satisfied with the award of the grade after the announcement of the grades, he may appeal on a Grievance Form duly filled in along with the fee receipt for this purpose to the HOD of the parent department within one week of the following term. The HOD will forward the form along with his recommendation based on the records of the case to DAAB within the date specified in the Academic Calendar. The duration of examinations for a theory course will be 3 hours for endterm examination 1 hours for mid-term examination. The pattern of question paper/examination will be as under: Theory Courses: The University shall conduct the End-term examination for all theory courses being taught in the term. (a) There will be eight questions in all distributed over all the units in a course syllabus. The question paper will be in three parts with weightage 20 percent, 40 percent and 40 percent respectively. (b) Part-A will be short answer type with multiple parts covering all the units in the syllabus, which will be compulsory.
FEEDBACK TO STUDENTS
SCHEME OF EXAMINATION

EVALUATION
8
Lingayas University, Faridabad (c) Part-B will have three questions from any three units, which will have long answers of derivation/descriptive type. Two questions are to be answered from this part. (d) Part-C will consist of four questions from the remaining four units and they will be of problem solving type in order to measure ability on comprehension/ analysis/ synthesis/ application. The relevant data will be made available. The student is required to solve two questions. However, for Part-C, the external examiner may select the questions from the question bank supplied by LU. Students are allowed in the examination the use of single memory, nonprogrammable calculator. However, sharing of calculator is not permitted. Laboratory Courses: (a) The End-term Examination in laboratory course will be conducted jointly by an external examiner (other than the instructor) and an internal examiner (the coordinator / instructor) jointly. (b) The student will be given randomly an experiment to perform from within the list of experiments in the course. (c) No change in the experiment will be permitted after the draw, if the student had performed the same in the class. Mid-Term Examination: Question 1 is compulsory covering all topics taught till then. Question 2 and 3 will be essay type, out of which student will answer any one. Question 4 and 5 will be to measure to ability of analysis / comprehension / synthesis / application. The student will answer any one. The answer books of all Mid-term Examination and End-term Examination will be shown to the students within three days of the last paper. It is the responsibility of the student to check this evaluation and affix his signature in confirmation. If the student finds some discrepancy, he should bring it to the notice of the Course Coordinator. The Course Coordinator will look into the complaint and remove the doubts of the student and proceed with the work of grading. The entire process of evaluation shall be transparent, and the course instructor shall explain to a student the marks he is awarded in various components of evaluation. The final marks shall be displayed on the notice board for ONE day, (the date of which will be indicated in the academic calendar). A student can approach the concerned course instructor(s) for any clarification within Two days of display. The process of evaluation shall be transparent and the students shall be made aware of all the factors included in the evaluation. In case of any correction, the course instructor shall have to incorporate the same before finalization of the grades. The Students Grade Card shall contain the Letter-Grade for each registered course; along with the TGPA at the end of the term, and the CGPA at the completion of the programme. 9
M.Tech. (CS)
APPEAL FOR REVIEW OF GRADE

The entire process of evaluation shall be transparent, and the course instructor shall explain to a student the marks he is awarded in various components of evaluation. In case of any grievance about the grades, the student may appeal for review of grades to the Departmental Academic Appeals Board (DAAB) before the date specified in Academic Calendar. The fee for such an appeal will be decided from time to time. If the appeal is upheld by DAAB, then the fee amount will be refunded to the student without interest. VC shall have power to quash the result of a candidate after it has been declared, if (a) he is disqualified for using malpractice in the examination; (b) a mistake is found in his result; (c) he is found ineligible to appear in the examination The overall performance of a student will be indicated by two indices: (i) TGPA which is the Term Grade Point Average (ii) CGPA which is the Cumulative Grade Point Average TGPA for a Term is computed as follows: TGPA = CiGi / Ci Where, th Ci denotes credits assigned to i course with double-letter grade, and Gi denotes the grade point equivalent to the letter grade obtained by th the student in i course with double-letter grade, including all FF grades in that term. CGPA is computed as follows: CGPA = CiGi / Ci Where, th Ci denotes credits assigned to i course with double-letter grade, and Gi denotes the grade point equivalent to the letter grade obtained by the th student in i course for all courses with double-letter grades, including all FF grades in all terms at the end of the programme. For CGPA calculation, the following grades are to be counted: (i) Grades in all core courses, (ii) The best grades in the remaining eligible courses to fulfill the minimum credits requirement for a programme. The degree will be awarded only upon compliance of all the laid down requirements for programme as under: (i) There shall be University requirement of earning a minimum credits for a degree, satisfactory completion of mandatory learning courses and other activities as per the course structure. (ii) There shall be a minimum earned credit requirement on all Departmental core courses, Elective course and Major Project as specified by BOS.
AWARD OF DIVISIONS
TRANSPARENCY
RESULT

10
Lingayas University, Faridabad (iii) There shall be a maximum duration for complying to the degree requirement. (iv) The candidate will be placed in First Division with Honours / First Division with Distinction/First Division/Second Division which will be mentioned on the degree certificate as under: DIVISION CONDITIONS TO BE FULFILLED First Division with Honours First Division with Distinction First Division CGPA 8.5 No FF, N or W grade in any course during the programme CGPA
M.Tech. (CS) * If at any stage, a student fails to cross the threshold with a minimum CGPA of 5.5, he will be treated as a critical case and will be advised to improve the grades. Note: The period of temporary withdrawal is not to be counted for the above Credit Threshold. (b) If a student is absent for more than 4 (Four) weeks in a Term without sanctioned leave. (c) Based on disciplinary action to that effect approved by the AC, on the recommendation of the appropriate committee. Under any circumstances of termination, the conditions specified in Permanent Withdrawal shall also apply.
CGPA Second Division CGPA Note: Although, there is no direct conversion from grades to marks, however, for comparison purposes percentage of marks may be assumed to be CGPA multiplied by nine.
8.5 6.75 5.0 but < 6.75
WITHDRAWAL FROM PROGRAMME

Temporarily: A student who has been admitted to a degree programme of the University may be permitted to withdraw temporarily, for a period of one term or more, on the grounds of prolonged illness or grave calamity in the family, etc., provided: (i) He applies to the LU stating fully the reasons for withdrawal together with supporting documents and endorsement from his parent / guardian (ii) There are no outstanding dues or demands, from the Departments / LU / Hostels / Library and any other centers; (iii) Scholarship holders are bound by the appropriate Rules applicable to them. (iv) The decision of the VC of the LU regarding withdrawal of a student is final and binding. Normally, a student will be permitted only one such temporary withdrawal during his tenure as a student and this withdrawal will not be counted for computing the duration of study. Permanently: Any student who withdraws permanently admission before the closing date of admission for the Academic Session is eligible for the refund of fee as per the University rules. Once the admission for the year is closed, the following conditions govern withdrawal of admission: A student who wants to leave the LU for good, will be permitted to do so (and take Transfer Certificate from the LU, if needed), only after clearing all the dues for the remaining duration of the course. A student who has received any scholarship, stipend or other form of assistance from the LU shall repay all such amounts, in addition, to those mentioned in clause No. G8.2 (a) above. The decision of the VC regarding all aspects of withdrawal of a student shall be final and binding. *****
M. TECH. DEGREE REQUIREMENTS

The requirements for the M.Tech. degree programme are as follows: (a) University Requirements: (i) Minimum Earned Credit Requirement for Degree which is 90. (ii) Securing a CGPA of at least 5.5. (iii) Satisfactory completion of Seminars & Teaching Practice (b) Programme Requirements: Minimum Earned Credit Requirements on all compulsory courses, Core Courses, Elective Courses and dissertation as specified by the BOS and conforming to Course Structure given above. (c) The Maximum duration for a student for complying to the degree requirement from the date of registration for his first Term, is FOUR years for full-time registration and FIVE years for part-time registration. A student may be allowed to improve CGPA in an appropriate term if his CGPA falls below 5.5. A student shall be required to leave the University without the award of the Degree, under the following circumstances: (a) If a student fails to earn the minimum credits specified below: (i) Full-time student Check Point End of FIRST year (ii) Part-time student Check Point End of FIRST year End of SECOND year Credit Threshold * 20 Credit Threshold * 15 30 11
GRADE IMPROVEMENT
TERMINATION FROM THE PROGRAMME
12
M.Tech. (CS)
OBJECTIVES
To impart dynamic and quality technical education of highest order to the students in the field of Computing, making them fit to analyze and mould themselves according to the needs of academia and/or industry from time to time. The students would have gained strong exposure to the technological developments in various spheres of Computing and preparing for future challenges, such as Knowledge Handling: Artificial Intelligence, Data Mining, Natural Language Processing, Expert Systems, Image Processing, etc., Software Development: Software Engineering, Software Project Management, etc., Advanced Computing: Advanced Computer Architecture, Pervasive Computing, etc.
Scheme of Studies & Detailed Syllabus M. Tech. Computer Science & Engineering Full Time/Part Time
The students would also be prepared to take up research and development in these areas. Students learn to solve real life problems using software tools such MATLAB, Visual Prolog, .NET, etc.
13
14
M.Tech. (CS)
OF STUDIES FOR THE MASTER OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING FULL TIME PROGRAMME Year- I
Course No. CS-501 CS-502 CS-503 CS-551 CS-553 TERM-I Theory of Computations Analysis & Design of Algorithms Advanced Database Management Systems Simulation Lab Advanced Database Management Systems Lab 15-3-8 (26) L-T-P 5-1*-0 5-1*-0 5-1*-0 0-0-4 0-0-4 Cr 4 4 4 2 2 16 Course No. Course No. CS-504 CS-505 CS-506 CS-555 TERM-II Computer System Software Object Oriented Software Engineering Advanced Computer Networks Elective I (any one) Software Engineering Lab 20-3-4 (27) L-T-P 5-1*-0 5-1*-0 5-1*-0 5-0-0 0-0-4 Cr 4 4 4 3 2 17 Course No. CS-659 CS-660 Course No. CS-515 CS-516 CS-566 CS-574 TERM-III Data Warehousing & Data Mining Advanced Operating Systems Elective II (any one) Advanced Operating Systems Lab Seminar I 15-2-6 (23) L-T-P 5-1*-0 5-1*-0 5-0-0 0-0-4 0-0-2 Cr 4 4 3 2 1 14 CS-661 CS-605 CS-656 CS-657 CS-658 Course No. CS-601 CS-602 CS-652 CS-653 CS-654
SCHEME OF STUDIES FOR THE MASTER OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING FULL TIME PROGRAMME Year- II
TERM-IV Knowledge Based System Design Soft Computing Soft Computing & AI Lab Dissertation Preliminary** Seminar-II 10-1-18 (29) L-T-P 5-0-0 5-1*-0 0-0-4 0-0-10 0-0-4 Cr 3 4 2 (5) 2 11
TERM-V Embedded Systems Design Dissertation Phase - I** Minor Project Seminar-III 5-1-24 (30)
L-T-P 5-1-0 0-0-12 0-0-8 0-0-4
Cr 4 (6) 4 2 10
TERM-VI Dissertation Phase II Teaching Practice-I*** Teaching Practice-II 0-0-24 (24)
L-T-P 0-0-24
Cr 12+5+6 (2) 2+2 27
15
16
Lingayas University, Faridabad IMPORTANT NOTE There are a total of two electives in the M. Tech. Programme and the student should choose two electives from any one of the following groups, selecting one from Level 5 and the other from Level 6: Group 1 Level 5 Courses Information Storage & Management Bluetooth Technology Cryptography and Data Compression Network Security Management Level 6 Courses Distributed Computing Mobile Computing Pervasive Computing Group 2 Level 5 Courses CS-511 CS-512 CS-513 CS-514 Digital Image Processing Computer Vision Robotics
M.Tech. (CS)
SCHEME OF STUDIES FOR THE MASTER OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING PART TIME PROGRAMME Year- I
Course No. CS-501 CS-502 CS-551 TERM-I Theory of Computations Analysis & Design of Algorithms Simulation Lab 10-2-4 (16) L-T-P 5-1*-0 5-1*-0 0-0-4 Cr 4 4 2 10
CS-507 CS-508 CS-509 CS-510
CS-517 CS-518 CS-519
Advanced Computer Architecture Level 6 Courses Speech Recognition & CS-520 Generation Natural Language CS-521 Processing CS-522 Expert Systems CS-523 Bioinformatics
Course No. CS-504 CS-505 CS-555
TERM-II Computer System Software Object Oriented Software Engineering Software Engineering Lab 10-2-4 (16)
L-T-P 5-1*-0 5-1*-0 0-0-4
Cr 4 4 2 10
Students should carefully understand the importance of selecting electives, discuss with faculty advisors/members and should indicate the electives during second term of the full time programme and sixth term of the part time programme. Once selected, changes in the electives shall not be entertained.
(L-T-P-Cr) - Lectures-Tutorials-Practicals-Credits FINAL EVALUATION IN GRADES * ** *** Period will be used for self study resulting in submission of Term Paper. Credits earned (5/6) through evaluation will be added in Term-VI under course CS-659 Dissertation Phase-II. Credits earned (2) through evaluation will be added under course CS-661 Teaching Practice-II. It is a mandatory learning course. Course No. CS-503 CS-506 CS-553 TERM-III Advanced Database Management Systems Advanced Computer Networks Advanced Database Management Systems Lab 10-2-4 (16) L-T-P 5-1*-0 5-1*-0 0-0-4 Cr 4 4 2 10
17
18
M.Tech. (CS)
SCHEME OF STUDIES FOR THE MASTER OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING PART TIME PROGRAMME Year- II
Course No. CS-516 TERM-IV Advanced Operating Systems Elective-I (any one) CS-566 Advanced Operating Systems Lab 10-1-4 (15) L-T-P 5-1*-0 5-0-0 0-0-4 Cr 4 3 2 9 Course No. CS-605 CS-653 CS-654
SCHEME OF STUDIES FOR THE MASTER OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING PART TIME PROGRAMME Year- III
TERM-VII Embedded Systems Design Dissertation Preliminary** Seminar II 5-1-14 (20) L-T-P 5-1*-0 0-0-10 0-0-4 Cr 4 (5) 2 6
TERM-V Knowledge Based System Design Soft Computing Soft Computing & AI Lab 10-1-4 (15)
L-T-P 5-0-0 5-1*-0 0-0-4
Cr 3 4 2 9
TERM-VIII Data Warehousing and Data Mining Dissertation Phase - I** Seminar III 5-1-16 (22)
L-T-P 5-1*-0 0-0-12 0-0-4
Cr 4 (6) 2 6
Course No.
TERM-VI Elective-II (any one)
L-T-P 5-0-0 0-0-8 0-0-2
Cr 3 4 1 8
TERM-IX Dissertation Phase - II Teaching Practice-I*** Teaching Practice-II 0-0-24 (24)
L-T-P 0-0-24
Cr 12+6+5 (2) 2+2 27
CS-657 CS-574
Minor Project Seminar I 5-1-8 (14)
19
20
Lingayas University, Faridabad IMPORTANT NOTE There are a total of two electives in the M. Tech. Programme and the student should choose two electives from any one of the following groups, selecting one from Level 5 and the other from Level 6: Group 1 Level 5 Courses Information Storage & Management Bluetooth Technology Cryptography and Data Compression Network Security Management Level 6 Courses Distributed Computing Mobile Computing Pervasive Computing Group 2 Level 5 Courses CS-511 CS-512 CS-513 CS-514 Digital Image Processing Computer Vision Robotics
M.Tech. (CS)
CS-501
1.
THEORY OF COMPUTATIONS
LTP 510
Cr 4
2. 3. 4. 5. 6. 7.
CS-507 CS-508 CS-509 CS-510
CS-517 CS-518 CS-519
Advanced Computer Architecture Level 6 Courses Speech Recognition & CS-520 Generation Natural Language CS-521 Processing CS-522 Expert Systems CS-523 Bioinformatics
INTRODUCTION: Regular grammar and finite automata; NDFA and DFA; NDFA to DFA conversion; Pumping Lemma to checking the regularity of regular grammars; reduction of states and design of equivalent finite automata CONTEXT-FREE GRAMMARS: Possible defects in CFG and their removal; Chomsky and Greibach Normal Form PUSH DOWN AUTOMATA: Push down automata; design of CFG corresponding to PDA and vice versa; design of parser using PDA; Linear bound automata TURING MACHINES: Turing machines as language recognizer; Computer for positive integers; enumerator and universal Turing machine; halting problem MULTI-TAPE TURNING MACHINES: Multi-tape and multi-head Turing machine; Post Machine SOLVABILITY AND UN-DECIDABILITY: Rices theorem; equivalence of general recursive and Turing computable function; primitive recursive function; Post-correspondence problem. COMPLEXITY THEORY: Introduction to complexity theory and finding the time complexity of Turing Machine Hopcroft and Ullman O. D., Mothwani R., Introduction to Automata Theory, Language & Computations, Addison Wesley, 2001 Mishra K. L. P. and Chandrasekaran N., Theory of Computer Sc. (Automata, Languages and Computations), Prentice Hall of India, 2000 Peter LinZ, Introduction to Formal Languages & Automata, Narosa Publ., 2001 Greenlaw Ramond and Hoover H. James, Fundamentals of the Theory of Computation Principles and Practice, Harcourt India Pvt. Ltd., 1998 Lewis H. R. and Papaditriou C. H., Elements of Theory of Computation, Prentice Hall of India, 1998 Martin John C., Introduction to Languages and the Theory of Computation, Tata McGraw Hill, 2003
REFERENCE BOOKS
1. 2. 3. 4. 5. 6.
Students should carefully understand the importance of selecting electives, discuss with faculty advisors/members and should indicate the electives during second term of the full time programme and sixth term of the part time programme. Once selected, changes in the electives shall not be entertained.
(L-T-P-Cr) - Lectures-Tutorials-Practicals-Credits FINAL EVALUATION IN GRADES * ** *** Period will be used for self study resulting in submission of Term Paper. Credits earned (5/6) through evaluation will be added in Term-IX under course CS-659 Dissertation Phase-II. Credits earned (2) through evaluation will be added under course CS-661 Teaching Practice-II. It is a mandatory learning course.
CS-502
1.
ANALYSIS & DESIGN OF ALGORITHMS
LTP 510
Cr 4
INTRODUCTION TO ALGORITHMS: Introduction to algorithms; correctness and efficiency; correctness; efficiency; expressing algorithms; keeping score; the RAM model of computation; best, worst, and average-case complexity; the Big Oh notation; growth rates; logarithms; modeling the problem
21
22
Lingayas University, Faridabad 2. DATA STRUCTURES AND SORTING: Fundamental data types; containers; dictionaries; binary search trees; priority queues; specialized data structures; sorting; applications of sorting; approaches to sorting: data structures; incremental insertion; divide and conquer, randomization, bucketing techniques. BREAKING PROBLEM DOWN: Dynamic programming; Fibonacci numbers; the partition problem; approximate string matching; longest increasing sequence; minimum weight triangulation; limitations of dynamic programming GRAPH ALGORITHMS: The friendship graph; data structures for graphs; war story: getting the graph; traversing a graph: breadth-first search, depth-first search; applications of graph traversal: connected components, tree and cycle detection, two-coloring graphs, topological sorting, articulation vertices; modeling graph problems; minimum spanning trees: Prim's algorithm; Kruskal's algorithm; shortest paths: Dijkstra's algorithm; All-Pairs shortest path. COMBINATORIAL SEARCH AND HEURISTIC METHODS: Backtracking: constructing all subsets, constructing all permutations, constructing all paths in a graph; search pruning; bandwidth minimization; heuristic methods; simulated annealing: traveling salesman problem, maximum cut, and independent set; circuit board placement; neural networks; genetic algorithms; parallel algorithms. INTACTABLE PROBLEMS AND APPROXIMATIONS: Problems and reductions; simple reductions: Hamiltonian Cycles, Independent set and vertex cover, clique and independent set; satisfiability: the theory of NPCompleteness, 3-satisfiability; difficult reductions: integer programming, vertex cover; other NP-complete problems; the art of proving hardness; approximation algorithms: approximating vertex cover, the Euclidean traveling salesman A CATALOG OF ALGORITHM PROBLEMS: Data structures; numerical problems; combinatorial problems; graph problems - polynomial-time problems; graph problems - hard problems; computational geometry; set and string problems
M.Tech. (CS)
WEB REFERENCES
1. 2. 3. 4. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html http://www.fib.upc.edu/en/infoAca/estudis/assignatures/ADA.html http://www.aw-bc.com/info/levitin/ http://www.cse.iitd.ernet.in/~ssen/csl356/notes/root.pdf
3.
4.
CS-503
1. 2. 3. 4. 5.
ADVANCED DATABASE MANAGEMENT SYSTEMS
LTP 510
Cr 4
5.
6.
6. 7.
7.
INTRODUCTION: Architecture advantages; disadvantages; data models; relational algebra; SQL normal forms QUERY PROCESSING: General strategies for query processing; transformations; expected size; statistics in estimation; query improvement; view processing; query processor RECOVERY: Reliability; transactions; recovery in centralized DBMS; reflecting updates; buffer management; logging schemes; disaster recovery CONCURRENCY: Introduction; serializability; concurrency control; locking schemes and timestamp based order; optimistic scheduling; multi-version techniques and deadlocks OOD DEVELOPMET AND IMPLEMENTATION THROUGH ORACLE: Introduction; object definition language; creating object instances; object query language; object relational databases: basic concepts; enhanced SQL; advantages of object relational approach; basic concepts of PL SQL DISTRIBUTED DATABASES: Basic concepts; options for distributing a database; distributed DBMS. DATA WAREHOUSING: Introduction basic concepts; data warehouse architecture; data characteristics; reconciled data layer data transformations; derived data layer user interface Ramakrishnan Raghu, Database Management System, McGraw Hill, 3rd Edition, 2003 Elmasri R. and Navathe S. B., Fundamentals of Database Systems, 3rd edition, Addison Wesley, Low Priced Edition, 2000. Tamer M. and Valduricz, Principles of Distributed Database Systems, 2nd edition, Pearson Education, 1999 Silbershatz A., Korth H. F. and Sudarshan S., Database System Concepts, 5th edition, McGraw-Hill, International Edition, 2005. Desai Bipin C., An Introduction to Database Systems, 11th Edition, Galgotia Publications/West Group, 1990 lioffer Feffray A., Prescotl Mary B., and McFadden Fred R., Modern Database Management, 9th edition, Pearson Education/Prentice Hall, 2008
REFERENCE BOOKS
1. 2. 3. 4. 5. 6.
REFERENCE BOOKS
1. 2. 3. 4. 5. 6. Sahni Sartaj, Horowitz Ellis, Fundamentals of Computer Algorithms, Galgotia Publications, 1993 Skiena Steven S., The Algorithm Design Manual, Department of Computer Science, State University of New York, Stony Brook, NY 11794-4400, 2nd Edition, Springer, 2008 Aho A.V., Hoproft J. E. and Ullman J. D., Design & Analysis of Algorithms, Addison Wesley, 1974 Dasgupta, Algorithms, 1st Edition, Tata McGraw Hill, 2006 Knuth Donald E., Fundamental Algorithms (The Art of Computer Programming Vol I), 3rd Edition, Addison Wesley, 1997 Dijkstra E. D., A Discipline of Programming, Prentice Hall, 1976 23
24
M.Tech. (CS)
WEB REFERENCES
1. 2. 3. 4. http://www.cse.iitb.ac.in/dbms/Data/Courses/CS632/ http://pages.cs.wisc.edu/~dbbook/openAccess/thirdEdition/slides/slides3 ed.html http://www.bcs.org/server.php?show=ConWebDoc.3409 http://www.cs.brown.edu/courses/cs227/papers.html
CS-505
1.
OBJECT ORIENTED SOFTWARE ENGINEERING
LTP 510
Cr 4
CS-504
1.
COMPUTER SYSTEM SOFTWARE
LTP 510
Cr 4
2.
2. 3. 4. 5. 6. 7.
INTRODUCTION: Introduction to object oriented programming; object oriented design; concepts of classes; objects; abstraction; encapsulation; inheritance; function overloading; virtual functions; function overriding; templates OBJECT MODELING: Object modeling: class and object diagrams; association; aggregation; generalization; dynamic modeling and function modeling UML: Introduction to UML: class diagrams; use cases; interaction diagrams; collaboration diagrams; deployment diagrams CLASS DESIGN: Principles of class design: open close principle; Liskovs substitution principle; dependency inversion principle; package cohesion principle SYSTEM SOFTWARE DESIGN: System software design issues; design of assemblers; macro processors; linkers and loaders; dynamic linking. KINDS OF SYSTEM SOFTWARES: Loading programs; operating systems; device drivers; linkers; utility software. PROBLEMS AND PATTERNS: Creational patterns; structural patterns; behavioral patterns; object orientation and databases Lafore Robert, Object Oriented Programming with C++, 4th Edition, Sams Publications, 2001 Rambaugh James, Object Oriented Modeling and Design, Prentice Hall of India, 1991 Dhamdhere, System Programming, 2nd Edition, Tata McGraw Hill, 1996 Donovan J. J., System Programming, Tata McGraw Hill, 1972 Booch Grady, Object Oriented Analysis and Design, 3rd Edition, Addison Wesley, 2007 http://online.onetcenter.org/link/summary/15-1032.00 http://en.wikipedia.org/wiki/Software http://www.jegsworks.com/Lessons/lesson8/lesson8-1.htm
3. 4. 5. 6.
7.
REFERENCE BOOKS
1. 2. 3. 4. 5.
REVIEW OF OBJECT ORIENTED SYSTEMS: Design objects;, class hierarchy; inheritance; polymorphism; object relationships and associations; aggregations and object containment; object persistence; meta classes; object oriented systems development life cycle; software development process; object oriented systems development: a use case driven approach OBJECT ORIENTED ANALYSIS: Analysis process; use case driven object oriented analysis; use-case model; object classification; theory; different approaches for identifying classes, classes, responsibilities and collaborators; identifying object relationships; attributes and methods; super sub class relationships; A- part of relationships aggregation; class responsibilities; object responsibilities OBJECT ORIENTED DESIGN: Object oriented design process; corollaries; design axioms; design patterns; object oriented design philosophy METHODOLOGY FOR OBJECT ORIENTED DESIGN: Object modeling technique as software engineering methodology; Rumbaugh methodology; Jacobson Methodology; Booch Methodology UNIFIED APPROACH FOR OBJECT ORIENTED DESIGN: Patterns, frameworks; the unified approach, unified modeling language (UML). UML: Why we model; types of models; principles of modeling; object oriented modeling; object oriented concepts; UML notation; object oriented analysis: use case diagrams, interaction diagrams, activity diagrams; object oriented design: class diagrams, object diagrams, state diagrams; collaboration diagrams, post-testing: deployment diagrams, patterns, frameworks USING UML FOR OOD: UML object constraint language; designing classes: The process, class visibility, refining attributes, designing methods ad protocols; packages and managing classes; designing interface objects; view layer interface design; macro and micro level interface design process Jacobson Ivar, Object Oriented Software Engineering, Addison Wesley, 1995 Bennett, Object Oriented System Analysis and Design using UML, Tata McGraw Hill, 3rd edition, 2005 Bahrami Ali, Object Oriented Systems Development, McGraw Hill, 1999 Rumbaugh et al, Object Oriented Modeling and Design, Prentice Hall of India, 1997 Booch Grady, Object Oriented Analysis and Design, 3rd Edition, Addison Wesley, 2007 Mehta Subhash and Basandra Suresh K., Object Oriented Software Engineering, Galgotia Publications
REFERENCE BOOKS:
1. 2. 3. 4. 5. 6.
WEB REFERENCES
1. 2. 3.
25
26
M.Tech. (CS) IPSec; firewalls; virtual private networks; network address translation; authentication protocols; social issues
WEB REFERENCES
1. 2. 3. http://www.site.uottawa.ca/school/research/lloseng/supportMaterial/slide s/ http://www.cse.lehigh.edu/~glennb/oose/oose.htm http://www.agiledata.org/essays/objectOrientation101.html
REFERENCE BOOKS
Forouzan Behrouz, TCP/IP Protocol Suite, 2nd Edition, Tata McGraw Hill 2. Forouzan Behrouz A., Data Communications and Networking, 4th Edition, Tata McGraw Hill, 2006 3. Smith and Collins, 3G Wireless Networks, Tata McGraw Hill, 2007 4. Rappaport Theodore S., Wireless Communication- Principles and Practices, 2nd Edition, Pearson Education, 2003. 5. Stallings William, Data and Computer Communications, 7th Edition, Pearson Education 6. Stallings William, Cryptography and Network Security Principles and Practices, 3rd Edition, Prentice Hall of India, 2003. 7. Bruce Schneier, Applied Cryptography, John Wiley & Sons Inc, 2001. 8. Pfleeger Charles B., Pfleeger Shari Lawrence, Security in Computing, Third Edition, Pearson Education, 2003. 9. Tanenbaum Andrew S., Computer Networks, 4th Edition, Pearson Education/ Prentice Hall of India, 2002 10. Gallo Michael A. and Hancock William M., Computer Communications and Networking Technologies, 1st Edition, Thomson Publication, 2001 1.
CS-506
1.
ADVANCED COMPUTER NETWORKS
LTP 510
Cr 4
2. 3.
4.
5.
6.
7.
BASIC CONCEPTS: Network architecture: protocol hierarchies, layered model, services, interface reference models underlying technologies LANs (Ethernet, token ring, wireless); point-to-point WANs; switched WANs (X.25, frame relay, ATM); connecting devices; addressing (physical, network, transport); the internet layer protocols IP: datagram, fragmentation and reassembly; ICMP: types of messages, error reporting, ICMP package, BOOTP and DHCP ROUTING PROTOCOLS: Interior and exterior routing: RIP, OSPF, BGP; multicast routing: unicast, multicast and broadcast, multicasting, multicast trees THE TRANSPORT LAYER: The transport service: services provided, service primitives; sockets; process-to-process communication: port addresses; elements of transport protocols: addressing, connection establishment, connection release, flow control and buffering, multiplexing, crash recovery; UDP: introduction, remote procedure call; TCP: service model, protocol, frame format, connection establishment, release, connection management; silly window syndrome; error control; congestion control; state transition diagram SOCKETS AND CLIENT-SERVER MODEL: Client-Server model: concurrency, processes; socket interface: sockets, byte ordering, socket system calls; connectionless and connection oriented applications; implementation of sockets (C/Java, etc); mobile IP: mobility, routing and addressing, characteristics, operation, foreign agent discovery, registration and communication, two crossing problem, communication with computers on the home front. THE APPLICATION LAYER: DNS; Protocols: Telnet and Rlogin, FTP, TFTP, SNMP, SMTP; world wide web (client and server side, cookies, wireless web); Java and the Internet; multimedia (streaming audio, internet radio, voice over IP - RTP, video standards); real time traffic over the internet VoIP TECHNOLOGY: Basis of IP transport; VoIP challenges; H-323; session invitation protocol; distributed architecture and media gateway control; VoIP and SS7; VoIP quality of service; broadband-Wifi 802.11; 802.16; Bluetooth and cable system. INTRODUCTION TO NETWORK SECURITY: Cryptography; symmetric key algorithms; public key algorithms; digital signatures; certificates, 27
WEB REFERENCES
1. 2. 3. 4. http://www.csl.mtu.edu/cs6461/www/ http://www.csl.mtu.edu/cs6461/www/Slide/slide08.html http://web.cs.wpi.edu/~rek/Adv_Nets/Summer2003/Summer2003.html http://www.cs.cmu.edu/~cmcl/courses/networking/
CS-507
INFORMATION STORAGE & MANAGEMENT
LTP 500
Cr 3
1. INTRODUCTION: Meeting today's data storage needs - data creation,

data creation: Individuals; data creation: Business; categories of data; data storage models; common data storage media and solutions: tape storage systems, optical data storage, disk based storage DATA CENTER INFRASTRUCTURE : Example; key requirements of storage systems management activities STORAGE SYSTEMS ARCHITECTURE: Storage system environment; components of a host; connectivity; physical disks; raid array; disk storage systems; data flow exercise NETWORKED STORAGE: Direct Attached Storage (DAS); Network Attached Storage (NAS); Fiber Channel Storage Area Network (FC SAN); IP Storage Area Network (IP SAN); Content Addressed Storage (CAS)
2. 3.
4.
28
Lingayas University, Faridabad 5. 6. BUSINESS CONTINUITY: Introduction; overview; backup and recovery; local replication; remote replication. MONITORING AND MANAGING THE DATA CENTER: Areas of the data center to monitor; considerations for monitoring the data center; techniques for managing the data center. SECURING STORAGE AND STORAGE VIRTUALIZATION: Securing the storage infrastructure; virtualization technologies. Osborne Marc Farley, Building Storage Networks, 2nd Edition, Tata McGraw Hill, 2001 Spalding Robert, Storage Networks: The Complete Reference, 1st Edition, Tata McGraw Hill, 2003 Gupta Meeta, Storage Area Network Fundamentals, Illustrated Edition, Pearson Education/Cisco Press, 2002 Kowalski Gerald J. and Maybury Mark T., Information Storage & Retrieval Systems Theory & Implementation, 1st Edition, Springer, 1999 Thejendra B. S., Disaster Recovery & Business Continuity, Shroff Publishers & Distributors, EMC Students Kit
M.Tech. (CS) 5. 6. 7. PROGRAMMING WITH JAVA: Java programming; J2ME architecture; Javax; Bluetooth package Interface; classes; exceptions; Javax.obex package: interfaces, classes BLUETOOTH SERVICES: registration and search application; Bluetooth client and server application. OVERVIEW OF IRDA, HOMERF, WIRELESS LANS, JINI
7.
REFERENCE BOOKS
1. 2. 3. 4. Prabhu C. S. R. and Reddi A. P., Bluetooth Technology, Prentice Hall of India, 2006 Labiod H., Afifi H., and De Santis C., Wi-Fi, Bluetooth, Zigbee and WiMax, 1st Edition, Springer, 2007 Bakker Dee, Gilster Diane McMichael, and Gilster Ron, Bluetooth End to End, 1st Edition, Wiley, 2002 Harte Lawrence, Introduction to Bluetooth: Technology, Market, Operation, Profiles, and Services, Althos, 2004
REFERENCE BOOKS
1. 2. 3. 4. 5.
WEB REFERENCES
1. 2. 3. 4. 5. http://www.soi.wide.ad.jp/class/20060035/materials_for_student/02/lectur e_02_80211bandBT.pdf http://www.geekinterview.com/question_details/49241 http://www.designspike.com/articles/bluetooth-technology-coming-to-atheater-near-you/8.htm http://info.ee.surrey.ac.uk/CE/technical/intro_bluetooth.html http://www.palowireless.com/bookshop/booksbluetooth.asp
WEB REFERENCES
1. 2. http://www.cs.cmu.edu/~fp/courses/03-312/handouts/18-storage.pdf http://www.freedownloadscenter.com/Information_Management/
CS-508
1. 2. 3.
BLUETOOTH TECHNOLOGY
LTP 500
Cr 3
CS-509
1. 2. 3. 4. 5. 6.
4.
INTRODUCTION TO WIRELESS TECHNOLOGIES: WAP services; serial and parallel communication; asynchronous and synchronous communication; FDM;TDM; TFM; spread spectrum technology INTRODUCTION TO BLUETOOTH: Specification; core protocols; cable replacement protocol; Bluetooth radio: type of antenna; antenna parameters; frequency hoping BLUETOOTH NETWORKING: Wireless networking; wireless network types; devices roles and states; ad-hoc network; Scatternet; connection establishment procedure; notable aspects of connection establishment; mode of connection; Bluetooth security; security architecture; security level of services; profile and usage model: generic access profile (GAP); SDA; serial port profile; secondary Bluetooth profile HARDWARE: Bluetooth implementation; baseband overview; packet format; transmission buffers; protocol implementation: link manager protocol; logical link control adaptation protocol; host control interface; protocol interaction with layers 29
CRYPTOGRAPHY AND DATA COMPRESSION
LTP 500
Cr 3
COMPRESSION: Packing; Huffman coding; run length encoding; Lempel-Ziv-Welch; Phil Katzs PKZIP; Delta modulation; JPEG. ERROR DETECTION AND CORRECTION: Parity; 1, 2, n-dimensions, Hamming codes; p-out-of-q codes CRYPTOGRAPHY: Vocabulary; history, steganography visual, textual; cipher hiding; false errors; public key cryptography - authentication, signatures, deniability MATHEMATICS: Information; confusion; diffusion; modular arithmetic; inverses; Fermats little theorem, Chinese remainder theorem; factoring; prime numbers; discrete logarithms ALGORITHMS: DES; AES (Rijndael); IDEA; one time pad; secret sharing and splitting; RSA; elliptic curves; modes; random numbers ATTACKING SYSTEMS: Recognition; destroying data; cryptanalysis differential cryptanalysis; cracking DES
30
M.Tech. (CS) 7. LEGAL, PRIVACY, AND ETHICAL ISSUES IN COMPUTER SECURITY: Protecting program and data; information and law; rights of employees and employers; software failures; computer crime; privacy; ethical issues in computer society; case studies of ethics Stallings William, Cryptography and Network Security: Principal & Practices, 4th Edition, Prentice Hall of India, 2005 Kauffman C., Perlman R. and Spenser M., Network Security, 2nd Edition, Prentice Hall, Englewood Cliffs, 2002. Mani Subramanian, Network Management Principles & Practices, Addison Wesley, 1999 Burke J. Richard, Network Management concepts and Practice A Handon Approach, Pearson Education/Prentice Hall of India, 2003 Stalling William, SNMP, 3rd Edition, Addison Wesley, 1999 Wang H. H., Telecom Network Management, McGraw Hill, 1999 Menezes Alfred, van Oorschot Paul, and Vanstone Scott, Handbook of Applied Cryptography, 1st Edition, CRC Press, NY., 1996 Bellovin S. and Chesvick W., Internet Security and Firewalls, 2nd Edition, Addison-Wesley, Reading, 2003. Schneier Bruce, Applied Cryptography, Wiley Student Edition, 2nd Edition, Singapore, 1996. www.londonexternal.ac.uk crypto.stanford.edu/cs155/ www.skillstrainuk.com/network-security www.networkcomputing.com www.foundstone.com/us/resources-free-tools.asp
REFERENCE BOOKS
1. 2. 3. 4. IEEE, Integration of Data Compression and Cryptography: Another Way to Increase the Information Security, IEEE Computer Society Schneier B., Applied Cryptography: Protocols, Algorithms and Source Code in C, 2nd edition, Wiley, 1996. Desai Suhag, Security in Computing, Pearson Education Trappe W. and Washington L., Introduction to Cryptography, 2nd edition, Pearson Education, 2006
REFERENCE BOOKS
1. 2. 3. 4. 5. 6. 7.
WEB REFERENCES
1. 2. 3. 4. http://www.data-compression.com/index.shtml http://www.webopedia.com/TERM/D/data_compression.html http://en.wikipedia.org/wiki/Data_compression http://www.debugmode.com/imagecmp/
CS-510
1. 2.
NETWORK SECURITY & MANAGEMENT
LTP 500
Cr 3
8. 9.
3. 4.
5.
6.
INTRODUCTION: Codes and ciphers; some classical systems; statistical theory of cipher systems: complexity theory of crypto systems; stream ciphers; block ciphers. STREAM CIPHERS: Rotor based system; shift register based systems; design considerations for stream ciphers; crypt-analysis of stream ciphers; combined encryption and encoding; block ciphers; DES and variant; modes of use of DES; public key systems; Knapsack systems; RSK; Diffie Hellman exchange; authentication and digital signatures; elliptic curve based systems. SYSTEM IDENTIFICATION AND CLUSTERING: Cryptology of speech signals; narrow band and wide band systems; analog and digital systems of speech encryption. SECURITY: HASH FUNCTION AUTHENTICATION: Protocols: digital signature standards; electronics mail security: PGP (Pretty Good Privacy) MIME; data compression technique; IP Security: architecture, authentication leader; encapsulating security payload: key management; web security: secure socket layer and transport layer security; secure electronics transactions; firewalls design principle; established systems. TELECOMMUNICATION NETWORK ARCHITECTURE: TMN management layers; management information model; management servicing and functions; structure of management information and TMN information model; SNMPv1, SNMPv2 & SNMPv3; RMONv1 & v2; broadband network management (ATM, HFC, DSL); ASN SECURITY IN NETWORKS: Threats in networks; network security control; firewalls, intrusion detection systems; secure e-mail; networks and cryptography; example protocols: PEM, SSL, IPsec; ADMINISTRATING SECURITY: Security planning, risk analysis, organizational security policies, physical security. 31
WEB REFERENCES
1. 2. 3. 4. 5.
CS-511
1.
DIGITAL IMAGE PROCESSING
LTP 500
Cr 3
2.
3.
INTRODUCTION AND DIGITAL IMAGE FUNDAMENTALS: The origins of digital image processing; examples of fields that use digital image processing; fundamentals steps in image processing; elements of digital image processing systems; image sampling and quantization;, some basic relationships like neighbours; connectivity; distance measures between pixels; linear and non linear operations. IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN: Some basic gray level transformations; histogram processing; enhancement using arithmetic and logic operations; basics of spatial filters; smoothening and sharpening spatial filters; combining spatial enhancement IMAGE ENHANCEMENT IN THE FREQUENCY DOMAIN: Introduction to Fourier transform and the frequency domain; smoothing and sharpening frequency domain filters; homomorphic filtering; image
32
Lingayas University, Faridabad restoration: a model of the image degradation / restoration process, noise models; restoration in the presence of noise only spatial filtering; periodic noise reduction by frequency domain filtering; linear positioninvariant degradations; estimation of degradation function; inverse filtering; Wiener filtering, constrained least square filtering; geometric mean filter; geometric transformations. IMAGE COMPRESSION: Coding; interpixel and psycho visual redundancy; image compression models; elements of information theory, error free comparison; lossy compression; image compression standards. IMAGE SEGMENTATION: Detection of discontinuities; edge linking and boundary detection; thresholding; region oriented segmentation; motion based segmentation REPRESENTATION AND DESCRIPTION: Representation; boundary descriptors; regional descriptors; use of principal components for description; introduction to morphology; some basic morphological algorithms. OBJECT RECOGNITION: Patterns and pattern classes; decisiontheoretic methods; structural methods. Jayaraman S., Esakkirajan S. and Veerakumar T., Digital Image Processing, Tata McGraw Hill, 2009 Jain A. K., Digital Image Processing, Prentice Hall of India, 1995 Gonzalez Rafael C. and Woods Richard E., Digital Image Processing, 2nd edition, Pearson Education, 2002 Jahne Bernd, Digital Image Processing, 5th Edition, Springer, 2000 Pratt William K., Digital Image Processing: Piks Inside, John Wiley & Sons, 2001. Forsyth D. A. and Ponce J., Computer Vision: A Modern Approach, Prentice Hall, 2003 Jain R., Kasturi R. and Schunck B.G. , Machine Vision, McGraw Hill, 1995 en.wikipedia.org/wiki/Digital_image_processing www.imageprocessingplace.com www.icaen.uiowa.edu www.uct.ac.za/depts/physics/laser/hanbury/intro_ip.html www.eng.auburn.edu/~sjreeves/Classes/IP/IP.html
M.Tech. (CS) 2. 3. BINARY MACHINE VISION: Thresholding; segmentation; connected component labeling; hierarchal segmentation; spatial clustering; split & merge; rule-based segmentation; motion-based segmentation AREA EXTRACTION: Concepts; data-structures, edge, line-linking, Hough transform, line fitting; curve fitting (least-square fitting), REGION ANALYSIS: region properties; external points; spatial moments; mixed spatial; gray-level moments; boundary analysis: signature properties, shape numbers. FACET MODEL RECOGNITION: Labelling lines, understanding line drawings; classification of shapes by labelling of edges; recognition of shapes; consisting labelling problem; back-tracking; perspective projective geometry; inverse perspective projection; photogrammetry from 2D to 3D; image matching: intensity matching of ID signals; matching of 2D image; hierarchical image matching. OBJECT MODELS AND MATCHING: 2D representation; global vs. local features; general frame works for matching: distance relational approach; ordered structural matching; view class matching; models database organization GENERAL FRAME WORKS: Distance relational approach; Ordered Structural matching; view class matching; models database organization KNOWLEDGE BASED VISION: Knowledge representation; controlstrategies; information integration Forsyth David A. and Ponce Jean, Computer Vision: A Modern Approach, US Edition, Prentice Hall, 2002 Jain R., Kasturi R., and Schunk B. G., Machine Vision, McGraw Hill. Sonka Milan, Hlavac Vaclav, Boyle Roger, Image Processing, Analysis, and Machine Vision, 3rd Edition, Thomson Learning, 2007 Haralick Robert and Shapiro Linda, Computer and Robot Vision, Vol. I and II, Addison Wesley, 2002 http://www.umiacs.umd.edu/~ramani/cmsc426/ http://www.cs.rochester.edu/~nelson/courses/vision/notes/notes.html http://www.cogs.susx.ac.uk/courses/compvis/index.html
4. 5. 6.
4.
5.
7.
6. 7.
REFERENCE BOOKS
1. 2. 3. 4. 5. 6. 7. 1. 2. 3. 4. 5.
REFERENCE BOOKS
1. 2. 3. 4.
WEB REFERENCES
WEB REFERENCES
1. 2. 3.
CS-513 CS-512
1.
ROBOTICS
COMPUTER VISION
LTP 500
Cr 3
LTP 500
Cr 3
1. 2.
RECOGNITION METHODOLOGY: Conditioning; labeling; grouping; extracting; matching; edge detection; gradient based operators; morphological operators; spatial operators for edge detection. thinning, region growing; region shrinking; labeling of connected components. 33
ROBOTIC MANIPULATION: Automation and robots; classification; application; specification; notations. DIRECT KINEMATICS: Dot and cross products; co-ordinate frames; rotations; homogeneous; co-ordinates; link co-ordination arm equation; (five-axis robot, four axis robot, six axis robot).
34
Lingayas University, Faridabad 3. 4. 5. INVERSE KINEMATICS: General properties of solutions tool configuration; five axis robots, three-four axis; six axis robot (inverse kinematics). WORKSPACE ANALYSIS AND TRAJECTORY PLANNING WORK: envelop and examples; workspace fixtures; pick and place operations; continuous path motion; interpolated motion; straight-line motion. ROBOT VISION: Image representation; template matching, polyhedral objects; Shane analysis; segmentation (thresholding, region labelling, shrink operators; swell operators; Euler numbers; perspective transformation; structured illumination; camera calibration). TASK PLANNING: Task level programming; uncertainty; configuration; space; gross motion; planning; grasp planning; fine-motion planning; simulation of planer motion; source and goal scenes; task planner simulation. MOMENTS OF INERTIA, PRINCIPLES OF NC AND CNC MACHINES. Shilling Robert, Fundamentals of Robotics-Analysis and Control, Prentice Hall of India, 1990 Fu, Gonzales and Lee, Robotics: Control, Sensing, Vision and Intelligence, McGraw Hill, 1980 Craig J.J., Introduction to Robotics, 3rd Edition, Prentice Hall of India, 2004 Ghoshal, 8051 Micro controller & Interfacing, Pearson Education Staughard, Robotics and Artificial Intelligence, Prentice Hall of India, 1993 Grover, Wiess, Nagel and Oderey, Industrial Robotics, McGraw Hill, 1986 Stdder Walfram, Robotics and Mechatronics, Tata McGraw Hill, 1995 Klafter, Chmielewski and Negin, Robot Engineering, Prentice Hall of India Mittal R. K. and Nagrath I. J., Robotics and Control, Tata McGraw Hill, 2003
M.Tech. (CS) flow mechanisms; control flow versus data flow; data flow architecture; demand driven mechanisms; comparisons of flow mechanisms SYSTEM INTERCONNECT ARCHITECTURES: Network properties and routing; static interconnection networks; dynamic interconnection networks; multiprocessor system interconnects; hierarchical bus systems; crossbar switch and multiport memory; multistage and combining network. PROCESSORS AND MEMORY HIERARCHY: Advanced processor technology; instruction-set architectures; CISC scalar processors; RISC scalar processors; superscalar processors; VLIW architectures; vector and symbolic processors; memory technology: hierarchical memory technology, inclusion, coherence and locality, memory capacity planning, virtual memory technology BACKPLANE BUS SYSTEM: Backplane bus specification; addressing and timing protocols; arbitration transaction and interrupt; cache addressing models; direct mapping and associative caches. PIPELINING: Linear pipeline processor; nonlinear pipeline processor; instruction pipeline design; mechanisms for instruction pipelining; dynamic instruction scheduling; branch handling techniques; arithmetic pipeline design; computer arithmetic principles; static arithmetic pipeline; multifunctional arithmetic pipelines. VECTOR PROCESSING PRINCIPLES: Vector instruction types; vectoraccess memory schemes; synchronous parallel processing: SIMD architecture and programming principles, SIMD parallel algorithms, SIMD computers and performance enhancement
3.
4.
6.
7. 1. 2. 3. 4. 5. 6. 7. 8. 9.
5. 6.
REFERENCE BOOKS
7.
REFERENCE BOOKS
1. 2. 3. 4. 5. Hwang Kai and Briggs A., Advance Computer Architecture, Tata McGraw Hill, 1993 Hwang Kai and Briggs A., Computer Architecture and Parallel Processing, International Edition, McGraw-Hill, 1984 Hennessy John L. and Patterson David A., Computer Architecture: A Quantitative Approach, 4th Edition, Morgan Kaufmann (An Imprint of Elsevier), 2006 Flynn Michael J., Pipelined and Parallel Processor Design, 1st Edition, Narosa Publications, 1995 Sima Dezso, Fountain Terence and Kacsuk Peter, Advanced Computer Architectures, 1st Edition, Pearson Education/Addison Wesley, 1997
WEB REFERENCES
1. 2. 3. 4. http://en.wikipedia.org/wiki/Robotics http://www.transit-port.net/Lists/Robotics.in.Japan.html http://www-formal.stanford.edu/jmc/whatisai/ http://library.thinkquest.org/2705/
CS-514
1. 2.
ADVANCED COMPUTER ARCHITECTURE
LTP 500
Cr 3
1. 2. 3.
WEB REFERENCES
PARALLEL COMPUTER MODELS: The state of computing; multiprocessors and multicomputers; multivector and SIMD computers; architectural development tracks. PROGRAM AND NETWORK PROPERTIES: Conditions of parallelism; data and resource dependences; hardware and software parallelism; program partitioning and scheduling; grain size and latency; program 35 http://www.doc.ic.ac.uk/~phjk/AdvancedCompArchitecture/Lectures/ http://www.ecs.syr.edu/faculty/ercanli/cse661/ http://cs.binghamton.edu/~nael/classes/cs325/
36
M.Tech. (CS) 2. 3. 4. Pujari Arun K., Data Mining Techniques, University Press Dunham Margaret H., Data Mining Introductory and Advanced Topics, 1st Edition, Pearson Education/Prentice Hall, 2002 Hand D. J., Mannila H., and Smyth P., Principles of Data Mining, MIT Press, 2001 Fayyad U. M., Piatetsky-Shapiro G., Smyth P., and Uthurusamy R., Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996 Hastie T., Tibshirani R., and Friedman J., The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition, Springer Verlag, 2009 Inmon W. H., Building the Data Warehouse, 4th Edition, Wiley Dreamtech, 2005 Ponnaiah Paulraj, Data Warehousing Fundamentals, 1st Edition, Wiley Student, 2001 Kimball Ralph, The Data Warehouse Life Cycle Tool Kit, 1st Edition, Wiley Student, 2008
CS-515
1.
DATA WAREHOUSING AND DATA MINING
LTP 510
Cr 4
2. 3.
4.
5.
6.
7.
INTRODUCTION: Fundamentals of data warehouse and mining; features of data warehouse; 2Tier data warehouse architecture; 3Tier data warehouse architecture; data warehouse components; data warehouse process; data mining functionalities; classification of data mining systems; major issues in data mining; data warehouse and OLAP technology for data mining data warehouse; multidimensional data model; data warehouse architecture, data warehouse implementation; further development of data cube technology; from data warehousing to data mining. DATA PROCESSING: Data preprocessing: needs preprocessing the data, data cleaning; data integration and transformation; data reduction; discretization and concept hierarchy generation; online data storage MINING PRIMITIVES: Data mining primitives, languages, and system architectures: data mining primitives; data mining query languages; designing GUI based on a data mining query language architectures of data mining systems. DATA GENERALIZATION: Concepts description: characterization and comparison: data generalization and summarizationbased characterization; analytical characterization: analysis of attribute relevance, mining class comparisons: discriminating between different classes, mining descriptive statistical measures in large databases; mining association rules in large databases: association rule mining, mining single-dimensional Boolean association rules from transactional databases; mining multilevel association rules from transaction databases; mining multidimensional association rules from relational databases and data warehouses; from association mining to correlation analysis; constraint-based association mining. CLASSIFICATION AND PREDICTION: Classification and prediction: issues regarding classification and prediction; classification by decision tree induction; Bayesian classification; classification by back propagation; classification based on concepts from association rule mining; other classification methods; prediction; classifier accuracy CLUSTER ANALYSIS: Cluster analysis introduction: types of data in cluster analysis; categorization of major clustering methods; partitioning methods; density-based methods; grid-based methods; model-based clustering methods; outlier analysis MINING COMPLEX: Mining complex types of data: multidimensional analysis and descriptive mining of complex, data objects; mining spatial databases; mining multimedia databases; mining time-series and sequence data; mining text databases; mining the world wide web. Han Jiawei and Kamber Micheline, Data Mining Concepts and Techniques, Harcourt India, 2006 37
5. 6. 7. 8. 9.
WEB REFERENCES
1. 2. 3. 4. http://infogoal.com/dmc/dmcdwh.htm http://www.pcai.com/web/ai_info/data_warehouse_mining.html http://www.anderson.ucla.edu/faculty/jason.frand/teacher/technologies/p alace/datamining.htm http://en.wikipedia.org/wiki/Data_mining
CS-516
1.
ADVANCED OPERATING SYSTEMS
LTP 510
Cr 4
2.
3.
REFERENCE BOOKS
1.
4.
INTRODUCTION: Introduction to history of operating systems; early batch systems; multiprogramming; timesharing; distributed OS and multiprocessor OS; processes; files; system calls; shell; layered structure v/s monolithic structure of OS MEMORY MANAGEMENT: Multiprogramming with fixed partition; variable partitions; virtual memory; paging; demand paging; design and implementation issues in paging such as page tables; inverted page tables; page replacement algorithms; page fault handling; working set model; local v/s global allocation; page size; segmentation; segmentation with paging FILE SYSTEMS: File types; attributes, access and security; file operations; directory structures; path names; directory operations; implementation of file systems; implementation of file and file operation calls; implementation of directories; sharing of files; disk space management; block allocation; free space management DEADLOCKS: Conditions; modelling; detection and recovery; deadlock avoidance; deadlock presentation
38
Lingayas University, Faridabad 5. 6. DISTRIBUTED SYSTEMS: Introduction; communications in distributed systems; layered protocols; ATM networks; Client Server model; RPC SYNCHRONIZATION AND MUTUAL EXCLUSION: Synchronization in distributed systems; clock synchronization; mutual exclusion; election algorithms; atomic transactions; deadlocks in distributed systems; distributed file system design and implementation DISTRIBUTED SHARED MEMORY: What is shared memory; consistency models; page-based distributed shared memory; shared variables; case studies: MACH and CHORUS Bach M., The Design of the UNIX Operating System, Prentice-Hall, 1986 Bayer et. al .(eds.), Operating Systems An Advanced Course, Springer Verlag, 1979 Chow R. and Johnson T., Distributed Operating Systems and Algorithms, Annotated Edition, Addison-Wesley, 1997 Stallings W., Operating Systems - Internals and Design Principles, 6th Edition, Prentice Hall, 2008 Stallings W., Operating Systems, Macmillian Publishing, 1991 Tanenbaum Andrew. S., Operating Systems Design and Implementation, 3rd Edition, Prentice-Hall, 2006 Tanenbaum Andrew. S., Distributed Operating Systems, Pearson Education Asia, 1994 Singhal M. and Shivarathi N. G., Advance Concepts in Operating Systems, McGraw Hill, 2001 http://www.cs.fsu.edu/~awang/courses/cop5611_s2004/ http://www.scs.stanford.edu/nyu/04fa/ http://www.cs.ucdavis.edu/~pandey/Teaching/ECS251/ecs251.htm http://www.cs.berkeley.edu/~brewer/cs262/
M.Tech. (CS) request response protocols; event and sequence diagram; connection vs. connectionless IPC. DISTRIBUTED COMPUTING PARADIGMS AND SOCKET API: Paradigms; abstraction; socket metaphor; diagram socket API; stream mode socket API; sockets with non-blocking I/O; secure socket API; GROUP COMMUNICATION: Unicasting; multicasting; archetypal multicast API; connection oriented and connectionless; reliable; unreliable multicast; Java basic multicast API. DISTRIBUTED OBJECTS: Message passing vs. distributed objects, archetypal distributed object architecture, distributed object systems, remote procedure calls, Java RMI architecture, API for Java RMI, Advanced RMI: client callback, stub downloading, RMI security manager, allowing for Stub downloading SIMPLE OBJECT ACCESS PROTOCOL: SOAP request; SOAP response; Apache SOAP; invoking web service; implementing web service ADVANCED DISTRIBUTED COMPUTING PARADIGMS: Message queue system paradigm; mobile agents; network service; object spaces
4.
7.
5.
REFERENCE BOOKS
1. 2. 3. 4. 5. 6. 7. 8. 6. 7.
REFERENCE BOOKS
1. 2. 3. Tannenbaum Andrew S. and van Steen Maarten, Distributed Systems: Principles and Paradigms, Prentice Hall, 2002. Coulouris George, Dollimore Jean, Kindberg Tim, Distributed Systems: Concepts and Design, 4th Edition, Addison Wesley, 2005 Garg Vijay K., Elements of Distributed Computing, Wiley, 2002.
WEB REFERENCES
1. 2. 3. 4.
WEB REFERENCES
1. 2. 3. 4. http://en.wikipedia.org/wiki/Distributed_computing http://www.dhpc.adelaide.edu.au/education/dhpc/2000/lecture-notes.html http://www.eli.sdsu.edu/courses/spring99/cs696/notes/ http://www.geocities.com/SiliconValley/Vista/4015/Chapter1.html
CS-517
1. 2. 3.
DISTRIBUTED COMPUTING
LTP 500
Cr 3
CS-518
1.
MOBILE COMPUTING
LTP 500
Cr 3
DISTRIBUTED COMPUTING: History; forms of computing; strengths and weaknesses of distributed computing; OS basics; network basics; software engineering basics CLIENT SERVER PARADIGM: Issues; software engineering for a network service; connection oriented and connectionless servers; Iterative server and concurrent server; stateful servers. INTERPROCESS COMMUNICATION: Archetypal IPC program interface; event synchronization; timeouts and threading; deadlock and timeouts; data representation; data encoding; text based protocols; 39
2.
INTRODUCTION TO WIRELESS TRANSMISSION: Applications; short history of wireless communication; frequency for radio transmission; signals; antennas; signal propagation; multiplexing; modulation; spread spectrum; cellular systems. MEDIUM ACCESS CONTROL: Motivation for a specialized MAC: hidden and exposed terminals; near and far terminals; SDMA; FDMA; TDMA: fixed TDM, classical Aloha; slotted Aloha; carrier sense multiple access; demand assigned multiple access; PRMA packet reservation multiple access, reservation TDMA; multiple access with collision avoidance; polling; inhibit sense multiple access; CDMA: spread Aloha multiple access
40
Lingayas University, Faridabad 3. TELECOMMUNICATION SYSTEMS: GSM: mobile services; system architecture; radio interface; protocols; localization and calling; handover; security; new data services; DECT: system architecture, protocol architecture; TETRA, UMTS and IMT-2000: UMTS basic architecture, UTRA FDD mode, UTRA TDD mode SATELLITE & BROADCAST SYSTEMS: History, applications; basics: GEO, LEO, MEO; routing; localization; handover; examples; cyclic repetition of data; digital audio; broadcasting: multimedia object transfer protocol; digital video broadcasting WIRELESS LAN: infrared vs. radio transmission; infrastructure and ad hoc networks; IEEE 802.11: system architecture, protocol architecture; physical layer; medium access control layer; MAC management; future development; HIPERLAN: protocol architecture, physical layer, channel access control sub layer, medium access control sub layer, information bases and networking; Bluetooth: user scenarios, physical layer, MAC layer, networking; security; link management; WIRELESS ATM: motivation for WATM, wireless ATM working group, WATM services; Reference model: example configurations; generic reference model; functions: wireless mobile terminal side, mobility supporting network side; radio access layer: requirements, BRAN; handover: handover reference model, handover requirements, types of handover, handover scenarios, backward handover, forward handover; location management: requirements for location management, procedures and entities; addressing, mobile quality of service, access point control protocol MOBILE NETWORK LAYER: Mobile IP: goals, assumptions and requirements, entities and terminology, IP packet delivery, agent advertisement and discovery, registration, tunnelling and encapsulation, optimizations, reverse tunnelling, IPv6; dynamic host configuration protocol, ad hoc networks: routing, destination sequence distance vector, dynamic source routing, hierarchical algorithms, alternative metrics, MOBILE TRANSPORT LAYER: traditional TCP: congestion control, slow start, fast retransmit/fast recovery, implications on mobility; indirect TCP, snooping TCP, mobile TCP, fast retransmit/fast recovery, transmission/ time-out freezing, selective retransmission, transaction oriented TCP SUPPORT FOR MOBILITY: File systems: consistency, examples; world wide web: hypertext transfer protocol, hypertext markup language, some approaches that might help wireless access, system architectures; wireless application protocol: architecture, wireless datagram protocol; wireless transport layer security; wireless transaction protocol; wireless session protocol; wireless application environment; wireless markup language; WML script; wireless telephony application; examples: stacks with WAP, mobile databases, mobile agents Schiller Jochen, Mobile Communications, 2nd Edition, Addison Wesley/Pearson Education, 2003 Agrawal Dharma Prakash and Zeng Qing-An, Introduction to Wireless and Mobile Systems, 2nd edition, 2006 41
M.Tech. (CS) 3. 4. 5. 6. 7. 8. 9. Talukder Asoke K. and Yavagal R. R., Mobile Computing, Tata McGraw-Hill, New Delhi, 2005. Hansman Uwe, Merk Lothar, Nicklous Martin S. and Stober Thomas, Principles of Mobile Computing, 2nd Edition, Springer Verlag, 2003 Stallings William, Wireless Communications and Networks, 2nd Edition, Prentice Hall of India, 2004 Lin Yi-Bing and Chlamtac Imrich, Wireless and Mobile Network Architectures, John Wiley & Sons, 2004 Rappaport, Wireless Communications Principles and Practices , 2nd Edition, Prentice Hall of India, 2002 Nicopolitidis P., Wireless Networks, John Wiley, 2003 Richharia M., Mobile Satellite Communication: Principles and Trends, 1st Edition, Addison Wesley/Pearson Education, 2001
4.
5.
WEB REFERENCES
1. 2. 3. 4. http://www.it.iitb.ac.in/~it601/dep/?id=3 http://www.onesmartclick.com/engineering/digital-communications.html http://www.nd.edu/~surendar/teach/spr02/ubicomp/lecture.shtml http://es.fbk.eu/people/murphy/classes/290e/notes/index.html
CS-519
1.
PERVASIVE COMPUTING
LTP 500
Cr 3
6.
2. 3.
7.
4. 5.
REFERENCE BOOKS
1. 2. 6. 42
INTRODUCTION: The Computer for the 21st Century; wireless technologies: signal propagation, multiplexing, modulation and spread spectrum techniques; challenges and Issues in ubiquitous computing: disconnected operation; update propagation; update conflicts; synchronization; replication; bandwidth adaptation; power adaptation; context awareness; location tracking; migration; system support; security; smart spaces; invisibility; localized scalability; uneven conditioning DEVICE TECHNOLOGY: Compaq iPAQ 5400 Series; iPAQ 5450 Specs; Tiqit Eightythree; Eighty three Specs; Palm Tungsten-T; Tungsten-T Specs; Bluetooth qualified products. WIRELESS NETWORKING AND SATELLITE SYSTEMS: Overview of IEEE 802.11b wireless Ethernet standard; Bluetooth radio system; Wi-Fi (802.11b); General Packet Radio Service in GSM, 802.11 a, b & g comparison; 802.11 a & b comparison; 802.11a official standard, WAP and WML; satellite systems: basic routing, localization, and handoff issues MOBILE NETWORKING: Mobile IP; ad-hoc networks: AODV, DSR, DSDV routing; wireless TCP: indirect TCP, snooping TCP, mobile TCP SENSOR NETWORKS AND AD HOC ROUTING: System architecture for networked sensors; making sharing pervasive: ubiquitous computing, multi-hop wireless ad hoc network routing protocols; TAG: Tiny aggregation service. LANGUAGES, PROTOCOLS AND INFORMATION MANAGEMENT: Jini; Sync; UDDI; Universal Plug-and-Play (UPnP); Simple Object Access
Lingayas University, Faridabad Protocol (SOAP) 1.1; MobileIP and TCP over wireless; Information Management: Location-Independent and Location-dependent computing models USER INTERFACES AND APPLICATION EXAMPLES: Coordination Infrastructure for Interactive Workspaces; ICrafter: a service framework for ubiquitous computing environments; the interactive workspaces project; ubiquitous computing rooms; context-aware design and interaction; fluid interaction; overview of the PARCTAB ubiquitous computing experiment. Agrawal Dharma Prakash and Zeng Qing-An, Introduction to Wireless and Mobile Systems, 2nd edition, 2006 Talukder Asoke K. and Yavagal R. R., Mobile Computing, Tata McGraw-Hill, New Delhi, 2005. Burkhardt Jochen, Henn Horst, Hepper Stefan, Schaec Thomas and Rindtorff Klaus, Pervasive Computing: Technology and Architecture of Mobile Internet Applications, Pearson Education, New Delhi, 2007. Adelstein Frank, Gupta S. K. S., Richard G. G. and Schwiebert L., Fundamentals of Mobile & Pervasive Computing, Tata McGraw-Hill, 2005. Foster Ian and Kesselman Carl, The Grid 2: Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers, 2004 Amor Daniel, Internet Future Strategies: How Pervasive Computing Services Will Change the World, Prentice-Hall PTR, 2008. Lin Yi-Bing and Chlamtac Imrich, Wireless and Mobile Network Architectures, John Wiley & Sons, 2004 Nicopolitidis P., Obaidat M. S., Papadimitriou G. I. and Pompportsis A. S., Wireless Networks, John Wiley & Sons, 2003 Graham Steve, Simeonov Simeon, Boubez Toufic, Daniels Glen, Davis Doug, Nakamura Yuichi and Neyama Ryo, Building Web Services with Java: Making Sense of XML, SOAP, WSDL and UDDI, 2001
M.Tech. (CS)
CS-520
1.
SPEECH RECOGNITION & GENERATION
LTP 500
Cr 3
7.
2.
REFERENCE BOOKS
1. 2. 3. 3.
4.
4. 5. 6. 7. 8. 9.
5.
6.
7.
WEB REFERENCES
1. 2. 3. 4. 5. 6. 7. 8. Jini Technology Core Platform Specification, v. 2.0, Sun Microsystems, June 2003; www.sun.com/software/jini/specs/core2_0.pdf. UPnP Device Architecture 1.0, UPnP Forum, Dec. 2003; www.upnp.org/resources/documents/CleanUPnPDA10120031202s.pdf. R. Chinnici et al., Web Services Description Language (WSDL) Version 2.0," W3C working draft, Aug. 2004; www.w3.org/TR/2004/WD-wsdl2020040803. UDDI Version 2.04 API Specification, OASIS standard, July 2002; http://uddi.org/pubs/ProgrammersAPI-V2.04-Published-20020719.pdf http://www.iswpc.org/2007/cfp.html http://www.parliament.uk/documents/upload/postpn263.pdf http://searchnetworking.techtarget.com/sDefinition/0,,sid7_gci759337,00. html http://www.isoc.org/inet2000/cdproceedings/3a/3a_1.htm 43
FUNDAMENTALS OF SPEECH RECOGNITION: Introduction; the paradigm for speech; recognition; out line; brief history of speech recognition research; SPEECH GENERATION: formant frequencies in speech, parametric source-filter synthesis, formant synthesizers, pitch detection, amplitude analyzer, vocabulary, text-to-speech conversion, vocoders THE SPEECH SIGNAL: Production, reception, and acoustic-phonetic characterization: the speech production system; representing speech in time and frequency domains; speech sounds and features; approaches to automatic speech recognition by machine. SIGNAL PROCESSING AND ANALYSIS METHODS FOR SPEECH RECOGNITION: The bank of filters; front-end processor; Linear predictive model for speech recognition; vector quantization; auditory based spectral analysis model. PATTERN COMPARISON TECHNIQUES: Speech detection; distortion measures: mathematical considerations; distortion measures: perceptual considerations; spectral: distortion measures; incorporation of spectral dynamic features into distortion measures; time alignment and normalization. SPEECH RECOGNITION SYSTEM DESIGN AND IMPLEMENTATION ISSUES: Application of source coding techniques to recognition; template training methods; performance analysis and recognition enhancements; template adoption to new talkers; discriminative methods in speech recognition; speech recognition in adverse environment. THEORY AND IMPLEMENTATION OF HIDDEN MARKOV MODELS: Discrete time Markov processes; extensions to hidden Markov Models; three basic problems for HMMs; types of HMMs; implementation issues for HMMs; HMM system for isolated word recognition SPEECH RECOGNITION BASED ON CONNECTED WORDS MODELS: General notations for the connected word-recognition problem; two level dynamic programming algorithm; level building algorithm; one pass algorithm; multiple candidate strings; grammar networks for connected digit recognition; segmental K-means training procedure; connected digit recognition implementation; task oriented applications of automatic speech recognition and generation. Gold Bernard and Morgan Nelson, Speech and Audio Signal Processing, John Wiley & Sons, 2004 Rabiner Lawrence R. and Juang B., Fundamentals of Speech Recognition, Pearson Education/Prentice Hall of India, 1993 Rabiner Lawrence R. and Schafer R. W., Digital Processing of Speech Signals, Pearson Education/Prentice Hall of India, 1978 Rabiner Lawrence R. and Gold Bernard, Theory and Application of Digital Signal Processing, Prentice Hall of India, 1975
REFERENCE BOOKS
1. 2. 3. 4.
44
Lingayas University, Faridabad 5. Jurafsky D. and Martin J. H., Speech and Language Processing, 2nd Edition, Pearson Education/Prentice Hall of India, 2008 http://pages.cs.wisc.edu/~dyer/cs540/notes/speech.html http://www.patentstorm.us/patents/6708150/claims.html http://www.thefreelibrary.com/Speech+Therapy:+A+new+generation+of+ voice-recognition+technology+--...-a084072940
M.Tech. (CS) 5. 6. Jurafsky D. and Martin J. H., Speech and Language Processing, Pearson Education, 2002. Manning Christopher D. and Schtze Hinrich, Foundations of Statistical Natural Language Processing, The MIT Press, Cambridge, Massachusetts.1999. http://www.cse.unt.edu/~rada/CSCE5290/ http://www.bowdoin.edu/~allen/nlp/ http://www.encyclopedia.com/doc/1G1-160760429.html
WEB REFERENCES
1. 2. 3.
WEB REFERENCES
1. 2. 3.
CS-521
1.
NATURAL LANGUAGE PROCESSING
LTP 500
Cr 3 CS-522 EXPERT SYSTEMS
2.
3. 4. 5.
6. 7.
INTRODUCTION TO NATURAL LANGUAGE UNDERSTANDING: The study of language, applications of NLP, evaluating language understanding systems, different levels of language analysis, representations and understanding, organization of natural language understanding systems, linguistic background: an outline of English syntax. GRAMMARS AND PARSING: Grammars and sentence structure, topdown and bottom-up parsers, transition network grammars, top-down chart parsing. feature systems and augmented grammars: basic feature system for English MORPHOLOGICAL ANALYSIS AND THE LEXICON: Brief review of regular expressions and automata, finite state transducers, parsing with features, augmented transition networks GRAMMARS FOR NATURAL LANGUAGE: Auxiliary verbs and verb phrases, movement phenomenon in language, handling questions in context-free grammars, hold mechanisms in ATNs. HUMAN PREFERENCES IN PARSING: Encoding uncertainty, deterministic parser, word level morphology and computational phonology; basic text to speech; introduction to HMMs and speech recognition, parsing with CFGs; probabilistic parsing. representation of meaning. AMBIGUITY RESOLUTION: Statistical methods, estimating probabilities, part-of- speech tagging, obtaining lexical probabilities, probabilistic context-free grammars, best first parsing. SEMANTICS AND LOGICAL FORM: Word senses and ambiguity, encoding ambiguity in logical form, semantic analysis; lexical semantics; word sense; disambiguation; discourse understanding; natural language generation, Indian language case studies. Siddiqui Tanveer and Tiwary U. S., Natural Language Processing and Information Retrieval, Oxford University Press, 2008 Allen James, Natural Language Understanding, 2nd edition, Pearson Education, 2003. Winograd Terry, Language as a Cognitive Process, Addison Wesley, 1983 Gazder G., Natural Language Processing in Prolog, Addison Wesley, 1989 45
LTP 500
Cr 3
1.
2. 3. 4.
5.
6. 7.
REFERENCE BOOKS
1. 2. 3. 4.
ARTIFICIAL INTELLIGENCE: History and applications; AI problems and techniques; concept of AI; approaches: acting and thinking like humans and rationally; brief history of AI; foundations of AI; underlying assumptions; application areas. PRODUCTION SYSTEMS, STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH: Data driven and goal driven search; depth first and breadth first search; DFS with iterative deepening. HEURISTIC SEARCH: Best first search; A* algorithm; AO* algorithm; constraint satisfaction; using heuristics in games: Minimax search, alpha beta procedure; state space theory/representation. KNOWLEDGE REPRESENTATION: Simple relational knowledge; inheritable knowledge; inferential knowledge; procedural knowledge propositional calculus; predicate calculus; theorem proving by resolution; answer extraction; AI representational schemes: semantic nets, conceptual dependency, scripts, frames; introduction to agent based problem solving. MACHINE LEARNING: Symbol based and connectionist; social and emergent models of learning; the genetic algorithm: genetic programming; overview of expert system technology: rule based expert systems; introduction to natural language processing; neural networks. LANGUAGES AND PROGRAMMING TECHNIQUES FOR AI: Introduction to PROLOG and LISP; search strategies and logic programming in LISP; production system examples in PROLOG. KNOWLEDGE BASED SYSTEMS: Expert systems; components; characteristic features of expert systems; applications; rule based system architecture; representing and using domain knowledge; expert system shell; explaining the reasoning and knowledge acquisition; applications. Mauss Rex and Keyes Jessica, Handbook of Expert Systems in Manufacturing, McGraw Hill, 1991
REFERENCE BOOKS
1.
46
Lingayas University, Faridabad 2. 3. 4. 5. 6. 7. Gonzalez, Fu and Lee, Robotics: Control, Sensing, Vision and Intelligence, McGraw Hill,1987 Nilsson N. J., Principles of Artificial Intelligence, Narosa Publishing House, 1990. Patterson Dan W., Introduction to Artificial Intelligence & Expert Systems, Seventh Indian Reprint, Eastern Economy Edition, Prentice Hall of India, 1999 Winston P. H., Artificial Intelligence, 3rd Edition, Pearson Education, 2000 Schalkoff R. J., Artificial Intelligence An Engineering Approach, McGraw Hill Int. Ed. Singapore, 1992. Sasikumar M. and Ramani S., Rule Based Expert Systems, Narosa Publishing House, 1994. http://brandonburk.blogspot.com/2006/11/artificial-intelligence-expertsystems.html http://www.rpi.edu/~bonisp/fuzzy-course/2000/notes00.html http://www.wtec.org/loyola/kb/c1_s1.htm http://www.pcai.com/web/ai_info/expert_systems.html
M.Tech. (CS) 7. NEW AREAS OF BIOINFORMATICS: Metabolmics metabolic pathways; drug target identification; biological systems systems of molecular network; eco-systems, elements of systems modeling; nutrigenomics; palenteoinformatics; toxicogenomics; systems biology; pharmacogenomics; synthetic biology; bio-terrorism; biological and chemical warefare; data security issues in bioinformatics; bio-ethics: cloning, transgenic organisms, bio-ethics in agriculture; ontology; standards Mount David, Bioinformatics: Sequence and Genome Analysis, 3rd Edition, Cold Spring Harbor Laboratory, 2008 Krane D. E. and Raymer M. L., Fundamental Concepts of Bioinformatics, Pearson Education, 2003. Gibas Cynthia and Jambeck Per, Developing Bioinformatics Computing Skills, OReilly, 2001 Attwood T. K. and Parry-Smith D. J., Introduction to Bioinformatics, Pearson Education, 2003 Zar J. H., Biostatistical Analysis, 4th edition, Pearson Education, 1999. Baldi Pierre and Brunak Sren, Bioinformatics: The Machine Learning Approach, 2nd edition, MIT Press, 2001 Westhead D. R. et al, Instant Notes Series: Bioinformatics, Viva Books, 2003 Baxenavis Andreas, Francis Ouellette B. F. (eds), Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins, John Wiley, 1998
REFERENCE BOOKS
1.
2.
WEB REFERENCES
1. 2. 3. 4.
3.
4. 5.
6. 7. 8.
CS-523
1. 2. 3. 4.
BIOINFORMATICS
LTP 500
Cr 3
5.
6.
INTRODUCTION TO MOLECULAR BIOLOGY: Gene structure and information content; molecular biology tools; genomic information content COMPUTATIONAL BIOLOGY: Data searches and pairwise alignments; gaps; scoring matrices; Needleman and Wunsch algorithm; global and local alignments; database searches. PHYLOGENETICS: Molecular phylogenetics; phylogenetic trees; distance matrix methods; character-based methods of phylogenetics; parsimony. GENOMICS: Patterns of substitution within genes; estimating substitution numbers, molecular clocks; ancestral sequences; searches; consensus trees; tree confidence; genomics; prokaryotic gene structure; gene density; eukaryotic genomes; gene expression. PROTEOMICS: Protein and RNA structure prediction;, polypeptic composition; secondary and tertiary structure; algorithms for modeling protein folding; structure prediction; proteomics; protein classification; experimental techniques; ligand screening; post-translational modification prediction. GENE EXPRESSION DATA: Microarrays and gene expression data; microarray design; analysis of data; application; microarray standards; clustering (SOM, PCA/SVD, k-means, Hierarchical); classification (LVQ, SVM); processing gene expression data using decision tree based methods (ID3, ASSISTANT, C5.0) 47
WEB REFERENCES
1. 2. 3. 4. http://bioinfo.ernet.in/ http://www.ibioinformatics.org/ http://www.bioinfbook.org/ http://www.bioplanet.com/bioinformatics_tutorial.htm
CS-551
SIMULATION LAB
LTP 004
Cr 2
The students are advised to take up at least two experiments from each Unit from both course CS-501 and CS-502.
CS-553
ADVANCED DATABASE MANAGEMENT SYSTEMS LAB
LTP 004
Cr 2
The students are advised to take up at least four experiments from each Unit of the course CS-503 48
M.Tech. (CS)
CS-555
SOFTWARE ENGINEERING LAB
LTP 004
Cr 2
CS-566
ADVANCED OPERATING SYSTEMS LAB
LTP 004
Cr 2
The students are advised to take up at least two experiments from each Unit covering courses CS-504 and CS-505:
The students are advised to take up at least four experiments from each Unit of the course CS-509.
LIST OF EXPERIMENTS
The students are advised to take up at least four experiments from each Unit, such as the following: 1. Write a program to implement classes and objects. 2. Write a program to implement constructor and destructor 3. Write a program to implement dynamic initialization of objects with the help of new and delete operator. 4. Write a program to implement bubble sort template or swapping template. 5. Write a program to implement friend function. 6. Write a program to implement operator overloading. 7. Write a program to implement virtual function. 8. Write a program to implement multilevel inheritance and multiple inheritances. 9. Create a data flow diagram for book shop management system 10. Create a collaboration diagram for elevator system 11. Create a sequence diagram for elevator system 12. Create a class diagram for elevator system 13. Use case diagram for elevator system 14. Write a program to perform read and write functions in a file 15. Write a program to maintain the inventory of super market using File Handling. 16. Make a class Employee with a name and salary. Make a class Manager inherits from Employee. Add an instance variable, named department, of type string. Supply a method to toString that prints the managers name, department and salary. Make a class Executive inherits from Manager. Supply a method to String that prints the string Executive followed by the information stored in the Manager super class object. Supply a test program that tests these classes and methods. 17. Create a generic class to create a list of int, float or char also include number to perform various operations on list i.e. traverse, insert and delete 18. Create a class Matrix and overload +, - , * operator to perform addition, subtraction, multiplication of two matrices. 19. Modify class Matrix to overload +, - , * operator with the help of friend function. 20. Write a program to implement following: A function to reverse a string ("spam" gets turned into maps). Function to reverse and uppercase a string Function to reverse and lowercase a string. An encrypt function. Invent your own encryption algorithm. 49
CS-574
SEMINAR I
LTP 002
Cr 1
The student has to undertake extensive literature survey on a topic with the approval of the course coordinator. The course coordinator shall not be below the rank of Assistant Professor. The work may involve extensive search of print, audio-video materials, internet surfing etc. The work of monitoring will be done by the course coordinator and evaluation by the course coordinator and the HOD or his nominee.
CS-601
1.
KNOWLEDGE BASED SYSTEM DESIGN
LTP 500
Cr 3
2. 3.
4.
5.
6.
INTRODUCTION TO AI AND SEARCH TECHNIQUES: Foundation and history of AI; Data, Information and Knowledge; AI problems and techniques AI programming languages, problem space representation with examples, blind search strategies; breadth first search; depth first search; heuristic search techniques: Hill climbing; best first search, A * algorithm AO* algorithm; Means-ends analysis KNOWLEDGE REPRESENTATION ISSUES: predicate logic; logic programming; constraint propagation; representing knowledge using rules REASONING UNDER UNCERTAINITY: Reasoning under uncertainty; Non monotonic reasoning; review of probability; Bayes probabilistic interferences and Dempster Shafer theory; Heuristic methods; symbolic reasoning under uncertainty; statistical reasoning, fuzzy reasoning PLANNING & GAME PLAYING: Minimax search procedure; goal stack planning; Non linear planning; hierarchical planning; Planning in situational calculus; representation for planning; partial order planning algorithm LEARNING: Basic concepts; rote learning; learning by taking advices; learning by problem solving; learning from examples; discovery as learning; learning by analogy; explanation based learning; neural nets; genetic algorithms. OTHER KNOWLEDGE STRUCTURES: semantic nets; partitioned nets; parallel implementation of semantic nets; frames; common sense reasoning and thematic role frames, architecture of knowledge based
50
Lingayas University, Faridabad system; rule based systems; forward and backward chaining; frame based systems APPLICATIONS OF ARTIFICIAL INTELLIGENCE: Principles of natural language processing; rule based systems architecture; expert systems; knowledge acquisition concepts; AI application to robotics and current trends in intelligent systems; Parallel and Distributed AI: Psychological modeling, parallelism in reasoning systems; Distributed reasoning systems and algorithms
M.Tech. (CS) unsupervised learning competitive learning network, Kohonen selforganizing networks, Hebbian learning, the Hopfield network. FUZZY SET THEORY: Basic definition and terminology; basic concepts of fuzzy logic; set theoretic operators; membership functions: formulation and parameterization; fuzzy union, intersection and complement; fuzzy rules and fuzzy reasoning; fuzzy inference systems: Mamdani and Sugeno fuzzy models, fuzzy associative memories. NEURO-FUZZY MODELLING: Adaptive neuro-fuzzy inference systems; neuro-fuzzy controller-feedback control; expert control; back propagation through time and real-time recurrent learning; reinforcement learning control; gradient-free optimization. NEURO-FUZZY CONTROLLER IN ENGINEERING APPLICATIONS: Fuzzy logic in control engineering- Mamdani and Sugeno architecture for fuzzy control; analytical issues in fuzzy logic control; fuzzy logic in intelligent agents; fuzzy logic in mobile robot navigation; fuzzy logic in database systems; applications of fuzzy logic in medical image segmentation. GENETIC ALGORITHMS: Basics of genetic algorithms; design issues in genetic algorithm; genetic modeling; hybrid approach; GA based fuzzy model identification; fuzzy logic controlled genetic algorithm, neurogenetic hybrids and fuzzy genetic hybrids.
7.
4.
5.
REFERENCE BOOKS
1. 2. 3. 4. 5. 6. 7. Rich Elaine, Knight Kevin and Nair Shivshankar B., Artificial Intelligence, 3rd Edition, Tata McGraw Hill, 2006 Konar Amit, Artificial Intelligence and Soft Computing Behavioural and Cognitive Modeling of the Human Brain, Special Indian Edition, CRC Press, 2008 Barnes Stuart (ed.), Knowledge Management Systems Theory and Practice, Indian Edition, Cengage Learning, 2002 Nilson Nils J., Artificial Intelligence, Harcourt Asia Pte. Ltd. Russell Stuart and Norvig Peter, Artificial Intelligence: A Modern Approach, Prentice Hall of India, 1998 Patterson O. W., Introduction to Artificial Intelligence & Expert Systems, Prentice Hall of India Clockson and Mellish, Programming PROLOG, Narosa Publications 6.
7.
REFERENCE BOOKS
1. Rajasekharan S. and Vijayalakshmi Pai S. A., Neural Networks, Fuzzy Logic & Genetic Algorithms, Prentice-Hall of India, 2003 2. Kecman Vojislav, Learning and Soft Computing, MIT Press, 2001 3. Konar Amit, Artificial Intelligence and Soft Computing Behavioural and Cognitive Modeling of the Human Brain, Special Indian Edition, CRC Press, 2008 4. Goldberg David E., Genetic Algorithms, Pearson Education, 2003. 5. Sivanandam, Introduction to Neural Networks with MATLAB 6.0, Tata McGraw Hill 6. Kumar Satish, Neural Networks: Classroom Approach, Tata McGraw Hill 7. Yen John and Langari Reza, Fuzzy Logic, Intelligence, Control, and Information, Pearson Education, 2003. 8. Zurada Jack N., Introduction to Neural Networks, Jaico Publishers. 9. Haykin Simon, Neural Networks, Prentice Hall, 1993/Pearson Education, 1999. 10. Koza J., Genetic Programming, MIT Press, 1993
WEB REFERENCES
1. 2. 3. 4. 5. http://en.wikipedia.org/wiki/Knowledge-based_systems http://www.kbsi.com/ http://courses.csail.mit.edu/6.871/ http://www.wtec.org/loyola/kb/toc.htm http://www.informatik.uni-trier.de/~ley/db/conf/kes/index.html
CS-602
1. 2.
SOFT COMPUTING
LTP 510
Cr 4
3.
INTRODUCTION: Comparison of soft computing methods: neural networks, fuzzy logic, genetic algorithm with conventional artificial intelligence (hard computing). OPTIMIZATION: Least-square methods for system identification, recursive least square estimator; LSE for nonlinear models; derivative based optimization: descent methods, Newtons method, conjugate gradient methods; nonlinear least-squares problems: Gauss Newton method, Levenberg- Marquardt method. NEURAL NETWORKS: Different architectures; back-propagation algorithm; hybrid learning rule; supervised learning- perceptrons, adaline, back-propagation multilayer perceptrons, radial basis function networks; 51
WEB REFERENCES
1. 2. 3. 4. 52 http://www.helsinki.fi/~niskanen/sc2000.html http://en.wikipedia.org/wiki/Soft_computing http://www.softcomputing.es/en/home.php http://www.springerlink.com/content/101181/
M.Tech. (CS) Introduction; open-loop and closed loop control systems; PID controllers; fuzzy logic controller; application examples: washing machine, automotive systems, auto-focusing digital camera, air-conditioner; EMBEDDED SYSTEM DEVELOPMENT: design methodologies; architectural design; design examples: telephone PBX, PDA, set-top box, elevator control system, ATM system; fault-tolerance techniques; reliability evaluation techniques
CS-605
1.
EMBEDDED SYSTEM DESIGN
LTP 510
Cr 4
2. 3.
4.
5.
6.
7.
REAL TIME OPERATING SYSTEMS: Real time operating system overview; exposure to Windows CE, QNX, Micro kernels and c/OS of introduction to process models; Interrupt routines in an RTOs environment, encapsulating semaphores and queues; hard real-time scheduling considerations; saving memory space. MICROPROCESSORS AND MICRO-CONTROLLERS: 16 and 32 bit microprocessor and micro-controller and DSP hardware with reference to embedded system. EMBEDDED SOFTWARE DEVELOPMENT TOOLS AND COMPILERS: host and target machines; linker/ locators for embedded software; cross compilers, cross assemblers and tool chairs; gce compiler; basic concept of device drivers; serial communication interface device driver. EMULATION: System synthesis of hardware/ software co-emulation; simulation speed of emulators; JTAG OCD communication: communication protocols with special reference to embedded system; TCP/IP; VDP wireless protocols; IRDA; Blue tooth IEEE 8.8.11 INTRODUCTION TO EMBEDDED SYSTEMS: Introduction; overview; design process, instruction set architecture; CISC and RISC instruction set; architecture; basic embedded processor/microcontroller architecture; memory system architecture; I/O sub-system, co-processors and hardware accelerators; processor performance enhancement; DESIGNING EMBEDDED COMPUTING PLATFORM: Using CPU bus; memory devices and their characteristics; I/O devices; component interfacing, memory interfacing; I/O device interfacing; interfacing protocols; designing with processors -system architecture, hardware design, FPGA based design; implementation - development environment; debugging techniques; design examples - data compressor, alarm clock PROGRAMMING EMBEDDED SYSTEMS: program design; programming languages; use of high level languages; programming and run-time environment; basic compilation techniques; analysis and optimization of execution time; analysis and optimization of energy and power; analysis and optimization of program size, program validation and testing; OPERATING SYSTEM: basic features of an operating system, kernel features, processes and threads, context switching, scheduling, inter-process communication, real-time memory management, I/O processes, example Real-time OS: VxWorks, RT-Linux, Psos; evaluating and optimising operating system performance; power optimisation strategies for processes NETWORK BASED EMBEDDED APPLICATIONS: Network fundamentals; layers and protocols; network architectures; distributed embedded architectures; elements of protocol design; high level protocol design languages; network based design; internet-enabled systems: protocols for industrial and control applications, internetworking protocols, wireless applications; EMBEDDED CONTROL APPLICATIONS: 53
REFERENCE BOOKS
1. 2. 3. 4. 5. 6. 7. 8. 1. 2. 3. 4. Simon David E., An Embedded System Primer, Addison-Wesley,1999 Marwedel Peter, Embedded System Design, Springer, 2006 Bentham Jeremy, TCP/IP Lean: Web servers for Embedded Systems, 2002 Grehan Rick, Realtime Programming: A Guide to 32 bit Embedded Development, Addison-Wesley, 1999 De Micheli G., Ernst Rolf, and Wolf Wayne, eds., Readings in Hardware/Software Co-Design, Morgan Kaufmann, Systems-on-Silicon Series Embedded Vahid Frank and Givargis Tony D., System Design: A Unified Hardware/Software Introduction, Addison Wesley, 2002. Barr Michael, Programming Embedded Systems in C and C++, O'Reilly, 1999. Ganssle Jack, The Art of Designing Embedded Systems, Newnes, 2000. http://www.technology.niagarac.on.ca/courses/ctec1630/ http://www1.cs.columbia.edu/~sedwards/classes/2005/4840/index.html http://ece-www.colorado.edu/~mcclurel/ http://www.eetasia.com/CAT_499495_embedded-systems.HTM
WEB REFERENCES
CS-652
SOFT COMPUTING & ARTIFICIAL INTELLIGENCE LAB
LTP 004
Cr 2
LIST OF EXPERIMENTS
PART A: The students should do the listed experiments from the course CS-601 Knowledge based System Design: 1. 2. 3. 4. 5. 6. 7. 54 Study of Prolog programming language Write at least 3 programs to use iterative structures using Prolog Write at least 3 programs to demonstrate inferencing/deductive logic using Prolog Write a program to solve 8 queens problem using Prolog. Solve any problem using depth first search using Prolog. Solve any problem using best first search using Prolog. Solve 8-puzzle problem using best first search using Prolog
Lingayas University, Faridabad 8. Solve robot (traversal) problem using means end analysis using Prolog. 9. Solve traveling salesman problem using Prolog. 10. Write program to exhibit the ability of building an expert system using Prolog 11. Study the properties and issues of natural language processing 12. Study the grammar mapping issues in language translation from English to Hindi and vice versa PART B: The students are advised to take up at least two experiments from each Unit of the course CS-602 Soft Computing.
M.Tech. (CS)
CS-658
SEMINAR III
LTP 004
Cr 2
The work of Dissertation Phase-I is to be presented by the student in the form of Seminars III. The work of monitoring will be done by the guide and evaluation by the committee consisting of guide, course coordinator and the HOD or his nominee.
CS-653
DISSERTATION PRELIMINARY
LTP 0 0 10
Cr 5
CS-659
DISSERTATION PHASE - II
LTP 0 0 24
Cr 12
See note as given under course CS-659.
Every student will carry out dissertation under the supervision of a guide. The topic of dissertation shall be approved by a committee constituted by the HOD. The method of evaluation including intermediate assessment shall be as evaluated by the pertinent BOS.
CS-654
SEMINAR II
LTP 004
Cr 2
The work of Dissertation Preliminary is to be presented by the student in the form of Seminars II. The work of monitoring will be done by the guide and evaluation by the committee consisting of guide, course coordinator and the HOD or his nominee.
Dissertation work is spread over three terms and coded as CS-653, CS-656 and CS-659. The distribution of amount of work in these three terms is equivalent to 5, 6 and 12 credits respectively. The evaluation of work is continuous but award of grade is for 23 credits in the last term on the basis of total work.
CS-660
TEACHING PRACTICE-I
LTP - - -
Cr 2
CS-656
DISSERTATION PHASE - I
LTP 0 0 12
Cr 6
CS-661 LTP 008 Cr 4
TEACHING PRACTICE II
LTP - - -
Cr 2
CS-657
MINOR PROJECT
The student is required to do the design/fabrication/coding/simulation of equipment/process/system of his/her choice and to be approved by the course coordinator. The course coordinator will evolve the evaluation procedure under the guidance of HOD. 55
Teaching practice comprises of two non-two letter mandatory courses to be done under the guidance of HOD. Here, the student is required to be engaged in teaching of two UG courses (I and II) of his/her choice during the period between IVth to IXth Terms of the M.Tech. Degree Programme. The student shall register for Teaching Practice only at the time he plans to take up teaching of UG course, but the credits earned will be counted in Term-VI for Full Time students and Term-IX for Part Time students. ***** 56

M.tech Syllabus

Загружено:

Сведения о документе

Исходное описание:

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

M.tech Syllabus

Загружено:

Авторское право:

Доступные форматы

Lingayas University, Faridabad

NON TWO-LETTER GRADE COURSES

COURSE CREDIT ASSIGNMENT

ABSENCE DURING EXAMINATIONS

Fail Incomplete Audited Withdrawal Satisfactory Unsatisfactory

APPEAL FOR REVIEW OF GRADE

8.5 6.75 5.0 but < 6.75

WITHDRAWAL FROM PROGRAMME

M. TECH. DEGREE REQUIREMENTS

TERMINATION FROM THE PROGRAMME

Lingayas University, Faridabad

Lingayas University, Faridabad

L-T-P 5-1-0 0-0-12 0-0-8 0-0-4

TERM-VI Dissertation Phase II Teaching Practice-I*** Teaching Practice-II 0-0-24 (24)

Cr 12+5+6 (2) 2+2 27

CS-507 CS-508 CS-509 CS-510

CS-517 CS-518 CS-519

Course No. CS-504 CS-505 CS-555

L-T-P 5-1*-0 5-1*-0 0-0-4

Lingayas University, Faridabad

Course No. CS-601 CS-602 CS-652

L-T-P 5-0-0 5-1*-0 0-0-4

Course No. CS-515 CS-656 CS-658

L-T-P 5-1*-0 0-0-12 0-0-4

TERM-VI Elective-II (any one)

L-T-P 5-0-0 0-0-8 0-0-2

Course No. CS-659 CS-660 CS-661

TERM-IX Dissertation Phase - II Teaching Practice-I*** Teaching Practice-II 0-0-24 (24)

Cr 12+6+5 (2) 2+2 27

Minor Project Seminar I 5-1-8 (14)

CS-507 CS-508 CS-509 CS-510

CS-517 CS-518 CS-519

ANALYSIS & DESIGN OF ALGORITHMS

ADVANCED DATABASE MANAGEMENT SYSTEMS

Lingayas University, Faridabad

OBJECT ORIENTED SOFTWARE ENGINEERING

COMPUTER SYSTEM SOFTWARE

Lingayas University, Faridabad

ADVANCED COMPUTER NETWORKS

INFORMATION STORAGE & MANAGEMENT

1. INTRODUCTION: Meeting today's data storage needs - data creation,

CRYPTOGRAPHY AND DATA COMPRESSION

Lingayas University, Faridabad

NETWORK SECURITY & MANAGEMENT

DIGITAL IMAGE PROCESSING

ADVANCED COMPUTER ARCHITECTURE

Lingayas University, Faridabad

DATA WAREHOUSING AND DATA MINING

ADVANCED OPERATING SYSTEMS

SPEECH RECOGNITION & GENERATION

NATURAL LANGUAGE PROCESSING

Cr 3 CS-522 EXPERT SYSTEMS

ADVANCED DATABASE MANAGEMENT SYSTEMS LAB

Lingayas University, Faridabad

SOFTWARE ENGINEERING LAB

ADVANCED OPERATING SYSTEMS LAB

KNOWLEDGE BASED SYSTEM DESIGN

Lingayas University, Faridabad

EMBEDDED SYSTEM DESIGN

SOFT COMPUTING & ARTIFICIAL INTELLIGENCE LAB

See note as given under course CS-659.

See note as given under course CS-661.

L-T-P 5-1-0 5-1-0 0-0-4