SCHOOL OF COMPUTING SCIENCES

M.S. Software Engineering

CURRICULUM & SYLLABI

[REGULATIONS- 2005]

[as approved in the 11th Meeting of the Academic Council held on 25.3.06]

A place to learn; A chance to grow

SCHOOL OF COMPUTING SCIENCES M.S. Software Engineering - Regulations

(Applicable to candidates admitted from the academic year 2005 06)
1.

Programme refers to M.S. in Software Engineering Programme Course refers any Theory or Laboratory Course in the Programme University refers to VIT University

M.S. Programme in Software Engineering The Master of Science in Software Engineering (abbreviated as M.S. Software Engineering) is a 5 years integrated program leading to a Post Graduate Degree in Software Engineering. The first three years of the M.S. (Software Engineering) programme deal with the Courses and course content similar to an undergraduate programme in computing and allied domains. The later two years of the programme deal with the Courses and course content of postgraduate level specializing in software engineering discipline.

2.

Condition for Admission a) Eligibility Criteria for Indian Students Candidates seeking admission to the First year M.S. (Software Engineering) Programme should have passed the final examination of +2 Higher Secondary course in the academic stream (Mathematics, Physics and Chemistry as Courses of study) conducted by the appropriate authority or any other examination approved by the Academic Council of this University as equivalent there to. The students shall also satisfy the conditions regarding minimum marks, number of attempts in the qualifying examination and age as prescribed by the AICTE / UGC and physical fitness as may be prescribed by the Academic Council of the University. b) Eligibility Criteria for Foreign Students: GCE Examination of UK with pass grades in five Courses at the Ordinary level (O level) and two Courses at the advanced level (A level) High School Certificate Examination, University of Cambridge Local Examinations Syndicate, UK. International Baccalaureate Examination of Geneva. High School Graduation from an accredited institution of USA. 12 years High School Grade 12 pass from the accredited institutions of Canada. 12 years High School Graduation / Diploma / Certificate of approved Board Schools of China, Thailand, Indonesia, Bhutan, Syria, Bangladesh, Sri Lanka, Iran, Iraq, Kuwait, Bahrain, Oman, Yemen, Saudi Arabia, UAE and other Gulf Countries. 12 years Secondary stage qualifications of National Examination Board / Council of Ministry of Education of Kenya, Nigeria, Sudan, Tanzania, Uganda and Rwanda.
2

 High School Certificate (HSC) and Cambridge School Certificate (A level) from the accredited institution of Mauritius. 3. Duration and Structure of the programmes a) Duration of the programmes M.S. Software Engineering programme normally extend over a period of five academic years i.e., 10 semesters. The programme comes to an end when the candidate earns a minimum of 220 credits. b) Structure of the programmes i. The program will consist of: 1. Science Courses as basics to engineering 2. Core Courses for the programme 3. Elective Courses for programme 4. Open Elective Courses in Cafeteria System 5. Project Work / Thesis The programmes typically may also include mini projects / seminars / assignments / practical / industry-orientation/communication skill classes, etc. The focus during the program is to: Impart Scientific, Engineering and Managerial Skills for becoming a Software Professional Deal with recommended Knowledge Areas in Software Engineering. Develop Software Systems Design Competency and Problem Solving Skills Apply Software Engineering Methodologies in industry and real-life application scenarios ii. Programme Specific Electives A candidate may be permitted by Dean of the School to choose the Programme Specific Electives Courses to specialize in a particular knowledge area. A candidate in his/her the third of year of study may be permitted by Dean of the School to choose B.Tech. (CSE)/B.Tech. (IT) Programme Specific Elective Courses. Similarly, a candidate in his/her the fourth and fifth years of study may be permitted by Dean of the School to choose M.Tech. (CSE)/M.Tech. (IT) Programme Specific Elective Courses iii. University Elective Courses and Cafeteria Courses A candidate may be permitted by the Dean of the School to choose the University Elective Courses and Cafeteria Courses during the period of study. A candidate in his/her the third of year of study may be permitted by Dean of the School to choose B.Tech. Elective Courses. Similarly, a candidate in his/her the fourth and fifth years of study may be permitted by Dean of the School to choose M.Tech. Elective Courses iv. Project work/Thesis Project work shall be carried out during VII & X Semesters (2 full-time projects) under the supervision of a faculty member in the School. A candidate may however be permitted to work on the project in the reputed industry and R&D organizations on the recommendation and approval of the Dean of School. In such cases, there will be an external supervisor, who usually will be the engineer from the industry and R&D organizations where the project work is proposed to be carried out. The project in VII semester will be a team-based project preferably in the industry or real-life application scenarios. The project in X semester will be an individual project focusing on high-end research topics typically to be carried out at VIT University or in any reputed research centers of the industry and academia.
3

4. Eligibility for the Degree: A candidate shall be eligible for the award of M.S. (Software Engineering) degree if the candidate has earned a minimum number of 220 credits. 5. Semester Pattern: An academic year will have two Semesters. Normally the FALL Semester will be from June to November and the WINTER Semester from December to April, with sixteen weeks of class work in each semester. Courses can be offered during summer term, Course to the availability of faculty members and other resources. 6. Attendance Requirements: A candidate will be permitted to appear for the University Semester final examination in any Semester only if;
(i)

(ii)

The candidate has attended at least 75% of the classes in each of the courses registered by him / her. The candidates conduct and academic progress are satisfactory.

Attendance of 75% is compulsory to appear for examination. Total of Sick / Medical Leave and other leaves for paper presentation & cultural activities should not exceed 25%. Students with less than 75% attendance shall not be permitted to write the examination. 7. Scheme of Assessment (Evaluation & Examination) The following are the rules and regulations related to evaluation and examinations.
Learning Assessment of the Students at VIT has basically two components. a. b.

Continuous Assessment Tests (CAT) for 50 marks. Term End (TEE) Examination for 50 marks

Continuous Assessment Tests for Theory Course:

The CAT Examinations are conducted twice in a semester as per the notification in the academic calendar. Each exam will be conducted for 90 minutes with maximum marks of 50. However the marks scored by students are reduced to a maximum of fifteen. CAT I

CAT II Assignments Total

15 Marks 15 Marks 20 Marks (Number/Type of assignments and distribution of marks may be decided by the faculty member concerned) 50 marks

Term End Examination for Theory Courses

There will be a term end examination at the end of each semester for three hours for each course for a maximum mark of 100. The detailed dates of exam will be announced by the Controller of Examination (COE), six weeks before hand. These marks will be reduced to fifty.
Evaluation for Laboratory Courses

For the laboratory courses, the distributions of marks may be decide the faculty members concerned in the CAT examinations and by the examiners in case of the Term End Examinations: The final laboratory exam will be for a minimum of 3 hours.
4

 Pass Criteria for Courses

A candidate is declared to have passed in a course (theory / practical), if he / she has secured a minimum of 20 marks out of 50 in TEE and a total of 50 marks (Sum of CAT + TEE) out of 100 marks. There is no minimum mark requirement in CAT for a pass in a course. . 8. Procedure in case of Failure If a candidate fails to obtain the minimum grade in a particular course (theory/lab), the candidate is required to reappear for the course in the supplementary examination which will be conducted few days after the declaration of results. If he/she fails to get minimum grade in the supplementary examination for the course, the candidate is required to re-register for the course in the subsequent semesters as and when it is offered. If the candidate fails to get minimum grade in the supplementary exam of the elective course and if he/she desires can drop the course and choose any other elective course with the approval of Dean of the School.

Normally the supplementary examination is conducted only for the failed candidates. The fact that the student has taken the supplementary examination will be reflected in the mark sheet by a mark * against the Course.

Under extraordinary circumstances, if a student is not able to appear for the regular examinations due to hospitalization or death in the family, he / she will be allowed to write supplementary exams if he / she has obtained prior permission from Dean of the School and COE, applying in the prescribed format before the commencement of regular exam. For such candidates, it will be treated as first attempt.

Supplementary Examinations

The university will conduct supplementary examination within 10 days from the date of declaration of results. Such of those failed candidates who wish to take up supplementary exams need to register for the same by paying prescribed examination fees.

9.

Perusal / Revaluation of Evaluated Answer Scripts: CAT Exam answer scripts will be handed over to students by the respective faculty members after valuation. Any discrepancy will be corrected then and there. If any one wants to improve the CAT marks, it can be done only by re-registering for the course. After the results are published, students desirous of seeing their TEE answer scripts have to apply for the same within a week from the date of publication of results by paying the prescribed fee. Similarly for revaluation of answer scripts, they have to apply with prescribed fees within a week from the date of publication of results. There is no provision for revaluation in Labs / Practical exams and Project Works examinations.

10. Grading System Based on the performance, each student will be awarded finally a letter grade at the end of the semester for each course. The letter grades and the corresponding grade points are as follows:
5

Letter Grade S A B C D E F (Fail) AAA (Absent)

Grade Point 10 9 8 7 6 5 Zero --

11. Relative Grading The letter grade assigned to a student in a course is based on Relative Grading system applicable in the university from time to time. 12. Calculation of Grade Point Average

The credits earned from the I Semester onwards will be accounted for calculation of CGPA. The Grade Point Average (GPA) for each semester and Cumulative Grade Point Average (CGPA) for all the semesters are calculated as follows: For each course passed, the grade point is multiplied by the credit for that Course. The total of all such credit earned is calculated. This grand total is divided by the credits earned (passed). The result thus calculated is the semester Grade Point Average. Similarly Cumulative Grade Point Average CGPA is calculated for more than one semester or for the programme. i.e.

(Ci GP) CGPA = i i Ci

Where Ci is the credit for the course GP is the grade point earned for that course Ci is the sum of credits of all courses appeared in all semesters including those i in which the student has F grade (If it is the case). 13. Registration for Examinations

All the students who have registered for a particular course in the prescribed format will be assumed to be taking the examination for that course at the end of the semester, provided he/she is declared not eligible due to 1. Shortage of attendance 2. Acts of indiscipline 3. Withdrawal of course 14. Absence in the Term End Examination

A candidate who is absent in the Term End Examination of a course / project work, after having registered for the same, without submitting withdrawal form, will be assumed to have got zero in the examination. If the candidate has appeared in CAT examination(s), an F (Fail) grade entry will be made in the grade sheet. If the candidate has been absent in both the CAT and Term End Examinations, a AAA (Absent) entry will be made in the grade sheet. 15. Withdrawal System
6

If a candidate fails to secure good marks in the Continuous Assessment Examinations and if, he/she so desirous, can withdraw from writing the Term End Examination. If a candidate withdraws, entry will not be made in the grade sheet. Withdrawal should be made in the prescribed format at least 10 days before the commencement of the first Term End Examination. But if he/she appears for the Term End Examination and fails, he/she will be given an opportunity to attend the supplementary examination. After writing the supplementary examination, he/she fails to get passing grade, reregistration can be done in the subsequent semesters. 16. Re-Registration Re-registration in subsequent semesters by students who have failed in a course or courses in a semester is permitted. The following is the procedure to be adopted for re-registration by students:1. Re-registration in a course or courses can be done in subsequent semesters for the same course offered by the parent School or for a similar course offered by any other School, Course to the approval of Dean of School. 2. The student will submit a letter to the respective Dean requesting for cancellation of the course (already undergone and failed or withdrawn) and indicating the course for which he/she wants to re-register in the subsequent semester. 3. The re-registration can be done for a course offered in subsequent semester or during Summer Term Courses. 4. Such students are required to apply in the prescribed format and to pay the prescribed Re-registration fees. 5. The student is required to attend the classes in the course for which he / she has re-registered along with other students and after earning the required percentage of attendance can appear for Continuous Assessment Examinations I & II and Term End Examination. 17. Time Limit for Passing The students are required to earn the total number of credits necessary within THREE years after completion of the prescribed period of study. A candidate may be permitted to temporarily break the study for valid reasons such as accident or hospitalization due to prolonged ill health, for a maximum period of one year. In such cases the time limit will be extended by the period of break of study. If any student is debarred / suspended for want of attendance or acts of indiscipline, it shall not be considered as break of study.
18. Award of M.S. (Software Engineering) Degree

After successful completion of the M.S. (Software Engineering) Programme and earning the required number of credits, a Provisional Degree Certificate will be issued to the eligible students. The M.S. (Software Engineering) Degree will be awarded during the Convocation. 19. Copying / Malpractice If a student indulges in copying or any malpractice in the CAT Examinations or in the Term End Examinations of the University, he will not be permitted to write any further examinations during the semester and all the examinations written in that semester will deemed to have been cancelled and zero marks will be awarded. The candidate will not be allowed to write the following supplementary examinations too.

-o0o-

7 -o0o-

SCHOOL OF COMPUTING SCIENCES

M.S (SOFTWARE ENGINEERING) DEGREE CURRICULUM
[as approved in the 11th Meeting of the Academic Council held on 25.3.06] I SEMESTER Subject Code 05MSE101 05MSE103 05MSE105 05MSE107 05MSE109 05MSE111 05MSE113L 05MSE115L Subject English for Engineers- I Multivariable Calculus & Differential Equations Modern Physics Introduction to Computer Science Electronic Devices and Circuits Programming in C Electronic Devices and Circuit lab Programming in C lab Total L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 C 3 4 4 3 3 3 2 2 24

II SEMESTER Subject Code 05MSE102 05MSE104 05MSE106 05MSE108 05MSE110 05MSE112 05MSE114L 05MSE116L Subject English for Engineers II Differential & Difference Equations Advanced Physics Digital Computer Fundamental Object Oriented Programming Environmental Studies Digital Computer Fundamentals Lab Object Oriented Programming Lab Total L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 3 C 3 4 3 3 3 3 2 2 23

III SEMESTER Subject Code 05MSE201 05MSE203 05MSE205 05MSE207 05MSE209 05MSE211 05MSE213L 05MSE215L Subject Complex Variables and Partial Differential Equations Microprocessor and Assembly Language Programming Data Structures and Algorithms Computer Profession and Society Programming Practices and Coding Standards Management Information Systems Microprocessor and Assembly Language Programming Lab Data Structures and Algorithms Lab Total 22 L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 3 C 3 3 3 3 3 3 2 2

IV SEMESTER Subject Code 05MSE202 05MSE204 05MSE206 05MSE208 05MSE210 05MSE212 05MSE214L 05MSE216L Subject Probability Statistics and Reliability Computer Architecture and Organization System Programming Internet Programming Database Management Systems Theory of Computation Internet Programming Lab Database Management Systems Lab Total 22 L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 C 3 3 3 3 3 3 2 2

V SEMESTER Subject Code 05MSE301 05MSE303 05MSE305 05MSE307 05MSE309 Subject Discrete Mathematical Structure Software Engineering Operating Systems Computer and Communication Networks Open Source Programming I
9

L 4 4 4 4 4

T 0 0 0 0 0

P 0 0 0 0 0

C 3 3 3 3 3

05MSE311 05MSE313L 05MSE315L

Management in Engineering Computer and Communication Networks Lab Operating Systems Lab Total

4 0 0

0 0 0

0 0 3

3 2 2 22

VI SEMESTER Subject Code 05MSE302 05MSE304 05MSE306 05MSE308 05MSE310 05MSE312L 05MSE314L Subject Graph Theory and its Applications Networking Protocols and Standards Software Architecture and Design Requirements Engineering Compiler Design Elective I CASE Tools Lab - I Compiler Lab Total L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 3 C 3 3 3 3 3 3 2 2 22

VII SEMESTER Subject code 05MSE401 Subject Project I L 0 T 0 P 0 C 22

VIII SEMESTER Subject code 05MSE402 05MSE404 05MSE406 05MSE408 Subject Operation Research Software Testing Software Configuration Management Open Source Programming - II Elective II Elective III 05MSE410L 05MSE412L Software Testing Lab Open Source Programming - II Total
10

L 4 4 4 4 4 4 0

T 0 0 0 0 0 0 0

P 0 0 0 0 0 0 3 3

C 3 3 3 3 3 3 2 2 22

IX SEMESTER Subject code 05MSE501 05MSE503 05MSE505 05MSE507 Subject Design Patterns Software Inspection Software Measurements Software Quality and Process Improvement Elective IV 05MSE509L 05MSE511L Elective V CASE Tools Lab - II Software Measurements Lab Total L 4 4 4 4 4 4 0 0 T 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 C 3 3 3 3 3 3 2 2 22

X SEMESTER 05MSE502 Project 0 0 0 22

Electives
05MSE E0105MSE E0205MSE E0305MSE E0405MSE E0505MSE E0605MSE E0705MSE E0805MSE E0905MSE E1005MSE E1105MSE E1205MSE E1305MSE E1405MSE E1505MSE E1605MSE E1705MSE E18Data Warehousing & Data Mining Natural Language Processing E- Commerce Network Security Distributed Computing Web Services Image Processing Digital Signal Processing Computer Simulation and Modeling Mobile Communication Embedded Systems Neural Networks Multimedia Computing Intelligent Systems Sensor Networks Geographic Information System Software Reengineering Software Agents
11

05MSE E1905MSE E2005MSE E2105MSE E2205MSE E2305MSE E2405MSE E25-

Decision Support System Enterprise Resource Planning Software Project Management Software Risk Management Clean Room Software Engineering Domain Engineering Principles of User Interface Design

12

05MSE101 ENGLISH FOR ENGINEERS-I

L 4 T P C 3

NOTE: The syllabus will be same as English for Engineers-I course in the B.Tech.-CSE and B.Tech-IT Programmes

13

05MSE103 MULTIVARIABLE CALCULUS AND DIFFEERENTIAL EQUATIONS

L 4 T P C 3

NOTE: The syllabus will be same as Multivariable Calculus & Differential EquationsI course in the B.Tech.-CSE and B.Tech-IT Programmes

14

05MSE105 MODERN PHYSICS

L 4 T P C 3

NOTE: The syllabus will be same as Modern Physics course in the B.Tech.-CSE and B.Tech-IT Programmes

15

05MSE107 - INTRODUCTION TO COMPUTER SCIENCE

L 4 Aim To establish knowledge in basics of computer science Objectives Exposure to fundamentals of computer science and Information technology. Introduction to Computer Science & IT Information systems Software and data IT in business, Industry, Home at Play, Education, Training, Entertainment, Arts, Science, Engineering and Mathematics Computers in Hiding Global Positioning System (GPS) Types of Computers Anatomy of a Computer T P C 3

Foundations of Modern Information Technology The Central Processing Unit How Microprocessors and Memory Chips are Made Memory Buses for Input and Output Communication with Peripherals I/O Devices Inputting Text and Graphics State of the Art Input and Output Pointing Devices- Foundations of Modern Output Display Screens Printers Modern Storage Storage Media Increasing Data Storage Capacity Backing up your Data The Smart Card Software and Software Issues User Interface Application Programs Operating Systems Document Centric Computing Network Computing Word Processing and Desk top Publishing Spreadsheet and Database Applications Network Applications Foundation of Modem Networks Local Area Networks Wide Area Networks Links between Networks Networks: Dial up Access High Bandwidth Personal Connections Multimedia Tools of Multimedia Delivering Multimedia Multimedia on Web. Text Book: 1. Information Technology The Breaking Wave, D.p.Curtin, K.Foley, K.Sen TMH 2002 Reference Books: 1. Using Information Technology Brief Version, Sawyer, Williams and Hutchinson, TMH 2003, 5th edition 2. Fundamentals of Information Technology, Alexis Leon and Mathews Leon, Vikas Publishing 1999

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

16

05MSE109 ELECTRONIC DEVICES & CIRCUITS *

L 4 T P C 3

