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