This action might not be possible to undo. Are you sure you want to continue?
M.S. Software Engineering
CURRICULUM & SYLLABI
[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)
‘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.
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.
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.
b.S. Semester Pattern: An academic year will have two Semesters. Continuous Assessment Tests (CAT) for 50 marks.4. a. 4 . six weeks before hand. 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. 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. The candidate’s conduct and academic progress are satisfactory. 6. Eligibility for the Degree: A candidate shall be eligible for the award of M. Course to the availability of faculty members and other resources. Attendance of 75% is compulsory to appear for examination. 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. (Software Engineering) degree if the candidate has earned a minimum number of 220 credits. Evaluation for Laboratory Courses For the laboratory courses. The detailed dates of exam will be announced by the Controller of Examination (COE). (i) (ii) The candidate has attended at least 75% of the classes in each of the courses registered by him / her. However the marks scored by students are reduced to a maximum of fifteen. Learning Assessment of the Students at VIT has basically two components. These marks will be reduced to fifty. 7. Courses can be offered during summer term. Attendance Requirements: A candidate will be permitted to appear for the University Semester final examination in any Semester only if. with sixteen weeks of class work in each semester. Each exam will be conducted for 90 minutes with maximum marks of 50. Scheme of Assessment (Evaluation & Examination) The following are the rules and regulations related to evaluation and examinations. 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. Normally the FALL Semester will be from June to November and the WINTER Semester from December to April. 5.
Procedure in case of Failure If a candidate fails to obtain the minimum grade in a particular course (theory/lab). After the results are published. 10. 8. Any discrepancy will be corrected then and there. Pass Criteria for Courses A candidate is declared to have passed in a course (theory / practical). Similarly for revaluation of answer scripts. each student will be awarded finally a letter grade at the end of the semester for each course. the candidate is required to re-register for the course in the subsequent semesters as and when it is offered. Normally the supplementary examination is conducted only for the failed candidates. The letter grades and the corresponding grade points are as follows: 5 . applying in the prescribed format before the commencement of regular exam. 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. The fact that the student has taken the supplementary examination will be reflected in the mark sheet by a mark ‘*’ against the Course. If he/she fails to get minimum grade in the supplementary examination for the course. he / she will be allowed to write supplementary exams if he / she has obtained prior permission from Dean of the School and COE. Under extraordinary circumstances. they have to apply with prescribed fees within a week from the date of publication of results. 9. There is no minimum mark requirement in CAT for a pass in a course. it can be done only by re-registering for the course. if a student is not able to appear for the regular examinations due to hospitalization or death in the family. For such candidates. There is no provision for revaluation in Labs / Practical exams and Project Works examinations. Supplementary Examinations The university will conduct supplementary examination within 10 days from the date of declaration of results. . 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 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. If any one wants to improve the CAT marks. Perusal / Revaluation of Evaluated Answer Scripts: CAT Exam answer scripts will be handed over to students by the respective faculty members after valuation. 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. it will be treated as first attempt. Grading System Based on the performance. Such of those failed candidates who wish to take up supplementary exams need to register for the same by paying prescribed examination fees.
i. Similarly Cumulative Grade Point Average CGPA is calculated for more than one semester or for the programme. 15. Withdrawal of course 14. after having registered for the same. The total of all such credit earned is calculated. 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. an F (Fail) grade entry will be made in the grade sheet. Shortage of attendance 2. Absence in the Term End Examination A candidate who is absent in the Term End Examination of a course / project work. a AAA (Absent) entry will be made in the grade sheet. will be assumed to have got zero in the examination. Acts of indiscipline 3. 12. the grade point is multiplied by the credit for that Course. Calculation of Grade Point Average The credits earned from the I Semester onwards will be accounted for calculation of CGPA. This grand total is divided by the credits earned (passed). Withdrawal System 6 . without submitting withdrawal form. ∑ (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). If the candidate has been absent in both the CAT and Term End Examinations. If the candidate has appeared in CAT examination(s). 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.Letter Grade S A B C D E F (Fail) AAA (Absent) Grade Point 10 9 8 7 6 5 Zero -- 11.e. provided he/she is declared not eligible due to 1. 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. The result thus calculated is the semester Grade Point Average. 13.
The following is the procedure to be adopted for re-registration by students:1. The M. (Software Engineering) Degree After successful completion of the M. The candidate will not be allowed to write the following supplementary examinations too. 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. Withdrawal should be made in the prescribed format at least 10 days before the commencement of the first Term End Examination. 4. 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. Award of M. Re-Registration Re-registration in subsequent semesters by students who have failed in a course or courses in a semester is permitted. 18. 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. Course to the approval of Dean of School. After writing the supplementary examination. 17. 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. for a maximum period of one year. If a candidate withdraws. 16. 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. In such cases the time limit will be extended by the period of break 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.If a candidate fails to secure good marks in the Continuous Assessment Examinations and if.S. (Software Engineering) Programme and earning the required number of credits. If any student is debarred / suspended for want of attendance or acts of indiscipline. The re-registration can be done for a course offered in subsequent semester or during Summer Term Courses. But if he/she appears for the Term End Examination and fails. Copying / Malpractice If a student indulges in copying or any malpractice in the CAT Examinations or in the Term End Examinations of the University.S. reregistration can be done in the subsequent semesters. he/she will be given an opportunity to attend the supplementary examination. (Software Engineering) Degree will be awarded during the Convocation. can withdraw from writing the Term End Examination. 19. -o0o- 7 -o0o- . 5. a Provisional Degree Certificate will be issued to the eligible students. entry will not be made in the grade sheet. he/she fails to get passing grade. 3. it shall not be considered as break of study.S. 2. Such students are required to apply in the prescribed format and to pay the prescribed Re-registration fees. he/she so desirous.
3.SCHOOL OF COMPUTING SCIENCES M.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 8 .06] I – SEMESTER Subject Code 05MSE101 05MSE103 05MSE105 05MSE107 05MSE109 05MSE111 05MSE113L 05MSE115L Subject English for Engineers.S (SOFTWARE ENGINEERING) DEGREE CURRICULUM [as approved in the 11th Meeting of the Academic Council held on 25.
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 .
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 .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 .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 .
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.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 .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.Tech-IT Programmes 13 .-CSE and B.
Tech.Tech-IT Programmes 14 .-CSE and B.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.Tech-IT Programmes 15 .05MSE105 MODERN PHYSICS L 4 T P C 3 NOTE: The syllabus will be same as “Modern Physics” course in the B.-CSE and B.
Williams and Hutchinson. Sawyer.05MSE107 . Fundamentals of Information Technology. Introduction to Computer Science & IT Information systems – Software and data – IT in business.Foley. Home at Play. Education.Curtin.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. Training. Science. 16 . K. Text Book: 1. Information Technology – The Breaking Wave. D. Seminars and Written Examinations. Using Information Technology – Brief Version.Sen– TMH – 2002 Reference Books: 1. 5th edition 2. Entertainment. K. 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. Industry. Arts. TMH – 2003. Vikas Publishing – 1999 Mode of Evaluation: By Assignment.p. Alexis Leon and Mathews Leon.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.
Objective The students would become aware of the ranges with respect to frequency. 1999. Ben. “Electronic Devices & Circuits”. The operational requirements such as proper heat sink arrangement etc. “Solid state electronic devices”. New Delhi. power ratings etc. 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. Semiconductor Basis Review of extrinsic semiconductor – drift and diffusion currents – thermal generation of minority carriers – Hall Effect. 2001. Prentice Hall of India. fabrication and characteristics of four layer devices such as SCR. Khanna Publishers. Mithal. inductor. RC section filters – Voltage regulators – current regulators. 17 . L section. TEXT BOOK: 1. Electronic Circuits Half – wave and full – wave rectifier circuits – performance characteristics of rectifier circuits – filter consideration capacitor. application and selection of apt devices to achieve a particular circuit function. REFERENCE BOOKS: 1.05MSE109 ELECTRONIC DEVICES & CIRCUITS * L 4 T P C 3 Aim The subject covers most of the basic devices and their functioning.K. IC voltage regulators – protection circuits for dc power supplies – switched mode power supplies. Transistor Principle of transistor action – current components – cutoff. 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. shall be provided. active and saturation region – input and output characteristics – CE. CB. temperature. Streetman.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.G. clipper and clamper circuits. G. Junction Diodes. & CC Configurations – small signal and large signal beta – transistor breakdown ratings – Thermal runaway problems – Use of Heat sinks. Triac and Diac.
decision statements. Herberet Schildt – The Complete Reference. Millman.simple C programs flow of control . Narain Gehani – “C Advanced Introduction” – Universities Press – 2004.comma operator Functions Functions .PROGRAMMING IN C L 4 Aim To understand the basics of C Programming. Objective To know the basic ‘C’ programming constructs like data types. Kamthane . 18 T - P - C 3 .2. 3.unions Pointers Pointers . “Electronic Devices and Integrated Circuits”.declarations .C. operators.defining. J. 4th Edition. “Electronic Devices and Applications of Integrated Circuits”. Mathur.arithmetic. Pearson Education.declarations .C.multidimensional arrays arrays and string structures . Seminars and Written Examinations. 2000. relational and logical. unary. Reference Books 1.operation in pointers .self referencing structures . 3. McGraw Hill.R.defining and processing . accessing function . Mode of Evaluation: By Assignment.function prototypes .identifier and key works .statements . Fundamentals of ‘C’ Programming C fundamentals .bit wise operations.files: creating processing. Halkias. Text Book: 1. opening and closing .Programming with ANSI and Turbo C. Arrays and Structures Arrays .Programming with ANSI and Turbo C –– 2002.data types .passing arguments recursions .passing array to functions . arrays and pointers.P. Noel Kalicharan – “C by Example” – Cambridge university Press-1996.constants variables . Control statements.expressions . 1997.pointer and arrays of pointers structures and pointers . 05MSE111. D. assignment and conditional operators . C. 2. S.character set . 4. Kulshreshtha and P.control structures switch. Primitive structures in ‘C’ Data input/output functions .liberty functions. 2002. TMH.passing pointers to function .passing structures to functions . Kamthane .storage classes multi file programs. 1998. break and continue go to statements . Chanda. functions.
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. Implementation and testing of 3 bit binary ripple counter. 15. V-I characteristics of SCR and TRIAC. Study of Logic Gates (AND OR NAND NOT EXOR gates). 6. Implementation of shift registers using flip-flops. 7. 13. Implementation and testing of Multiplexers. Study of Flip flops (D T JK SR flip-flops). testing of code converters. 3. Study of decade counter using flip-flops. Switching characteristics of BJT SCR and MOSFET. Static emitter characteristics of UJT and PUT. 11. 17. 9. 2. 5. Study of CRO and measurement of amplitude frequency time period and phase angle. Forward and reverse characteristics of PN junction diode. Design and testing of Half and Full sub tractor. V-I characteristics of tunnel diode and varactor diode. 10. 12. Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters. 16. Implementation and. Design and testing of Half and Full adders. 8. 14. Drain and transfer characteristics of JFET and graphical determination of transconductance. 4. Characteristics of Zener diode and study of its power ratings. 18. 20 .
Creating database for Web page addresses and related operations using pointers. 14. Finding inverse of a Matrix. Generating Permutations. 8. 4. Euclidean’s Algorithms for finding GCD. Computing Combinations. Creating database for Mailing addresses and related operations Using Structures. Matrix Multiplications. 6. 12. String Manipulation. Creating database for telephone numbers and related operations Use file concepts. 2. 11. 21 . 13. 7. Pascal’s Triangle. 5. File Processing. Finding Determinant of a Matrix. 3. 10. Determining a given number is prime or not. Checking for Tautologies and Contradictions. 9.05MSE115L PROGRAMMING IN C LAB L T P 3 C 2 LIST OF EXPERIMENTS 1.
05MSE102 .Tech-IT Programmes 22 .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.-CSE and B.Tech.
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 .
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 – Matthiessen’s 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.
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 r’s and r-l’s 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 don’t 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:
Morris M. Mano, "Digital Design", Third Edition, Prentice Hall India, 2001
26 . polymorphism. destructors in derived class.A. abstract classes. derived class declaration. sequential access to a file.Class specification. file modes. Classes Working with classes. friend classes and friend functions. class member accessibility.REFERENCE BOOKS: 1. defining member functions.Structured versus object-oriented development. limitations of increment/decrement operators. Inheritance Inheritance . fundamentals of OO-class. P. data conversion. lists of exceptions. polymorphism. Malvino and D. object. P. Objectives Students will be able to know the fundamentals of object oriented programming and use OOPs’ features such as inheritance. Function Overloading Overloading-Function overloading. inheritance and member accessibility. arithmetic operators. file pointers and their manipulation. elements of object oriented programming. operator overloading. Exception handling-exception handling model. parameterized constructors. and templates. "Computer Architecture Logic Design". features of Object-oriented Programming and focuses on generic programming with templates and Exception handling. constructors. accessing member functions within class. Bartee. “this” pointer.Classes and Objects. McGraw Hill 1999. structure of C++ program. concatenation of strings. encapsulation. class objects. Tata McGraw Hill 1997. Generic programming with templates-Function templates.Base class and derived class relationship. accessing class members. inline functions. unary operator overloading. constructor invocation and data member initialization. data hiding. benefits of OOP. comparison operators. random access to a file. binary operator overloading. Files Files and Streams-Opening and Closing a file. and abstraction and its importance. 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. “Digital Principles and Applications”. error handling during file manipulations. constructors in derived class. copy constructor. virtual base classes.overload able operators. operator keyword. Mode of Evaluation: By Assignment. delete operators.Thomas C. Basic Concepts Object Oriented fundamentals. handling exceptions. 4 th edition. new. 2. constructor overloading. Forms of inheritance. Leach. exception handling constructs. class templates. virtual functions. catching exceptions. ASCII and binary files. empty classes.
desertification & case studies. food webs and ecological pyramids. Pollution effects and control measures of Air. Seminars and Written Examinations 05MSE112 ENVIRONMENTAL STUDIES L 4 T - P - C 3 Aim The subject aims to impart knowledge about natural resources. Tata McGraw Hill. deforestation. Tata McGraw Hill 2. Soil. Biodiversity-Definition. “The C++ programming Language”. 1997 REFERENCE BOOKS: 1. structure & function of an ecosystem. 2nd Edition.Venugopal.Causes. water conflicts. man-wildlife conflicts. hotspots. environmental effects of mining. Energy resources – need to develop renewable energy. Water. ethical. producers. Water resources – use of surface and subsurface water. "Mastering C++”.Ravishankar. estuaries). Pollution Environmental Pollution.Definition . various characteristics features of – forest.R. Solid Waste management: causes. Thermal. cyclone and landslides. species and ecosystem diversity. endangered and endemic species of India. Ecosystem Ecology-Concept of ecosystem. Conservation of biodiversity. genetic. 3 rd edition. welfare programmes and role of Information technology in protection of environment. threats related to habitat loss. aesthetic and option values. E. advantage and disadvantage of fertilizers & pesticides. bio geographical classification of India. Values – consumptive use. streams. Mode of Evaluation: By Assignment. Marine. aquatic ecosystems (ponds. Resources Environment & Natural Resources. K. Disaster management: floods. need for public. 2004. food resources – food problems. pollution measures. Problems and Development 27 . poaching of wildlife. Addison Wesley. grassland. desert. Natural Resources – use. energy flow. 1988. soil erosion. consumers and decomposers. productive use. pollution.Balagurusamy. effect on environment. bio-diversity. effect of floods. oceans. Objectives The students shall be able to learn about various natural resources. Scope. food chains. construction of multipurpose dams – effect on forests. earthquake. lakes.TEXT BOOK: 1. exploitation. Role of information technology in welfare of population and protection of environment. case studies. Noise. drought. importance. population explosion. concepts of ecosystem. ecology. Nuclear hazards. social. and Rajkumar. Mineral resources – use and exploitation. Bjarne stroustrup.Definition. land slides. T. land resources – Land degradation. “Object Oriented Programming with C++”. effects and control measures of urban and industrial wastes. environmental pollution. rivers. ecological succession.
Environmental Encyclopedia. Gorhani E & Hepworth MT. Environment Human Population and the Environment. Mode of Evaluation: By Assignment. 345 pages.Urban problems related to energy & sustainable development. Visit to local polluted site – Urban / Rural / Industrial / Agricultural. Environment and human health. nuclear accidents and holocaust – case studies. . 3. Down to Earth. river. rain water harvesting. Mumbai. Women and Child Welfare. Wasteland reclamation. insects.Documenting environmental assets – river / forest / grassland / hill / mountain. 480 pgs. Study of simple ecosystems – pond. Center for Science and Environment(R) 4. WB Saunders Co. Pvt. Fundamentals of Ecology. Study of common plants. 2. Ltd. Forest Conservation Act. Wiley Eastern Ltd. Field Work. Human Rights. 574 pages.. Erach Bharucha. acid rain. HIV / AIDS. Hazardous Waste Incineration. Jaico Publishing House. REFERENCE BOOKS: 1. Wildlife. hill slopes. 2. Environmental Chemistry. Rao MN and Datta AK. water conservation. Water. Environmental legislation and public awareness. Seminars and Written Examinations. 1987. population explosion – Family Welfare Programme. etc. Cooper TH.Population growth. Air. global warming. De AK. Odum EP.Issues and possible solutions. Oxford and IBH Publishing Co. Environmental ethics. ozone layer depletion. 2001. problems related to rehabilitation – case studies. Climate change. Consumerism and waste products – Environment Protection Act. Value Education. Waste Water Treatment. birds. 28 . 5. watershed management. variation among nations. 1196 pgs. University Grants Commission. McGram Hill Inc.Field Visits. TEXT BOOKS: 1. Cunningham WP. Brunner RC. 1971. 1989. USA. Role of Information Technology – Case Studies.
Display count value on 7 segment LED display using BCD to 7 segment code converter IC. 29 . Display result suitably. 6. Design and implement a 3 variable Boolean SOP expression using 2 numbers of 4:1 multiplexer IC. b. Asynchronous counter to count up to FFH using 2 stages of such an IC. Display result on discrete LEDs and the waveform on CRO.05MSE114L . Excess-3 to BCD code converter BCD to Excess-3 code converter Design and implement a full adder using a multiplexer. b. Johnson counter b. Ring counter 14 Design and implement the following: a. Design and implement Excess-3 to BCD code converter using logic gates. Design and implement asynchronous counter using a Decade counter IC to count up from 0 to n (n<9). Design and implement using decoder and other gates a. 11 Design and implement Mod n (n<8) synchronous counter using flip flops. 9. 4. 2.DIGITAL COMPUTER FUNDAMENTALS LAB L 4 1. 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. 5. Design and implement a 3 stage asynchronous counter using J-K flip flops to count down from 7 to n (n>0). Also implement a multiplexer tree using 3 multiplexes. 8. Design and implement to display result suitably: a. Full adder b. Full subtractor. Asynchronous counter using 4 bit binary counter IC to count up from 0 to n ( n<=15). (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. 12 Design and implement a 3-stage up/down counter that counts from a preset value using Decade presettable counter ICs. 7. Crystal controlled clock using CMOS inverters. 13 Design and implement using 4-bit shift register IC: a. Oscillator for a given frequency using Schmitt trigger inverter and RC components. 10. Display result suitably. 3.
T - P 3 C 2 overflow and underflow in stack etc). 7. Multiple. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. from students class. Write programs illustrating file handling operations: Ex. 9. 10. Create their objects and process them. constructor with arguments. Single.05MSE116L OBJECT ORIENTED PROGRAMMING LAB* L LIST OF EXPERIMENTS 1. Programs illustrating the use of destructor and the various types of constructors (no arguments. a) Copying a text file b) Displaying the contents of the file etc. 30 . Medical. 3. 2. etc. Write a program which illustrates the use of virtual base class. Write a program having student as on abstract class and create many derived classes such as Engg. Programs illustrating the overloading of various operators Ex : Binary operators. Write programs illustrating how exceptions are handled (ex: division-by-zero. 6. 4. New and delete operators etc. 5. Science. Program illustrating function overloading feature. multilevel. Write a program illustrating the use of virtual functions. copy constructor etc). constructor. Programs illustrating the various forms of inheritance : Ex. Unary operators. 8. hierarchical inheritance etc.
Properties of Fourier transforms – Convolution theorem for Fourier transforms – Parseval’s 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. variation of parameters technique (without proof). Z-transform of elementary functions. Indented contour integral. Jordan’s lemma (without proof). Cauchy’s Residue theorem – Evaluation of integrals by the method of residues . Z-transform – definition – relation between Z – transform and Laplace transform. w = z2 . (w = zA+B. Particular and Complete integrals – Lagrange’s Linear Equations – Linear PDE of Higher order with Constant Coefficients – Homogeneous and non homogeneous equation – Solution of PDE’s by the method of separation of variables. Inversion contour method-solution of difference equations by Z. Complex Integration Integration in the complex plane along a contour. Inversion contours for Laplace. Applications of Partial Differential Equations Solution of Laplaces equations in Cartesian. application to ladder type electrical network. Functions of A Complex Variable Functions of a complex variable. Exponential Fourier series – Fourier Integral Transforms – Definition – Fourier Integral – Fourier sine and cosine transforms. Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates. .transform method. Integral Transforms Difference Equations and Z-transforms: Difference Equations with constant coefficients -Complementary function. particular integral – method of undetermined co-efficient. integral theorem – Derivatives of analytic functions. concept of conformal transformation – Qualitative discussion on applications.w= ez). Analytic and Harmonic functions – Complex potential – Applications to flow around a corner and around a cylinder. linear transformations.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.Inverse Z-transforms – partial fraction expansion method. Partial Differential Equations Introduction – Formation of PDEs – Solution of PDE – General. limits and continuity. Cylindrical and Spherical coordinates – variable separable method: Potential flow over a sphere. properties of Z-transforms (proofs not required) Initial and final value theorems. Brach prints. Fourier and Z transforms. Wave Equation-Vibrations of a Stretched string-Variable Separable Method. Bilinear transformation. Cauchy – Riemann equations. the Cauchy-Goursat theorem. Text Books: 31 . Residues.D’ Alembert ’s solution for the initial value problem. Taylor and Laurent series(without proof's) singularities – Zeros – Poles. branch cuts.
International student edition (1978) . Churchill and J. 2. 32 . Brown and R. Brown.. Reference Books: 1. MichaelD. Grewal. 4. Churchill. 8th Edition. Khanna Publications (2005). 38th Edition. V. Erwin Kreyzsizig. W. Fourier series and Boundary value problems. J. S. R. John Wilag & Sons (Wiley student Edison) (2004). Complex variables and application. Seminars and Written Examinations. Advanced Engineering Mathematics. Elements of Partial Differentail equations. 3.V. B. Mc Graw Hill International ed. 7th Edition (2004). Higher Engineering Mathematics.1. Greenberg. W. MC Graw – Hill International edition (1985). PearsonEducation (2002). Mode of Evaluation: By Assignment. Ian Sneddon. 2nd Edition. Advanced Engineering Mathematics. 2.
assemblers for the PC. Prentice-Hall India.UdayaKumar and B. clock generator. 2. Machine control AND miscellaneous instructions. Addison-Wesley. ready and wait state. min/max modes of operations. 1997. programming examples. assembling. Tata McGraw Hill. The Intel Microprocessors. 8259A PIC and Interfacing of 8255 and 8254 devices.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. Memory interfacing Memory devices. Microprocessor-Based Computer Systems. Microprocessors And Interfacing. Doughlas V Hall. Programmer’s Model Of 8086/8088. Segmentation And Memory Addressing In 8086/8088.Application Examples.Brey. modular program development: use of linker.. Data movement instructions excluding string instructions. Interrupt processing. To Code in assembly language Introduction Introduction to Microprocessor. debugging programs. linking and executing programs. DRAM memory system Interrupt System and PIC (8259 A). program flow control instructions. Second Edition. 33 . bus buffering. String instructions. Hardware features of 8086/8088 Pin-outs an pin functions. 1992. Assembly language programming Assembly language. 2. Computer Organization And Assembly Language Programming. macros and conditional assembly.S. Advanced Microprocessors And IBM – PC Assembly Language Programming. address decoding. addressing modes of 8086. Text Book: Barry B. programming examples. latching and timing diagrams. 1996. library. Programming And Hardware. instruction encoding. McGraw Hill. I/O Interfacing Introduction to interrupts. Michael Throne.. Fourth Edition.Umashankar. T - P - C 3 Reference Book: 1. 8/16 bit memory interfacing. 1. arithmetic and logical instructions. Architecture Of 8086/8-88. K. Interrupt-related instructions. 1991.
Seminars and Written Examinations 34 .3. Essentials of Assembly Language Programming for The IBM PC. Mode of Evaluation: By Assignment. PHI 1999. Rajaraman & Radhakrishna.
Stack ADT – stack model – implementation of stacks – applications of stacks– infix. postorder)– binary trees – implementation – expression trees – binary search trees – threaded binary trees – B – trees – B+-trees – hashing – hash function. Algorithms Algorithm Design Techniques. Tata McGraw Hill. Rajesekar. “An Introduction to Data Structures with Applications”. bucket sort.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. Branch and Boundtravelling salesperson problem – algebraic manipulations.Basic concepts of NP-hard and NP-complete. depth first search & breadth first search – shortest path algorithm. Sorenson. List ADT – simple array implementation of lists – linked lists– doubly & circular linked lists – cursor implementation of linked lists – polynomial addition and multiplication. 1991. 2. Overview of Garbage collection & Compaction Trees Trees-Preliminaries – implementations of trees– tree traversals (inorder. Introduction Algorithm Analysis-Mathematical background model – running time calculations – complexity analysis – abstract data types – asymptotic notations. Horowitz. selection sort. Galgotia-1999. Heap sort and its analysis. E. Queue ADT – queue model – array implementation of queues. Back Tracking. Mark Allen Weiss. Jean-Paul Tremblay and Paul. G.8 queens problem. REFERENCE BOOKS: 1. Objective To make the Students learn various types data structures algorithm analysis. Addison Wesley . Dynamic Programmingtraveling salesman problem. Lower Bound Theory. merge sort and its analysis. “Data Structures & Algorithm Analysis in C++”. quick sort and its analysis. external sort. S. Stacks & Queues Stacks & Queues. The students would be able to implement various data structures and apply operations on them and also implement various sorting and searching techniques. “Computer Algorithms”. 2004.knapsack 01. Sorting Insertion sort and its analysis. Greedy Method.05MSE205. TEXT BOOK: 1. Sahni and S.Divide & Conquer Algorithm – Strassen’s matrix multiplication and its analysis. prefix and postfix expressions and their conversions. preorder. Shell sort. 35 .
Statement – Level Control structures: Compound – selective – interactive statements. implementation methods. .Prentice Hall . Reference Books 1. Expression and Assignment Statement Arithmetic expressions – Overload operators – type conversions – relational and Boolean expressions – Assignment statements – mixed mode assignment.offs.How to communicate Technical Information Addison. Preliminaries Programming Domains.Johnson. 2. statement level concurrency. 37 T - P - C 3 .Johnson.G. Programming environments. implementation object oriented constructs. recursive descent parsing.1995..Jeanne Marguardt Elmhorst . Evolution of the Major Programming Languages: Zuse’s plankalkul – Pseudocodes –FORTRAN – LISP –COBOL – BASIC – PL/I – APL and SNOBOL – SIMULA 67 – ALGOL 68 – Prolog – Ada – Small talk – C+ + .Ethical Decision making and Information Technology McGraw Hill . Support for object oriented programming in C++ .2002 2. Kenry Korman. Java threads.P.Text Books 1. Type checking and scopes: Names – variables – concept of binding – strong typing – type compatibility – scope & life time.2nd Edition .Java – Ada 95 – Eiffel. Jonathan Price.Communicating a work – MCGraw Hill.JAVA Syntax and semantics Problem of describing syntax. 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. 3 Ronald B. attribute grammar. Concurrency: Subprogram level concurrency – semaphores – monitors – message passing – concurrency in Ada 95. Deborah.Adler . Grillo . unconditional branching and guarded commands.formal methods for describing syntax.1993. Mode of Evaluation: By Assignment. John. Data types: Primitive – chapter string – user defined – array – associative arrays – record – union – set – pointers – Abstract data types. 6th Edition . Language evaluation criteria – design – categories – trade.Prentice Hall .Computers.2nd Edition . Ethics.1999. and Social Values . Seminars and Written Examinations.Computer Ethics . Ernest A Kallman.1996. Dynamic semantics – Names Binding. Deborah. 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.Wesley .G. Helen Nissenbaum (eds) .
1. 38 . Programming Langages Principles and Pradigms. TMH Reference Books: Robert W. Functional Programming Languages: Mathematical functions – fundamentals – LISP – introduction to schema – COMMON LISP – ML – Haskell – applications of functional languages – comparison with imperative languages. Tucker. Robernooan.Exception Handling Exception handling in PL / I – Ada – C++ . Allen B. Logic programming Languages: Predicate calculus – predicate calculus and proving theorem – overview of logical programming – PROLOG – overview – basic elements – deficiencies. Seminars and Written Examinations. 1 st Indian Reprint.Java. “ Programming Languages”. “ Programming Languages” – Paradigm & Practice”. Ravi Sethi. 2002. Doris Appleby & Julius J Vandekopple. Text Books: 1. “ Concepts of Programming Languages”. 2nd Edition. Addison Wesley. Mc Graw Hill. 3. 1999. Addison Wesley 2. 1999. Sebesta. Mode of Evaluation: By Assignment. 2nd Edition. Applications of programming languages.
Applications of MIS in Manufacturing.Controlling . basic features Enterprise Management Systems and Role of MIS in Data Warehouse.Security in E-Business .Management Effectiveness Planning. Decision Support Systems.Organizational Behaviour .05MSE211 MANAGEMENT INFORMATION SYSTEMS L 4 T P C 3 Aim The subject aims to introduce Role & Impact of MIS.Information as a Quality Product . Web: A Tool for Business Management . Strategic Management of Business Corporate Planning Concepts .MIS in Web Environment TEXT BOOK: 1.World Wide Web .Technology in MIS.Methods of Data Collection .MIS: Organization. Approaches to Management . Tata McGraw Hill.Information System Processing .Strategic Planning . Tools of Planning Decision Making Decision Making . 2002 39 . W. Deterministic Systems .Organizational Decision Making .Evaluation . Tools & Procedures .Value of Information .Basic Model of Organization Structure .Organization as a System . Selection and Implementation of ERP. Knowledge Based Expert System.Organizing .MIS Development & Implementation Application IT Strategic Decision .Internet . Organization Structure and Theory .Design . Decision making.Real Time Systems & Design .Management as Control System Management by Exception . Introduction Role & impact of MIS.Methods.Process of Management . methods of data collection.Transaction Processing Application Processing .MIS: A Tool for Management Process.Electronic Payment Systems .S.Programming Languages . Objectives The Students shall be able to understand role and impact of MIS. Jawadekar. 2nd Ed.Application System Architecture in Web ..Applications in Service Sector.MIS & Decision Making Concepts .MIS and E-Business. Enterprise management systems.Strategic Management under Web .Staffing . "Management Information System". MIS and the Role of DSS Enterprise Management System Enterprise Management Systems.Intranet/Extranet .Process Model of the Organization Data Warehouse Data Warehouse: Architecture to Implementation . MIS DevelopmentDetermining Information Requirement . Artificial Intelligence and Expert systems. Organization structure and theory. various steps in management.Types of System . Decision making concepts.Internet and Web and Process of Management .Coordinating and Directing .Web Enabled Business Management .System Concepts Systems Control .Modifications to the Basic Model of Organization Structure .Post Implementation Problems.Development of Business Strategies .Electronic Business Technology Models of E-Business . Development of Business Strategies.Choice of IT and MIS. Business Process Re-engineering .Types of Strategies.Implementation Plan . applications of MIS in Manufacturing.Classification of Information .Basic Features & Benefits.Artificial Intelligence. Data Processing .Case Tools.TQM of Information Systems User Interface .
Display and Keypad. Mode of Evaluation: By Assignment. These interfaces are the standard interfaces used with 8085 trainers also. 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. Assemble and link the above two files and execute the 40 . James A.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. No need to compute this value.. Seminars and Written Examinations. No need to compute these values. Dual DAC.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.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. (The delay is not to be specified by the examiner.REFERENCE BOOK: 1. b) Develop and execute an Assembly language program to generate a rectangular pulse train using the DAC interface. It can be any arbitrary value that just permits the steps of the motor rotation to be conducted.) 5.O’Brien.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. Tata McGraw Hill. (N specified by the examiner). ) 4. (The output of the DACis to be displayed on a CRO. The student need not compute the delay. The board layout and the circuit diagram of the interface are to be provided to the student during the examination. “Management Information Systems”. Introduce suitable delay between successive steps. The slope can be any arbitrary value.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. Introduce suitable delay between successive steps. TURBO DEBUG etc.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. CodeView. 2.) 3. It can be any arbitrary value that just permits the steps of the motor rotation to be counted). Logic Controller. 1. 2004. The on/off times can be any arbitrary values. The student need not compute the delay. (The delay is not to be specified by the examiner. ) and that the program itself is executed under the control of such a debugging utility. (The output of the DAC is to be displayed on a CRO. The interfaces to be used are: Stepper Motor. A brief description of these interfaces will be provided separately. (N is specified by the examiners) .
resulting 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 drive the Elevator interface in the following way: Assume that initially the elevator is at ground floor and all service requests are cleared. an unsigned 16-bit integer called x. b) Develop and execute an assembly language program to read the status of eight inputs from the logic controller interface. the elevator moves to that floor.a) Create an assembly language source file containing two PUBLIC procedures called RDKEY and ECHO. (Assume overflow will not occur).a) Develop and execute an assembly language program that implements Binary search algorithm. & a 4-bit key value.a) Using conditional assembly. Set up the table to permit BCD to 7-segment code conversion. 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. Assume that the data consists of sorted 16-bit unsigned integers. Otherwise. using the same interface. The search key is also a 16-bit unsigned integer. RDKEY reads from keyboard using INT 21H (Function 6) leaving the ASCII code of key read in AL. When a service request is detected. While it is traveling to that floor. nor is the student required to 41 . 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. • If Eqn 1 is true. After servicing the floor for which the request was first registered. it assembles code which computes 7*x+8 and places the 32bit result in a double-word memory location. it is also serviced (the floor request LED is turned off). The elevator stays in the ground floor as long as there is no service request. Examiner doesn’t specify these values. 8. The macro reads the keyboard using INT21H (Function 6) and places the ASCII code of the key read in LOC. b) Develop and execute an assembly language program to perform the following: • Read the status of 3 inputs from the logic controller interface. a) Develop& execute an assembly language program to perform the following: Assuming a look up a table of 16 entries. 10. the delay indicating the servicing of a request can be any arbitrary values. display 2* x using the same interface. the elevator returns to ground floor ignoring all further requests. display FF if any input is high and display 00 otherwise. to complement those values and to display these complemented values using the same interface. 9. The delays to simulate the elevator motion. b) Develop and execute an assembly language program to read the status of eight inputs from the logic controller interface. develop and execute an Assembly language program with the following features: • It uses one input value. 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. 7.a) Develop and execute an assembly language program with the following features: It has a macro with one parameter called LOC. look up the table to find the conversion value. The macro defined above is used twice to read the keyboard twice and store the ASCII codes in two consecutive memory locations. • Assuming that these three inputs represent a binary number x (0<=x<=7). it assembles code which computes 3*x*x*x+4*x+5 and places the32 bit result in a double-word memory location. if a service request is detected for any intermediate floor.) 6. (The two Boolean expressions are to be specified by the examiner. each of which is 8-bit wide.
calculate them. Function 2CH). 13.a) Develop and execute an assembly language program that determines if a given substring is present in a main string of characters. Function 2).a) Develop and execute an assembly language program to perform the following: Read the current time from the system (INT 21 H. (Use values for n and r which will ensure that the can be stored as a 16-bit unsigned integer. The 16-bit binary result can be left in a memory word location. Ensure a flashing rate that makes it easy to read both the messages. display two 4 digit messages on the display interface for suitable period of time. (b) Develop and execute an assembly language program to perform the following: Alternately. The result (1:present. 11. Nor is it necessary for the student to compute these values).) b) Develop and execute an assembly language program to scan a 4x4 keypad interface for key closure. (Use a value for n which will ensure that n! can be stored as a 16. b) Develop and execute an assembly language program to display a 4 digit BCD number on the display interface.). (You can assume that the BCD equivalent will be less than or equal to 9999). 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.bit unsigned integer. format it as HH:MM. Assume n & r to be non-negative integers and leave the binary result in a memory word location. (Examiner doesn’t specify there delay values. 12. 14.a) Develop and execute an assembly language program to compute nCr using recursive procedure. and display it on the video screen (INT 21H. 42 . The row number and column number of the key pressed are to be stored in memory locations. 15. a) Develop and execute an Assembly language program to compute the factorial of a positive integer n using recursive procedure. 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.
Implementing Stacks and queues. Shell sort T - P 3 C 2 4. Binary search 43 . Searching: a. 3. Insertion sort b. Implementation and processing in lists. Quick sort d.05MSE215L DATA STRUCTURES AND ALGORITHMS LAB* L LIST OF EXPERIMENTS 1. Linear search b. Sorting: a. Heap sort f. 2. Selection sort e. Merge sort c.
Objective To have an understanding of the Probability concepts.System Reliability . Anova One way and Two way classifications. 3.small sample tests .Control Charts for Attributes. 3rd ed. 2.Binomial. JE .Hazard Models.Myers and K.F-test .. Probability and Statistics. Thomsun (2000) Mode of Evaluation: By Assignment.R. Morris H..Independent Events-Random Variables-Distribution Function-Density Function (PDF)Random Vector-Joint Distribution.K. New Delhi (1999). B. Exponential.Procedure of Testing Hypothesis.Pure Birth and Death Models. Poisson. Mathematical Statistics.05MSE202 PROBABILITY.Baye's Theorem.Moment Generating Function-Characteristic Function-Regression and Correlation. 7th Edition. A. John Wiley & Sons.CRD-RBD-LSD. 5th Edition. and Ebsanes Saleh. J.Independent Random Variables. R.. 2nd Ed. Ltd. S. 3rd Edition.x -chart.Devore. analyze the problems connected with statistics and reliability.Partial and Multiple correlation. Seminars and Written Examinations 44 . Probability and statistics for Engineers and Scientists. Freund.Reliability Allocation . Statistical Parameters Mathematical Expectation. Rohatgi.p-chart. V. Probability and Statistics. New York (2002).Maintainability and Availability.Exponential Distribution.L. Md.Control Charts for Measurements . to understand how to make the transition from a real problem to a probability model for that problem.Little's formula . New Age International Pvt.R-chart. Tests of Statistical Hypothesis Large sample Tests . Reference Books: 1. R. Gamma.H. Queuing Theory Preliminary Ideas (Markov Chains) . 5.L. Bhat.Myers.Conditional Distribution and Density Functions.Variance. An introduction to Probability and Statistics.np-chart.E.Conditional Probability.theory of estimation. Probability & Random Variables Axioms.Walpole. 4..Ye.Student’s tdistribution . 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. Weilbull distributions. Inc.c-chart Reliability Terms related to Reliability. DeGroot. Pearson Education (2003). Normal. Addison-Wesley (2002).Joint Density. Prentice Hall International (1998).K. Text Book: 1.Chi-square test.. Statistical Quality Control Control Charts . Modern Probability Theory.
– Arithmetic – Logic Units. Multiprocessors. Operating Systems. 1998. REFERENCE BOOK: 45 . also how the computer systems are organized and the characteristics of modern processors that affect system architecture. address mapping. Programming Considerations. Division.Floating point Arithmetic. Address translations. memory systems: Multilevel memories. Sequential ALUs.CPU organization: Fundamentals. coarse-grain parallelism.Register .Communication methods: Basic concepts. Pipeline Processing Memory Organization Memory Organization-Memory technology: Memory Device Characteristics. – Instruction Sets: Instruction formats.Mechanical Era. Structure versus performance. Hayes. . DMA and Interrupts. Elements of Computers.05MSE204 COMPUTER ARCHTECTURE AND ORGANIZATION* L 4 T P C 3 Aim The subject aims at imparting the knowledge of Computer architecture. Fixed –Point Numbers.. including the instruction sets.System design. Random Access Memories. Fault Tolerance.Combinational ALUs. and Register level design. System Organization System Organization. – the Register level. – Advanced Topics. Arithmetic Data Path Design-Fixed point arithmetic-Addition and Subtraction.System Representation. Introduction Nature of computing. and system organization. Floating point numbers. Processor level design. Instruction Types. Memory Management and Networking. TEXT BOOK: 1. Design process. Processor Basisc Processor Basics. The Later generation. – Parallel Processing: Processor –Level Parallelism.Processor Level Components. Limitations of Computers. John P. the design of computers. The Gate level. – the Processor Level. “Computer Architecture and Organization”. Processor Architecture.Integrated Circuits. Multiplication. Electronic Computers. – Data Representation: Basic formats. Memory Allocation. System Architecture. Bus control. 3rd Ed.the evolution of computers. Serial –Access Memories. overlapping communication and computation. and reliability. IO processors. – the VLSI era. McGraw Hill.level components. programmable logic devices. – IO And System Control: Programmed IO. Objectives At the end of the course students should be able to understand basic principles such as locality of reference. hardware components. Design Methodology. performance/power trade-offs. – Caches: Main features.
Patterson. “Computer Architecture”. Mode of Evaluation: By Assignment. Elsevier. John. 46 . Hennessy & David A. L. Seminars and Written Examinations. 3rd Ed.1. India. 2003.
and error handling – compiler writing tools programming languages. loop optimization. A. optimization code generation. loaders. immediate code generation. 47 . Lexical Analyzer Role of lexical analyzer – design of lexical analyzer. M. 2nd Edition. Design of a two-pass assembler. implementation to lexical analyzer context free grammar. 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. dominators. operator precedence parsing. linker for MS – DOS. derivations & parse trees capabilities of context free grammar Parser Parsers. Dhamdhere. intermediate code. 1996. Boolean expression. Aho. Semantic analysis. V. syntax analysis. lexical analysis. Objectives The student shall be understand the different steps involved in pass I and pass II of Assembler. Code Optimization Principles. linking for overlays. TEXT BOOK: 1. Design of a linker. global data flow analysis. translation of assignment statement. Tata McGraw Hill. self-relocating program. Lexical analysis. errors. “Principles of Compiler Design”. REFERENCE BOOK: 1. implementation of syntax-directed translators. lexical phase errors. quadruples. Optimization and machine code generation. Ullman.D. loop-invariant computations. semantic errors. book keeping. value numbers and algebraic laws. parsing. shift-reduce parsing. induction variable elimination. DAG representation of basic blocks. semantic-phase errors. minimizing DFA. parse trees and syntax trees. Linker.05MSE206 SYSTEM PROGRAMMING* L 4 T - P - C 3 Aim The subject aims to introduce operations and functions of Assembler. three address code. Narosa Publishing. other loop optimization. 2000. triples. finite automation regular expression to finite automata. J. regular expression. sources of optimization. “System Programming”. Relocation and linking concepts. depth-first search.D. postfix notation. top down parsing. syntax directed translation scheme. reducible flow graphs. Compiler Structure of compilers.
Accept types and content types.Applet Programming: How Applets Differ from Applications. and Multithreaded Programming Interfaces . The Graphics Class. Passing Parameters to Applets. Security. Creating an Executable applet.configuration environmental variables. Designing a Web Page. accessing from input. Survey/poll and pie graphs. CGI Examples with gnuplot and pgperl. Packages. con-figuring the server.Arrays. Aligning the Display. CGI Examples with postscript. The expires and Pragma headers. Wrapper Classes. Drawing Arcs. Forms and CGI HTML tags. Output from CGI and response headers. Classes. File statistics. Interfaces. Tailoring SSI output. 05MSE208 INTERNET PROGRAMMING* L 4 Aim To understand the concepts of internet programming. Applet Tag. and Data Types. Using Control Loops in 48 T - P - C 3 . More about HTML Tags. Onedimensional Arrays. Graphics Programming. Designing applications using forms in PERL. Strings and Vectors: Arrays. Including boilerplates. Seminars and Written Examinations. Introduction To Java Overview of JAVA Language. Constants. Objects and Methods –Inheritance . Server Side Includes (SSI). Animation. Displaying Numerical Values. Getting Input from the Usr. Server redirection. Circles and Ellipses.Java API Packages. the context length header. Languages under different operating systems. Creating an Array. Drawing Polygons. Variables. Objective To know the internet concepts and to design web pages using java The Common Gate Way Interface (CGI) CGI applications. quiz/test form application. Vectors. Hypermedia Documents Creating dynamic pages. Multithreaded Programming: Managing Exceptions. sending data to the server. Advanced form applications.Gouestbook. Applet Programming Managing Errors and Exceptions . Adding Applet to HTML File. programming in CGI. Lines and Rectangles.Multiple Inheritances . Examining environmental variables. The gd graphics library. Status codes. Decoding forms in other languages. Strings. Executing external program and CGI programs.Mode of Evaluation: By Assignment. complete headers. Two-dimensional Arrays. Input to the CGIEnvironmental variables. Line Graphs. Input / Output Graphics Programming: Introduction. Common Errors. Strings and Vectors Classes. Arrays. Operators and Expressions: Decision Making and Branching.
2nd Edison .Applets. Seminars and Written Examinations.CGI Programming on the World Wide Web. Balaguruswamy . 2004 2 nd Reference Books: 1.2003. O’ Reilly and Associates .Shroff publishers . Drawing Bar Charts. Shishir Gundavaram . Managing input/output Files in JAVA Text Book 1.TMH edition.Programming with JAVA A Primer . Mode of Evaluation: By Assignment. E. 49 .
1995. Addison Wesley. 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.J: Introduction to Database Systems. Introduction ER Modeling Basic concepts – Databases and database users – Database system concepts and architecture – data modeling using Entity Relationship model. system implementation techniques. implement and maintain database applications. Concurrency. Analyze and design ER model for a customized application and concurrency techniques and active databases. database modeling and design.F.. Sixth Edition. Date C. REFERENCE BOOKS: 1. IV Ed.05MSE210 DATABASE MANAGEMENT SYSTEMS* L 4 Aim This subject aims to introduce techniques to design. 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. 50 . Addison-Wesley. McGraw Hill.Navathe: Fundamentals of Database Systems. 2. Objectives The students shall be able to understand fundamental concepts of database management system. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems. Codd rules. SQL. Ramez Elmasri & B. 2005. 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. Concluding remarks including database design and implementation process. III Edition. TEXT BOOK: 1. PL/SQL.
51 . Seminars and Written Examinations.Mode of Evaluation: By Assignment.
John C. N. 2nd Edition. Chandrasekaran. Construction of NFA and DFA from Regular expressions. Seminars and Written Examinations.P Mishra. Regular expressions and Regular languages Finite Automata and its minimization. Turing Machine Turing machines – Church Turing hypothesis – Turing machine as language acceptors – Partial function – Non – deterministic Turing Machine – Universal Turing Machines – Applications. K. Introduction An overview of grammars and languages. They would be able to analyze the problems by determining whether a problem is solvable.L. 1998. and simply solvable or it cannot be solved. 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. Non – determinism and kleenes theorem – pumping lemma – Decision problems. REFERENCE BOOK: 1. 1997. Martin. 52 . Prentice Hall of India. Computational complexities and NP – Completeness. Introduction to Languages and the Theory of Computation. "Theory of Computation". Automata Theory and Abstract models of Computation and Computability. Tata McGraw Hill. Applications Unsolvable problems and computable functions – Rice theorem – Halting problem – Post’s correspondence Problem – Primitive recursive functions – Godel Numbering – Recursive and recursively enumerable languages. efficiently solvable. Normal Forms : Chomsky’s & Griebach’s 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. TEXT BOOK: 1. Mode of Evaluation: By Assignment. Conversion of NFA into DFA Normal Forms Chomsky hierarchy of language. 3rd Edition.05MSE212 THEORY OF COMPUTATION* L 4 T P C 3 Aim The subject aims to introduce of Formal Languages.
Create a contact list database in XML using style sheets.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. Create a table ORDER with the following fields and constraints. EName Eno. Insert a record with NULL values for rate unit 4. Using Ex 3. 18. 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. 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. Create a table EMP with the above mentioned fields.Create a XML page for displaying staff details from the database 20. Drop unique constraint for item-name 2. Disable the constraint Nn-rate 3. 19. 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. Enable the constraint with NULL value existing on rate-unit 54 .Develop a XML schema for the database document type.17. 1.
Create a cursor to update the salary of employees in EMP table 2. iii)Select all the employees who are working in IT department. 7.5. i) Modify EMP table adding a new field BONUS. Create a table EMP mentioned above and test all the arithmetic functions and character functions 6. 9. 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 . Primary Key DName Modify EMP table adding a foreign key constraint on DeptNo. Add a field date-of-birth to EMP table and test all the date functions. Using EMP and DEPT. implement all type of view techniques. 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. 8. 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. update it using NVL ii) Retrieve the employees whose name starts with S. Create a table DEPT with the following fields DNo. a) Row subset view b) Column subset view c) Row column subset view d) Grouped view e) Joined view f) With check option 11. 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.
Matrix Representation of Graphs .Recursion Algebraic Structures Semigroups and Monoids . Lattices and Boolean Algebra Lattices as Partially Ordered Sets .Tautologies . Objective To use inference theory in circuit models.Groups . Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP. Boolean Functions - Graph Theory Basic Concepts of Graph Theory .Grammars and Languages. graph theory in net work models and lattices & Boolean algebra in Boolean functions . Inference Theory The Theory of Inference for the Statement Calculus -The Predicate Calculus .Functions. 4.Principal Conjunctive Norm Forms. Write a function to find substring. Mathematical Logic Introduction -Statements and Notation .Connectives .Principal Disjunctive Norm Forms . Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. and algebraic theory in computer science problems.Equivalence Implications .Normal Forms . 56 . 05MSE301.The Application of Residue Arithmetic to Computers .3.Group Codes.Relations and Ordering.Polish Expressions and Their Compilation . Set Theory Basic Concepts of Set Theory.Boolean Algebra Representation and Minimization of Boolean Functions. 5.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.Trees -Storage Representation and Manipulation of Graphs.Inference Theory of the Predicate Calculus.
Discrete Mathematical Structures with Applications to Computer Science. S. Manohar. Pearson Education (2001). J. Discrete Mathematics.P. Discrete Mathematics. 5th Edition. 2. Tata McGraw Hill. 57 . Seminars and Written Examinations. Lipson. Lipschutz and M. Trembley and R. Reference Books: 1. Mode of Evaluation: By Assignment. 2 nd Edition (2000). Richard Johnsonbaugh. Tata McGraw Hill – 13th reprint (2001).Text Book: 1.
2004. Software design and implementation. Software cost estimation. Requirements elicitation and analysis.Component-based development. Risk management. Over view of CASE tools.Defect testing. 58 .V&V planning. "Software Engineering". System requirements. Software Specification. System Specification. 2004. Process iteration. Overview of Quality management & Process Improvement.User interface design principles. Software validation. Object-oriented testing. Interface specification. Interface evaluation. Software change & re-engineering. Project duration and staffing. Domain-specific architectures. System ModelsContext.Formal methods and critical systems. Behavioural specification Architectural Architectural design.planning and managing change. Project management activities. use the testing tools and methods.Prototyping in the software process. Behavioural.Project planning. User requirements. Automated static analysis. Requirements validation.Functional and non-functional requirements. Addison-Wesley. and Six Sigma. Rapid prototyping techniques.Productivity. User interface prototyping. CASE workbenches. version and release. Safety assurance. overview of Legacy Systems. Critical System Critical Systems. Design with Reuse. Pressman. Objectoriented and Real-time software.Formal specification in the software process. User interface design . REFERENCE BOOK: 1. The system engineering process. develop an efficient software system through group cohesiveness. Critical systems validation. Software process models. McGraw Hill. Software testing. Estimation techniques. Verification and validation. User support. User interaction.Feasibility studies. Integration testing. Requirements management. Object models.System structuring. Ian Sommerville. TEXT BOOK: 1. “Software Engineering”. Modular decomposition.Over view of Dependability. and System Development. Information presentation. Over view of SEI-CMM. Data and. Roger S. Reliability validation. Security assessment. Software requirements. Objectives The students’ would be able to analyse software requirements. Configuration management. Algorithmic cost modeling.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 . Control models. Clean room software development. Formal Specification. Software inspections. Application families. Software evolution. Over view of design for Distributed systems. software requirements document. Fundamentals Software Engineering Fundamentals. Design patterns. Software prototyping. Engineering Process Requirements engineering processes . Project scheduling. ISO 9000. Managing Software Over view of managing software people.
CPU scheduling algorithms. TEXT BOOK: 1. 59 . Memory Management. Deadlocks Memory Management Memory Management. John Wiley & Sons. Operating-System Structures Process Processes. Distributed systems. scheduling algorithms and distributed file systems Objectives The students would be able to understand and explain various OS concepts such as time-sharing. Semaphores and Critical regions. Multiprogramming. "Operating Systems". Security Case Studies The Linux System. Fourth Edition Mode of Evaluation: By Assignment. windows 2000. Seminars and Written Examinations. CPU Scheduling. Introduction Introduction. Parallel. Windows 2000.Mode of Evaluation: By Assignment. Deadlock prevention. Abraham Silberschatz. Prentice Hall of India. Distributed Coordination. Mass-Storage Structure Distributed File Structure Distributed System Structures. REFERENCE BOOK: 1. Threads. "Operating System Concepts". File-System Implementation.They would be able to use Linux system. I/O Systems. I/O systems and File Systems . 05MSE305 OPERATING SYSTEMS* L 4 T P C 3 Aim This subject aims to introduce operating system concepts such as processes & threads. Peter Baer Galvin. Stallings William. Protection. Seminars and Written Examinations. Greg Gagne. Inc. Computer-System Structures. Process Synchronization. processes & Threads. memory management. 6th Edition. Virtual Memory. File-System Interface. Distributed File Systems.
TCP/IP TCP/IP Architecture. switches. Network design approaches.Network Services and Internal Network Operation. different topologies like Star. different protocol standards. Multiple Access Communications. etc. different switching techniques. LAN. different internetworking devices like bridges. Ethernet networking. Overview of TCP/IP Architecture. Shortest Path Algorithms.05MSE307 COMPUTER AND COMMUNICATION NETWORKS* L 4 T P C 3 Aim The subject aims to introduce basics of Networks. Leon-Garcia. Network Services Networks and Services. The Internet Protocol. security protocols & security algorithms. Indra Widjaja. WAN. Approaches to Network Design. Packet Switching Packet Switching Networks. Introduction to Internet Routing Protocols. routers. etc. A.Introduction to MPLS and Differentiated Services. Transmission Control Protocol. client/server systems. Limitations of IPv4 and Introduction to IPv6. Objectives Students shall be able to understand about working of Intranet. Sliding Window Flow Control. various functions of layers. congestion & traffic control. Architecture of Networks. The OSI Reference Model. "Communication Networks". and Introduction to traffic management & QoS. Introduction to LAN Standards and LAN Bridges. LAN and access methods. Peer-to-Peer Protocols and Service Models ARQ Protocols. Advanced Network Advanced Network Architectures and Security Protocols. Application Protocols and TCP/IP Utilities. different network architectures. Routing in Packet Networks.. 2000 60 . User Datagram Protocol. and also future Networking technology. Security Protocols. RSVP. DHCP. MAN setups. Packet Network Topology. Tata McGraw Hill. Cryptographic Algorithms TEXT BOOK: 1. Security and Cryptographic Algorithms. Mesh.
B. Managing Technology Managing Research Function: Nature of Research and Development Research strategy and organization – Selecting R & D projects – Making R&D Organization successful.Shroff Publishers . 1998. O' Reilly and Associates . Bek et al : LINUX Kernel Internals. Human Aspects of Organizing Authority and Paver – Delegation – Committees and Meetings. Remy Card et al: The LINUX Kernel book. Delhi. Development of Engineering Management: Industrial Revolution – Management Philosophies – Scientific Management – Administrative Management – Behavioral Management. the students will be able to 1.D) 2.CGI Programming on the World Wide Web. Understand research functions Introduction to Engineering Management Engineering and Management: Engineering – Management – Engineering Management.1996. Core PHP programming. Managing Projects 62 . 2004. REFERENCE BOOKS 1. Pearson Education. Leon Atkinson and Zeev Suraski. Appendices A. Mode of Evaluation: By Assignment. (Chapters 1 to 7). Understand planning and forecasting 4. Shishir Gundavaram . Seminars and Written Examinations.C. 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. 2. Addison-Wesley. 1997. Functions of Technology Management Planning and Forecasting: Nature of Planning – Foundations for Planning – Planning concepts – Forecasting – Strategies for Managing Technology. M. Understand the functions of technology of management 3.TEXT BOOKS 1. John Wiley. (Chapters 1 to 9. Differentiate Management and Engineering 2.
Write a program for the above 6. 3. Managing Engineering and Technology – Daniel L. Seminars and Written Examinations. Third Edition –2005. This process is done using UDP. Write a program to display the client’s address at the server end. b as c …z as a. Mode of Evaluation: By Assignment. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. Pearson Education. 2. 4. Lucy C. a as b.e. Write a program for the above 63 . 5. Encoding is done by replacing a character by the character next to it i. Write a program to develop a simple Chat application. 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. Write a program to display the server’s date and time details at the client end. a as b. Babcock. Encoding is done by replacing a character by the character next to it i. b as c …z as a. 05MSE313L COMPUTER AND COMMUNICATION NETWORKS LAB* L T P 3 C 2 1. Write a program to implement an echo UDP server. This process is done using the TCP/IP protocol. The message entered in the client is sent to the server and the server encodes the message and returns it to the client.Project Planning and Acquistion Characteristics of a project – Project proposal process – Project Planning Tools – Project organization – Motivating Project Performance.Morse.e. Reference Book 1.
2. Implement the solution for reader – writers problem. After it’s started where K is a command line parameter. 8. 8. Sec. amount of memory currently available. 5. 6. Implement the first fit. Write a program to create processes and threads. Write a program that uses a wait able timer to stop itself K. 4. kernal version. Objective To know the basic concepts and notations in graphs. round – robin. Write a program to create a daemon process. Write a program to capture each packet and to examine its checksum field. To give the combinatorial and matrix representation of graphs To explain the computer representation of graphs and its application to computer science. 3. Program to get the amount of memory configured into the computer. Priority. Program to report the behavior of the OS to get the CPU type and model. 9. Implement the various process scheduling mechanisms such as FCFS. 64 . 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. Implement bankers algorithm.7. SJF. 7. best fit and worst fit file allocation strategy. Implement the solution for dining philosophers problem. 9. Write a program to display the name and address of the computer that we are currently working on. 05MSE315L OPERATING SYSTEMS LAB* L T P 3 C 2 1.
tournament. Coloring. circuits. covering. Euler digraphs. Networks and Algorithms. trees-matrix representation. Graph. N. 2. 1977. Prentice Hall India. trees.input & output.Introduction Definitions. chromatic partitioning. Planar And Dual Graphs Combinatorial representation. Trees Properties. Nievergelt. connectivity. 65 . Graph Theoretic Algorithms Computer representation of graphs . Mode of Evaluation: By Assignment. 1981. adjacency matrix. operation on graphs operation on graphs. Graph theory with application to engineering and computer science. disconnected graphs. Tulasiraman And M. Text Book: 1. network flows. N. fundamental circuits. importance. detection of planarity. J. 4. euler and hamiltonian graphs.M. Narasing Deo. Practice.J.S. Harary. dual graphs. Reference Book 1.N. kuratowski's graphs. Graph Theory. directed paths and connectedness. Deo. four color problem. path matrix. Cut Sets Properties. E. cut vertices. F. relationships amongst matrices. Prentice Hall. planar graphs. minimal spanning tree. Covering And Partitioning Chromatic number. fundamental circuits. matching. directed circuits and shortest paths. Directed Graphs Different types. distance and centres. cut set matrix. walk. paths. Addison Wesley / Narosa. 1995. spanning tree. circuit matrix. 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. Seminars and Written Examinations. 3. Swamy. spanning trees. Combinatorial algorithms: Theory and 5. connected. separatability. isomorphism. 1998. 1-2 isomorphism. fundamental matrices. John Wiley. fundamental circuits and cut sets. algorithms for connectedness. Matrix Representation of Graphs Incidence matrix.Reingold.
TCP/IP Protocol Suite TCP/IP Protocol Suite. Pearson Education. Pearson Education. Internet Protocol (IP). Third Edition.Comer. Overview of OSI and TCP/IP Protocol Suite: Converting network names to IP addresses. 2001.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. Other networking protocols The IPX/SPX Protocol Suite. Reference Book 1) W.SMB. Addressing and Routing Network names and addresses. Convergent Protocols – H. Mode of Evaluation: By Assignment. TCP/IP Protocol Suite advantages.I. TCP/IP Illustrated. Text Book: 1. Addressing and routing. Internetworking with TCP/IP Principles. Network Management Protocol – SNMP and CIMP. S. Mail and news protocols . Behrouz A. Resolving IP addresses to physical addresses. NNTP and IMAP. The Protocols. Siyan. and NFS.323 and SIP. Network layer address: The IPX address. NCP. Tim Parker. File sharing protocols . TCP/IP Unleashed. POP3. 2) D. ISO and the IEEE standards. Physical layer addressing: the MAC address. Need for standardization. Pearson Education. Protocols and Architecture Vol . Forouzan. Other Protocols Suite – ICMP and ARP. Networking Standards and Specification Networking standards and specifications.RIP. Transport Layer Protocols -TCP and UDP.FTP and TFTP. Seminars and Written Examinations. PHI 4) Karanjit. AppleTalk Protocol. Tata McGraw-Hill. Using TCP/IP.SMTP. NetBEUI. Richard Stevens. 2005. TCP/IP Protocol Suite. File Transfer protocols . 05MSE306 SOFTWARE ARCHITECTRE AND DESIGN L 4 T P C 3 66 . Network layer addressing: The IP address. 3) John Ray. OSPF and BGP. 2004.E. Routing protocols . The IEEE 802 Project.
Design practices-Rational for method.Other familiar Architecture .Case Studies. Architecture Structures for Shared Information Systems. Design strategies-Top down and bottom up. Design qualities. Pearson Education 2004 2nd edition.S. Seminars and Written Examinations 67 . Architecture design guidance . " Software Architectural Perspectives on an emerging discipline ". object-oriented and object-based design and Structured System Analysis and Structured design method.Layered Systems .Prospects . Reference Books: 1) Pressman R. Addison Wesley Pearson Education of 1995. " Software Design ". Constructs. " Software Engineering ".Exploiting style in architectural design – Architectural Interconnection . David Budgen. McGraw Hill Inc. Architecture Design Architectural design and Mapping – Description of various Architectural design patterns Object Oriented Organization. 2005 6th edition. Miscellaneous Topics Tools for Architectural design .Repositories . “ Pattern Oriented S/W Architecture”. 2) Mary Shaw David Garlan.Architectural Styles . PHI 1996. Addison-Wesley.Definition .Heterogeneous Architectures. John Wiley & sons -1996 Mode of Evaluation: By Assignment.EEE.. Organizational methods and design. 4) Frank Bushmann et al. Text Book: 1.State of Art . Traditional approach to design-SADT organizational design practices-SSADM and design for real time systems – MASCOT Software Architecture Introduction . Design viewpoints for software. Jackson system development. Design Methodologies and Models Jackson Structural programming.Software Architecture .Process Control .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. 3) Gamma & Helm et al.User Interface Architecture. 6th Edition. “Design Patterns”.Pipes and Filters . assessing the design.
Unified Modeling Language by OMG. TMH. Managing Software Requirements . Pearson Education. Mark Priestley. Don Widrig. Text Books: 1. 68 . 2004. 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. TMH. Practical Objected Oriented Design with UML. 2005. Introduction to Object Oriented Analysis and Design. Introduction The Requirements Problem – introduction to Requirements and software development life cycle. Stephen R Schach. Reference Books: 1. second Edition by Dean Leffingwell . 2. requirements management – T P C 3 Analyzing the problem: The five steps in problem analysis – Business Modeling – systems engineering of software – Intensive systems.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. 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.the vision document – product management – establishing project scope – managing your customer. Defining the system A Use case primer – organizing requirements information . 2.
Run-time Environments Source language issues. Writing a grammar. Syntax Analysis The role of the parser. Assignment statements. Top-down parsing. Lexical Analysis – The role of the lexical analyzer. The grouping of phases. Context-free grammar. Parser generators. parameter passing. Boolean expressions. Text Book: 69 . The phases of a compiler. Register allocation and assignment. Loops in flow graphs. Access to nonlocal names. the principle source of optimization. bottom-up evaluation of Sattributed definitions. The dag representation of basic blocks.05MSE310 COMPILER DESIGN* L 4 Aim To learn the fundamental concepts of compiler construction. Storage-allocation strategies. Analysis of the source program. Compiler-construction tools. Code Optimization Introduction. The target machine. Specification of tokens. Construction of syntax trees. Syntax-Directed Translation Syntax-directed definitions. Basic blocks and flow graphs. Recognition of tokens. Design of a lexical analyzer generator. Storage allocation in Fortran etc. Bottom-up parsing. Top-down translations. Input buffering. Code Generation Issues in the design of a code generator. A simple code generator. Run-time storage management. symbol tables. Case statements. Storage organization. LR parsers. T P C 3 Intermediate Code Generation Intermediate languages. Optimization of basic blocks. Dynamic storage allocation techniques. A language for specifying lexical analyzers. Declarations. L-attributed definitions. Language facilities for dynamic storage allocation. Next-use information. Bottom-up evaluation of inherited attributes. Operator-precedence parsing. Cousins of the compiler. Objective To understand the different phases in compiler construction. Introduction to Compiling and Lexical Analysis Compilers..
Stress Testing. Volume testing. 05MSE312L CASE TOOLS LAB – I L T P 3 C 2 • The Students have to form a team size of 3 or 4. Jeffrey D Ullman . Reference Books: 1. Seminars and Written Examinations. Modeling .Cambridge University Press 2003. 2. Herk Albas. Compilerbased Analysis. Alfred V Aho.PHI – 1996. Andrew W. 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 . Mode of Evaluation: By Assignment. Albert Nymeyer.Compilers-Principles. . Regression testing etc • This tool has to be used for testing and taking various metrics.Modern Compiler Implementation in Java .metrics tools like Code Comparison.1. Appel . Techniques and Tools – Addison-Wesley – Pearson Education as 2004. Complexity-based Metric. Ravi Seti. Review.Practice and principles of Compiler Building with C . Each team is assigned System Analyze. Coding. testing/.
Code Optimization 71 . Lexical Analysis 2. Syntax Analysis 3.05MSE314L COMPILER LAB L T P 3 C 2 Mini Projects will be assigned for the students under the following topics. 1. Code Generation 4.
2001.D.Decision making under risk Decision making under uncertainty.Network Simplex method – CPM and PERT. It provides numerate skills covering mathematical modeling and optimization technique with application to practical problems arising in computer science.Linear Programming and Network flow.Minimal spanning tree algorithm . Operations Research . John Wiley and sons.Infinite stage model . 72 . Hiller and J.Investment Problem – Maximization of the event of Achieving a Goal. Probabilistic Models: Continuous Review model . J. To use the concepts in network analysis and inventory theory Decision Theory Decision Environments . 1979 3. Markovian Decision Process. 2.Pollaczek Khintchine formula. Objective • • To introduce the concepts and techniques in decision theory.J.Finite stage Dynamic Programming model . Deterministic and Probabilistic Dynamic Programming Recursive nature of computations in DP – Selected DP Applications – Problem of Dimensionality – A Game of chance . New Delhi.Phillips.Shortest route Problem Maximum flow Model . Reference Books: 1. New Delhi (2002). Bazaraa. B. Prentice Hall Pvt Ltd. Inventory Theory Basic Elements of an Inventory model . D. Text Book: 1.Jarvis..Linear Programming formulation .S.Deterministic models of the following types: Single item static model with and without price breaks . M.Decision making under certainty .Prentice . New York 1990.05MSE402 OPERATIONS RESEARCH L 4 T P C 3 Aim The main aim of the course Operational Research is introduce the main techniques. 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 .2nd Edition.S.Foundations of Optimization . Taha .Gardner example .Multiple item static models with storage limitation.Lieberman -.Minimum cost capacitated flow problem .Single period models. methods and approaches of operational research.Introduction to Operations Research .Linear Programming solution. C. Scope of the Markovian Decision Problem .Sharall . H.7th Edition. New York. Beightler. Network Analysis Network Definitions . Tata McGraw Hill Publishing Company.Hall of India Private Limited. F. Hamdy A. Wilde .
Fundamentals of Queuing Theory. 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.M.Decision/Condition coverage . Automated Tools for Testing . Gross. Installation phase testing – Tools for acceptance test – Software acceptance process -Software maintenance Methodologies for testing – Training and change installation. 3rd Edition.Test case generators – GUI .Role of software testing . Text Book: 73 . Seminars and Written Examinations.Automated code coverage analysis . Software Testing Principles Software testing –Need for testing .Mutation testing .Testing web-enabled applications.White box.Finite state testing . SDLC and Testing – Verification & Validation.Dataflow coverage .Statement coverage .Harris. Testing Strategies White box testing techniques .Black box testing techniques .Robustness testing .Branch Coverage – Condition coverage . Black box testing – A structural approach to testing – methods for developing test strategy .Levels of testing .5. tools and techniques Testing methods.Testing methodologies. 05MSE404 SOFTWARE TESTING L 4 T P C 3 Aim To learn the fundamental concepts of Software Testing methodologies. Mode of Evaluation: By Assignment. 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. New York.Equivalence partitioning Syntax testing .Boundary value analysis . 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 compilers and language processors .Psychology of testing – Testing economics .Multiple condition coverage . Testing methods.Static code analyzers . 1998.Unit. Wiley & Sons. Integration and System Testing. D and C. Objective To apply the various software testing methodologies for software development.
John Wiley & Sons. Introduction Overview of Software Configuration Management : History of Software Configuration Management. " The Art of Software Testing ".Myers. Black-Box Testing: " Techniques for Functional Testing of Software and Systems". " Effective Methods for Software Testing (2nd Edition) ".Need and Importance of Software Configuration Management – Basic Concepts. 1979. 05MSE406 SOFTWARE CONFIGURATION MANAGEMENT L 4 Aim To learn the basic concepts of Software Configuration Management. John Wiley & Sons.concepts and definitions.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 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 .Software Configuration Management in special circumstances Text Book: T P C 3 74 . Software Configuration Management Implementation Different phases of Software Configuration Management – Configuration Identification – Configuration Control – Status Accounting – Configuration Verification and Audits. 1999 2nd edition. William E.Perry. Mode of Evaluation: By Assignment. 2) Boris Beizer. Reference Books: 1) Glenford J.Software Configuration Management . 1995. Objective To understand and apply Software Configuration Management concepts for software development. Seminars and Written Examinations.1. John Wiley & Sons.
E-mailing with PHP Sending an email – multipart message – storing images – getting confirmation. 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. Managing Global Software Projects. Introduction to Python. Constants. Pearson Education . Gopalswamy Ramesh. “ Software Configuration Management Handbook”. operations. Text Books: 75 .Overview of PHP – Variables.1. 2nd Edition. control structures arrays. Seminars and Written Examinations. Session tracking using PHP – Graphics Input Validators – cookies. classes – Handling files. Introduction to Perl / TCL / Python Numbers and Strings – Control Statements – Lists and Arrays – Files – Pattern matching – Hashes – Functions. Functions. 2nd Edition. Mode of Evaluation: By Assignment. Introduction to PHP Open source Programming PHP. 2004. Objective On completion of this course the students will be able to create open source software applications and can publish it over the Internet. Reference Books: 1. 2000. Alexis Leon. Apache. 3. My SQL database programming Connecting – table creation – record insertion – updation – multiple database handling. TMH. Watts S. Humphrey. Postgress. Managing Software Process. John Wiley. SQL and Perl. 2. 1992. MySQL. Software Configuration Management Strategies and IBM® Rational® ClearCase®: A Practical Introduction. Introduction to TCL/TK.
3 Mini Projects will be assigned for the students under the following domains. testing/. Rommn le Scouarnec. O’Reilly. Apache. 2004. 2000. Leon Atkinson and Zeev Suraski. New Delhi. Review. Seminars and Written Examinations. Complexity-based Metric. Ashish Wilfred Meeta Gupta and Karticj Bhatnagar PHI. 2004 2. Perl CookBook. Reference Books: 1. 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 . Tom Christiansen and Nathan Torkington. Delhi. et al. New Delhi. Coding.Beginning PHP. Techmedia.metrics tools like Code Comparison. Volume testing. Each team is assigned System Analyze. 3. Core PHP programming. 1. Mode of Evaluation: By Assignment. Regression testing etc This tool has to be used for testing and taking various decisions. Clinton pierce.glass. Stress Testing. 05MSE410L SOFTWARE TESTING LAB L • T P 3 C 2 The Students have to form a team size of 3 or 4. 2003 2. Compiler-based Analysis. PHP Professional Projects. Pearson Education. Modeling . MySQL web development Michael K. 2002 Teach Fourself perl. • PHP • PERL • My SQL • Linux C 2 76 .Wiley Publishing. Inc.
John Wiley & sons -2001. Reference Book: Frank Bushmann et al. Text Book: Gamma & Helm et al. Behavioral Pattern Behavioral Pattern – Chain of responsibility – Command – Interpreter – Iterator – Mediator – Memento. Objective To learn various architectural styles and Design Pattern.05MSE501 DESIGN PATTERNS L 4 T P C 3 Aim To provide advanced concepts on software design and architecture. 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 – Façade – Flyweight – Proxy – Discussion. Addison Wesley 1999.Description of architectural patterns-Design pattern –an Introduction – Description of design pattern.State Strategy – Template method – visitor – discussion Future of Patterns Benefits of pattern in S/ W development – expectation from design pattern – A Case study. Seminars and Written Examinations.pattern description – patterns and S/W architecture. 77 . Mode of Evaluation: By Assignment. Introduction Introduction to patterns – Pattern categories – Relationship. “ Pattern Oriented S/W Architecture”. “Design Patterns”.Observer .
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
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
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:
Volume testing. Sami Zahran – Software Process Improvement: Practical Guidelines for Business Success. 1994. 2. “Managing Software Process ". Review.Pearson Education. Complexity-based Metric. 2000.Wesley. Reference Books: 1. Humphery. 81 . " Software Engineering ". Addison . Roger Pressman. New York. Darrel Ince . Modeling. 2002 2. testing/.S. 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. Watt.1996.1. Osten Oskarsson and R .An ISO 9000 Approach to Building Quality Software Prentice Hall .metrics tools like Code Comparison. Compiler-based Analysis. Coding.ISO 9001 and Software Quality Assurance – McGraw Hill. Stress Testing. Each team is assigned System Analyze. Mode of Evaluation: By Assignment. McGraw Hill. Regression testing etc • This tool has to be used for testing and taking various metrics. Pearson Education 6th edition 2004 1. 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.
Complexity-based Metric. 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 . Stress Testing. Each team is assigned testing / metrics tools like Code Comparison. Compiler-based Analysis. Modeling . Review.05MSE511L SOFTWARE MEASUREMENT LAB L T P 3 C 2 The Students have to form a team size of 3 or 4. Volume testing.
Architecture of Data mining. 83 .A multidimensional Data Model – Data Warehouse architecture – Data preprocessing.. & Kamber. To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining Introduction to Data Warehouse. D. UNIT V: Cluster analysis – Types of Data in cluster analysis . languages & system architecture Data mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern . Anahory S.Mining single dimensional Boolean association rules from transactional databases. “Data Mining: Concepts and Techniques”. Wiley Dream Tech. fact data and dimension data. 3rd Edition. “Building the Data Warehouse”.Major clustering methods. summary table.H..Data Mining Query language – Designing Graphical User interfaces based on DMQL . Data mining applications. Classification & prediction: What’s classification issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear. Data Mining primitives.W. Text Book: 1.Data cleaning – Data integration and Transformation. 1st Edition. 2005. Association Rule Mining Basic concepts – market basket analysis . Reference Books: 1. Morgan Kaufmann. Han J.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. M. Addison Wesley. 2. Major issues in Data mining. data mart. Immon. 2003. 1997. Murray. Data Mining Introduction Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems. To sail along with the various approaches in data mining. Objectives To make familiar with the various concepts of data warehousing like meta data. “Data Warehousing in the Real World”.
such as morphological analysis. 05MSE E02 NATURAL LANGUAGE PROCESSING L 4 T P C 3 Aim To introduce the fundamental techniques of natural language processing. and relating those formalisms to recursive transition networks (RTNs) as well as augmented transition networks (ATNs). Ambiguities in words like “pen” and “pipe”.g. such as formal language theory. Morphology Analysis and generation of language on word level: e. Semantics by linking the “linguistics view” (computational linguistics) with the “artificial intelligence view” (natural language processing). but will also discuss some complex strings. Semantics Language ambiguities on the level of “meaning”: represented by case structures and conceptual dependency structures. Understand how these techniques draw on and relate to other areas of (theoretical) computer science. Syntax.g. or theorem proving Introduction Introduction to the Morphology. such as machine translation and email response • be able to describe briefly a fundamental technique for processing language for several subtasks. And will discuss why the machine runs into problems during analysis. parsing. problems with compounding and idiomatic phrases.Mode of Evaluation: By Assignment.g. 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. finite state automata as well as semantic networks. applications such as machine translation and grammar checking and the processing using phase structure grammars as well as unification based formalisms. Seminars and Written Examinations. Syntax Analysis and generation of language on phrasal and sentence level: e. to develop an understanding of the limits of those techniques and of current research issues. homophonous strings as well as loan words and their processing using e. formal semantics of programming languages. and how these problems can be overcome. Applications of NLP 84 . We will look at famous utterances such as: Colourless green ideas sleep furiously. word sense disambiguation etc.
Cambridge. NII standard. approach for BPR. electronic data interchange (EDI). Martin “Speech and Language Processing” Prentice Hall. internet security. security solution. components of EDI system. interchange structure. cost and benefits. commerce over extranets. electronic commerce over internet. PC and networking. light weight directory access protocol. 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. E-mail security. security issues and Business Process Reengineering Electronic Commerce Electronic Commerce. BPR methodology. Technology and security issues Technology issues – Bandwidth issues. EDI over internet. MIT Press. James H. technology issues for the internet. Services. Grammar Checkers Dictation. value added networks. guidelines for cryptography policy. UN/EDIFACT standard – introduction. electronic cash over the internet.Machine Translation. Seminars and Written Examinations. internet 2. implementation issues. identification and tracking tools for electronic commerce. ISO model. G11. EDI interchange agreement. strategic alignment model. Reengineering Business process reengineering. Intranet – Introduction. 2001. Text Book: Daniel Jurafsky.400 message handling system. message directories. NI1 services. Electronic data interchange (EDI) EDI – introduction. Automatic Document Generation. an EDIFACT message. implementation plan. Case Studies 85 . X. risks – paper document versus electronic document. internet E-mail. communication media. laws for e commerce. “Foundations of Statistical Natural Language Processing”. networking . computer communication system. change management in public administration. change management. NL Interfaces. legal issues. MA: May 1999. Mode of Evaluation: By Assignment. security issues security concerns. internet search. Reference Books: Chris Manning and Hinrich Schütze. NI1 agenda.
internet in India. automotive industry.“E-Commerce” . authentication techniques digital signatures and System-level security issues.Tata McGraw Hill – 2000. Conventional Encryption: Classical Techniques: Conventional Encryption model . Attacks. Blow Fish etc. Hash Algorithm: MD5 Message Digest algorithm – Secure Hash algorithm (SHA-1) – HMAC. Digital Signatures and Authentication Protocols: Digital signatures – Authentication protocols – Digital signature standard. model interchange agreement for international commercial use of EDI. 2) Jim Iterne – “World Wide Web Marketing” – John Wiley – 1995. Kamlesh K. laws for e commerce in India. 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. Reference Books: 1) San Jose CA – “Electronic Publishing Guide “ – Adobe Press – 1998. Ecommerce in India – EDI in India.EDI in Indian customs. Text Book: 1. US electronic procurement. Bajaj . 86 . Crypto-analysis. Seminars and Written Examinations. Service and Mechanism Attacks.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. UNCITRAL model law on electronic commerce. Services & Mechanisms – Security attacks – Security services – Network Security Model.Stenography – Classical Encryption Techniques. Objectives The students would be able to understand and use encryption algorithms such as RSA.Modern Techniques: The Data Encryption Standard – The Strength of DES – Differential and Linear. SNS. Mode of Evaluation: By Assignment. banks. It also covers the topics such as cryptography and various encryption algorithms. Public Key Cryptography Principles of public-key cryptosystems – The RSA algorithm .
DCE. desirable features of a good message passing system. utilization and management of the expensive resources that are remote to the users. Worms Intruders – Intrusion techniques – Password protection – Access control – Password selection strategies -Intrusion detection. Mode of Evaluation: By Assignment. issues in design. 2002. synchronization. Prentice-Hall of India Pvt Ltd. process addressing. security mechanisms and design methodologies of Distributed systems Introduction Introduction to distributed computing system. message passing –introduction. 05MSE E05 DISTRIBUTED COMPUTING L 4 T P C 3 Aim The subject aims to cover parallel & distributed computing architecture. multigram messages. encoding and decoding of message data. networked clusters of computers. group communication. failure handling. Seminars and Written Examinations. Intruders and Viruses. Reference Book: Charlie Kaufman. gaining popularity. evolution different models. Objectives The students would be able to understand and use different network models. Raja perlman. “Network Security” – 2nd edition. Mike speciner.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. buffering. 2002. Pearson Education. 2nd edition. 87 . Text Book: William Stallings “Cryptography and Network security – Principles and Practice". issues in IPC. definition.Different approaches of Intrusion detection Audit records Viruses and related Threats – Firewalls: Firewall design principles – Firewall characteristics – types of firewalls – Firewall configurations.
"Data Communications and Distributed Networks". software processes. access control. RPC messages. call semantics. such as e. implementation & evaluation of distributed information systems. Sinha. design and implementation issues of DSM systems. workflow. Digital signatures.g. file accessing Models. security. advantages of DSM. communication protocols for RPCs. Methods for building distributed applications. 2.Remote Procedure Call RPC-Introduction. cryptography.g. clock synchronization DFS and security. parameter . file models. Mode of Evaluation: By Assignment. 5th Edition. middle-ware to glue heterogeneous. stub generation.NET. Objectives After completion of this course the students will be able to undergo projects in .passing semantics. PHI.general architecture of DSM systems. and data modeling. implementation mechanism. PHI. Parallel Programming Languages and Algorithms. Parallel and Distributing Computing Overview of Parallel and Distributed Computing. transaction management. Design Considerations Tools Methods and tools for development. 2005. DCE security service. server management. potential attacks to computer system. fault Tolerance. client/server-. and partly mobile/distributed data systems. replacement strategy. mini project using Java RMI Distributed Shared Memory Distributed shared memory. REFERENCE BOOKS: 1. Client-Server Model. Distributed Database Systems. file replication. file catching schemes. Distributed Network ArchitecturesManaging Distributed Systems. Pradeep K. infrastructure e. autonomous. "An Introduction to Distributed and Parallel Computing". Seminars and Written Examinations. C#. CORBA-. Operating Systems. 1997. structure of shared memory space. Black Uyless. model. 05MSE E06 WEB SERVICES L 4 Aim To provide the student with the basics of . file sharing semantics. granularity. client – server binding. PHI. atomic transaction. transparency. Crichlow Joel M. authentication. "Distributed Operating Systems: Concepts & Design".Desirable features of good DFS. exception handling. and Internet-technologies. thrashing. consistency model. TEXT BOOK: 1.NET 88 T - P - C 3 . marshalling arguments and results.
2. Ltd. Advanced Concepts.NET framework.Remoting -XML Parsing-Security. MSDN. 2003. Mode of Evaluation: By Assignment.NET on the edge. WP Publishers and Distributors.file/O –serialization.NET framework. 2003. Introduction to ADO.NET Framework. Web Services Writing Mobile Application with .Introduction Introduction to Microsoft . . Writing Web Application with the . Image Transform.NET Platform. Seminars and Written Examinations. WP Publishers and Distributors. Rick Leinecker ASP.NET Framework. MSDN.NET. Framework Concepts Console I/O-working with strings-formatting and conversion. WP Publishers and Distributors. 89 . Threading NET Framework Concepts II: Reflection. TEXT BOOK: 1. 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 Restoration using various approaches. Applications Writing GUI Applications with the . 2001.NET Framework. MSDN. Image segmentation and Image recognition and interpretation. 2003.NET C# Language Fundamentals: Object Oriented Programming in C#. REFERENCE BOOK: 1. IDG Books India Pvt. Microsoft Visual Basic . Building Blocks of . Microsoft C# Language specification. 3.
Image segmentation and Recognition & interpretation of Images. Decision and theoretic methods. Fast Fourier transform. structural methods. Wiener Filter constraint least squares restoration. Enhancement in the Frequency domain. Image Compression. Anil K. Image Enhancement – Spatial domain methods. Jain. Boundary descriptors. Enhancement by point processing. sampling and quantization. Error free compression. Pearson Education. patterns and pattern classes. Restoration in the spatial domain. Fundamentals: Elements of visual perception. Compression models. Reference book: 1. Discrete Fourier transform. Inverse Filtering. 1989. Image Segmentation Detection of Detection of Discontinuity – Edge linking and boundary detection. 2005. Image Transform Fourier transform. Digital Image representation Steps in image processing. Digital Image Processing. properties of 2 – D Fourier transform. spatial filtering. Elements of Digital Image processing systems. Thresholding Region oriented segmentation. Lossy compression. Seminars and Written Examinations. Algebraic approach to restoration. Gonzalez & Richard E. Image representation – Representation schemes. Mode of Evaluation: By Assignment. Imaging Geometry – some basic transforms. Woods. 90 . Frequency domain methods. Text Book: 1. PHI. perspective transforms. Fundamentals of digital Image processing. basic relationship between pixels. Regional descriptors. Image Restoration Degradation model.Redundancy. Image Transforms. Recognition and interpretation Elements of Image analysis. Image restoration techniques.Objectives The students would be able to understand and explain Fundamentals of Image processing. Image compression standards. Interpretation. Rafel C.
analysis of coefficient quantization effects in fir filters. Implementation. (Chapters 1. Review of basic concepts Signals and signal processing: characterization and classification of signals. fir filter design based on frequency sampling approach. spectral transformations of iir filters. stability test. Digital signal processors Overview of motorola DSP3xx family of digital signal processors. Design: preliminary consideration. 1998. Reference Books: 1. typical signal processing operations.8. cascaded lattice realization of iir and fir filters. discrete-time processing of random signals.10. all pass transfer function. digital sine-cosine generator. 9. basic fir digital filter structures. typical signal processing applications. Sanjit K. fir design based on truncated Fourier series. low pass iir digital filter design. architectures of DSP56307: assembly language instructions and programming: typical software applications. software implementation. digital fm stereo generation. subband coding of speech and audio signals. Digital filters Structures: block diagram representation. 91 T - P - C 3 . discrete-time analytic signal generation. 1998. state-space structures. spectral analysis using dft. complementary transfer functions. 11.4. equivalent structures. musical sound processing. impulse invariance method of iir filter design. minimum-phase and maximum-phase transfer functions. Text Book: 1.1 To 8. tunable iir digital filters. Alan V. types of transfer functions. computer-aided design of digital filters. digital two-pairs. Schafer : Discrete – Time Signal Processing (Second Edition). Tata McGraw-Hill.3.8). Oppenhein. Mitra: Digital Signal Processing – A Computer –Based Approach. the transfer function.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. design of digital iir notch filters.6. analysis of coefficient quantization effects. applications Implementation consideration: basic issues.1 To 9. parallel all pass realization of iir transfer functions. voice privacy system. And Ronald W. the quantization process and errors. Representative applications: dual – tone multifrequency signal detection. why digital signal processing? Transform-domain representations of l to 1 systems: the frequency response. computational complexity of digital filter structures. all pass filters. signal flow-graph representation. basic iir filter structures. computation of the discrete fourier transform. bilinear transform method of iir filter design.1 To 11. examples of typical signals. Prentice – Hall.7. short-term discrete fourier transform. Examples.
Generation of Pseudo – random. John G. Discrete – events system simulation. discrete event simulation. Continuous distributions. Acceptance-Rejection technique. Inventory policies. Transient & steady state behavior of queues. calibration & validation of models. parameter estimation. And Applications Prentice-Hall. Discrete and continuous systems. and Random numbers & variables. Random Number Generation: Properties of random numbers. verification of simulation models.Stochastic nature of O/I data. Components of a system. verification & validation. Direct Transformation for the normal distribution.. 1996. Input and output analysis Objectives The students would be able to understand and use discrete event simulation. Simulation of queuing systems. Algorithms. Useful statistical models. measures of performance and their estimation. queuing notation. GPSS. Summary and comparison of simulations. long run measures of performance of queuing systems. types of simulations with respect to O/P analysis. Concepts in DES. Process. Proakis & Dimitris G. goodness-of-fit tests. Inventory systems. Types of models. Deterministic systems. Inventory Systems Measures of effectiveness. Seminars and Written Examinations. Output Analysis Output Data analysis for a Single Model. Random Variable Generation: Inverse transform technique. simulation techniques. Model of a system. Introduction Simulation-Advantages and disadvantages of simulation. Simulation Examples. areas of application. Empirical distributions. Programming languages for DESS: FORTRAN. Nos. Convolution method. techniques for generating random nos. Input Data Analysis Data collection. and probabilistic systems. Simulation of inventory systems.. tests for random nos. Simulation in inventory analysis. and statistical methods. Transient & steady state behavior of queuing notation. Discrete distributions. Queuing Models: Characteristics of queuing systems. SIMSCRIPT. Steps in a simulation study. other examples of simulation. steady – state behavior of finite population models. 05MSE E09 COMPUTER SIMULATION & MODELLING L 4 T P C 3 Aim This subject aims to cover statistical models in simulation. identifying the distribution.2. Systems and system environment. 92 . GASP. SLAM. general principles and computer simulation languages. Statistical Models in Simulation Review of terminology & concepts. Manolakis: DSP Principles. Verification and validation of simulation models: Model building. Mode of Evaluation: By Assignment.
Modern Statistical Systems and GPSS Simulation. GPRS and Wireless Application protocols Objectives The student would be able to understand the principles and practices of Mobile Communication. GSM. Wireless ATM operations. O/P analysis for steady-state simulations. Mobile TCP-Fast 93 . 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. Mobile Devices. Discrete-event System Simulation. Karian. and Dvdewicz.A. Z.2000. Carson. John S. Freeman. 1991. Telecommunication Systems – GSM – DECT – TETRA . Mobile Network Layers Mobile network layer-Mobile IP-Dynamic host configuration protocol-Ad hoc networks. mobile network layer and various wirelesses Application Protocol. Text Book : 1. E. Wireless Communication Wireless Communication-Wireless LAN-Infrared vs Radio transmission –Infrastructure and ad hoc networks –IEEE802.. 3rd Edition REFERENCE BOOK: 1. Comparison and evaluation of alternative system designs: Comparison of two and several system designs. Satellite Systems –GEO139. Wireless Local Area Networks. 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. 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. MEO140 Routing –Localization –Handover –Broadcast systems-Overview –Cyclic Repetition of Data Digital Audio Broadcasting –Digital Video Broadcasting.J.O/p analysis for terminating simulations.UMTS and IMT . Medium Access Control techniques.11-HIPERLAN –Bluetooth. Mode of Evaluation: By Assignment. Mobile transport layer-Traditional TCP292-Indirect TCP Snooping TCP. Jerry Banks. statistical models for estimating the effect of design alternatives. HiperLAN and Bluetooth. LEO139. Satellite Communication. PHI.
software engineering practices in embedded systems development and Inter process communication. “Mobile Computing-Technology.Retransmit/Fast recovery-transmission/Timeout Freezing . Roopa R. 2000. Talukder. 05MSE E11 EMBEDDED SYSTEMS L 4 T P C 3 Aim The subject aims to cover the concepts of embedded systems. Asoke K. Devices and Buses Devices and Buses for Device Networks-I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C.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. PCI. Mode of Evaluation: By Assignment.Yavagal. their design and applications. PCI – X and Advanced Buses. 94 . ‘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. Johchen schiller. Addison Wesley. 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. Introduction Introduction to Embedded Systems. Memories and I/O Devices. programming models and Inter process communication. Tata Mcgraw Hill. 2005. Reference Book`: 1. device drivers. Mobile Communication. Objectives The student would be able to understand and use in embedded systems. Seminars and Written Examinations. Applications and Service Creation”.
4. 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. learning in machines. Deadline and Interrupt Latency. 3. Programming Concepts Program Modeling Concepts in Single and Multiprocessor Systems Software – Development Process. “Embedded Systems-Application.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. “Embedded Systems Design”.Device Drivers and Interrupts Device Drivers and Interrupts Servicing Mechanism. pattern recognition – a summary. Practice & Design”. feature vectors and feature space. 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. Berger. the structure of the brain. the differences. 95 . 1997. 2. classification techniques. Text Book: 1. statistical techniques. Tata McGraw Hill. linear classifiers. Pattern recognition in perspective. Reference Books: 1. discriminate functions. Arnold S. Tasks & Threads-Multiple Processes in an Application – Problems of Sharing Data by Multiple Tasks and Routines – Inter process Communication. 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.Modeling Processes for Software Analysis Before Software Implementation – Programming Models for Event Controlled or Response Time Constrained Real Time Programs – Modeling of Multiprocessor Systems. Mode of Evaluation: By Assignment. pattern recognition – a definition. 05MSE E12 NEURAL NETWORKS L 4 Aim To provide basic knowledge in Neural Networks. Rajkamal. Objective After completion of this course the students will be able to understand 1. CMP Books. Seminars and Written Examinations.
generalization. Adam Hilger. reducing the neighborhood. software tools multimedia authoring and design process. weight training. Beale & T.Hopfield model. R. clarification conclusion. bi-directional associative memories. Adaptive resonance theory. Seminars and written Examinations. software. constraint satisfaction. Associative Memory Associative Memory -Standard computer memory. visualizing network behaviour. Neural Computing: An Introduction.Introduction altering the perception model. the perception learning rule. Addison Wesley. limitations of perceptions. the energy landscape. the phonetic typewriter. learning vector quantisation. the ADAM system. kaneva’s sparse distributed memory. Willshaw’s associative net. FAMS & N-tupling. architecture and operation. Mode of Evaluation: By Assignment.H. Jackson. Introduction 96 . Self Organizing Networks Kohenen Self-Organizing Networks. Objectives At the end of the course students would be able to use multimedia computing hardware. neighborhoods. the new model the new learning rule. 1990.Introduction modeling the single neuron. learning in simple neurons. fault tolerance. the Boltzman machine.Introduction. ART algorithm. operating systems and DBMS. summary of ART. Peo Y. Hopfield Networks Hopfield Network . 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. implementation in RAMs. implement associative memory. multilayer perceptions as classifiers. optional computing optical computing and neural networks. Hardware and software implementations. The Multi-Layer Perception.Basic Neuron The Basic Neuron. learning difficulties radial basis functions. proof. the XOP problem reverted. Reference Book: 1. 1989. Adaptive pattern recognition and neural networks. the multilayer perception algorithm. the perception. applications. training the ART network. Text Book: 1. the kohenen algorithm. a vectorial perspective.
Quality of Service and Resource Management Multimedia Database Systems Data Analysis. Media Composition. Process Management. K.Media and Data Streams. Global Structure. SGML. Music.Application Subsystem. Computer Image Processing.261. 05MSE E14 INTELLIGENT SYSTEMS L 4 Aim To learn the fundamental concepts of intelligent systems 97 T - P - C 3 . 2002. Mode of Evaluation: By Assignment. Introduction to Optical Storage Video and Animation Basic Concepts. 1st reprint – 2001. Data Structure. Sound /Audio Basic Sound Concepts. Traditional Data Stream Characteristics. "Multimedia computing. "Multimedia Communication Systems: Techniques. Reference Book: 1.Basic Concepts. H.Branch-overlapping Aspects of Multimedia. Content. Data Compression-Storage Space. Standards. Coding Requirements. File Systems. Multimedia. ODA. Document Architecture. Introduction to Hypertext. Pearson Education Asia. Resource Management. and Networks". and Hybrid Coding. Television. Entropy. Multimedia Applications. MPEG. A Reference Model for Multimedia Synchronization. Multimedia Communication Systems. Information Units. Source. Rao. System Architecture.Media Preparation. Data Streams Characteristics for Continuous Media. Hypermedia. Prentice Hall. Ralf Steinmetz and Klara Mahrstedt. Computer-based Animation. Image and Graphics. Additional Operating System Issues. communications and Applications". Some Basic Compression Techniques-JPEG. Operations on Data. Main Properties of a Multimedia System. Medium. Seminars and Written Examinations. Media Integration. DVI Multimedia Operating Systems Introduction. Media Communication. Integration in a Database Model. Media Entertainment Text Book : 1. Real-time. Speech. MHEG. Transport Subsystem. Media Consumption.
PHI 2004 2nd edition Reference Books: 1.Future of AI.Utility Theory .Value of Information .Learning Decision TreesReinforcement Learning . Introduction Definitions .Belief Networks .Decision Theoretic Agent Design.Building a knowledge Base General Ontology .General Model . Narosa Publishing House. Pearson Education 2002 3rd Edition. .Logic-First order logic .Intelligent search .Logical Recovery. Text Book: 1.Communicative agents -Types of Communicating agents .J. Other Agents Learning agents . 2.planning Agents. 05MSE E15 SENSOR NETWORKS L 4 98 T - P - C 3 .Formulating .Reflex Agent .Representation of Planning .Practical Planners – Conditional Planning . 2002.Knowledge in Learning .Intelligent Agents .Search Strategies .Game playing as search. Knowledge Based Agents Representation .Objective To understand the agent based software development. AW.A Modern Approach. Artificial Intelligence. 3rd Edition.Inference . Agents and Uncertainty Acting under uncertainty . Planning Agents Situational Calculus .Basic Problem Solving Agents.Nilsson. Nils.Structure-Environment . Stuart Russell and Peter Norvig Artificial Intelligence . Patrick Henry Winston.Partial order Planning.Decision Network .Inductive Learning . Prentice Hall. Principles of Artificial Intelligence. Mode of Evaluation: By Assignment.History . Seminars and Written Examinations.Probability Baye’s Rule and use .
clustering. In-Network aggregation.Sensor database challenges.15. Control and Data acquisition Task driven sensing. 99 . Profibus . Interbus. Objective At the end of the course students should . to develop an understanding of the limits of those techniques and of current research issues. 2005. etc. Ordinary Sensors Vs Networked Sensors. 2005. query interfaces. node level software platforms.Have deeper knowledge and understanding of sensor models for automotives. MAC:. ”Wireless Sensor Networks” Springer. Querying the physical environment. Sensor network applications.Topology control. Leonidas GUIBAS “Wireless Sensor Networks” Elsevier. Sensor network platforms & Tools Sensor Node hardware. Data Acquisition:. Raghavendra. Mode of evaluation: Written examination. node level simulators.. 2. Potential Problems with Networked Sensors. Time synchronization . Canonical problems. Protocols and Architectures for Wireless Sensor Networks. Wiley. Krishna Sivalingam. Key definitions of sensor networks. Infrastructure Establishment:. IEEE 802. Case Analysis. and to evaluate some current and potential applications. Holger Karl.SMAC. AS-i . Andreas Willig. HART .4 standard. . Reference Books 1.based routing.CAN bus.Zigbee.Have a knowledge and understanding of wireless sensor networks and their principles. Sensor tasking. Assignments.Be able to apply the available tools to perform various kinds of performance testing. Text Book Feng ZHAO. Information based sensor tasking. WorldFIP. data centric storage. attribute. . joint routing and information aggregation. localization and localization services. Introduction to Sensors Communication Network. Graphic. Cauligi S. RS-485 . Seriplex .Aim To introduce the fundamental techniques of sensor Networks. Network Technologies RS-232 . Network sensors & Infrastructure establishment Key assumptions. sensor nodes utilities. LonWorks. Energy-aware routing. Sensor network programming challenges. Foundation Fieldbus. Use of Networked Sensors.
Definition of a GIS. Data base. commercial data. Ian Heywood. etc. images. databases. Regions. T P C 3 100 . CAD Concepts. how GIS is applied. Arcinfo Concepts ARC/INFO Data Management. contributing and allied disciplines. Maps Map Projections and Coordinate Systems:. indexing and hierarchical data structures. GIS and cartography. workspace.Major data feeds to GIS and their characteristics: maps. data formats. Concept of data model. Pearson Education. Data Sources Data Automation and Data Quality:. Mode of Evaluation: By Assignment. scale. features and functions.). GIS as an Information System. Introduction to Arcinfo Modules. Map projections. topology. naming conventions. compression. GIS Concepts and Spatial Data Models Automated cartography versus GIS. abstraction. Seminars and written Examinations. historical development of GIS. 2002. Remote Sensing. precision and error. why GIS is important. data quality. Introduction Introduction and Overview of Geographic Information Systems:. Introduction to Geographical Information Systems. GPS. Arcinfo Concepts. coordinate systems. TIN data model. vector data model. metadata.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. Text Books 1. map projections. locating and evaluating data. GIS data feeds.Maps and their characteristics (selection. raster data model.
Stéphane Ducasse.Regression Test after Every Change Pattern. 2003 Mode of Evaluation: By Assignment.Deprecate Obsolete Interfaces Pattern -Conserve Familiarity Pattern .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.Distinguish Public from Published Interface Pattern .Eliminate Navigation Code Pattern .Compare Code Mechanically Pattern . Object-Oriented ReEngineering Patterns. 101 .Split up God Class Polymorphism Transform Conditionals to Polymorphism Forces Overview Pattern .Use Profiler before Optimizing Detecting Duplicated Codes Detecting Duplicated Code Forces Overview Pattern .Prototype the Target Solution Pattern .Visualize Code as Dot plots Overview of Pattern Redistribute Responsibilities Forces Overview Pattern .Write Tests to Understand Migration Strategies Migration Strategies Forces Overview Pattern .Transform Client Type Checks Pattern .Grow Your Test Base Incrementally Pattern Use a Testing Framework Pattern .Transform Conditionals into Registration Text Book: 1. Not the Implementation Pattern Record Business Rules as Tests Pattern .Factor Out State Pattern Factor Out Strategy Pattern .Make a Bridge to the New Town Pattern . Form of a Reengineering Pattern. Reengineering Patterns.Transform Self Type Checks Pattern .Always Have a Running Version Pattern . Serge Demeyer.Test the Interface. The Reengineering Life Cycle.Introduce Null Object Pattern . A Map of Reengineering Patterns Evolution Write Tests to Enable Evolution Pattern . Oscar Nierstrasz .Move Behavior Close to Data Pattern .Present the Right Interface Pattern . ELsvier Publication. Need for Reengineer.Involve the Users Pattern .Build Confidence Pattern Migrate Systems Incrementally Pattern . Seminars and written Examinations.
Adaptive (Customizable) Software Systems Autonomous mobile and immobile robots .Design and manufacturing . as well as the use of agents to provide intelligent interoperability between loosely coupled components of distributed systems. Russell & Norvig. Palo Alto.based Information systems .Knowledge . Languages Languages and tools for design and implementation of intelligent agents and multiagent systems.Data mining and Knowledge discovery Smart Systems (Smart homes. 2. information retrieval and knowledge discovery.Design and Implementation of Intelligent Agents: Reactive . Huhns and Singh(ed). “Readings in Agents”.Planning .Decision Support Systems and Intelligent design and Manufacturing Systems.Logical . Smart automobiles. It covers various approaches to agent-to-agent communication and agent mobility. 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. Foundations Theoretical Foundations for Software Agents . adapt.Learning agents.Deliberative . Morgan Kaufmann 1998. and actively seek ways to support users. etc.Smart Systems . Text Books: 1.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.Based . “Artificial Intelligence:A Modern Approach”. They would also be able to comprehend the software agent applications in decision support systems. Information Systems Internet .) .Computational Biology . Prentice Hall. Reference Books 102 . Introduction to mobile agents. 1995.Decision Support . manufacturing system. Applications: Adaptive Information Retrieval .Rational Commutating .Adaptive .Knowledge Discovery . 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.Robots.
1997. “Constructing Intelligent Agents with Java”. static and dynamic models. data visualization and multidimensionality. visual spreadsheets. expert systems. database management systems in DSS. 1997. mss modeling in spreadsheets. evaluation. capabilities. multidimensional modeling. access. White. Decision making and computerized support . DSS hardware. constructing a GDSS and the determinants of its success. and components of DSS.1) Bradshaw (ed. the user. Support systems UNIT III: The GDSS meeting process. the concept of decision support systems. Objectives The students will be capable of designing the decision support system for managers to take the decision. 4) James. Database organization Database organization and structure. model base management. intelligent database and data mining. decision analysis of a few alternatives. the evolution and attributes of computerized decision aids. knowledge-based DSS & AI 103 . and visualization. the need for computerized decision support technologies. Mode of Evaluation: By Assignment. GDSS research challenges Modeling for mss. influence diagrams. managerial decision making and informative system. managers and computerized support. OLAP: data access and mining. uncertainty and risk. 2) Bigus & Bigus. the modeling process. classifications of DSS. executive information (support) systems. artificial neural networks. 3) Jeffrey Broadshaw. “Software Agents”. John Wiley. introduction and definitions. systems models. a framework for decision support. the nature and sources of data. analysis. data warehousing. Managers and decision making. characteristics. 1996. the big picture. hybrid support systems. data collection and data problems. distinguishing DSS from management science and MIS. “Mobile Agents”. MIT press. 05MSE E19 DECISION SUPPORT SYSTEM L 4 T P C 3 Aim To provide an environment to understand the system and to make decisions. General Magic. the internet and commercial database services. “Software Agents”. financial and planning modeling. MA:MIT Press. ready-made quantitative software packages. data warehousing. Seminars and written Examinations. optimization. querying and analysis. simulation. E. Decision Support System DSS configuration.). group decision support systems. treating certainty. 1999. Simulation Heuristic programming. Inc. visual modeling and simulation.
DSS construction.16. types of knowledge-based DSS. Text Book: 1.5. how AI differs from conventional computing. Decision Support Systems And Intelligent Systems (Fifth Edition). the technology of GDSS. GDSS software idea generation.4. the decision (electronic meeting) room.8. the DSS of the future.12. decision making in groups. knowledge in AI.concepts and definitions.14. Prentice-Hall.21) Mode of Evaluation: By Assignment.3. Intelligent DSS Intelligent DSS. AI verses natural intelligence. the future of AI. Seminars and Written Examinations. 1998.13. the AI field.6. Aronson. group DSS.2.10. the DSS development process. 104 . Efrain Turban And Jay E. (Chapters . the goal of GDSS and its technology levels.15. negotiation.
EIS. Introduction Introduction to ERP. business modeling. In-house implementation – pros and cons. and MTS. ERP and related technologies: BPR. market SAP AG. ETO. Oracle. Future directions and case studies Faster implementation methodologies. Tata McGraw Hill. package evaluation. its need. MIS. its evolution. benefits of PDM. data warehousing. application platforms. materials management. configuration. CTO. PDM. reengineering. Baan. MTO. MRP-11. Objective To emphasis the need for ERP. reduction in cycle time. Implementation ERP implementation lifecycle – pro-evaluation screening. Various Modules and benefits of market issues. post-implementation. data mining. closed loop MRP. data management. improved resource utilization better customer satisfaction. ‘its growth. testing. end – user training. going live. some case studies. Seminars and Written Examinations. project planning phase. Convergence on Windows NT. new business segment and features. ATO. Reference Book: 1. “Enterprise Resource Planning”. People soft. increased flexibility. shipment. QAD. JD Edwards. SSA. on-time. plant maintenance. CAD/CAM. Manufacturing perspective and various modules MRP. BOM. implementation team training. OLAP. 105 . supply chain management. business models and BAPIs. gap – analysis. quality management. DRP. integrated data model. JIT and kanban. 1999. ERP modules – Finance.05MSE E20 ENTERPRISE RESOURCE PLANNING L 4 Aim To understand the concepts of ERP. Benefits and Markets Reduction of Load-time. DSS. integrated management information. its advantages. T P C 3 Mode of Evaluation: By Assignment. reduced quality costs. Alexis Leon. improved supplier performance.
Risk Management Risk Management-resource allocation-monitoring and control-managing people and organizing teams-planning for small projects.responsibilities-standards-configuration managementprototyping models of prototyping. Reference Books 3. Humphrey. Watts .Gopalaswamy .Sharp and M. Bob Hughes . Mike Cotterell.Introduction to Software Project Management and Quality Assurance .Tata MCGraw Hill .Managing the software process . Ramesh.Tata McGraw Hill.Managing Global Projects .Inclination/Thomas Computer Press .05MSE E21 .1986 106 . 2. Darel Ince. Software Configuration Management Software Configuration Management – basic functions.Woodman .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. T - P - C 3 Activity planning Activity planning-project schedules-sequencing and scheduling projects-network planning model-shortening project duration identifying critical activities.2001 4. H.Software Project Management .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.1995.Addison Wesley . 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. Software Maintenance Software Maintenance characteristics .
McGraw Hill . 6. 107 .A Practitioners approach .Peopleware Mode of Evaluation: By Assignment. Pressman : Software Engineering .1997 DeMarco and Lister .5. Seminars and Written Examinations.
Define Risk Management Mechanisms. Define Risk Resolution Measures. Define Risk Evaluation Criteria. Mitigation. Consequences of Knowledge. Schedule Risk Management Activities. Resolve Risk -Define Risk Resolution Process. Consequences of Ignorance.Define Risk Tracking Process. Develop Plan. Define Risk Management Verification. Approve Policy. Anticipation. Establish Risk-Database Schema. Implementation: The Project Execution Risk Management Process Identify Risk. Hall . Define Selection Criteria. Develop Risk Management Form. Establish Initiative. Document Policy. Coordinate Risk Management Training. Dowd Keyn . Survey Existing Practice. Define Triggering Devices. Elaine M. Risk in the Small.Define Risk Planning Process. Major Factors in Risk Management Capability. Define Risk Management Goals. Plan Risk Management Activities. Define Draft Policy.. Risk Management Infrastructure. Process: The Steps to Manage Risk. Define Risk Analysis Techniques. Budget Risk Management Activities. Review Draft Policy. Outline Risk Management Plan. People: The Human Element. Analyze Risk . Assess Risk. Define Risk Resolution Techniques. Define Risk Identification Process. Plan Risk. Define Risk Management Process. Develop Risk Checklists. Develop Corrective Action Procedure.Define Risk Analysis Process. Define Risk Tracking Measures. Staff Risk Management Activities. Risk in the Large. Establish Risk Prioritization Scheme.Managing Risk: Methods for Software Systems Development Reference Books 2.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. Define Risk Resolution Strategies. P2I2 Sucess Formula. Infrastructure: The Organizational Foundation. Allocate Resources. Obtain Commitment. Develop Risk Action Plan Template. Define Risk Tracking Techniques. Beyond Value at risk – The New Science of Risk Manangement – John Wiley – 1998. Control Risk. Communicate Policy. Track Risk . Text Books: 1. Software Risk Management Foundations. 108 T - P - C 3 . Develop Policy. Review Risk Management Requirements. Define Risk Assessment Method. Risk Management Implementation. Define Risk Management Strategy.
3. Seminars and Written Examinations.MIT Press . 109 . Christian – “The Economics of risk and time”. Golier .2001 Mode of Evaluation: By Assignment.
The Sequence-Based Cleanroom Software Development. Increment Planning in Practice. Architecture Specification Process. Cleanroom Specification Processes. Usage Modeling and Test Planning Process. Project Planning Process. Economic Production of High-Quality Software. Cleanroom Process Mappings to CMM KPAs. Correctness Verification Process. Function Specification Process. Usage Specification Process. Satellite Control System Requirements. The Cleanroom Software Engineering Referen Model The Cleanroom Reference Model. Cleanroom Foundations. Cleanroom Software Certification Benefits of Statistical Testing Based on a Usage Model. Engineering Change Process. Cleanroom Technologies. A CASE STUDY IN CLEANROOM SOFTWARE ENGINEERING. Box Structure Development. Cleanroom and the Capability Maturity Model for Software. Cleanroom Project Experience. Integrating CRM Technology and CMM Management. An Introduction to the CRM. Increment Design Process. The Satellite Control System Case Study.05MSE E23 . Clear Box Verification. Statistical Usage Testing in Practice. Cleanroom Software Engineering Fundamentals Cleanroom Overview. Software Reengineering Process. Common Cleanroom Process Elements. Cleanroom Management Processes. Example: Security Alarm. The Cleanroom Process. Cleanroom Management by Incremental Development Benefits of Incremental Development. Relationship of Cleanroom to Other Practices. TEXT BOOKS: 110 . Requirements Analysis Process. Incremental Development in Practice. Example: The Security Alarm Clear Box. Performance Improvement Process. and Design. Theoretical Foundations of Statistical Testing. Cleanroom Software Specification Box Structures for Cleanroom Specification Specification Process. Cleanroom Certification Processes. Statistical Testing and Certification Process.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. Increment Planning Process. Clear Box Development. The CMM for Software. Theoretical Foundations of Incremental Development. Cleanroom Process Definition Format. Project Management Process. Cleanroom Development Processes.
Linger. Trammell.1. and Jesse H. Poore Cleanroom Software Engineering: Technology and Process Mode of Evaluation: By Assignment. Prowell. Richard C. Carmen J. Stacey J. Seminars and Written Examinations 111 .
z.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. Prince Sodhi – Software Reuse (Domain Analysis and Design Processes. 2. Seminars and Written Examinations T P C 3 112 . Domain Analysis Process: concepts.JODA Products – Domain Design Process: Domain Design – The Object oriented Domain Design Methods – The Object Oriented Method.05MSEE24 . Mode of Evaluation: By Assignment. Jag Sodhi.cshi – “Domain Decomposition Methods in Sciences and Engineering “ – John Willionsons – 1997. 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). Perieaux . J.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. R. Glowinski . 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.
Database Query and phrase Search in Textual Documents. User Productivity. High Level Theories. Goals of System Engineering. Theories. Virtual Environments. Object-Action Interface Model. 113 T - P - C 3 . Fast Movement through Menus. Display Design. Explanations of Direct Manipulation. Evaluation During Active Use. Accommodation of Human Diversity. Same Time. Color. Styles. Preparation of Printed Manuals. Image and Video Displays. Principles. Specification Methods. Applying CSCW to Education. Hypermedia and the World Wide Web: Introduction. Advanced Filtering. Participatory Design. Digitization. Direct-Manipulation Programming. Item Presentation Sequence. Legal Issues. Preparation of Online Facilities Multiple-Windows. Acceptance Tests. Manuals. Remote Direct Manipulation. Goals of Cooperation. Information Search and Visualization: Introduction. Individual-Window Design. Interaction Devices. Dialog Boxes. Principle 2: Use the Eight Golden Rules of Interface Design. Natural Language in Computing. Surveys. Keyboards and Function Keys. and Guidelines Introduction. Response Time and Display Rate: Theoretical Foundations. The Three Pillars of Design Development Methodologies. Synchronous Distributed: Different Place. Guidelines for Data Entry. Computer-Supported Cooperative Work. Same Time. Evaluation and Critiquing Tools. Printer. Information Search and WWW. Guidelines for Data Display. Response Time and Display Rate. Menu Layout. and Manuals Interaction Devices: Introduction. Form Fillin. Management Issues Introduction. Information Visualization. Goals for Our Profession. Usability Testing and Laboratories. Social Impact Statement for Early Design Review.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. Variability. Balance of Automation and Human Control. Environment. Nonanthropomorphic Design. Menus: Task related organization. Command and Natural Languages: Functionality to support Users Tasks. The Benefits of structure. Direct Manipulation and Virtual Environments: Introduction. Error Messages.05MSE E25 . Naming and Abbreviations. Home Automation. Expert Reviews. Computer-Supported Cooperative Work: Introduction. Motivations for Human Factors in Design. Personal Role Management and Elastic Windows. Principle 3: Prevent Errors. Visual Thinking and Icons. Controlled Psychologically Oriented Experiments Tools. Command-organization Strategies. Expectations and Attitudes. Organizational Design to Support Usability. Interface-Building Tools. Response Times. Presentation Styles: Introduction. Different Place. and Menus Introduction. Principle 1: Recognize the Diversity. Speech Recognition. Face to Face: Same Place. and Generation. Goals of User-Interface Design. Ethnographic Observation. Examples of DirectManipulation systems. Asynchronous Interactions: Different Time. Multiple-Window Design. Multimedia Document Searches. Pointing Devices. Command Menus. Coordination by Tightly-Coupled Windows. Image Browsing and Tightly-Coupled Windows. Help: Reading From Paper Versus from Displays. Multiple-Window Strategies: Introduction. Scenario Development.
Prentice-Hall. John-Wiley. 1998 (Chapters 1 To 16) Reference Books: 1. Addison-Wesley. Prentice-Hall. 1998.Hypertext and Hypermedia. 1994 3. Ben Shneiderman: Designing The User Interface (Third Edition). 1997. Genres and Goals and Designs. Wilber O Galitz: The Essential Guide to User Interface Design: An Introduction to GUI Design Principles and Techniques. Eberts: User Interface Design. Object-Action Interface Model for Web Site Design Text – Books: 1. World Wide Web. Mode of Evaluation: By Assignment. Users and Their Tasks. 2. Seminars and Written Examinations 114 . Alan J Dix et al: Human-Computer Interaction (Second Edition).
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.