Aim The subject covers most of the basic devices and their functioning, application and selection of apt devices to achieve a particular circuit function. Objective The students would become aware of the ranges with respect to frequency, temperature, power ratings etc. The operational requirements such as proper heat sink arrangement etc. shall be provided. Semiconductor Basis Review of extrinsic semiconductor drift and diffusion currents thermal generation of minority carriers Hall Effect. Junction Diodes- Energy band diagram PN junction junction diode volt ampere characteristics ratings transition and diffusion capacitance varactor diode avalanche and Zener break down Zener diode tunnel diode PIN diode, clipper and clamper circuits. Transistor Principle of transistor action current components cutoff, active and saturation region input and output characteristics CE, CB, & CC Configurations small signal and large signal beta transistor breakdown ratings Thermal runaway problems Use of Heat sinks. FET And Other Devices Constructional features and characteristics of JFET and MOSFET depletion and enhancement modes VVR operation of FET handling precautions for MOSFET construction and characteristics of UJT, fabrication and characteristics of four layer devices such as SCR, Triac and Diac. Photo Electric Devices Photo emissivity-photo electric theory-Photo diodes Photo voltaic cell LED & LCD Photo multiplier circuit Light absorption and photo devices Photo conductive cell (LDR) Photo transistor PN junction LASER Solar energy converters. Electronic Circuits Half wave and full wave rectifier circuits performance characteristics of rectifier circuits filter consideration capacitor, inductor, L section, RC section filters Voltage regulators current regulators, IC voltage regulators protection circuits for dc power supplies switched mode power supplies. TEXT BOOK: 1. G.K. Mithal, Electronic Devices & Circuits, Khanna Publishers, New Delhi, 2001. REFERENCE BOOKS: 1. Ben.G. Streetman, Solid state electronic devices, Prentice Hall of India, 1999.
17

2. S.P. Mathur, D.C. Kulshreshtha and P.R. Chanda, Electronic Devices and Applications of Integrated Circuits, 1998. 3. J. Millman, C.C. Halkias, Electronic Devices and Integrated Circuits, McGraw Hill, 1997. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE111- PROGRAMMING IN C
L 4 Aim To understand the basics of C Programming. Objective To know the basic C programming constructs like data types, operators, decision statements, Control statements, functions, arrays and pointers. Fundamentals of C Programming C fundamentals - character set - identifier and key works - data types - constants variables - declarations - expressions - statements - arithmetic, unary, relational and logical, assignment and conditional operators - liberty functions. Primitive structures in C Data input/output functions - simple C programs flow of control - control structures switch, break and continue go to statements - comma operator Functions Functions - defining, accessing function - function prototypes - passing arguments recursions - storage classes multi file programs. Arrays and Structures Arrays - defining and processing - passing array to functions - multidimensional arrays arrays and string structures - passing structures to functions - self referencing structures - unions Pointers Pointers - declarations - passing pointers to function - operation in pointers - pointer and arrays of pointers structures and pointers - files: creating processing, opening and closing - bit wise operations. Text Book: 1. Kamthane - Programming with ANSI and Turbo C, Pearson Education, 2002. Reference Books 1. Narain Gehani C Advanced Introduction Universities Press 2004. 2. Noel Kalicharan C by Example Cambridge university Press-1996. 3. Kamthane - Programming with ANSI and Turbo C 2002. 4. Herberet Schildt The Complete Reference, TMH, 4th Edition, 2000.
18

T -

P -

C 3

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

19

05MSE113L ELECTRONIC DEVICES CIRCUITS LAB*

L T P 3 C 2

LIST OF EXPERIMENTS: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. Study of CRO and measurement of amplitude frequency time period and phase angle. Forward and reverse characteristics of PN junction diode. Characteristics of Zener diode and study of its power ratings. Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters. Drain and transfer characteristics of JFET and graphical determination of transconductance. Static emitter characteristics of UJT and PUT. V-I characteristics of SCR and TRIAC. Switching characteristics of BJT SCR and MOSFET. V-I characteristics of tunnel diode and varactor diode. Study of Logic Gates (AND OR NAND NOT EXOR gates). Study of Flip flops (D T JK SR flip-flops). Design and testing of Half and Full adders. Design and testing of Half and Full sub tractor. Implementation and testing of 3 bit binary ripple counter. Implementation and. testing of code converters. Implementation and testing of Multiplexers. Implementation of shift registers using flip-flops. Study of decade counter using flip-flops.

20

05MSE115L PROGRAMMING IN C LAB

L T P 3 C 2

LIST OF EXPERIMENTS 1. 2. 3. 4. 5. 6. 7. 8. 9. Determining a given number is prime or not. Pascals Triangle. String Manipulation. Matrix Multiplications. Finding Determinant of a Matrix. Finding inverse of a Matrix. Checking for Tautologies and Contradictions. Euclideans Algorithms for finding GCD. Generating Permutations.

10. Computing Combinations. 11. Creating database for telephone numbers and related operations Use file concepts. 12. Creating database for Mailing addresses and related operations Using Structures. 13. Creating database for Web page addresses and related operations using pointers. 14. File Processing.

21

05MSE102 - ENGLISH FOR ENGINEERS II

L 4

T -

P -

C 3

NOTE: The syllabus will be same as English for Engineers-II course in the B.Tech.-CSE and B.Tech-IT Programmes

22

05MSE104 DIFFERENTIAL AND DIFFERENCE EQUATIONS

L 4 T P C 3

NOTE: The syllabus will be same as Differential & Difference Equations course in the B.Tech.-CSE and B.Tech.-IT Programmes .

23

05MSE106 ADVANCED PHYSICS

L 4 T P C 3

Aim To enable the students to understand the nature of different types of materials namely Dielectrics, Magnetic, Semi conducting, Conducting and Superconducting materials. Objective To enable the students to understand the nature of different types of materials namely Dielectrics, Magnetic, Semi conducting, Conducting and Superconducting materials. Dielectrics Introduction Dielectric parameters various polarization mechanisms in dielectrics and their frequency and temperature dependence Lorentz field Clausius Mosotti relation dielectric loss dielectric strength dielectric break down different types of dielectric breakdown problems. Magnetic Materials Origin of magnetic moment Bohr magnetron properties of dia, para, ferro, antiferro and ferri magnetic materials Ferromagnetism Domain theory of ferromagnetism Hystersis soft and hand magnetic materials Antiferromagnetic materials floppy and magnetic disk drives magnetic memories ferrite core memory and bubble memory Semi conducting Materials Band theory of solids Semiconductors classification intrinsic, extrinsic-n type, p type-direct, indirect band gap - electron hole pair formation and recombination radiative and non radiative band to band recombination - structure of Si and Ge Variation of Fermi level with carrier concentration and temperature in n type solar cell Problems. Conducting Materials Conducting Materials Free electron gas Drude Lorentz theory electrical conductivity relaxation time drift velocity thermal conductivity Wiedmann Franz law Matthiessens rule, Hall effect problems. Superconducting materials Zero resistance source of superconductivity properties effect of magnetic field Meissner effect critical current isotope effect type I and II superconductors BCS theory London equations (I&II) Josephson effect (AC & DC) application cryotron SQUIDS problems. Text books: 1. Physics for engineers Department of Physics, VIT 2005. 2. Materials Science and Engineering by V.Raghavan, Prentice Hall, 4th edition 2000. Mode of Evaluation: Written Examination, Assignments, Seminars and Mini projects.

24

05MSE108 DIGITAL COMPUTER FUNDAMENTALS*

L 4 T P C 3

Aim The subject aims to impart the knowledge about digital logic fundamentals, design steps involved in flip-flop, shift register, designing a simple computer which is capable of providing few arithmetic and logical operation. Objectives The students shall be able to understand Boolean laws, Boolean algebra, Boolean logic, logic gate fundamentals, function of flip-flop and shift register, arithmetic and Logic unit, understand the memory representation in ROM, RAM and CPU. Number System Number Systems and Boolean Algebra- Number systems converting number from one base to another complements algorithms for rs and r-ls complements sign. Floating point representation of Codes- Binary decimal, error detection reflection alphanumeric codes. Basic laws, theorems and properties of Boolean algebra Boolean functions canonical and standard forms logical operations logic gates Karnough map up to 6 variables SOP and POS simplification dont care condition tabulation method. Combinational Logic Combinational Logic Design-Adder sub tractor code conversion analyzing a combinational circuit multi level NAND and NOR circuits binary parallel adder decimal adder RCD adder Magnitude comparator decoders demultiplexer. Sequential Logic Sequential Logic Design - Flip flops triggering of flip flop analyzing a sequential circuit state reduction excitation tables counters design with state equation. Registers - shift registers ripple and synchronous counters. Processor Organization Processor Organization-Memory unit inter register transfer micro operations bus organization scratch pad memory ALU design of ALU - status register effect of o / p carry design of shifter processor unit design of accumulator. Control Logic Control Logic Design- Control organization PLA control micro program control hardwired control micro program sequencer micro programmed CPU organization. Computer Design Computer Design- Computer configuration instructions and date formats instruction sets timing and control execution of instruction design of computer design of control. TEXT BOOK:
1.

Morris M. Mano, "Digital Design", Third Edition, Prentice Hall India, 2001
25

REFERENCE BOOKS: 1.Thomas C. Bartee, "Computer Architecture Logic Design", Tata McGraw Hill 1997. 2.A. P. Malvino and D. P. Leach, Digital Principles and Applications, 4 th edition, McGraw Hill 1999. Mode of Evaluation: By Assignment, Seminars and Written Examinations

05MSE110 OBJECT ORIENTED PROGRAMMING*

L T P C 4 0 0 3 Aim The subject aims to impart the knowledge about the evolution of C++ language, features of Object-oriented Programming and focuses on generic programming with templates and Exception handling. Objectives Students will be able to know the fundamentals of object oriented programming and use OOPs features such as inheritance, polymorphism, and templates. Basic Concepts Object Oriented fundamentals- Structured versus object-oriented development, elements of object oriented programming, fundamentals of OO-class, object, and abstraction and its importance, encapsulation, polymorphism, benefits of OOP, structure of C++ program. Classes Working with classes- Classes and Objects- Class specification, class objects, accessing class members, defining member functions, inline functions, accessing member functions within class, data hiding, class member accessibility, empty classes, constructors, parameterized constructors, constructor overloading, copy constructor, new, delete operators, this pointer, friend classes and friend functions. Function Overloading Overloading-Function overloading, operator overloading- overload able operators, unary operator overloading, operator keyword, limitations of increment/decrement operators, binary operator overloading, arithmetic operators, concatenation of strings, comparison operators, Generic programming with templates-Function templates, class templates. Inheritance Inheritance - Base class and derived class relationship, derived class declaration, Forms of inheritance, inheritance and member accessibility, constructors in derived class, destructors in derived class, constructor invocation and data member initialization, data conversion, abstract classes, virtual base classes, virtual functions. Files Files and Streams-Opening and Closing a file, file modes, file pointers and their manipulation, sequential access to a file, ASCII and binary files, random access to a file, error handling during file manipulations, Exception handling-exception handling model, exception handling constructs, lists of exceptions, catching exceptions, handling exceptions.
26

TEXT BOOK: 1. K.R.Venugopal, T.Ravishankar, and Rajkumar, "Mastering C++, Tata McGraw Hill, 1997 REFERENCE BOOKS: 1. E.Balagurusamy, Object Oriented Programming with C++, 2nd Edition, 2004, Tata McGraw Hill 2. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 3 rd edition, 1988. Mode of Evaluation: By Assignment, Seminars and Written Examinations

05MSE112 ENVIRONMENTAL STUDIES

L 4

T -

P -

C 3

Aim The subject aims to impart knowledge about natural resources, ecology, environmental pollution, Role of information technology in welfare of population and protection of environment. Objectives The students shall be able to learn about various natural resources, concepts of ecosystem, bio-diversity, pollution, population explosion, welfare programmes and role of Information technology in protection of environment. Resources Environment & Natural Resources- Definition, Scope, importance, need for public, Natural Resources use, exploitation, deforestation, construction of multipurpose dams effect on forests, Water resources use of surface and subsurface water, effect of floods, drought, water conflicts, Mineral resources use and exploitation, environmental effects of mining, food resources food problems, advantage and disadvantage of fertilizers & pesticides, effect on environment, Energy resources need to develop renewable energy, land resources Land degradation, land slides, soil erosion, desertification & case studies. Ecosystem Ecology-Concept of ecosystem, structure & function of an ecosystem, producers, consumers and decomposers, energy flow, ecological succession, food chains, food webs and ecological pyramids, various characteristics features of forest, grassland, desert, aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries). Biodiversity-Definition, genetic, species and ecosystem diversity, bio geographical classification of India, Values consumptive use, productive use, social, ethical, aesthetic and option values, hotspots, threats related to habitat loss, poaching of wildlife, man-wildlife conflicts, endangered and endemic species of India, Conservation of biodiversity. Pollution Environmental Pollution- Definition - Causes, Pollution effects and control measures of Air, Water, Soil, Marine, Noise, Thermal, Nuclear hazards. Solid Waste management: causes, effects and control measures of urban and industrial wastes, pollution measures, case studies, Disaster management: floods, earthquake, cyclone and landslides. Problems and Development
27

Urban problems related to energy & sustainable development, water conservation, rain water harvesting, watershed management, problems related to rehabilitation case studies, Environmental ethics- Issues and possible solutions, Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust case studies, Wasteland reclamation, Consumerism and waste products Environment Protection Act, Air, Water, Wildlife, Forest Conservation Act, Environmental legislation and public awareness. Environment Human Population and the Environment- Population growth, variation among nations, population explosion Family Welfare Programme, Environment and human health, Human Rights, Value Education, HIV / AIDS, Women and Child Welfare, Role of Information Technology Case Studies. Field Work- Documenting environmental assets river / forest / grassland / hill / mountain, Visit to local polluted site Urban / Rural / Industrial / Agricultural, Study of common plants, insects, birds, Study of simple ecosystems pond, river, hill slopes, etc., - Field Visits. TEXT BOOKS: 1. Erach Bharucha, University Grants Commission, 2. Brunner RC, 1989, Hazardous Waste Incineration, McGram Hill Inc. 480 pgs. REFERENCE BOOKS: 1. Cunningham WP, Cooper TH, Gorhani E & Hepworth MT, 2001. Environmental Encyclopedia, Jaico Publishing House, Mumbai, 1196 pgs. 2. De AK, Environmental Chemistry, Wiley Eastern Ltd. 3. Down to Earth, Center for Science and Environment(R) 4. Odum EP, 1971. Fundamentals of Ecology, WB Saunders Co. USA, 574 pages. 5. Rao MN and Datta AK, 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd. 345 pages. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

28

05MSE114L - DIGITAL COMPUTER FUNDAMENTALS LAB L 4 1. 2. 3. T P C 3

Design a Half adder and a Full adder using NAND gates only. Cascade them to implement a 2 bit binary adder. Design and implement Excess-3 to BCD code converter using logic gates. (Choice of Logic gates left to the student) Design and implement using NAND gates : 4:1 multiplexer 2:4 decoders Design and implement the following the following using 4-bit adder chip and gates. Excess-3 to BCD code converter BCD to Excess-3 code converter Design and implement a full adder using a multiplexer. Also implement a multiplexer tree using 3 multiplexes. Design and implement using decoder and other gates a. Full adder b. Full subtractor. Design and implement a 3 variable Boolean SOP expression using 2 numbers of 4:1 multiplexer IC. Design and implement a 3 stage asynchronous counter using J-K flip flops to count down from 7 to n (n>0). Display result on discrete LEDs and the waveform on CRO. Design and implement asynchronous counter using a Decade counter IC to count up from 0 to n (n<9). Display count value on 7 segment LED display using BCD to 7 segment code converter IC.

4.

5. 6. 7. 8. 9.

10. Design and implement to display result suitably: a. Asynchronous counter using 4 bit binary counter IC to count up from 0 to n ( n<=15). b. Asynchronous counter to count up to FFH using 2 stages of such an IC. 11 Design and implement Mod n (n<8) synchronous counter using flip flops. Display result suitably. 12 Design and implement a 3-stage up/down counter that counts from a preset value using Decade presettable counter ICs. Display result suitably. 13 Design and implement using 4-bit shift register IC: a. Johnson counter b. Ring counter 14 Design and implement the following: a. Oscillator for a given frequency using Schmitt trigger inverter and RC components. b. Crystal controlled clock using CMOS inverters.

29

05MSE116L OBJECT ORIENTED PROGRAMMING LAB*

L LIST OF EXPERIMENTS 1. Program illustrating function overloading feature. 2. Programs illustrating the overloading of various operators Ex : Binary operators, Unary operators, New and delete operators etc. 3. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. 4. Programs illustrating the use of destructor and the various types of constructors (no arguments, constructor, constructor with arguments, copy constructor etc). 5. Programs illustrating the various forms of inheritance : Ex. Single, Multiple, multilevel, hierarchical inheritance etc. 6. Write a program having student as on abstract class and create many derived classes such as Engg. Science, Medical, etc. from students class. Create their objects and process them. 7. Write a program illustrating the use of virtual functions. 8. Write a program which illustrates the use of virtual base class. 9. Write programs illustrating file handling operations: Ex. a) Copying a text file b) Displaying the contents of the file etc.
10. Write programs illustrating how exceptions are handled (ex: division-by-zero,

T -

P 3

C 2

overflow and underflow in stack etc).

30

05MSE201 COMPLEX VARIABLES AND PARTIAL DIFFERENTIAL EQUATIONS

L 4 T P C 3

Aim

To understand complex variables and partial differential equation

Objective
After completion the students will have a thorough knowledge in complex variables and partial differential equation. Functions of A Complex Variable Functions of a complex variable, limits and continuity, Cauchy Riemann equations, Analytic and Harmonic functions Complex potential Applications to flow around a corner and around a cylinder, Brach prints, branch cuts, linear transformations. (w = zA+B, w = z2 ,w= ez), Bilinear transformation, concept of conformal transformation Qualitative discussion on applications. Complex Integration Integration in the complex plane along a contour, the Cauchy-Goursat theorem, integral theorem Derivatives of analytic functions, Taylor and Laurent series(without proof's) singularities Zeros Poles, Residues, Cauchys Residue theorem Evaluation of integrals by the method of residues , Jordans lemma (without proof), Indented contour integral, Inversion contours for Laplace, Fourier and Z transforms. Partial Differential Equations Introduction Formation of PDEs Solution of PDE General, Particular and Complete integrals Lagranges Linear Equations Linear PDE of Higher order with Constant Coefficients Homogeneous and non homogeneous equation Solution of PDEs by the method of separation of variables. Applications of Partial Differential Equations Solution of Laplaces equations in Cartesian, Cylindrical and Spherical coordinates variable separable method: Potential flow over a sphere. Wave Equation-Vibrations of a Stretched string-Variable Separable Method- D Alembert s solution for the initial value problem, Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates. Integral Transforms Difference Equations and Z-transforms: Difference Equations with constant coefficients -Complementary function, particular integral method of undetermined co-efficient, variation of parameters technique (without proof), application to ladder type electrical network. Z-transform definition relation between Z transform and Laplace transform, Z-transform of elementary functions, properties of Z-transforms (proofs not required) Initial and final value theorems- Inverse Z-transforms partial fraction expansion method, Inversion contour method-solution of difference equations by Z- transform method. Exponential Fourier series Fourier Integral Transforms Definition Fourier Integral Fourier sine and cosine transforms; - Properties of Fourier transforms Convolution theorem for Fourier transforms Parsevals identity for Fourier transforms (proof not required) -Application of Integral Transforms to Partial differential equations: (i) Heat flow in an infinite bar (ii) Wave propagation on a semi infinite string (iii) Steady state heat flow in a semi-infinite domain.
Text Books: 31

1. Erwin Kreyzsizig, Advanced Engineering Mathematics, 8th Edition, John Wilag & Sons (Wiley
student Edison) (2004).

2. B. S. Grewal, Higher Engineering Mathematics, 38th Edition, Khanna Publications (2005).

Reference Books: 1. J. W. Brown and R.V. Churchill, Complex variables and application, Mc Graw Hill International ed., 7th Edition (2004). 2. R. V. Churchill and J. W. Brown, Fourier series and Boundary value problems, International student edition (1978) . 3. Ian Sneddon, Elements of Partial Differentail equations, MC Graw Hill International edition (1985). 4. MichaelD. Greenberg, Advanced Engineering Mathematics, 2nd Edition, PearsonEducation (2002). Mode of Evaluation: By Assignment, Seminars and Written Examinations.

32

05MSE203 MICROPROCESSORS AND ASSEMBLY LANGUAGE PROGRAMMING

L 4 Aim To understand the basic concepts of Micro processors and assembly language programming Objective: To understand the Architecture and working principles of various Microprocessors (8086 / 8088) To learn the interfacing of peripheral devices. To Code in assembly language Introduction Introduction to Microprocessor, Microprocessor-Based Computer Systems, Architecture Of 8086/8-88, Programmers Model Of 8086/8088, Segmentation And Memory Addressing In 8086/8088. Assembly language programming Assembly language, assemblers for the PC, addressing modes of 8086. Data movement instructions excluding string instructions, instruction encoding, assembling, linking and executing programs; arithmetic and logical instructions. String instructions, debugging programs, programming examples; program flow control instructions. Machine control AND miscellaneous instructions, programming examples, modular program development: use of linker, library, macros and conditional assembly. Hardware features of 8086/8088 Pin-outs an pin functions, clock generator, bus buffering, latching and timing diagrams, ready and wait state, min/max modes of operations. Memory interfacing Memory devices, address decoding, 8/16 bit memory interfacing, DRAM memory system Interrupt System and PIC (8259 A), I/O Interfacing Introduction to interrupts, Interrupt-related instructions, Interrupt processing, 8259A PIC and Interfacing of 8255 and 8254 devices- Application Examples. Text Book: Barry B.Brey, The Intel Microprocessors, Fourth Edition, Prentice-Hall India, 1997. 2. K.UdayaKumar and B.S.Umashankar., Advanced Microprocessors And IBM PC Assembly Language Programming, Tata McGraw Hill, 1996.
1.

T -

P -

C 3

Reference Book: 1. Doughlas V Hall., Microprocessors And Interfacing, Programming And Hardware, Second Edition, McGraw Hill, 1992. 2. Michael Throne, Computer Organization And Assembly Language Programming, Addison-Wesley, 1991.
33

3. Rajaraman & Radhakrishna, Essentials of Assembly Language Programming for The IBM PC, PHI 1999.

Mode of Evaluation: By Assignment, Seminars and Written Examinations

34

05MSE205- DATA STRUCTURES AND ALGORITHMS*

L 4 T P C 3

Aim This subject aims to impart knowledge about various types of data structures (standard and user defined) It covers algorithm analysis for the run time complexities and the space requirements. Objective To make the Students learn various types data structures algorithm analysis. The students would be able to implement various data structures and apply operations on them and also implement various sorting and searching techniques. Introduction Algorithm Analysis-Mathematical background model running time calculations complexity analysis abstract data types asymptotic notations. Stacks & Queues Stacks & Queues- Stack ADT stack model implementation of stacks applications of stacks infix, prefix and postfix expressions and their conversions, Queue ADT queue model array implementation of queues, List ADT simple array implementation of lists linked lists doubly & circular linked lists cursor implementation of linked lists polynomial addition and multiplication, Overview of Garbage collection & Compaction Trees Trees-Preliminaries implementations of trees tree traversals (inorder, preorder, postorder) binary trees implementation expression trees binary search trees threaded binary trees B trees B+-trees hashing hash function, depth first search & breadth first search shortest path algorithm. Sorting Insertion sort and its analysis, Shell sort, Heap sort and its analysis, merge sort and its analysis, quick sort and its analysis, bucket sort, selection sort, external sort. Algorithms Algorithm Design Techniques- Divide & Conquer Algorithm Strassens matrix multiplication and its analysis, Greedy Method- knapsack 01, Dynamic Programmingtraveling salesman problem, Back Tracking- 8 queens problem, Branch and Boundtravelling salesperson problem algebraic manipulations, Lower Bound Theory- Basic concepts of NP-hard and NP-complete. TEXT BOOK: 1. Mark Allen Weiss, Data Structures & Algorithm Analysis in C++, Addison Wesley , 2004. REFERENCE BOOKS: 1. E. Horowitz, S. Sahni and S. Rajesekar, Computer Algorithms, Galgotia-1999. 2. Jean-Paul Tremblay and Paul. G. Sorenson, An Introduction to Data Structures with Applications, Tata McGraw Hill, 1991.

35

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE207 COMPUTER PROFESSION AND SOCIETY*

L 4 T P C 3

Aim To provide the concept of computer profession and how it helps the society. Objectives To emphasis the students to adhere the ethics, issues related to ethics. Computer Ethics Introduction: What is computer ethics? Philosophical Ethics; Professional Ethics; The Social Implication of Computers: Autonomy and Access. Ethics and Ethical Decision Making Why we should care about Ethics, Computer Ethics and Regular Ethics, Competing Factors that affect our behavior, Value judgements, The types of ethical choices, Making defensible decisions. Ethics and Information Technology New Technologies, New Problems, Why is Ethical Computer Use a Special Challenge? What is Unethical computer use? Ethical issues and ethical decision Property rights in Computer Software; Computers and Privacy; Crime, Abuse, and Hacker Ethics; Responsibility and Liability. Solving Ethical Dilemmas: A Sample Case Exercise-A Four-Step Analysis Process, Sample Case-Too much of a good thing? Discovering an Ethical Dilemma, Using the Four-Step process. Selected Case Studiess, Ethics Codes and Polices: The need for Codes and Polices, An Email Privacy Policy, An Internet Use Policy. Communication and Personal Skill Communicating at work- The importance of Communication, The nature of Communication, Using communication networks, choosing the optimal communication channel; Communication, Culture, and Work- Cultural Diversity and Communication, Organizational Culture. Verbal and Nonverbal Messages Verbal messages, Sexual harassment, Nonverbal Communication; Listening The Importance of Listening, Barriers to effective listening, Approaches to listening, Reasons for listening; Interpersonal Skills- Building Positive relationships, Dealing with criticism, Managing Conflict, Negotiating skills. Working in Groups and Making Effective Presentations Working in Groups: Working in Teams Characteristics of Groups and Teams, Types of Groups and teams, Leadership and Influence in groups and teams, Problem-Solving Communication, Effective Communication in groups and teams. Making Effective Presentations: Developing the Presentation-Establishing a purpose, developing the Thesis, Analyzing the situation; organizing your Ideas- The importance of clear organization, Gathering ideas and material. Organizing the Body, Planning the introduction, Planning the conclusions, Adding transitions; Verbal and Visual Support in Presentations Functions of supporting material, Verbal support, Visual Aids; Developing the Presentations- Types of Delivery, Guidelines for delivery, Question and Answer Sessions, Speaking with confidence.
36

Text Books 1. Deborah.G.Johnson, - Computer Ethics - Prentice Hall - 2nd Edition - 2002 2. Ernest A Kallman, John.P. Grillo - Ethical Decision making and Information Technology McGraw Hill - 2nd Edition - 1996. 3 Ronald B.Adler - Jeanne Marguardt Elmhorst - Communicating a work MCGraw Hill, 6th Edition - 1999. Reference Books 1. Deborah.G.Johnson, Helen Nissenbaum (eds) - Computers, Ethics, and Social Values - Prentice Hall - 1995. 2. Jonathan Price, Kenry Korman.- How to communicate Technical Information Addison- Wesley - 1993.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE209 PROGRAMMING PRACTICES AND CODING STANDARDS

L 4 Aim To deliver the concepts of various programming practices Objective To make the students to understand the concepts of various programming languages including syntax and semantics. Preliminaries Programming Domains, Language evaluation criteria design categories trade- offs, implementation methods, Programming environments, Evolution of the Major Programming Languages: Zuses plankalkul Pseudocodes FORTRAN LISP COBOL BASIC PL/I APL and SNOBOL SIMULA 67 ALGOL 68 Prolog Ada Small talk C+ + - JAVA Syntax and semantics Problem of describing syntax- formal methods for describing syntax, recursive descent parsing, attribute grammar, Dynamic semantics Names Binding, Type checking and scopes: Names variables concept of binding strong typing type compatibility scope & life time. Data types: Primitive chapter string user defined array associative arrays record union set pointers Abstract data types. Expression and Assignment Statement Arithmetic expressions Overload operators type conversions relational and Boolean expressions Assignment statements mixed mode assignment. Statement Level Control structures: Compound selective interactive statements, unconditional branching and guarded commands. Subprograms: Fundamentals design issues local referencing parameter parsing overloaded subprograms Design issues of functions accessing nonlocal environment user defined overloaded operators Implementing subprograms Support for Object Oriented Programming Object oriented programming design issues Small talk example programs features evaluation. Support for object oriented programming in C++ - Java Ada 95 Eiffel, implementation object oriented constructs. Concurrency: Subprogram level concurrency semaphores monitors message passing concurrency in Ada 95, Java threads, statement level concurrency.
37

T -

P -

C 3

Exception Handling Exception handling in PL / I Ada C++ - Java. Functional Programming Languages: Mathematical functions fundamentals LISP introduction to schema COMMON LISP ML Haskell applications of functional languages comparison with imperative languages. Logic programming Languages: Predicate calculus predicate calculus and proving theorem overview of logical programming PROLOG overview basic elements deficiencies. Applications of programming languages. Text Books: 1. Allen B. Tucker, Robernooan, Programming Langages Principles and Pradigms, 2002, TMH Reference Books: Robert W. Sebesta, Concepts of Programming Languages, 1 st Indian Reprint, 1999, Addison Wesley 2. Doris Appleby & Julius J Vandekopple, Programming Languages Paradigm & Practice, Mc Graw Hill, 2nd Edition.
1. 3. Ravi Sethi, Programming Languages, 2nd Edition, Addison Wesley, 1999.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

38

05MSE211 MANAGEMENT INFORMATION SYSTEMS

L 4 T P C 3

Aim The subject aims to introduce Role & Impact of MIS, Decision making, Enterprise management systems. Objectives The Students shall be able to understand role and impact of MIS, various steps in management, Organization structure and theory, Development of Business Strategies, Decision making concepts, methods of data collection, applications of MIS in Manufacturing, basic features Enterprise Management Systems and Role of MIS in Data Warehouse, Artificial Intelligence and Expert systems. Introduction Role & impact of MIS, Approaches to Management - Management as Control System Management by Exception - Process of Management - Management Effectiveness Planning- Organizing - Staffing - Coordinating and Directing - Controlling - MIS: A Tool for Management Process. Organization Structure and Theory - Basic Model of Organization Structure - Modifications to the Basic Model of Organization Structure - Organizational Behaviour - Organization as a System - MIS: Organization. Strategic Management of Business Corporate Planning Concepts - Strategic Planning - Development of Business Strategies - Types of Strategies, Tools of Planning Decision Making Decision Making - Methods, Tools & Procedures - Organizational Decision Making - MIS & Decision Making Concepts - Information as a Quality Product - Classification of Information - Methods of Data Collection - Value of Information - System Concepts Systems Control - Types of System - Post Implementation Problems, MIS DevelopmentDetermining Information Requirement - MIS Development & Implementation Application IT Strategic Decision - Design - Evaluation - Implementation Plan - Choice of IT and MIS, Applications of MIS in Manufacturing- Applications in Service Sector, Decision Support Systems, Deterministic Systems - Artificial Intelligence, Knowledge Based Expert System, MIS and the Role of DSS Enterprise Management System Enterprise Management Systems- Basic Features & Benefits, Selection and Implementation of ERP- Technology in MIS, Data Processing - Transaction Processing Application Processing - Information System Processing - TQM of Information Systems User Interface - Real Time Systems & Design - Programming Languages - Case Tools, Business Process Re-engineering - Process Model of the Organization Data Warehouse Data Warehouse: Architecture to Implementation - Electronic Business Technology Models of E-Business - Intranet/Extranet - Internet - World Wide Web - Electronic Payment Systems - Security in E-Business - MIS and E-Business. Web: A Tool for Business Management - Internet and Web and Process of Management - Strategic Management under Web - Web Enabled Business Management - Application System Architecture in Web - MIS in Web Environment TEXT BOOK: 1. W.S. Jawadekar, "Management Information System", Tata McGraw Hill, 2nd Ed., 2002
39

REFERENCE BOOK: 1. James A.OBrien, Management Information Systems, Tata McGraw Hill, 2004. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE213L MICROPROCESSOR AND ASSEMBLY LANGUAGE PROGRAMMING LAB

L 4 T P C 3

Instructions to the students Unless the problem explicitly states otherwise you can assume that the input data/output data will be in memory location and can be examined using a suitable debugging utility (DEBUG, CodeView, TURBO DEBUG etc., ) and that the program itself is executed under the control of such a debugging utility. The board layout and the circuit diagram of the interface are to be provided to the student during the examination. The interfaces to be used are: Stepper Motor, Logic Controller, Dual DAC, Display and Keypad. These interfaces are the standard interfaces used with 8085 trainers also. A brief description of these interfaces will be provided separately. 1.a) Develop and execute an Assembly Language program to find the LCM of two 16-bit unsigned integers b) Develop and execute an Assembly Language program to drive a Stepper motor interface to rotate the motor in clockwise direction by N steps. (N specified by the examiner). Introduce suitable delay between successive steps. (The delay is not to be specified by the examiner. The student need not compute the delay. It can be any arbitrary value that just permits the steps of the motor rotation to be counted). 2.a) Develop and execute an Assembly Language program to find the GCD of two 16bit unsigned integers b) Develop and execute an Assembly Language Program to drive a Stepper motor interface to rotate the motor in anticlockwise direction by N steps. (N is specified by the examiners) . Introduce suitable delay between successive steps, (The delay is not to be specified by the examiner. The student need not compute the delay. It can be any arbitrary value that just permits the steps of the motor rotation to be conducted.) 3.a) Develop and execute an assembly language program to sort a given set of 16-bit unsigned integers into ascending order using insertion sort algorithm. b) Develop and execute an Assembly language program to generate a rectangular pulse train using the DAC interface. (The output of the DAC is to be displayed on a CRO. The on/off times can be any arbitrary values. No need to compute these values. ) 4.a) Develop and execute an assembly language program to sort a given set of 8-bit unsigned integers into ascending order using Bubble sort algorithm b) Develop and execute an assembly language program to generate a triangular wave form using a DAC interface. (The output of the DACis to be displayed on a CRO. The slope can be any arbitrary value. No need to compute this value.) 5.a)Create an assembly language source file containing PUBLIC declarations for 100 bytes of data and PUBLIC code for a procedure READKB to read from keyword using INT 21H (Function code 6) leaving the result in AL.Create a second source file with EXTRN declaration for data and READKB procedure of the first source file and statements to read 10 bytes from keyboard and store the data in the data area declared as EXTRN. Assemble and link the above two files and execute the
40

resulting file. b) Develop and execute an assembly language program to read the status of two inputs from the logic controller interface and to display the output of 2 Boolean expressions of the two inputs, using the same interface. (The two Boolean expressions are to be specified by the examiner.) 6.a) Create an assembly language source file containing two PUBLIC procedures called RDKEY and ECHO. RDKEY reads from keyboard using INT 21H (Function 6) leaving the ASCII code of key read in AL. The ECHO displays the ASCII character in AL on the screen using INT21H (Function 6) Assemble this file and place it in a library file. Develop and execute an assembly language program which uses the RDKEY and ECHO procedures once. b) Develop and execute an assembly language program to read the status of eight inputs from the logic controller interface, to complement those values and to display these complemented values using the same interface. 7.a) Develop and execute an assembly language program with the following features: It has a macro with one parameter called LOC. The macro reads the keyboard using INT21H (Function 6) and places the ASCII code of the key read in LOC. The macro defined above is used twice to read the keyboard twice and store the ASCII codes in two consecutive memory locations. b) Develop and execute an assembly language program to read the status of eight inputs from the logic controller interface, display FF if any input is high and display 00 otherwise. 8.a) Using conditional assembly, develop and execute an Assembly language program with the following features: It uses one input value, an unsigned 16-bit integer called x. If Eqn 1 is true, it assembles code which computes 3*x*x*x+4*x+5 and places the32 bit result in a double-word memory location. (Assume overflow will not occur); Otherwise, it assembles code which computes 7*x+8 and places the 32bit result in a double-word memory location. b) Develop and execute an assembly language program to perform the following: Read the status of 3 inputs from the logic controller interface. Assuming that these three inputs represent a binary number x (0<=x<=7), display 2* x using the same interface. 9.a) Develop and execute an assembly language program that implements Binary search algorithm. Assume that the data consists of sorted 16-bit unsigned integers. The search key is also a 16-bit unsigned integer. b) Develop and execute an assembly language program to scan a 4 x 4 keypad for key closure and to store the code of the key pressed in a memory location. 10. a) Develop& execute an assembly language program to perform the following: Assuming a look up a table of 16 entries, each of which is 8-bit wide, & a 4-bit key value, look up the table to find the conversion value. Set up the table to permit BCD to 7-segment code conversion. b) Develop and execute an assembly language program to drive the Elevator interface in the following way: Assume that initially the elevator is at ground floor and all service requests are cleared. The elevator stays in the ground floor as long as there is no service request. When a service request is detected, the elevator moves to that floor. While it is traveling to that floor, if a service request is detected for any intermediate floor, it is also serviced (the floor request LED is turned off). After servicing the floor for which the request was first registered, the elevator returns to ground floor ignoring all further requests. The delays to simulate the elevator motion, the delay indicating the servicing of a request can be any arbitrary values. Examiner doesnt specify these values, nor is the student required to
41

calculate them. 11. a) Develop and execute an assembly language program to read a 4-digit hexadecimal number from the keyboard and store the corresponding 16-bit binary value in a word location. b) Develop and execute an assembly language program to display a 4 digit BCD number on the display interface. 12. a) Develop and execute an Assembly language program to compute the factorial of a positive integer n using recursive procedure. The 16-bit binary result can be left in a memory word location. (Use a value for n which will ensure that n! can be stored as a 16- bit unsigned integer.) b) Develop and execute an assembly language program to scan a 4x4 keypad interface for key closure. The row number and column number of the key pressed are to be stored in memory locations. 13.a) Develop and execute an assembly language program to compute nCr using recursive procedure. Assume n & r to be non-negative integers and leave the binary result in a memory word location. (Use values for n and r which will ensure that the can be stored as a 16-bit unsigned integer.). (b) Develop and execute an assembly language program to perform the following: Alternately, display two 4 digit messages on the display interface for suitable period of time. Ensure a flashing rate that makes it easy to read both the messages. (Examiner doesnt specify there delay values. Nor is it necessary for the student to compute these values). 14.a) Develop and execute an assembly language program that determines if a given substring is present in a main string of characters. The result (1:present, 0:absent) can be left in a memory location b) Develop and execute an assembly language program to convert a 16 bit binary value (Assumed to be an unsigned integer) to BCD and to display it on the Display interface. (You can assume that the BCD equivalent will be less than or equal to 9999). 15.a) Develop and execute an assembly language program to perform the following: Read the current time from the system (INT 21 H, Function 2CH), format it as HH:MM, and display it on the video screen (INT 21H, Function 2).

42

05MSE215L DATA STRUCTURES AND ALGORITHMS LAB*

L LIST OF EXPERIMENTS 1. Implementing Stacks and queues. 2. Implementation and processing in lists. 3. Sorting: a. Insertion sort b. Merge sort c. Quick sort d. Selection sort e. Heap sort f. Shell sort

T -

P 3

C 2

4. Searching: a. Linear search b. Binary search

43

05MSE202 PROBABILITY, STATISTICS AND RELIABILITY

L 4 T P C 3

Aim To motivate the students to address the challenge of the relevance of Probability and Statistics Theory to Engineering problems. Objective To have an understanding of the Probability concepts, analyze the problems connected with statistics and reliability, to understand how to make the transition from a real problem to a probability model for that problem. Probability & Random Variables Axioms- Conditional Probability- Baye's Theorem- Independent Events-Random Variables-Distribution Function-Density Function (PDF)Random Vector-Joint Distribution- Joint Density- Conditional Distribution and Density Functions- Independent Random Variables- Binomial, Poisson, Normal, Exponential, Gamma, Weilbull distributions. Statistical Parameters Mathematical Expectation- Variance- Moment Generating Function-Characteristic Function-Regression and Correlation- Partial and Multiple correlation. Tests of Statistical Hypothesis Large sample Tests - Procedure of Testing Hypothesis- small sample tests - Students tdistribution - F-test - Chi-square test- theory of estimation. Anova One way and Two way classifications- CRD-RBD-LSD. Statistical Quality Control Control Charts - Control Charts for Measurements - x -chart- R-chart- Control Charts for Attributes- p-chart- np-chart- c-chart Reliability Terms related to Reliability- Hazard Models- System Reliability - Reliability Allocation - Maintainability and Availability. Queuing Theory Preliminary Ideas (Markov Chains) - Exponential Distribution- Little's formula - Pure Birth and Death Models. Text Book: 1. R.E.Walpole, R.H.Myers, S.L.Myers and K.Ye, Probability and statistics for Engineers and Scientists, 7th Edition, Pearson Education (2003). Reference Books: 1. Bhat, B.R.. Modern Probability Theory, 3rd ed. New Age International Pvt. Ltd., New Delhi (1999). 2. Freund, JE , Mathematical Statistics, Prentice Hall International (1998). 3. Rohatgi, V.K. and Ebsanes Saleh, A.K. Md., An introduction to Probability and Statistics, 2nd Ed., John Wiley & Sons, Inc., New York (2002). 4. Morris H. DeGroot, Probability and Statistics, 3rd Edition, Addison-Wesley (2002). 5. J.L.Devore, Probability and Statistics, 5th Edition, Thomsun (2000) Mode of Evaluation: By Assignment, Seminars and Written Examinations
44

05MSE204 COMPUTER ARCHTECTURE AND ORGANIZATION*

L 4 T P C 3

Aim The subject aims at imparting the knowledge of Computer architecture, the design of computers, including the instruction sets, hardware components, and system organization, Memory Management and Networking. Objectives At the end of the course students should be able to understand basic principles such as locality of reference, coarse-grain parallelism, overlapping communication and computation, performance/power trade-offs, and reliability, also how the computer systems are organized and the characteristics of modern processors that affect system architecture. Introduction Nature of computing, Elements of Computers, Limitations of Computers; - the evolution of computers- Mechanical Era, Electronic Computers, The Later generation; the VLSI era- Integrated Circuits, Processor Architecture, System Architecture. Design Methodology- System design- System Representation, Design process, The Gate level; the Register level- Register - level components, programmable logic devices, and Register level design; the Processor Level- Processor Level Components, Processor level design. Processor Basisc Processor Basics- CPU organization: Fundamentals; Data Representation: Basic formats, Fixed Point Numbers, Floating point numbers; Instruction Sets: Instruction formats, Instruction Types, Programming Considerations. Arithmetic Data Path Design-Fixed point arithmetic-Addition and Subtraction, Multiplication, Division; Arithmetic Logic Units- Combinational ALUs, Sequential ALUs; Advanced Topics- Floating point Arithmetic, Pipeline Processing Memory Organization Memory Organization-Memory technology: Memory Device Characteristics, Random Access Memories, Serial Access Memories; memory systems: Multilevel memories, Address translations, Memory Allocation; Caches: Main features, address mapping, Structure versus performance. System Organization System Organization- Communication methods: Basic concepts, Bus control; IO And System Control: Programmed IO, DMA and Interrupts, IO processors, Operating Systems; Parallel Processing: Processor Level Parallelism, Multiprocessors, Fault Tolerance. TEXT BOOK: 1. John P. Hayes, Computer Architecture and Organization, 3rd Ed. McGraw Hill., 1998. REFERENCE BOOK:
45

1.

John. L. Hennessy & David A. Patterson, Computer Architecture, 3rd Ed, 2003, Elsevier, India.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

46

05MSE206 SYSTEM PROGRAMMING*

L 4

T -

P -

C 3

Aim The subject aims to introduce operations and functions of Assembler, Linker, Lexical analysis, parsing, Semantic analysis, Optimization and machine code generation. Objectives The student shall be understand the different steps involved in pass I and pass II of Assembler, the structure of compiler and the functions performed in different phases of compiler Assembler Assemblers elements of assembly language programming simple assembly scheme pass structure of assemblers. Design of a two-pass assembler. Relocation and linking concepts. Design of a linker, self-relocating program, linker for MS DOS, linking for overlays, loaders. Compiler Structure of compilers, lexical analysis, syntax analysis, immediate code generation, optimization code generation, book keeping, and error handling compiler writing tools programming languages. Lexical Analyzer Role of lexical analyzer design of lexical analyzer, regular expression, finite automation regular expression to finite automata, minimizing DFA, implementation to lexical analyzer context free grammar, derivations & parse trees capabilities of context free grammar Parser Parsers, shift-reduce parsing, operator precedence parsing, top down parsing, syntax directed translation scheme, implementation of syntax-directed translators, intermediate code, postfix notation, parse trees and syntax trees, three address code, quadruples, triples, translation of assignment statement, Boolean expression, errors, lexical phase errors, semantic-phase errors, semantic errors. Code Optimization Principles, sources of optimization, loop optimization, DAG representation of basic blocks, value numbers and algebraic laws, global data flow analysis, dominators, reducible flow graphs, depth-first search, loop-invariant computations, induction variable elimination, other loop optimization.

TEXT BOOK: 1.D. M. Dhamdhere, System Programming, Tata McGraw Hill, 2nd Edition, 2000. REFERENCE BOOK: 1. A. V. Aho, J.D. Ullman, Principles of Compiler Design, Narosa Publishing, 1996.

47

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE208 INTERNET PROGRAMMING*

L 4 Aim To understand the concepts of internet programming. Objective To know the internet concepts and to design web pages using java The Common Gate Way Interface (CGI) CGI applications, con-figuring the server, programming in CGI. Input to the CGIEnvironmental variables, accessing from input, Languages under different operating systems. Examining environmental variables. Output from CGI and response headers; Accept types and content types; the context length header, Server redirection; The expires and Pragma headers, Status codes, complete headers. Forms and CGI HTML tags; sending data to the server; Designing applications using forms in PERL. Decoding forms in other languages. Server Side Includes (SSI)- configuration environmental variables. Including boilerplates. File statistics. Executing external program and CGI programs. Tailoring SSI output. Common Errors. Hypermedia Documents Creating dynamic pages, CGI Examples with postscript. The gd graphics library. CGI Examples with gnuplot and pgperl. Animation. Advanced form applications- Gouestbook, Survey/poll and pie graphs, quiz/test form application, Security. Introduction To Java Overview of JAVA Language, Constants, Variables, and Data Types. Operators and Expressions: Decision Making and Branching. Classes, Arrays, Strings and Vectors Classes, Objects and Methods Inheritance - Arrays, Strings and Vectors: Arrays, Onedimensional Arrays, Creating an Array, Two-dimensional Arrays, Strings, Vectors, Wrapper Classes. Interfaces, Packages, and Multithreaded Programming Interfaces - Multiple Inheritances - Java API Packages, Multithreaded Programming: Managing Exceptions, Applet Programming Managing Errors and Exceptions - Applet Programming: How Applets Differ from Applications, Creating an Executable applet, Designing a Web Page, Applet Tag, Adding Applet to HTML File, Passing Parameters to Applets, Aligning the Display, More about HTML Tags, Displaying Numerical Values, Getting Input from the Usr. Graphics Programming, Input / Output Graphics Programming: Introduction, The Graphics Class, Lines and Rectangles, Circles and Ellipses, Drawing Arcs, Drawing Polygons, Line Graphs, Using Control Loops in
48

T -

P -

C 3

Applets, Drawing Bar Charts. Managing input/output Files in JAVA Text Book 1. E. Balaguruswamy - Programming with JAVA A Primer - 2nd Edison - TMH edition. 2004 2 nd

Reference Books: 1. Shishir Gundavaram - CGI Programming on the World Wide Web, O Reilly and Associates - Shroff publishers - 2003. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

49

05MSE210 DATABASE MANAGEMENT SYSTEMS*

L 4 Aim This subject aims to introduce techniques to design, implement and maintain database applications. Objectives The students shall be able to understand fundamental concepts of database management system, database modeling and design, SQL, PL/SQL, system implementation techniques. Analyze and design ER model for a customized application and concurrency techniques and active databases. Introduction ER Modeling Basic concepts Databases and database users Database system concepts and architecture data modeling using Entity Relationship model. T P C 3

Relational Model The Relational data model Relational constraints Relational algebra Introduction to SQL Introduction PL/SQL Relational database standard ER to relational mapping E.F. Codd rules.
Normalization Functional dependencies Normalization for relational databases up to BCNF Query Optimization and Transaction Processing Query Processing Translating queries into relational algebra Using Heuristics in query optimization Introduction to Transactions Single user and multiuser system transactions Read and write operations DBMS buffers Transactions system concepts Serializability types. Concurrency, Recovery And Security 2PL Types of locks System lock tables deadlocks Timestamp ordering algorithm Recovery concepts ARIES recovery algorithm Introduction to database security issues Discretionary access control based on granting and revoking privileges. Concluding remarks including database design and implementation process.

TEXT BOOK: 1. Ramez Elmasri & B.Navathe: Fundamentals of Database Systems, IV Ed., Addison Wesley, 2005. REFERENCE BOOKS: 1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, III Edition, McGraw Hill. 2. Date C.J: Introduction to Database Systems, Sixth Edition, Addison-Wesley, 1995.

50

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

51

05MSE212 THEORY OF COMPUTATION*

L 4 T P C 3

Aim The subject aims to introduce of Formal Languages, Automata Theory and Abstract models of Computation and Computability, Computational complexities and NP Completeness. Objectives The students would be able to understand universal Model of Computation in terms of both the current Platforms and the Philosophical ideas about the nature of Computation. They would be able to analyze the problems by determining whether a problem is solvable, efficiently solvable, and simply solvable or it cannot be solved. Introduction An overview of grammars and languages, Regular expressions and Regular languages Finite Automata and its minimization, Construction of NFA and DFA from Regular expressions, Conversion of NFA into DFA Normal Forms Chomsky hierarchy of language, Non determinism and kleenes theorem pumping lemma Decision problems. Normal Forms : Chomskys & Griebachs Normal Forms Automata Push down Automata and context free languages Context free grammars Derivation trees Ambiguity PDA& CFG Context Free and non-Context free languages. Turing Machine Turing machines Church Turing hypothesis Turing machine as language acceptors Partial function Non deterministic Turing Machine Universal Turing Machines Applications. Applications Unsolvable problems and computable functions Rice theorem Halting problem Posts correspondence Problem Primitive recursive functions Godel Numbering Recursive and recursively enumerable languages. TEXT BOOK: 1. John C. Martin, Introduction to Languages and the Theory of Computation, 3rd Edition, Tata McGraw Hill, 1997. REFERENCE BOOK: 1. K.L.P Mishra, N. Chandrasekaran, "Theory of Computation", Prentice Hall of India, 2nd Edition, 1998.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

52

05MSE214L INTERNET PROGRAMMING LAB*

L T P 3 C 2

1. Create the personal home page using HTML 2. Design a E-greetings page which has properly aligned paragraphs with images along with it. 3. Implement a Web site for Information Technology department Using a) Frameset b) Tables c) Internal Linking d) Headers e) List Items f) Hyperlink for mailing 4. Using STYLE SHEETS: 1 .Set the Background Image Fixed and Foreground Scrolling 2. Set the Background Image without tiles and at the center of the screen. 3. Set the Background Color for the text using all the 4 methods of Style sheets 5. Using JavaScript create a web page for Online Testing (Quantitative Aptitude) 6. Develop a JavaScript program to get Register Number as Input and print the Students total mark and grades. 7. Develop a VBScript code to perform the functions of a Calculator. 8. Using VBScript, develop a web site for online counseling. 9. Create a Text Editor using VBScript. 10.Write a function that takes an integer value and returns the number with its digits reversed. For Ex. Given the number 7631, the function should return 1367. Incorporate the function into a VBScript that reads a value from the user. Display the result in the status bar of the browser window. 11. Create a server-side include file containing the AdRotator code to display 4 advertisements. 12.Create an ASP application that allows the user to customize a web page. The application should consist of three ASP files: Ask the user name to login & read from a database to determine if the user is known. If the user is not known, second ASP file is loaded asking the user to choose their preference for foreground color, background color & image. Insert the new user & pREFERENCE to the database. Display the page customized according to the pREFERENCE selected. If the user is known at login, the customized page should be displayed. 13.Create an ASP application to display the students information from the Database Note: Only 5 students information per page should be displayed. Use Previous & Next to retrieve the rest of the information. 14.Create an ASP application for sending E-Mails using CDO. 15.Design a web page for registering the following information into Oracle Database using ASP. Name Reg. No, Date of Birth, Date of Admission, E-Mail (check for validation) Gender Address Branch & Year 16.Create a formatted business letter using XML & DTD.
53

17.Create a contact list database in XML using style sheets. 18.Develop a XML schema for the database document type. 19.Create a XML page for displaying staff details from the database 20.Connect to a database using XML & display its contents using HTML Page

05MSE216L DATABAE MANAGEMENT SYSTEMS LAB*

L 1. a) Create a table EMP with the following fields. EName Eno. Salary DeptNo Address Dname b) Insert 5 records into EMP c) ALTER EMP table i) varying size of Eno field ii) adding a new field job d) Delete the table EMP 2. Create a table EMP with the above mentioned fields. i) Insert 5 records into EMP ii) Update the salary of the Employees by 10% hike iii) Delete the employees whose name is AAA 3. Create a table ORDER with the following fields and constraints. ORDER Column Name Order-no Item-name Qty rate-unit Constraint Name Constraint Type pk-order-no PRIMARY KEY itn UNIQUE ck-aty CHECK (25<QTY<50) Nn-rate NOT NULL T P 3 C 2

4. Using Ex 3. 1. Drop unique constraint for item-name 2. Disable the constraint Nn-rate 3. Insert a record with NULL values for rate unit 4. Enable the constraint with NULL value existing on rate-unit

54

5. Create a table EMP mentioned above and test all the arithmetic functions and character functions 6. Add a field date-of-birth to EMP table and test all the date functions. 7. i) Modify EMP table adding a new field BONUS, update it using NVL ii) Retrieve the employees whose name starts with S. iii)Select all the employees who are working in IT department. 8. i) Using EMP table find the employee getting maximum salary ii) Find the employee whose salary is minimum iii) Find the sum of salaries of all the employees working in ACCOUNTS department.

9. Create a table DEPT with the following fields DNo. Primary Key DName Modify EMP table adding a foreign key constraint on DeptNo. i) ii) Insert 6 records into Dept. Implement the following Join operations a) Self Join b) Equi Join c) Non Equi Join d) Outer Join e) Natural Join

10. Using EMP and DEPT, implement all type of view techniques. a) Row subset view b) Column subset view c) Row column subset view d) Grouped view e) Joined view f) With check option 11. Using EMP and DEPT a) Create a sequence to insert the empno in EMP table b) Create a synonym for the above two tables

PART B 1. Create a cursor to update the salary of employees in EMP table 2. a) Write a PL/SQL program to raise an Exception i) When the bonus exceeds salary b) Write a PL/SQL program to test the built-in Exceptions

55

3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. 4. Write a function to find substring. 5. Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP.

05MSE301- DISCRETE MATHEMATICAL STRUCTURES

L 4 T P C 3

Aim To address the challenge of the relevance of inference theory, Algebraic structures and graph theory to computer science and engineering problems. Objective To use inference theory in circuit models, and algebraic theory in computer science problems, graph theory in net work models and lattices & Boolean algebra in Boolean functions . Mathematical Logic Introduction -Statements and Notation - Connectives - Tautologies - Equivalence Implications - Normal Forms - Principal Disjunctive Norm Forms - Principal Conjunctive Norm Forms. Inference Theory The Theory of Inference for the Statement Calculus -The Predicate Calculus - Inference Theory of the Predicate Calculus. Set Theory Basic Concepts of Set Theory- Relations and Ordering- Functions- Recursion Algebraic Structures Semigroups and Monoids - Grammars and Languages- Polish Expressions and Their Compilation - Groups - The Application of Residue Arithmetic to Computers - Group Codes. Lattices and Boolean Algebra Lattices as Partially Ordered Sets - Boolean Algebra Representation and Minimization of Boolean Functions. Boolean Functions -

Graph Theory Basic Concepts of Graph Theory - Matrix Representation of Graphs - Trees -Storage Representation and Manipulation of Graphs.
56

Text Book:
1.

J.P. Trembley and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill 13th reprint (2001).

Reference Books: 1. Richard Johnsonbaugh, Discrete Mathematics, 5th Edition, Pearson Education (2001). 2. S. Lipschutz and M. Lipson, Discrete Mathematics, Tata McGraw Hill, 2 nd Edition (2000).

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

57

05MSE303 SOFTWARE ENGINEERING*

L 4

T -

P -

C 3

Aim The subject aims to impart sound knowledge to design and implement an efficient software system and manage the resources . Objectives The students would be able to analyse software requirements, develop an efficient software system through group cohesiveness, use the testing tools and methods. Fundamentals Software Engineering Fundamentals, The system engineering process, Software process models, Process iteration, Software Specification, Software design and implementation, Software validation, Software evolution, Project management activities- Project planning, Project scheduling, Risk management, Software requirements- Functional and non-functional requirements, User requirements, System requirements, software requirements document. Engineering Process Requirements engineering processes - Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management, System ModelsContext, Behavioural, Data and, Object models, CASE workbenches, Software prototyping- Prototyping in the software process, Rapid prototyping techniques, User interface prototyping, Formal Specification- Formal specification in the software process, Interface specification, Behavioural specification Architectural Architectural design- System structuring, Control models, Modular decomposition, Domain-specific architectures, Over view of design for Distributed systems, Objectoriented and Real-time software, Design with Reuse- Component-based development, Application families, Design patterns, User interface design - User interface design principles, User interaction, Information presentation, User support, Interface evaluation. Critical System Critical Systems- Over view of Dependability, System Specification, and System Development, Verification and validation- V&V planning, Software inspections, Automated static analysis, Clean room software development, Software testing- Defect testing, Integration testing, Object-oriented testing, Critical systems validation- Formal methods and critical systems, Reliability validation, Safety assurance, Security assessment. Managing Software Over view of managing software people, Software cost estimation- Productivity, Estimation techniques, Algorithmic cost modeling, Project duration and staffing, Overview of Quality management & Process Improvement, overview of Legacy Systems, Software change & re-engineering, Configuration management- planning and managing change, version and release, Over view of SEI-CMM, ISO 9000, and Six Sigma, Over view of CASE tools. TEXT BOOK: 1. Ian Sommerville, "Software Engineering", Addison-Wesley, 2004. REFERENCE BOOK: 1. Roger S. Pressman, Software Engineering, McGraw Hill, 2004.
58

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE305 OPERATING SYSTEMS*

L 4 T P C 3

Aim This subject aims to introduce operating system concepts such as processes & threads, memory management, scheduling algorithms and distributed file systems Objectives The students would be able to understand and explain various OS concepts such as time-sharing, Multiprogramming, Parallel, Distributed systems, processes & Threads, CPU scheduling algorithms, Semaphores and Critical regions, Deadlock prevention, Memory Management, I/O systems and File Systems .They would be able to use Linux system, windows 2000. Introduction Introduction, Computer-System Structures, Operating-System Structures Process Processes, Threads, CPU Scheduling, Process Synchronization, Deadlocks Memory Management Memory Management, Virtual Memory, File-System Interface, File-System Implementation, I/O Systems, Mass-Storage Structure Distributed File Structure Distributed System Structures, Distributed File Systems, Distributed Coordination, Protection, Security Case Studies The Linux System, Windows 2000.

TEXT BOOK: 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concepts", John Wiley & Sons, Inc. 6th Edition. REFERENCE BOOK: 1. Stallings William, "Operating Systems", Prentice Hall of India, Fourth Edition

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

59

05MSE307 COMPUTER AND COMMUNICATION NETWORKS*

L 4 T P C 3

Aim The subject aims to introduce basics of Networks, client/server systems, Network design approaches, Architecture of Networks, and also future Networking technology. Objectives Students shall be able to understand about working of Intranet, LAN, WAN, MAN setups, different topologies like Star, Mesh, etc., various functions of layers, different network architectures, different switching techniques, different protocol standards, congestion & traffic control, different internetworking devices like bridges, switches, routers, etc, security protocols & security algorithms. Network Services Networks and Services, Approaches to Network Design, The OSI Reference Model; Overview of TCP/IP Architecture, Application Protocols and TCP/IP Utilities. Peer-to-Peer Protocols and Service Models ARQ Protocols, Sliding Window Flow Control, Multiple Access Communications, LAN and access methods, Introduction to LAN Standards and LAN Bridges, Ethernet networking. Packet Switching Packet Switching Networks- Network Services and Internal Network Operation, Packet Network Topology, Routing in Packet Networks, Shortest Path Algorithms, and Introduction to traffic management & QoS. TCP/IP TCP/IP Architecture, The Internet Protocol, Limitations of IPv4 and Introduction to IPv6, User Datagram Protocol, Transmission Control Protocol, DHCP, Introduction to Internet Routing Protocols. Advanced Network Advanced Network Architectures and Security Protocols- Introduction to MPLS and Differentiated Services; RSVP; Security and Cryptographic Algorithms, Security Protocols, Cryptographic Algorithms TEXT BOOK: 1. A. Leon-Garcia, Indra Widjaja, "Communication Networks", Tata McGraw Hill, 2000
60

REFERENCE BOOKS: 1. William Stallings, " Data and Computer Communications", Pearson Education, 7th Edition 2. Andrew S. Tanenbaum, "Computer Networks", Prentice Hall India, 4th Edition, 2003. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE309 OPEN SOURCE PROGRAMMING I

L 4 T P C 3

Aim To create Software applications that can be accessed by all the people over the internet and to allow the users to customize the software based on their requirements. Objective On completion of this course the students will be able to create open source software applications and can publish it over the Internet. Introduction to LINUX The operating System; Compiling the Kernel; Introduction to the Kernel: Important data structures, Main algorithms, Implementing System Calls. LINUX Architectureindependent memory model, Virtual address space for a process, Block device caching, Pages under LINUX. IPC, File System IPC: Synchronization in the Kernel, Communication via files, Pipes, Debugging using ptrace, System V IPC, IPC with sockets. File System: Basic Principles, Representation of file system in the Kernel, The Proc file system and Ext2 file system. HTML AND FORMS HTML tags; sending data to the server; Designing applications using forms in HTML. Creating dynamic pages, CGI Examples with postscript. The gd graphics library. CGI Examples with gnuplot and pgperl. Animation. Advanced form applications- Guestbook, Survey/poll and pie graphs, quiz/test form application, Security. JavaScript - VB Script Introduction to JavaScript, VB Script - usage in Web Page develpment, sending an email - multipart message - storing images - getting confirmation - Session tracking - Graphics Input Validators - cookies.

61

TEXT BOOKS 1. M. Bek et al : LINUX Kernel Internals, Addison-Wesley, 1997. (Chapters 1 to 9, Appendices A,B,C,D) 2. Remy Card et al: The LINUX Kernel book, John Wiley, 1998. REFERENCE BOOKS 1. Shishir Gundavaram - CGI Programming on the World Wide Web, O' Reilly and Associates - Shroff Publishers - 1996. (Chapters 1 to 7). 2. Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi, 2004. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE311 MANAGEMENT IN ENGINEERING

L 4 T P C 3

Aim To emphasis the students the importance and concept of management and engineering Objective After completion of this course, the students will be able to 1. Differentiate Management and Engineering 2. Understand the functions of technology of management 3. Understand planning and forecasting 4. Understand research functions Introduction to Engineering Management Engineering and Management: Engineering Management Engineering Management. Development of Engineering Management: Industrial Revolution Management Philosophies Scientific Management Administrative Management Behavioral Management. Functions of Technology Management Planning and Forecasting: Nature of Planning Foundations for Planning Planning concepts Forecasting Strategies for Managing Technology. Human Aspects of Organizing Authority and Paver Delegation Committees and Meetings. Managing Technology Managing Research Function: Nature of Research and Development Research strategy and organization Selecting R & D projects Making R&D Organization successful. Managing Projects
62

Project Planning and Acquistion Characteristics of a project Project proposal process Project Planning Tools Project organization Motivating Project Performance. Managing Engineering Career Achieving Effectiveness as an Engineer Charting Career Communicating Ideas Technical Competent Professional Activity. Managerial and International Opportunities for Engineers Management and Engineer International Management. Reference Book 1. Managing Engineering and Technology Daniel L. Babcock, Lucy C.Morse, Pearson Education, Third Edition 2005.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE313L COMPUTER AND COMMUNICATION NETWORKS LAB*

L T P 3 C 2

1. Write a program to display the servers date and time details at the client end. 2. Write a program to display the clients address at the server end. 3. Write a program to implement an echo UDP server.
4.

Write a program to develop a simple Chat application.

5. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c z as a. This process is done using the TCP/IP protocol. Write a program for the above 6. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c z as a. This process is done using UDP. Write a program for the above
63

7. Write a program to display the name and address of the computer that we are currently working on. 8. Write a program to capture each packet and to examine its checksum field. 9. Write a program to create a daemon process.

05MSE315L OPERATING SYSTEMS LAB*

L T P 3 C 2

1. Program to report the behavior of the OS to get the CPU type and model, kernal version. 2. Program to get the amount of memory configured into the computer, amount of memory currently available. 3. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round robin. 4. Implement the solution for reader writers problem. 5. Implement the solution for dining philosophers problem. 6. Implement bankers algorithm. 7. Implement the first fit, best fit and worst fit file allocation strategy. 8. Write a program to create processes and threads. 9. Write a program that uses a wait able timer to stop itself K. Sec. After its started where K is a command line parameter.

05MSE302 GRAPH THEORY AND ITS APPLICATIONS

L 4 T P C 3

Aim To introduce the basics concepts of graph theory and its applications to computer net work models. Objective To know the basic concepts and notations in graphs. To give the combinatorial and matrix representation of graphs To explain the computer representation of graphs and its application to computer science.
64

Introduction Definitions, importance, isomorphism, walk, paths, circuits, connected, disconnected graphs, operation on graphs operation on graphs, euler and hamiltonian graphs. Trees Properties, distance and centres, trees, spanning trees, fundamental circuits, minimal spanning tree. Cut Sets Properties, fundamental circuits and cut sets, connectivity, separatability, network flows, 1-2 isomorphism. Planar And Dual Graphs Combinatorial representation, planar graphs, kuratowski's graphs, detection of planarity, dual graphs. Matrix Representation of Graphs Incidence matrix, circuit matrix, cut set matrix, fundamental matrices, relationships amongst matrices, path matrix, adjacency matrix. Coloring, Covering And Partitioning Chromatic number, chromatic partitioning, matching, covering, four color problem. Directed Graphs Different types, directed paths and connectedness, Euler digraphs, trees-matrix representation, tournament. Graph Theoretic Algorithms Computer representation of graphs - input & output, algorithms for connectedness, spanning tree, fundamental circuits, cut vertices, directed circuits and shortest paths. Text Book: 1. Narasing Deo, Graph theory with application to engineering and computer science, Prentice Hall India, 1995. Reference Book 1. Tulasiraman And M.N.S. Swamy, Graph, Networks and Algorithms, John Wiley, 2. 1981. 3. F. Harary, Graph Theory, Addison Wesley / Narosa, 1998. 4. E.M.Reingold, J. Nievergelt, N. Deo, Combinatorial algorithms: Theory and 5. Practice, Prentice Hall, N.J. 1977. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE304 NETWORKING PROTOCOLS AND STANDARDS

L 4 T P C 3

Aim To design new methods for communication and data transfer that eliminates delay and improves data integrity.
65

Objective On completion of this course the students will be able to know about various protocols and standards and the students can create new protocols for communication and data transfer. Networking Standards and Specification Networking standards and specifications, Need for standardization, ISO and the IEEE standards, The IEEE 802 Project. Addressing and Routing Network names and addresses, Physical layer addressing: the MAC address, Network layer addressing: The IP address, Network layer address: The IPX address. Overview of OSI and TCP/IP Protocol Suite: Converting network names to IP addresses, Resolving IP addresses to physical addresses, Addressing and routing. TCP/IP Protocol Suite TCP/IP Protocol Suite, TCP/IP Protocol Suite advantages, Internet Protocol (IP), Transport Layer Protocols -TCP and UDP, File Transfer protocols - FTP and TFTP, Mail and news protocols - SMTP, POP3, NNTP and IMAP, Other Protocols Suite ICMP and ARP. Other networking protocols The IPX/SPX Protocol Suite, NetBEUI, AppleTalk Protocol, File sharing protocols - SMB, NCP, and NFS, Routing protocols - RIP, OSPF and BGP, Network Management Protocol SNMP and CIMP, Convergent Protocols H.323 and SIP.

Text Book: 1. Behrouz A. Forouzan, TCP/IP Protocol Suite, Third Edition, Tata McGraw-Hill, 2005. Reference Book 1) W. Richard Stevens, TCP/IP Illustrated, The Protocols, Pearson Education, 2004. 2) D.E.Comer, Internetworking with TCP/IP Principles, Protocols and Architecture Vol - I, Pearson Education, 2001. 3) John Ray, Using TCP/IP, PHI 4) Karanjit. S. Siyan, Tim Parker, TCP/IP Unleashed, Pearson Education.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE306 SOFTWARE ARCHITECTRE AND DESIGN

L 4 T P C 3

66

Aim To understand the fundamental concepts of software design and architecture Objective To learn the importance of software design and architecture Design Fundamentals The nature of Design process-Objectives-Building Modules, Constructs, Design qualities, assessing the design, Design viewpoints for software. Design practices-Rational for method. Design strategies-Top down and bottom up, Organizational methods and design. Design Methodologies and Models Jackson Structural programming, Jackson system development, object-oriented and object-based design and Structured System Analysis and Structured design method. Traditional approach to design-SADT organizational design practices-SSADM and design for real time systems MASCOT Software Architecture Introduction - Software Architecture - Definition - Prospects - State of Art - Architectural Styles - Pipes and Filters - Layered Systems - Repositories - Process Control - Other familiar Architecture - Heterogeneous Architectures. Architecture Design Architectural design and Mapping Description of various Architectural design patterns Object Oriented Organization. Architecture Structures for Shared Information Systems. Architecture design guidance - User Interface Architecture. Miscellaneous Topics Tools for Architectural design - Exploiting style in architectural design Architectural Interconnection - Case Studies. Text Book: 1. David Budgen, " Software Design ", Addison-Wesley, Pearson Education 2004 2nd edition. Reference Books: 1) Pressman R.S, " Software Engineering ", 6th Edition, McGraw Hill Inc., 2005 6th edition. 2) Mary Shaw David Garlan, " Software Architectural Perspectives on an emerging discipline ",EEE, PHI 1996. 3) Gamma & Helm et al, Design Patterns, Addison Wesley Pearson Education of 1995. 4) Frank Bushmann et al, Pattern Oriented S/W Architecture, John Wiley & sons -1996

Mode of Evaluation: By Assignment, Seminars and Written Examinations

67

05MSE308 REQUIREMENTS ENGINEERING

L 4 Aim To understand the concept of Requirement Engineering Objective To emphasis the students to have a thorough knowledge in analyzing the problem and defining the systems. Introduction The Requirements Problem introduction to Requirements and software development life cycle. requirements management T P C 3

Analyzing the problem: The five steps in problem analysis Business Modeling systems engineering of software Intensive systems. Understanding the user and stakeholder needs: The challenge of requirements elicitation the future of the product or system interviewing requirements workshops brainstorming and idea reduction storyboarding. Defining the system A Use case primer organizing requirements information - the vision document product management establishing project scope managing your customer. Refining the System Definition Software requirements refining the use cases developing the supplementary specification Building the right system: from use case to implementation using UML diagrams From use case to test cases tracing requirements. Text Books: 1. Managing Software Requirements , second Edition by Dean Leffingwell , Don Widrig, Pearson Education. 2. Unified Modeling Language by OMG. Reference Books: 1. Practical Objected Oriented Design with UML, Mark Priestley, 2005, TMH. 2. Introduction to Object Oriented Analysis and Design, Stephen R Schach, 2004, TMH.

68

05MSE310 COMPILER DESIGN*

L 4 Aim To learn the fundamental concepts of compiler construction. Objective To understand the different phases in compiler construction. Introduction to Compiling and Lexical Analysis Compilers, Analysis of the source program, The phases of a compiler, Cousins of the compiler, The grouping of phases, Compiler-construction tools. Lexical Analysis The role of the lexical analyzer, Input buffering, Specification of tokens, Recognition of tokens, A language for specifying lexical analyzers, Design of a lexical analyzer generator. Syntax Analysis The role of the parser, Context-free grammar, Writing a grammar, Top-down parsing, Bottom-up parsing, Operator-precedence parsing, LR parsers, Parser generators. Syntax-Directed Translation Syntax-directed definitions, Construction of syntax trees, bottom-up evaluation of Sattributed definitions, L-attributed definitions, Top-down translations, Bottom-up evaluation of inherited attributes. Run-time Environments Source language issues, Storage organization, Storage-allocation strategies, Access to nonlocal names, parameter passing, symbol tables, Language facilities for dynamic storage allocation, Dynamic storage allocation techniques. Storage allocation in Fortran etc., T P C 3

Intermediate Code Generation Intermediate languages, Declarations, Assignment statements, Boolean expressions, Case statements. Code Generation Issues in the design of a code generator, The target machine, Run-time storage management, Basic blocks and flow graphs, Next-use information, A simple code generator, Register allocation and assignment, The dag representation of basic blocks.

Code Optimization Introduction, the principle source of optimization, Optimization of basic blocks, Loops in flow graphs. Text Book:
69

1.

Alfred V Aho, Ravi Seti, Jeffrey D Ullman - Compilers-Principles, Techniques and Tools Addison-Wesley Pearson Education as 2004,

Reference Books: 1. Herk Albas, Albert Nymeyer, - Practice and principles of Compiler Building with C - PHI 1996. 2. Andrew W. Appel - Modern Compiler Implementation in Java - Cambridge University Press 2003. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE312L CASE TOOLS LAB I

L T P 3 C 2

The Students have to form a team size of 3 or 4. Each team is assigned System Analyze, Coding, testing/.metrics tools like Code Comparison, Compilerbased Analysis, Complexity-based Metric, Modeling , Review, Volume testing, Stress Testing, Regression testing etc This tool has to be used for testing and taking various metrics. Estimation for some application Comparative Study of different tools have to be done The above facts has to be documented and a report has to be submitted at the end of the semester

70

05MSE314L COMPILER LAB

L T P 3 C 2

Mini Projects will be assigned for the students under the following topics. 1. Lexical Analysis 2. Syntax Analysis 3. Code Generation 4. Code Optimization

71

05MSE402 OPERATIONS RESEARCH

L 4 T P C 3

Aim The main aim of the course Operational Research is introduce the main techniques, methods and approaches of operational research. It provides numerate skills covering mathematical modeling and optimization technique with application to practical problems arising in computer science. Objective To introduce the concepts and techniques in decision theory. To use the concepts in network analysis and inventory theory

Decision Theory Decision Environments - Decision making under certainty - Decision making under risk Decision making under uncertainty. Markovian Decision Process. Scope of the Markovian Decision Problem - Gardner example - Finite stage Dynamic Programming model - Infinite stage model - Linear Programming solution. Deterministic and Probabilistic Dynamic Programming Recursive nature of computations in DP Selected DP Applications Problem of Dimensionality A Game of chance - Investment Problem Maximization of the event of Achieving a Goal. Network Analysis Network Definitions - Minimal spanning tree algorithm - Shortest route Problem Maximum flow Model - Minimum cost capacitated flow problem - Linear Programming formulation - Network Simplex method CPM and PERT. Inventory Theory Basic Elements of an Inventory model - Deterministic models of the following types: Single item static model with and without price breaks - Multiple item static models with storage limitation. Probabilistic Models: Continuous Review model - Single period models. Queuing Theory Basic elements of a queuing model - Role of Poisson and Exponential distributions Pure Birth and Death models Specialized Poisson Queues M/G/1 queue - Pollaczek Khintchine formula. Text Book: 1. Hamdy A. Taha , Operations Research ,Prentice - Hall of India Private Limited, New Delhi (2002). Reference Books: 1. F.S. Hiller and J.Lieberman -,Introduction to Operations Research ,7th Edition, Tata McGraw Hill Publishing Company, New Delhi, 2001. 2. Beightler. C, D.Phillips, B. Wilde ,Foundations of Optimization ,2nd Edition, Prentice Hall Pvt Ltd., New York, 1979 3. Bazaraa, M.S; J.J.Jarvis, H.D.Sharall ,Linear Programming and Network flow, John Wiley and sons, New York 1990.
72

5. Gross, D and C.M.Harris, Fundamentals of Queuing Theory, 3rd Edition, Wiley & Sons, New York, 1998. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE404 SOFTWARE TESTING

L 4 T P C 3

Aim To learn the fundamental concepts of Software Testing methodologies. Objective To apply the various software testing methodologies for software development. Software Testing Principles Software testing Need for testing - Role of software testing - Psychology of testing Testing economics - White box, Black box testing A structural approach to testing methods for developing test strategy - Testing methodologies. SDLC and Testing Verification & Validation. Testing Strategies White box testing techniques - Statement coverage - Branch Coverage Condition coverage - Decision/Condition coverage - Multiple condition coverage - Dataflow coverage - Mutation testing - Automated code coverage analysis - Black box testing techniques - Boundary value analysis - Robustness testing - Equivalence partitioning Syntax testing - Finite state testing - Levels of testing - Unit, Integration and System Testing. Life Cycle Testing Approach Requirements testing Walk through test tool Risk matrix test tool testing for requirements phase and design phase Design review test tool Test data and volume test tools. Installation phase testing Tools for acceptance test Software acceptance process -Software maintenance Methodologies for testing Training and change installation. Testing methods, tools and techniques Testing methods, tools and techniques Testing the Validity of software Cost estimate Strategies for cost estimation Testing the Progress of software system Overview of point accumulation tracking system Performance analysis of testing Inspection plan and test plan documents. Testing and other Related Issues Rapid prototyping Spiral testing Tool selection processes Structural system testing Documentation of test results Test effectiveness evaluation Test measurement process Test metrics. Automated Tools for Testing - Static code analyzers - Test case generators GUI - Testing compilers and language processors - Testing web-enabled applications. Text Book:
73

1. William E.Perry, " Effective Methods for Software Testing (2nd Edition) ", John Wiley & Sons, 1999 2nd edition. Reference Books: 1) Glenford J.Myers, " The Art of Software Testing ", John Wiley & Sons, 1979. 2) Boris Beizer, Black-Box Testing: " Techniques for Functional Testing of Software and Systems", John Wiley & Sons, 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE406 SOFTWARE CONFIGURATION MANAGEMENT

L 4 Aim To learn the basic concepts of Software Configuration Management. Objective To understand and apply Software Configuration Management concepts for software development. Introduction Overview of Software Configuration Management : History of Software Configuration Management- Software Configuration Management - concepts and definitions- Need and Importance of Software Configuration Management Basic Concepts. Software Configuration Management Implementation Different phases of Software Configuration Management Configuration Identification Configuration Control Status Accounting Configuration Verification and Audits. Software Configuration Management advanced concepts and standards Software Configuration Management: Advanced Concepts Software Configuration Management standards Software process improvement models and SCM Software Configuration Management organization & Document Management Software Configuration Management Plans Software Configuration Management organization Software Configuration Management tools - Documentation management and control and product data management Operation and Maintenance of Software Configuration Management Software Configuration Management Implementation Software Configuration Management operation and Maintenance- Software Configuration Management in special circumstances Text Book: T P C 3

74

1.

Alexis Leon, Software Configuration Management Handbook, 2nd Edition, John Wiley, 1992.

Reference Books:

1.

Software Configuration Management Strategies and IBM Rational ClearCase: A Practical Introduction, 2nd Edition.

2. Managing Software Process, Watts S. Humphrey, Pearson Education , 2000. 3. Managing Global Software Projects, Gopalswamy Ramesh, 2004, TMH.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE408 OPEN SOURCE PROGRAMMING II

L 4 T P C 3

Aim To create Software applications that can be accessed by all the people over the internet and to allow the users to customize the software based on their requirements. Objective On completion of this course the students will be able to create open source software applications and can publish it over the Internet. Introduction to PHP Open source Programming PHP, Apache, MySQL, Postgress, SQL and Perl- Overview of PHP Variables, operations, Constants, control structures arrays, Functions, classes Handling files. My SQL database programming Connecting table creation record insertion updation multiple database handling. E-mailing with PHP Sending an email multipart message storing images getting confirmation. Session tracking using PHP Graphics Input Validators cookies. Introduction to Perl / TCL / Python Numbers and Strings Control Statements Lists and Arrays Files Pattern matching Hashes Functions. Introduction to TCL/TK, Introduction to Python.

Text Books:
75

Beginning PHP, Apache, MySQL web development Michael K.glass, Rommn le Scouarnec, et al.Wiley Publishing, Inc, New Delhi, 2004 2. Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi, 2004.
1.

Reference Books:
1.

PHP Professional Projects, Ashish Wilfred Meeta Gupta and Karticj Bhatnagar PHI, 2002 Teach Fourself perl, Clinton pierce, Techmedia, New Delhi, 2000. Tom Christiansen and Nathan Torkington, Perl CookBook, OReilly, 2003

2. 3.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE410L SOFTWARE TESTING LAB

L T P 3 C 2

The Students have to form a team size of 3 or 4. Each team is assigned System Analyze, Coding, testing/.metrics tools like Code Comparison, Compiler-based Analysis, Complexity-based Metric, Modeling , Review, Volume testing, Stress Testing, Regression testing etc This tool has to be used for testing and taking various decisions. Comparative Study of different tools have to be done The above facts has to be documented and a report has to be submitted at the end of the semester

05MSE412L OPEN SOURCE PROGRAMMING LAB

L T P - 3 Mini Projects will be assigned for the students under the following domains. PHP PERL My SQL Linux C 2

76

05MSE501 DESIGN PATTERNS

L 4 T P C 3

Aim To provide advanced concepts on software design and architecture. Objective To learn various architectural styles and Design Pattern. Introduction Introduction to patterns Pattern categories Relationship- pattern description patterns and S/W architecture- Description of architectural patterns-Design pattern an Introduction Description of design pattern. Design Pattern Catalog of Design Pattern Problem solving by Design Pattern Guidelines for selecting & using design pattern Creation of patterns Abstract factory Builder Factory methods prototype singleton Discussion Structural Pattern Structural Pattern Adapter Bridge Composite Decorator Faade Flyweight Proxy Discussion. Behavioral Pattern Behavioral Pattern Chain of responsibility Command Interpreter Iterator Mediator Memento- Observer - State Strategy Template method visitor discussion Future of Patterns Benefits of pattern in S/ W development expectation from design pattern A Case study. Text Book: Gamma & Helm et al, Design Patterns, Addison Wesley 1999. Reference Book: Frank Bushmann et al, Pattern Oriented S/W Architecture, John Wiley & sons -2001. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

77

05MSE503 SOFTWARE INSPECTION

L 4 Aim To learn the need and concepts of software inspection Objective To prepare, conduct and manage software inspection. Inspection Background Inspection background Inspection preconditions common questionnaires Inspections approach to success inspections first inspections approach to success inspection. Introduction definitions from inspection comparison Walk thru & review defect detection & prevent or characteristics inspection. The Inspection process flow of Improvement process planning & scheduling inspection meeting analysis meeting rework follow up prevention meeting & inspection process monitoring. Moderator & other roles Introduction quality of good moderator code of conduct for moderator moderator pools moderating 1:1 Inspection role participation role assignments participant personalities. Inspection Analysis Inspection data goal setting defects classification sign of work products effort time & cost other inspection date inspection date tools defect density inspection meeting rate inspection effectiveness inspection analysis casual analysis pareto analysis presentation. Managing Inspections Re inspection criteria imp rate preparation rate, compelling quality of inspection group consensus rework Vs restrictive recommendations Managing inspections policy commitment proctor projects feedback inspections co-coordinators SQA responsible Types of Inspection Approaches what to inspect? Software work products systems engineering reviews walk through self review disk check a person inspection N fold inspections formal technical review clear work inspection characteristics- inspections future improvements in work product - aspects of a best case inspection process Text Book: Ronald a Radice ,Software inspections how to cut costs , improve quality & short terms time cycles of software projects , Tata McGraw hill 2003. Reference Book: Watts Humpherey,Managing Software process Addison Wesley 2000 Pearson Education 2004. T P C 3

78

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE505 SOFTWARE MEASUREMENTS

L 4 Aim To learn the basics of software measurement Objective To understand and utilize the various product and process metrics for software quality. Fundamentals of Measurements and Experimentation Fundamentals of measurement Basics of Measurements in Software Engineering A goal-based framework for software measurement Software Measurement validation. Software Metrics Data Collection and Analysis Empirical investigation - Planning formal experiments - Software metrics data Collection - Analysis methods statistical methods. Measuring Product Attributes Measurement of internal product attributes - size and structure - External product attributes - measurement of quality Metrics for Quality Software quality metrics - Product quality - Process quality Software reliability measurements -metrics for software maintenance. Measurement and Management Quality management models Resource measurement process predictions planning measurement program measurement in practice. Text Book: 1. Norman E - Fentar and Share Lawrence Pflieger, " Software metrics ", International Thomson Computer Press, 2003.Thomson Delmar 2nd edition. Reference Books: 1) Stephen H.Kin, " Metric and models in software quality engineering ", Addison Wesley 1995 Pearson Education 2003 2) William A. Florac and Areitor D. Carletow, Measuring Software Process ", Addison - Wesley, 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations. T P C 3

79

05MSE507 SOFTWARE QUALITY AND PROCESS IMPROVEMENT

L 4 T P C 3

Aim To learn the concepts and procedures assuring software quality and process improvement Objective To understand and implement software quality and process improvement procedures. Software Quality Concepts of Quality Control, Quality Assurance, Quality Management - Total Quality Management; Cost of Quality; QC tools - 7 QC Tools Measuring of quality Standards and procedures Technical activities ISO 9000 series standards ISO 9001 accreditation Management responsibility Board responsibility and day to day responsibility Documented quality system Training and induction Relation to ISO 9000-3. Standards and procedures Quality system - Documentation Contract review Standards and procedures for feasibility analysis Standards and procedures for design and requirements Traceability validation Organizational interface Design input requirements Configuration management Configuration control Status accounting Subcontracted requirements Subcontracting decisions Purchased product identification Prechecking. Software Process Improvement. A Framework for Software Process Improvement: Software process improvement environment. Software process infrastructure. Software process improvement roadmap. Software process assessment. Software process improvement plan. Software Process Infrastructure Justification and definition. Organizational and management infrastructure. Process technical infrastructure. An example of a software process support infrastructure. Making the infrastructure effective. Process Improvement Roadmaps Learning from the quality gurus. Software process improvement models. Staged versus continuous architecture for SPI models. Standards and models for SPI. Text Books:
80

1. Sami Zahran Software Process Improvement: Practical Guidelines for Business Success,Pearson Education, 2002 2. Darrel Ince - ISO 9001 and Software Quality Assurance McGraw Hill, New York, 1994. Reference Books: 1. Osten Oskarsson and R - An ISO 9000 Approach to Building Quality Software Prentice Hall - 1996. 2. Roger Pressman, " Software Engineering ", McGraw Hill, Pearson Education 6th edition 2004 1. Watt.S. Humphery, Managing Software Process ", Addison - Wesley, 2000. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE509L CASE TOOLS LAB II

L T P 3 C 2

The Students have to form a team size of 3 or 4. Each team is assigned System Analyze, Coding, testing/.metrics tools like Code Comparison, Compiler-based Analysis, Complexity-based Metric, Modeling, Review, Volume testing, Stress Testing, Regression testing etc This tool has to be used for testing and taking various metrics. Estimation for some application Comparative Study of different tools have to be done The above fact has to be documented and a report has to be submitted at the end of the semester.

81

05MSE511L SOFTWARE MEASUREMENT LAB L T P 3 C 2

The Students have to form a team size of 3 or 4. Each team is assigned testing / metrics tools like Code Comparison, Compiler-based Analysis, Complexity-based Metric, Modeling , Review, Volume testing, Stress Testing, Regression testing etc This tool has to be used for testing and taking various metrics. Estimation for some Application Comparative Study of different tools have to be done

The above facts has to be documented and a report has to be submitted at the end of the semester

82

05MSE E01 DATAWAREHOUSING & DATA MINING *

L 4 T P C 3

Aim The subject aims to cover knowledge discovery process and to design and populate a business data warehouse. Objectives To make familiar with the various concepts of data warehousing like meta data, data mart, summary table, fact data and dimension data. To sail along with the various approaches in data mining. To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining Introduction to Data Warehouse- A multidimensional Data Model Data Warehouse architecture Data preprocessing- Data cleaning Data integration and Transformation. Data Mining Introduction Introduction to Data Mining Data Mining Functionalities Classification of Data Mining systems, Major issues in Data mining. Data Mining primitives, languages & system architecture Data mining primitives: Task relevant data kind of knowledge to be mined Background knowledge interestingness measures presentation & visualization of discovered pattern - Data Mining Query language Designing Graphical User interfaces based on DMQL - Architecture of Data mining. Association Rule Mining Basic concepts market basket analysis - Mining single dimensional Boolean association rules from transactional databases. Classification & prediction: Whats classification issues regarding classification and prediction Bayesian classification prediction: linear non linear.

UNIT V: Cluster analysis Types of Data in cluster analysis - Major clustering methods. Data mining applications.

Text Book: 1. Han J. & Kamber, M, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2005. Reference Books: 1. Immon.W.H., Building the Data Warehouse, Wiley Dream Tech, 3rd Edition, 2003. 2. Anahory S., Murray, D, Data Warehousing in the Real World, Addison Wesley, 1st Edition, 1997.

83

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E02 NATURAL LANGUAGE PROCESSING

L 4 T P C 3

Aim To introduce the fundamental techniques of natural language processing, to develop an understanding of the limits of those techniques and of current research issues, and to evaluate some current and potential applications Objective Students should be able to discuss the current and likely future performance of several NLP applications, such as machine translation and email response be able to describe briefly a fundamental technique for processing language for several subtasks, such as morphological analysis, parsing, word sense disambiguation etc. Understand how these techniques draw on and relate to other areas of (theoretical) computer science, such as formal language theory, formal semantics of programming languages, or theorem proving Introduction Introduction to the Morphology, Syntax, Semantics by linking the linguistics view (computational linguistics) with the artificial intelligence view (natural language processing). Morphology Analysis and generation of language on word level: e.g. problems with compounding and idiomatic phrases, homophonous strings as well as loan words and their processing using e.g. finite state automata as well as semantic networks. Ambiguities in words like pen and pipe, but will also discuss some complex strings. Syntax Analysis and generation of language on phrasal and sentence level: e.g. applications such as machine translation and grammar checking and the processing using phase structure grammars as well as unification based formalisms, and relating those formalisms to recursive transition networks (RTNs) as well as augmented transition networks (ATNs). Semantics Language ambiguities on the level of meaning: represented by case structures and conceptual dependency structures. We will look at famous utterances such as: Colourless green ideas sleep furiously. And will discuss why the machine runs into problems during analysis, and how these problems can be overcome. Applications of NLP
84

Machine Translation, Grammar Checkers Dictation, Automatic Document Generation, NL Interfaces. Text Book: Daniel Jurafsky, James H. Martin Speech and Language Processing Prentice Hall, 2001. Reference Books: Chris Manning and Hinrich Schtze, Foundations of Statistical Natural Language Processing, MIT Press. Cambridge, MA: May 1999. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E03 E-COMMERCE

L 4 T P C 3

Aim To provide an environment to understand the concepts of E-Commerce Objective To make students to the basic concepts, security issues and Business Process Reengineering Electronic Commerce Electronic Commerce, electronic data interchange (EDI), value added networks, electronic commerce over internet, PC and networking, networking , communication media, computer communication system, ISO model, X.400 message handling system, internet E-mail, E-mail security, light weight directory access protocol, internet search, internet 2, Intranet Introduction, Services. Electronic data interchange (EDI) EDI introduction, cost and benefits, components of EDI system, implementation issues, UN/EDIFACT standard introduction, an EDIFACT message, interchange structure, message directories, EDI over internet, commerce over extranets, identification and tracking tools for electronic commerce. Technology and security issues Technology issues Bandwidth issues, technology issues for the internet, NII standard, NI1 services, NI1 agenda, G11, security issues security concerns, security solution, electronic cash over the internet, internet security, guidelines for cryptography policy. Reengineering Business process reengineering, approach for BPR, strategic alignment model, BPR methodology, change management, change management in public administration, implementation plan, legal issues, risks paper document versus electronic document, laws for e commerce, EDI interchange agreement. Case Studies
85

EDI in Indian customs, US electronic procurement, banks, automotive industry, SNS, Ecommerce in India EDI in India, internet in India, laws for e commerce in India, UNCITRAL model law on electronic commerce, model interchange agreement for international commercial use of EDI. Text Book: 1. Kamlesh K. Bajaj - E-Commerce - Tata McGraw Hill 2000. Reference Books: 1) San Jose CA Electronic Publishing Guide Adobe Press 1998. 2) Jim Iterne World Wide Web Marketing John Wiley 1995. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E04 NETWORK SECURITY

L 4 T P C 3

Aim The subject aims to cover the significance of security of computer systems and computer networks. It also covers the topics such as cryptography and various encryption algorithms. Objectives The students would be able to understand and use encryption algorithms such as RSA, Blow Fish etc; authentication techniques digital signatures and System-level security issues. Attacks, Service and Mechanism Attacks, Services & Mechanisms Security attacks Security services Network Security Model. Conventional Encryption: Classical Techniques: Conventional Encryption model - Stenography Classical Encryption Techniques- Modern Techniques: The Data Encryption Standard The Strength of DES Differential and Linear, Crypto-analysis. Public Key Cryptography Principles of public-key cryptosystems The RSA algorithm - Key management DiffieHellman key exchange Elliptic curve cryptography Message Authentication and Hash functions Authentication requirements Authentication functions Hash functions Security of hash functions and MACS. Hash Algorithm: MD5 Message Digest algorithm Secure Hash algorithm (SHA-1) HMAC. Digital Signatures and Authentication Protocols: Digital signatures Authentication protocols Digital signature standard.
86

Electronic Mail Security Pretty Good Privacy PGP services Transmission and reception of PGP messages PGP message generation PGP message reception. IP Security: Overview Architecture Authentication header Web Security: A comparison of Threats on the Web Secure socket layer and transport layer security: SSL architecture SSL record protocol Handshake protocols. Intruders and Viruses, Worms Intruders Intrusion techniques Password protection Access control Password selection strategies -Intrusion detection- Different approaches of Intrusion detection Audit records Viruses and related Threats Firewalls: Firewall design principles Firewall characteristics types of firewalls Firewall configurations. Text Book: William Stallings Cryptography and Network security Principles and Practice", 2nd edition, Pearson Education, 2002. Reference Book: Charlie Kaufman, Raja perlman, Mike speciner, Network Security 2nd edition, Prentice-Hall of India Pvt Ltd, 2002. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E05 DISTRIBUTED COMPUTING

L 4 T P C 3

Aim The subject aims to cover parallel & distributed computing architecture, networked clusters of computers, utilization and management of the expensive resources that are remote to the users. Objectives The students would be able to understand and use different network models, security mechanisms and design methodologies of Distributed systems Introduction Introduction to distributed computing system, evolution different models, gaining popularity, definition, issues in design, DCE, message passing introduction, desirable features of a good message passing system, issues in IPC, synchronization, buffering, multigram messages, encoding and decoding of message data, process addressing, failure handling, group communication.

87

Remote Procedure Call RPC-Introduction, model, transparency, implementation mechanism, stub generation, RPC messages, marshalling arguments and results, server management, parameter - passing semantics, call semantics, communication protocols for RPCs, client server binding, exception handling, security, mini project using Java RMI Distributed Shared Memory Distributed shared memory- general architecture of DSM systems, design and implementation issues of DSM systems, granularity, structure of shared memory space, consistency model, replacement strategy, thrashing, advantages of DSM, clock synchronization DFS and security- Desirable features of good DFS, file models, file accessing Models, file sharing semantics, file catching schemes, file replication, fault Tolerance, atomic transaction, potential attacks to computer system, cryptography, authentication, access control. Digital signatures, DCE security service. Parallel and Distributing Computing Overview of Parallel and Distributed Computing, Operating Systems, Client-Server Model, Distributed Database Systems, Parallel Programming Languages and Algorithms. Distributed Network ArchitecturesManaging Distributed Systems. Design Considerations Tools Methods and tools for development, implementation & evaluation of distributed information systems, workflow, software processes, transaction management, and data modeling, infrastructure e.g. middle-ware to glue heterogeneous, autonomous, and partly mobile/distributed data systems, such as e.g. client/server-, CORBA-, and Internet-technologies. Methods for building distributed applications. TEXT BOOK: 1. Pradeep K. Sinha, "Distributed Operating Systems: Concepts & Design", PHI, 2005. REFERENCE BOOKS: 1. Crichlow Joel M, "An Introduction to Distributed and Parallel Computing", PHI, 1997. 2. Black Uyless, "Data Communications and Distributed Networks", PHI, 5th Edition. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E06 WEB SERVICES

L 4 Aim To provide the student with the basics of .NET, C#. Objectives After completion of this course the students will be able to undergo projects in .NET
88

T -

P -

C 3

Introduction Introduction to Microsoft .NET Platform; Building Blocks of .NET C# Language Fundamentals: Object Oriented Programming in C#. Framework Concepts Console I/O-working with strings-formatting and conversion- file/O serialization. Threading NET Framework Concepts II: Reflection- Remoting -XML Parsing-Security; Applications Writing GUI Applications with the .NET Framework; Introduction to ADO.NET; Writing Web Application with the .NET framework; Web Services Writing Mobile Application with .NET Framework; Advanced Concepts. TEXT BOOK: 1. Rick Leinecker ASP.NET on the edge, IDG Books India Pvt. Ltd, 2003. REFERENCE BOOK: 1. MSDN, Microsoft C# Language specification, WP Publishers and Distributors, 2001. 2. MSDN, Microsoft Visual Basic .NET framework, WP Publishers and Distributors, 2003. 3. MSDN, .NET Framework, WP Publishers and Distributors, 2003. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E07 IMAGE PROCESSING

L 4 T P C 3

Aim This subject aims to introduce the concepts of image processing such as Representation of Image, Image Transform, Image Restoration using various approaches, Image segmentation and Image recognition and interpretation.
89

Objectives The students would be able to understand and explain Fundamentals of Image processing, Image Transforms, Image restoration techniques, Image segmentation and Recognition & interpretation of Images. Digital Image representation Steps in image processing, Elements of Digital Image processing systems, Fundamentals: Elements of visual perception, sampling and quantization, basic relationship between pixels. Imaging Geometry some basic transforms, perspective transforms. Image Transform Fourier transform, Discrete Fourier transform, Fast Fourier transform, properties of 2 D Fourier transform, Image Enhancement Spatial domain methods, Frequency domain methods, Enhancement by point processing, spatial filtering, Enhancement in the Frequency domain. Image Restoration Degradation model, Algebraic approach to restoration, Inverse Filtering, Wiener Filter constraint least squares restoration, Restoration in the spatial domain, Image Compression- Redundancy, Compression models, Error free compression, Lossy compression, Image compression standards. Image Segmentation Detection of Detection of Discontinuity Edge linking and boundary detection, Thresholding Region oriented segmentation. Image representation Representation schemes, Boundary descriptors, Regional descriptors. Recognition and interpretation Elements of Image analysis, patterns and pattern classes, Decision and theoretic methods, structural methods, Interpretation.

Text Book: 1. Rafel C. Gonzalez & Richard E. Woods, Digital Image Processing, Pearson Education, 2005. Reference book: 1. Anil K. Jain, Fundamentals of digital Image processing, PHI, 1989.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

90

05MSE E08 DIGITAL SIGNAL PROCESSING

L 4 Aim To deliver the concepts of signal processing Objective To make students to understand the various digital filters family of digital processors and its applications. Review of basic concepts Signals and signal processing: characterization and classification of signals, typical signal processing operations, examples of typical signals, typical signal processing applications, why digital signal processing? Transform-domain representations of l to 1 systems: the frequency response, the transfer function, types of transfer functions, all pass transfer function, minimum-phase and maximum-phase transfer functions, complementary transfer functions, digital two-pairs, stability test, discrete-time processing of random signals. Digital filters Structures: block diagram representation, signal flow-graph representation, equivalent structures, basic fir digital filter structures, basic iir filter structures, state-space structures, all pass filters, tunable iir digital filters, cascaded lattice realization of iir and fir filters, parallel all pass realization of iir transfer functions, digital sine-cosine generator, computational complexity of digital filter structures. Design: preliminary consideration, impulse invariance method of iir filter design, bilinear transform method of iir filter design, design of digital iir notch filters, low pass iir digital filter design. Examples, spectral transformations of iir filters, fir design based on truncated Fourier series, fir filter design based on frequency sampling approach, computer-aided design of digital filters. Digital signal processors Overview of motorola DSP3xx family of digital signal processors, architectures of DSP56307: assembly language instructions and programming: typical software applications. Implementation, applications Implementation consideration: basic issues, software implementation, computation of the discrete fourier transform, the quantization process and errors, analysis of coefficient quantization effects, analysis of coefficient quantization effects in fir filters. Representative applications: dual tone multifrequency signal detection, spectral analysis using dft, short-term discrete fourier transform, musical sound processing, digital fm stereo generation, discrete-time analytic signal generation, voice privacy system, subband coding of speech and audio signals. Text Book: 1. Sanjit K. Mitra: Digital Signal Processing A Computer Based Approach, Tata McGraw-Hill, 1998. (Chapters 1,4,6,7,8.1 To 8.3, 9.1 To 9.10, 11.1 To 11.8). Reference Books: 1. Alan V. Oppenhein, And Ronald W. Schafer : Discrete Time Signal Processing (Second Edition), Prentice Hall, 1998.
91

T -

P -

C 3

2.

John G. Proakis & Dimitris G. Manolakis: DSP Principles, Algorithms, And Applications Prentice-Hall, 1996.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E09 COMPUTER SIMULATION & MODELLING

L 4 T P C 3

Aim This subject aims to cover statistical models in simulation, Inventory systems, and Random numbers & variables, Input and output analysis Objectives The students would be able to understand and use discrete event simulation, simulation techniques, and statistical methods. Introduction Simulation-Advantages and disadvantages of simulation, areas of application, Systems and system environment, Components of a system, Discrete and continuous systems, Model of a system. Types of models, Discrete events system simulation, Steps in a simulation study. Simulation Examples, Simulation of queuing systems, Simulation of inventory systems, other examples of simulation, discrete event simulation, general principles and computer simulation languages. Concepts in DES, Programming languages for DESS: FORTRAN, GASP, SIMSCRIPT, GPSS, SLAM, Summary and comparison of simulations. Statistical Models in Simulation Review of terminology & concepts, Useful statistical models, Discrete distributions, Continuous distributions, Process, Empirical distributions. Queuing Models: Characteristics of queuing systems, queuing notation, Transient & steady state behavior of queuing notation, Transient & steady state behavior of queues, long run measures of performance of queuing systems, steady state behavior of finite population models. Inventory Systems Measures of effectiveness, Inventory policies, Deterministic systems, and probabilistic systems, Simulation in inventory analysis. Random Number Generation: Properties of random numbers, Generation of Pseudo random. Nos., techniques for generating random nos., tests for random nos. Random Variable Generation: Inverse transform technique, Direct Transformation for the normal distribution, Convolution method, Acceptance-Rejection technique. Input Data Analysis Data collection, identifying the distribution, parameter estimation, goodness-of-fit tests. Verification and validation of simulation models: Model building, verification & validation, verification of simulation models, calibration & validation of models. Output Analysis Output Data analysis for a Single Model- Stochastic nature of O/I data, types of simulations with respect to O/P analysis, measures of performance and their estimation,
92

O/p analysis for terminating simulations, O/P analysis for steady-state simulations. Comparison and evaluation of alternative system designs: Comparison of two and several system designs, statistical models for estimating the effect of design alternatives. Text Book : 1. Jerry Banks, John S. Carson, Discrete-event System Simulation, PHI, 3rd Edition REFERENCE BOOK: 1. Karian, Z.A. and Dvdewicz. E.J., Modern Statistical Systems and GPSS Simulation, Freeman, 1991. Mode of Evaluation: By Assignment, Seminars and Written Examinations

05MSE E10 MOBILE COMMUNICATION

L 4 T P C 3

Aim The subject aims to impart the knowledge about the technologies like CDMA, GSM, GPRS and Wireless Application protocols Objectives The student would be able to understand the principles and practices of Mobile Communication, Satellite Communication, Medium Access Control techniques, Mobile Devices, Wireless Local Area Networks, HiperLAN and Bluetooth, Wireless ATM operations, mobile network layer and various wirelesses Application Protocol. Introduction Introduction-Wireless Transmission Frequencies for Radio transmission signalsAntennas Signal propagation multiplexing Modulation-Spread spectrum Cellular systems Communication Systems Communication Systems-Medium access control-Motivation for a specialized MAC SDMA-FDMA-TDMA-CDMA-comparison of S/T/F/CDMA. Telecommunication Systems GSM DECT TETRA - UMTS and IMT - 2000, Satellite Systems GEO139, LEO139, MEO140 Routing Localization Handover Broadcast systems-Overview Cyclic Repetition of Data Digital Audio Broadcasting Digital Video Broadcasting. Wireless Communication Wireless Communication-Wireless LAN-Infrared vs Radio transmission Infrastructure and ad hoc networks IEEE802.11-HIPERLAN Bluetooth. Wireless ATM-Motivation for WATM Wireless ATM working group WATM Services-Reference Model-Functions-Radio Access Layer Handover Location Management Addressing Mobile quality of service Access point control protocol. Mobile Network Layers Mobile network layer-Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Mobile transport layer-Traditional TCP292-Indirect TCP Snooping TCP, Mobile TCP-Fast
93

Retransmit/Fast recovery-transmission/Timeout Freezing ,Selective Retransmission Transaction oriented TCPU File Systems Support for Mobility File Systems-Consistency World wide Web Hyper Text mark up language approaches that might help wireless access-System architecture Wireless Application Protocol Text Book: 1. Johchen schiller, Mobile Communication, Addison Wesley, 2000. Reference Book`: 1. Asoke K. Talukder, Roopa R.Yavagal, Mobile Computing-Technology, Applications and Service Creation, Tata Mcgraw Hill, 2005. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E11 EMBEDDED SYSTEMS

L 4 T P C 3

Aim The subject aims to cover the concepts of embedded systems, their design and applications, programming models and Inter process communication. Objectives The student would be able to understand and use in embedded systems, device drivers, software engineering practices in embedded systems development and Inter process communication. Introduction Introduction to Embedded Systems, Processor in the System Software Embedded into a system Exemplary Embedded Systems Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization Structural Units in a Processor Processor Selection for an Embedded System Memory Devices Memory Selection for an Embedded System Allocation of Memory to Program Segments and Blocks and Memory Map of a System Direct Memory Access Interfacing Processor, Memories and I/O Devices. Devices and Buses Devices and Buses for Device Networks-I/O Devices Timer and Counting Devices Serial Communication Using the I2 C, CAN and Advanced I/O Buses between the Networked Multiple Devices Host System or Computer Parallel Communication between the Networked I/O Multiple Devices Using the ISA, PCI, PCI X and Advanced Buses.

94

Device Drivers and Interrupts Device Drivers and Interrupts Servicing Mechanism- Device Drivers Parallel Port Device Drivers in a System Serial Port Device Drivers in a System Device Drivers for Internal Programmable Timing Devices Interrupt Servicing (Handling) Mechanism Context and the periods for Context Switching, Deadline and Interrupt Latency. Programming Concepts Program Modeling Concepts in Single and Multiprocessor Systems Software Development Process- Modeling Processes for Software Analysis Before Software Implementation Programming Models for Event Controlled or Response Time Constrained Real Time Programs Modeling of Multiprocessor Systems. Software Engineering in Embedded Software Engineering Practices in the Embedded Software Development ProcessSoftware Algorithm Complexity Software Development Process Life Cycle and its Models Software Analysis Software Design Software Implementation Software Testing, Validating and Debugging Real Time Programming Issues during the Software Development Process Software Project Management Software Maintenance Unified Modelling Language (UML) Inter-Process Communication & Synchronisation of processes, Tasks & Threads-Multiple Processes in an Application Problems of Sharing Data by Multiple Tasks and Routines Inter process Communication. Text Book: 1. Rajkamal, Embedded Systems-Application, Practice & Design, Tata McGraw Hill. Reference Books: 1. Arnold S. Berger, Embedded Systems Design, CMP Books, 1997. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E12 NEURAL NETWORKS

L 4 Aim To provide basic knowledge in Neural Networks. Objective After completion of this course the students will be able to understand 1. 2. 3. 4. Various learning techniques Various multilayered neural networks Application of Neural Networks Implementation of hardware and software networks T P C 3

Introduction Human and computers, the structure of the brain, learning in machines, the differences. Pattern recognition in perspective, pattern recognition a definition, feature vectors and feature space, discriminate functions, classification techniques, linear classifiers, statistical techniques, pattern recognition a summary.
95

Basic Neuron The Basic Neuron- Introduction modeling the single neuron, learning in simple neurons, the perception; a vectorial perspective, the perception learning rule, proof, limitations of perceptions. The Multi-Layer Perception- Introduction altering the perception model, the new model the new learning rule, the multilayer perception algorithm, the XOP problem reverted, visualizing network behaviour, multilayer perceptions as classifiers, generalization, fault tolerance, learning difficulties radial basis functions, applications. Self Organizing Networks Kohenen Self-Organizing Networks- Introduction, the kohenen algorithm, weight training, neighborhoods, reducing the neighborhood, learning vector quantisation, the phonetic typewriter. Hopfield Networks Hopfield Network - Hopfield model, the energy landscape, the Boltzman machine, constraint satisfaction, Adaptive resonance theory, architecture and operation, ART algorithm, training the ART network, clarification conclusion, summary of ART. Associative Memory Associative Memory -Standard computer memory, implement associative memory, implementation in RAMs, FAMS & N-tupling, Willshaws associative net, the ADAM system, kanevas sparse distributed memory, bi-directional associative memories. Hardware and software implementations, optional computing optical computing and neural networks. Text Book: 1. Neural Computing: An Introduction, R. Beale & T. Jackson, Adam Hilger, 1990. Reference Book: 1. Peo Y.H. Adaptive pattern recognition and neural networks, Addison Wesley, 1989. Mode of Evaluation: By Assignment, Seminars and written Examinations.

05MSE E13 MULTIMEDIA COMPUTING

L 4 T P C 3

Aim The subject aims to introduce multimedia computing & communications covering various building blocks such as hardware, software, operating systems and DBMS. Objectives At the end of the course students would be able to use multimedia computing hardware, software tools multimedia authoring and design process. Introduction
96

Branch-overlapping Aspects of Multimedia, Content, Global Structure, Multimedia- Media and Data Streams, Medium, Main Properties of a Multimedia System, Traditional Data Stream Characteristics, Data Streams Characteristics for Continuous Media, Information Units. Sound /Audio Basic Sound Concepts, Music, Speech, Image and Graphics- Basic Concepts, Computer Image Processing, Introduction to Optical Storage Video and Animation Basic Concepts, Television, Computer-based Animation, Data Compression-Storage Space, Coding Requirements, Source, Entropy, and Hybrid Coding, Some Basic Compression Techniques-JPEG, H.261, MPEG, DVI Multimedia Operating Systems Introduction, Real-time, Resource Management, Process Management, File Systems, Additional Operating System Issues, System Architecture, Multimedia Communication Systems- Application Subsystem, Transport Subsystem, Quality of Service and Resource Management Multimedia Database Systems Data Analysis, Data Structure, Operations on Data, Integration in a Database Model, Introduction to Hypertext, Hypermedia, Document Architecture, SGML, ODA, MHEG, A Reference Model for Multimedia Synchronization, Multimedia Applications- Media Preparation. Media Composition, Media Integration, Media Communication, Media Consumption, Media Entertainment Text Book : 1. Ralf Steinmetz and Klara Mahrstedt, "Multimedia computing, communications and Applications", Pearson Education Asia, 1st reprint 2001. Reference Book: 1. K. Rao, "Multimedia Communication Systems: Techniques, Standards, and Networks", Prentice Hall, 2002. Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E14 INTELLIGENT SYSTEMS

L 4 Aim To learn the fundamental concepts of intelligent systems
97

T -

P -

C 3

Objective To understand the agent based software development. Introduction Definitions - History - Intelligent Agents - Structure-Environment - Basic Problem Solving Agents- Formulating - Search Strategies - Intelligent search - Game playing as search. Knowledge Based Agents Representation - Logic-First order logic - Reflex Agent - Building a knowledge Base General Ontology - Inference - Logical Recovery. Planning Agents Situational Calculus - Representation of Planning - Partial order Planning- Practical Planners Conditional Planning - planning Agents. Agents and Uncertainty Acting under uncertainty - Probability Bayes Rule and use - Belief Networks - Utility Theory - Decision Network - Value of Information - Decision Theoretic Agent Design. Other Agents Learning agents - General Model - Inductive Learning - Learning Decision TreesReinforcement Learning - Knowledge in Learning - Communicative agents -Types of Communicating agents - Future of AI. . Text Book: 1. Stuart Russell and Peter Norvig Artificial Intelligence - A Modern Approach, Prentice Hall, PHI 2004 2nd edition Reference Books: 1. Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, Pearson Education 2002 3rd Edition. 2. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 2002.

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

05MSE E15 SENSOR NETWORKS

L 4
98

T -

P -

C 3

Aim To introduce the fundamental techniques of sensor Networks, to develop an understanding of the limits of those techniques and of current research issues, and to evaluate some current and potential applications. Objective At the end of the course students should - Have a knowledge and understanding of wireless sensor networks and their principles. - Have deeper knowledge and understanding of sensor models for automotives, etc., - Be able to apply the available tools to perform various kinds of performance testing. Introduction to Sensors Communication Network, Ordinary Sensors Vs Networked Sensors, Use of Networked Sensors, Potential Problems with Networked Sensors, Canonical problems, Key definitions of sensor networks, Sensor network applications. Network sensors & Infrastructure establishment Key assumptions, MAC:- SMAC, IEEE 802.15.4 standard- Zigbee; Graphic, Energy-aware routing, attribute- based routing; Infrastructure Establishment:- Topology control, clustering, Time synchronization , localization and localization services. Sensor tasking, Control and Data acquisition Task driven sensing, sensor nodes utilities, Information based sensor tasking, joint routing and information aggregation. Data Acquisition:- Sensor database challenges, Querying the physical environment, query interfaces, In-Network aggregation, data centric storage. Sensor network platforms & Tools Sensor Node hardware, Sensor network programming challenges, node level software platforms, node level simulators. Network Technologies RS-232 , RS-485 , Seriplex , AS-i , Interbus- CAN bus, HART , Profibus , Foundation Fieldbus, WorldFIP, LonWorks. Text Book Feng ZHAO, Leonidas GUIBAS Wireless Sensor Networks Elsevier. Reference Books 1. Cauligi S. Raghavendra, Krishna Sivalingam, Wireless Sensor Networks Springer, 2005. 2. Holger Karl, Andreas Willig, Protocols and Architectures for Wireless Sensor Networks, Wiley, 2005. Mode of evaluation: Written examination, Case Analysis, Assignments.

99

05MSE E16 GEOGRAPHIC INFORMATION SYSTEM

L 4 Aim To provide an environment to understand the concept of GIS Objective To make the students to understand spatial data models, Arcinfo Concepts. Introduction Introduction and Overview of Geographic Information Systems:- Definition of a GIS, features and functions; why GIS is important; how GIS is applied; GIS as an Information System; GIS and cartography; contributing and allied disciplines; GIS data feeds; historical development of GIS. Maps Map Projections and Coordinate Systems:- Maps and their characteristics (selection, abstraction, scale, etc.); map projections; coordinate systems; precision and error. GIS Concepts and Spatial Data Models Automated cartography versus GIS; CAD Concepts; Data base; Remote Sensing, Concept of data model; raster data model; compression, indexing and hierarchical data structures; vector data model; topology; TIN data model. Arcinfo Concepts ARC/INFO Data Management; workspace; naming conventions; Map projections; Regions, Introduction to Arcinfo Modules. Data Sources Data Automation and Data Quality:- Major data feeds to GIS and their characteristics: maps, GPS, images, databases, commercial data; locating and evaluating data; data formats; data quality; metadata. Text Books 1. Ian Heywood, Introduction to Geographical Information Systems, Pearson Education, 2002. Mode of Evaluation: By Assignment, Seminars and written Examinations. T P C 3

100

05MSE E17

SOFTWARE REENGINEERING
L 4 T P C 3

Aim To understand the concept of software Reengineering Objective On completion of this course the students will understand Reengineering Patterns, Need for Reengineer, The Reengineering Life Cycle, Reengineering Patterns, Form of a Reengineering Pattern, A Map of Reengineering Patterns Evolution Write Tests to Enable Evolution Pattern - Grow Your Test Base Incrementally Pattern Use a Testing Framework Pattern - Test the Interface, Not the Implementation Pattern Record Business Rules as Tests Pattern - Write Tests to Understand Migration Strategies Migration Strategies Forces Overview Pattern - Involve the Users Pattern - Build Confidence Pattern Migrate Systems Incrementally Pattern - Prototype the Target Solution Pattern - Always Have a Running Version Pattern - Regression Test after Every Change Pattern- Make a Bridge to the New Town Pattern - Present the Right Interface Pattern - Distinguish Public from Published Interface Pattern - Deprecate Obsolete Interfaces Pattern -Conserve Familiarity Pattern - Use Profiler before Optimizing Detecting Duplicated Codes Detecting Duplicated Code Forces Overview Pattern - Compare Code Mechanically Pattern - Visualize Code as Dot plots Overview of Pattern Redistribute Responsibilities Forces Overview Pattern - Move Behavior Close to Data Pattern - Eliminate Navigation Code Pattern - Split up God Class Polymorphism Transform Conditionals to Polymorphism Forces Overview Pattern - Transform Self Type Checks Pattern - Transform Client Type Checks Pattern - Factor Out State Pattern Factor Out Strategy Pattern - Introduce Null Object Pattern - Transform Conditionals into Registration Text Book: 1. Object-Oriented ReEngineering Patterns, Serge Demeyer, Stphane Ducasse, Oscar Nierstrasz , ELsvier Publication, 2003 Mode of Evaluation: By Assignment, Seminars and written Examinations.

101

05MSE E18 SOFTWARE AGENTS

L 4 T P C 3

Aim The aim of this subject is to deal with the dynamic and distributed nature of both data and applications require that software not merely respond to requests for information but intelligently anticipate, adapt, and actively seek ways to support users. It covers various approaches to agent-to-agent communication and agent mobility, as well as the use of agents to provide intelligent interoperability between loosely coupled components of distributed systems. Objective The students would be able to describe and use software agents for enhance learning and providing intelligent assistance to users in situations where direct manipulation interfaces alone are insufficient. They would be able to select and use languages and tools for design and implementation of intelligent agents and multi-agent systems including mobile agents. They would also be able to comprehend the software agent applications in decision support systems, manufacturing system, information retrieval and knowledge discovery. Information Systems Internet - based Information systems - Adaptive (Customizable) Software Systems Autonomous mobile and immobile robots - Data mining and Knowledge discovery Smart Systems (Smart homes, Smart automobiles, etc.) - Decision Support Systems and Intelligent design and Manufacturing Systems. Foundations Theoretical Foundations for Software Agents - Design and Implementation of Intelligent Agents: Reactive - Deliberative - Planning - Knowledge - Based - Logical - Rational Commutating - Adaptive - Learning agents. Languages Languages and tools for design and implementation of intelligent agents and multiagent systems, Introduction to mobile agents. Applications: Adaptive Information Retrieval - Decision Support - Knowledge Discovery - Computational Biology - Design and manufacturing - Smart Systems - Robots. Text Books: 1. Russell & Norvig, Artificial Intelligence:A Modern Approach, Prentice Hall, 1995. 2. Huhns and Singh(ed), Palo Alto, Readings in Agents, Morgan Kaufmann 1998. Reference Books
102

1) Bradshaw (ed.), Software Agents, MA:MIT Press, 1997. 2) Bigus & Bigus, Constructing Intelligent Agents with Java, John Wiley, 1999. 3) Jeffrey Broadshaw, Software Agents, MIT press, 1997. 4) James. E. White, Mobile Agents, General Magic, Inc. 1996. Mode of Evaluation: By Assignment, Seminars and written Examinations.

05MSE E19 DECISION SUPPORT SYSTEM

L 4 T P C 3

Aim To provide an environment to understand the system and to make decisions. Objectives The students will be capable of designing the decision support system for managers to take the decision. Decision making and computerized support . Managers and decision making, managerial decision making and informative system, managers and computerized support, the need for computerized decision support technologies, a framework for decision support, the concept of decision support systems, group decision support systems, executive information (support) systems, expert systems, artificial neural networks, hybrid support systems, the evolution and attributes of computerized decision aids, introduction and definitions, systems models, the modeling process; evaluation. Decision Support System DSS configuration, characteristics, capabilities, and components of DSS, the user, DSS hardware, distinguishing DSS from management science and MIS, classifications of DSS, data warehousing, access, analysis, and visualization, the nature and sources of data, data collection and data problems, the internet and commercial database services, database management systems in DSS. Database organization Database organization and structure, data warehousing, OLAP: data access and mining, querying and analysis, data visualization and multidimensionality, intelligent database and data mining, the big picture. Support systems UNIT III: The GDSS meeting process, constructing a GDSS and the determinants of its success, GDSS research challenges Modeling for mss, static and dynamic models, treating certainty, uncertainty and risk, influence diagrams, mss modeling in spreadsheets, decision analysis of a few alternatives, optimization. Simulation Heuristic programming, simulation, multidimensional modeling, visual spreadsheets, financial and planning modeling, visual modeling and simulation, ready-made quantitative software packages, model base management, knowledge-based DSS & AI
103

concepts and definitions, AI verses natural intelligence, knowledge in AI, how AI differs from conventional computing, the AI field, types of knowledge-based DSS. Intelligent DSS Intelligent DSS, the future of AI. DSS construction; the DSS development process; the DSS of the future, decision making in groups, group DSS, the goal of GDSS and its technology levels, the technology of GDSS, the decision (electronic meeting) room, GDSS software idea generation, negotiation. Text Book:
1.

Efrain Turban And Jay E. Aronson, Decision Support Systems And Intelligent Systems (Fifth Edition), Prentice-Hall, 1998, (Chapters ,2,3,4,5,6,8,10,12,13,14,15,16,21)

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

104

05MSE E20 ENTERPRISE RESOURCE PLANNING

L 4 Aim To understand the concepts of ERP. Objective To emphasis the need for ERP, Various Modules and benefits of market issues. Introduction Introduction to ERP, its evolution, its growth, its advantages, its need, integrated management information, business modeling, integrated data model, ERP and related technologies: BPR, MIS, DSS, EIS, data warehousing, data mining, OLAP, supply chain management. Manufacturing perspective and various modules MRP, BOM, closed loop MRP, MRP-11, DRP, JIT and kanban, CAD/CAM, PDM, data management, benefits of PDM, MTO, and MTS, ATO, ETO, CTO, ERP modules Finance, plant maintenance, quality management, materials management. Benefits and Markets Reduction of Load-time, on-time, shipment, reduction in cycle time, improved resource utilization better customer satisfaction, improved supplier performance, increased flexibility, reduced quality costs, market SAP AG, Baan, Oracle, People soft, JD Edwards, SSA, QAD. Implementation ERP implementation lifecycle pro-evaluation screening, package evaluation, project planning phase, gap analysis, reengineering, configuration, implementation team training, testing, going live, end user training, post-implementation, In-house implementation pros and cons. Future directions and case studies Faster implementation methodologies, business models and BAPIs. Convergence on Windows NT, application platforms, new business segment and features, some case studies. Reference Book: 1. Alexis Leon, Enterprise Resource Planning, Tata McGraw Hill, 1999. T P C 3

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

105

05MSE E21 - SOFTWARE PROJECT MANAGEMENT

L 4 Aim To learn the fundamental concepts of software project management Objective To understand and apply project management methodologies in software development. Introduction
Software projects-various type of projects-problems with software projects-an overview of project planning project evaluation-project analysis and technical planning-software estimation.

T -

P -

C 3

Activity planning Activity planning-project schedules-sequencing and scheduling projects-network planning model-shortening project duration identifying critical activities.

Risk Management

Risk Management-resource allocation-monitoring and control-managing people and organizing teams-planning for small projects. Software Configuration Management

Software Configuration Management basic functions- responsibilities-standards-configuration managementprototyping models of prototyping.

Software Maintenance Software Maintenance characteristics - maintenance tasks maintenance side effects maintenance issues source code metrics software reliability definition of software reliability concept of software repair and availability software error and faults estimating number of bugs in computer program reliability models availability models Text Books 1. Mike Cotterell, Bob Hughes - Software Project Management - Inclination/Thomas Computer Press - 1995. 2. Darel Ince, H.Sharp and M.Woodman - Introduction to Software Project Management and Quality Assurance - Tata McGraw Hill. Reference Books 3. Ramesh.Gopalaswamy - Managing Global Projects - Tata MCGraw Hill - 2001 4. Humphrey, Watts - Managing the software process - Addison Wesley - 1986
106

5. 6.

Pressman : Software Engineering - A Practitioners approach - McGraw Hill - 1997 DeMarco and Lister - Peopleware

Mode of Evaluation: By Assignment, Seminars and Written Examinations.

107

05MSE E22 SOFTWARE RISK MANAGEMENT

L 4 Aim To learn the fundamental concepts of software risk management Objective To understand and apply risk management techniques and strategies in software development. Software Risk Management Foundations. Risk in the Large. Risk in the Small. Consequences of Knowledge. Consequences of Ignorance. P2I2 Sucess Formula. Major Factors in Risk Management Capability. People: The Human Element. Process: The Steps to Manage Risk. Infrastructure: The Organizational Foundation. Implementation: The Project Execution Risk Management Process Identify Risk. Define Risk Identification Process. Develop Risk Checklists. Define Risk Assessment Method. Develop Risk Management Form. Establish Risk-Database Schema. Analyze Risk - Define Risk Analysis Process. Define Risk Analysis Techniques. Define Risk Evaluation Criteria. Establish Risk Prioritization Scheme. Plan Risk.- Define Risk Planning Process. Define Risk Resolution Strategies. Define Selection Criteria. Develop Risk Action Plan Template. Track Risk - Define Risk Tracking Process. Define Risk Tracking Techniques. Define Risk Tracking Measures. Define Triggering Devices. Resolve Risk -Define Risk Resolution Process. Define Risk Resolution Techniques. Define Risk Resolution Measures. Develop Corrective Action Procedure. Risk Management Infrastructure. Develop Policy. Obtain Commitment. Survey Existing Practice. Allocate Resources. Define Draft Policy. Review Draft Policy. Document Policy. Approve Policy. Communicate Policy. Risk Management Implementation. Establish Initiative. Review Risk Management Requirements. Plan Risk Management Activities. Budget Risk Management Activities. Schedule Risk Management Activities. Staff Risk Management Activities. Coordinate Risk Management Training. Develop Plan. Outline Risk Management Plan. Define Risk Management Goals. Define Risk Management Strategy. Define Risk Management Process. Define Risk Management Verification. Define Risk Management Mechanisms. Assess Risk. Control Risk. Mitigation. Anticipation. Text Books: 1. Elaine M. Hall - Managing Risk: Methods for Software Systems Development Reference Books 2. Dowd Keyn , Beyond Value at risk The New Science of Risk Manangement John Wiley 1998.
108

T -

P -

C 3

3. Golier , Christian The Economics of risk and time- MIT Press - 2001 Mode of Evaluation: By Assignment, Seminars and Written Examinations.

109

05MSE E23 - CLEANROOM SOFTWARE ENGINEERING

L 4 T P C 3

Aim To learn the fundamental principles and practices concepts of cleanroom software engineering Objective To understand and apply cleanroom software engineering in a given real-life scenario. Cleanroom Software Engineering Fundamentals Cleanroom Overview. Economic Production of High-Quality Software. Cleanroom Foundations. Cleanroom Technologies. The Cleanroom Process. Relationship of Cleanroom to Other Practices. Cleanroom Project Experience. Cleanroom Management by Incremental Development Benefits of Incremental Development. Theoretical Foundations of Incremental Development. Increment Planning in Practice. Incremental Development in Practice. Cleanroom Software Specification Box Structures for Cleanroom Specification Specification Process. and Design. The Sequence-Based

Cleanroom Software Development. Box Structure Development. Clear Box Development. Clear Box Verification. Example: The Security Alarm Clear Box. Cleanroom Software Certification Benefits of Statistical Testing Based on a Usage Model. Theoretical Foundations of Statistical Testing. Statistical Usage Testing in Practice. Example: Security Alarm. The Cleanroom Software Engineering Referen Model The Cleanroom Reference Model. An Introduction to the CRM. Cleanroom Process Definition Format. Common Cleanroom Process Elements. Cleanroom Management Processes. Project Planning Process. Project Management Process. Performance Improvement Process. Engineering Change Process. Cleanroom Specification Processes. Requirements Analysis Process. Function Specification Process. Usage Specification Process. Architecture Specification Process. Increment Planning Process. Cleanroom Development Processes. Software Reengineering Process. Increment Design Process. Correctness Verification Process. Cleanroom Certification Processes. Usage Modeling and Test Planning Process. Statistical Testing and Certification Process. Cleanroom and the Capability Maturity Model for Software. The CMM for Software. Cleanroom Process Mappings to CMM KPAs. Integrating CRM Technology and CMM Management. A CASE STUDY IN CLEANROOM SOFTWARE ENGINEERING. Satellite Control System Requirements. The Satellite Control System Case Study. TEXT BOOKS:
110

1. Stacey J. Prowell, Carmen J. Trammell, Richard C. Linger, and Jesse H. Poore Cleanroom Software Engineering: Technology and Process Mode of Evaluation: By Assignment, Seminars and Written Examinations

111

05MSEE24 - DOMAIN ENGINEERING L 4 Aim To learn the fundamental principles of domain engineering Objective To understand and apply domain engineering in a given real-life scenario. Domain Engineering Basics: Domain Engineering Application Engineering System Life-Cycle Models Developing a Domain Architectural Model The Reusability Process: Domain Repositories Establishing a Reusable Repository Domain Specific Repository (DSR) Domain Repository and Application Development Domain Models: Domain Prototype Model Domain Functional Model Domain Dynamic Model Domain Object Model Domain information model Domain Data Dictionary (All models with case study). Domain Analysis Process: concepts- Benefits of Domain analysis Domain Analysis for Reusability KAPTUR Design Recovery Integrated Computer Aided Manufacturing (ICAM) Definition (IDEF) Process model Feature Oriented Domain Analysis (FODA): Concepts Modeling Techniques Product Parameterization Levels of Abstraction FODA Context Analysis FODA domain modeling FODA Architecture Modeling Joint Object Oriented Domain Analysis (JODA): JODA Context for Domain Analysis JODA Application Engineering JODA Process- JODA Products Domain Design Process: Domain Design The Object oriented Domain Design Methods The Object Oriented Method. Domain Implementation: Object Oriented Life Cycle Model ASSET Collection Selection Criteria for Reuse Assets Asset Submitting Schema Asset Certification Levels of Certification Assessing the Repository for an Asset The Reuse Asset Anomaly Process Collection of Metrics TEXT BOOKS: 1. Jag Sodhi, Prince Sodhi Software Reuse (Domain Analysis and Design Processes. 2. R. Glowinski , J. Perieaux , z- cshi Domain Decomposition Methods in Sciences and Engineering John Willionsons 1997. Mode of Evaluation: By Assignment, Seminars and Written Examinations T P C 3

112

05MSE E25 - PRINCIPLES OF USER INTERFACE DESIGN

L 4 Aim To learn the fundamental principles of user interface design Objective To understand and apply user interface design in a given real-life scenario Human Factors, Theories, Principles, and Guidelines Introduction, Goals of System Engineering, Goals of User-Interface Design, Motivations for Human Factors in Design, Accommodation of Human Diversity, Goals for Our Profession, High Level Theories, Object-Action Interface Model, Principle 1: Recognize the Diversity, Principle 2: Use the Eight Golden Rules of Interface Design, Principle 3: Prevent Errors, Guidelines for Data Display, Guidelines for Data Entry, Balance of Automation and Human Control. Management Issues Introduction, Organizational Design to Support Usability, The Three Pillars of Design Development Methodologies, Ethnographic Observation, Participatory Design, Scenario Development, Social Impact Statement for Early Design Review, Legal Issues, Expert Reviews, Usability Testing and Laboratories, Surveys, Acceptance Tests, Evaluation During Active Use, Controlled Psychologically Oriented Experiments Tools, Environment, and Menus Introduction, Specification Methods, Interface-Building Tools, Evaluation and Critiquing Tools. Direct Manipulation and Virtual Environments: Introduction, Examples of DirectManipulation systems, Explanations of Direct Manipulation, Visual Thinking and Icons, Direct-Manipulation Programming, Home Automation, Remote Direct Manipulation, Virtual Environments. Menus: Task related organization, Item Presentation Sequence, Response Time and Display Rate, Fast Movement through Menus, Menu Layout, Form Fillin, Dialog Boxes. Command and Natural Languages: Functionality to support Users Tasks, Command-organization Strategies, The Benefits of structure, Naming and Abbreviations, Command Menus, Natural Language in Computing, Interaction Devices, Response Times, Styles, and Manuals Interaction Devices: Introduction, Keyboards and Function Keys, Pointing Devices, Speech Recognition, Digitization, and Generation, Image and Video Displays, Printer. Response Time and Display Rate: Theoretical Foundations, Expectations and Attitudes, User Productivity, Variability. Presentation Styles: Introduction, Error Messages, Nonanthropomorphic Design, Display Design, Color. Manuals, Help: Reading From Paper Versus from Displays, Preparation of Printed Manuals, Preparation of Online Facilities Multiple-Windows, Computer-Supported Cooperative Work, Information Search and WWW. Multiple-Window Strategies: Introduction, Individual-Window Design, Multiple-Window Design, Coordination by Tightly-Coupled Windows, Image Browsing and Tightly-Coupled Windows, Personal Role Management and Elastic Windows. Computer-Supported Cooperative Work: Introduction, Goals of Cooperation, Asynchronous Interactions: Different Time, Different Place, Synchronous Distributed: Different Place, Same Time, Face to Face: Same Place, Same Time, Applying CSCW to Education. Information Search and Visualization: Introduction, Database Query and phrase Search in Textual Documents, Multimedia Document Searches, Information Visualization, Advanced Filtering. Hypermedia and the World Wide Web: Introduction,
113

T -

P -

C 3

Hypertext and Hypermedia, World Wide Web, Genres and Goals and Designs, Users and Their Tasks, Object-Action Interface Model for Web Site Design Text Books: 1. Ben Shneiderman: Designing The User Interface (Third Edition), Addison-Wesley, 1998 (Chapters 1 To 16) Reference Books: 1. Alan J Dix et al: Human-Computer Interaction (Second Edition), Prentice-Hall, 1998. 2. Eberts: User Interface Design, Prentice-Hall, 1994
3. Wilber O Galitz: The Essential Guide to User Interface Design: An Introduction to GUI Design Principles and Techniques, John-Wiley, 1997.

Mode of Evaluation: By Assignment, Seminars and Written Examinations

114