This action might not be possible to undo. Are you sure you want to continue?
REVISED STUDY AND EVALUATION SCHEME FROM 1st TO 4th SEMESTER
MASTER OF ENGINEERING
REGULAR PROGRAMME IN INFORMATION TECHNOLOGY Examination 2012-13
Scheme of Evaluation (Semester-wise) 2012-13 M.E. (INFORMATION TECHNOLOGY)
Scheme of Examination for M.E. in Information Technology for Examination 2012-13. First Semester:
Paper Code MEIT 101 MEIT 102 MEIT 103 MEIT 104 MEIT 105 Paper title
Hrs/wk Marks Univ Exam
Marks Internal Assessment Credits Hrs/wk
Algorithm Analysis & Design Object Oriented Analysis Advanced Digital Signal Processing Wireless & Mobile Comm. Information Security Total
4 4 4 4 4 20
50 50 50 50 50 250
50 50 50 50 50 250
4 4 4 4 4 20
_ 2 _ 2 _ 4
_ 50 _ 50 _ 100
_ 1 _ 1 _ 2
Total Hrs/wk = 24 Total Credits = 22 *-Marks refer to mid semester evaluation and end semester evaluation Second Semester:
Hrs/wk Marks Univ Exam
Paper Code MEIT 201 MEIT 202 MEIT 203 MEIT 204 MEIT 205 MEIT 206
Marks Internal Assessment
Practical Credits 4 4 4 3 3 18 Hrs/wk _ 2 2 _ _ 3 7
Credits _ 1 1 _ _ 2 4
Research Methodology Multimedia Systems Embedded System Design Elective – I Elective - II Research Seminar Total
4 4 4 3 3 18
50 50 50 50 50 250
50 50 50 50 50 250
_ 50 50 _ _ 100 200
Total Hrs/wk = 25 Total Credits = 22 *-Marks refer to mid semester evaluation and end semester evaluation
Third Semester: Paper title Hrs/ wk 3 3 _ 6 Marks Univ Exam Theory Marks Internal Assessment Practical Marks* Paper Code MEIT 301 MEIT 302 MEIT 303 Credits 3 3 _ 6 Hrs/wk _ _ 20 20 _ _ 100 100 Credits _ _ 10 10 Data Warehousing & Data Mining Elective – III Project-based Thesis Work –I Total 50 50 _ 100 50 50 _ 100 Total Hrs/wk = 26 Total Credits = 16 *-Marks refer to mid semester evaluation and end semester evaluation Fourth Semester: Paper title Hrs/ wk _ Total _ Marks Univ Exam Paper Code MEIT 401 Theory Marks Internal Assessment Practical Credits _ _ Hrs/wk 25 25 Marks* Credits 15 15 Thesis Work – II _ _ _ _ 100 100 Total Hrs/wk = 25 Total Credits = 15 *-Marks refer to mid semester evaluation and end semester evaluation ELECTIVES Group I Software Testing & Quality Assurance Soft Computing Theory of Computation Group II Total Quality Management HRD & Training Methods Grid Computing Advanced Digital Image Processing Group III Network Management and Security User Interface Design Advanced Computer Networks .
Identifying differences among best. Multistage graph problem.average and worst Case Behaviors. Leiserson. polynomial time approximation scheme.Queens algorithm. Horowitz. 2. Note: Examiner shall set eight questions.Warshall algorithm. Galgotia publications. Sum of subsets. Zero sum games. NP-Complete and Approximation Algorithm (6) Non-deterministic problem. “Fundamentals of Computer Algorithms”. Knuth-Morries-Pratt-Algorith NP-Hard . Rivest and Stein. Bipartite Matching. Analyzing recursive algorithms using recurrence relations. Knapsack problem. Hamiltonian Circuit problem Linear Programming and Reductions (6) Introduction. four from Part-A and four from Part-B of the syllabus. Big O. Sahni and Rajsekaran. Traveling salesperson problem. Empirical measurements of performance. String matching with finite automata.MASTER OF ENGINEERING IN INFORMATION TECHNOLOGY First Semester Paper title: Algorithm Analysis and Design Paper Code: MEIT 101 Max. Amortized analysis Divide and Conquer algorithms and Dynamic Programming (7) Introduction. Time and space tradeoffs in algorithms. Text Books 1.Quick sort. Minimum spanning tree. Knapsack problem. Single source shortest path algorithm and their performance analysis Branch and Bound techniques 0-1 knapsack problem. Flow of Networks. Strassen’s multiplication. little O. omega and theta notations. N. Cormen. NP-hard and NP-complete Classes. Traveling salesman problem (5) Part B Dynamic Programming and Backtracking algorithms (7) Introduction. Introduction to approximation. absolute approximation. . Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. PHI. Part A Analysis of Algorithms (7) Asymptotic analysis : upper and average complexity bounds .Standard complexity classes. The simplex algorithm String Matching Algorithms (7) The Brute force algorithm. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. Floyd.” Introduction to Algorithms”. Duality.
Operator overloading (05) Definition. Hopcraft. Operator Precedence. Variables. Inheritance. Type ConversionsBuilt in to Class Type. Class Type to Built in Type. Function Overloading Classes and Objects (06) Structures and Classes. Aho. Type Cast Operator. Member Function Definition. Operator Overloading. Pearson Education Ed-2008 Paper Title: Object Oriented Analysis And Design Max. One Class conversion to another Class. Basic Concepts of Object Oriented Programming. Control Structure.Basic Data Types. Dasgupta. Manipulators. Memory Management Operator.Vazirani : “Algorithms” . Visibility Modes. Types of Inheritance. Hierarchical Inheritance. Derived Data Type. Part A Object Oriented Concepts (02) Difference between Procedure-Oriented and Object-Oriented Programming. four from Part-A and four from Part-B of the syllabus. Hybrid Inheritance. Scope Resolution Operator. Creating Objects. Array of objects.References 1. Overloading Unary Operators. Multiple Inheritance. Marks: 50 Time: 3 hours Paper Code: ME IT 102 Course Duration: 45 lecturers of one hour duration each Note: Examiner shall set eight questions. Abstract data types: Object. User Defined Data Types. Ed No-1/2006 2. Ullman : “The Design and Analysis of Algorithms”. Polymorphism. Classes. Nesting of Member Functions. Call by Reference. Tata Mc GrawHill. C++ Programming Language and Functions (05) Tokens. Memory Allocation for objects. Multilevel Inheritance. Call by Value. Class Function Definition. Keywords. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Inheritance: Extending Classes (05) Base and Derived Classes. Class declaration. Inline functions. Assessing Class Members. Data Abstraction and Encapsulation. Default Argument. Objects as Function Arguments. . Identifiers. Concept of Protected Member. Private and Public Member Function. Overloading Binary Operators. Papadimitriou. Function Prototype.Single Inheritance.
. 3rd Ed. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Object Oriented Analysis and Object Oriented Design (08) Object Oriented Notations and Graphs. James. D. 3. C++ Stream Classes. 1996. Addison Wesley. 1994. write() and read(). Formatted I/O Operations.Part .. Object Oriented Programming with C++.B Streams and Templates (05) C++ Streams. Recommended Books 1. 4th Ed. paperback Ed 4. Ltd. Steps in Object Oriented Analysis. Templates. Michael Blaha. Unformatted I/O Operations. Opening and Closing a File. Note: Examiner shall set eight questions. Tata McGraw Hill Publishing Co. File Pointers and Manipulators. PHI 1998. 2000. Objecting Modeling and Design. Dynamic Model. Robert Lafore. Jacksons Model.put() and get(). Galgotia Publications Pvt. File Streams (05) Classes for File Stream Operation.2nd Ed. 5. System Design. Manipulators. Programming with C++. Functions. Paper Title: Advanced Digital Signal Processing Paper Code: MEIT 103 Max. Tata McGraw Hill. Frederick Eddy and William Lorensen. Object Design Object Oriented Methodologies (04) OMT methodology. 2000. Bjarne Stroustrup. Ltd. Booch’s OOA and OOD approach. William Premerlani. Relationship among models. Balagurusamy. Rumbaugh. The C++ Programming Language. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. Marks: 50 Time: 2 hours/wk Paper Code: ME IT 102 Practicals based on theory of the same subject will be conducted. Object Model. Steps in Object Oriented Design. four from Part-A and four from Part-B of the syllabus. Function Model. Paper Title: Object Oriented Analysis and Design Practical Max. . 2. Detecting End-of-File. System analysis. Object Oriented Programming in TURBO C++.Ravichandran.
Digital Filter Banks. Dynamic range scaling. A/D conversion noise analysis. Quantization process & errors. Design of Digital Filters: (12) (a) Finite Impulse Response (FIR) filter-Basic design steps. (b) Infinite Impulse Response (IIR) filter-Design from analog filters-Impulse Invariance. Reduction of product round-off errors . Digital Signal Processing Oppenheim and RW Schieffer. Scaling Functions And Wavelets.K. Subband Coding of speech signals. Theory and Applications of Digital Signal Processing by Rabiner & Gold Paper Title: Wireless & Mobile Communication Paper code: MEIT 104 Max. 3. Fast Fourier Transform(FFT) algorithms. Design of Butterworth. Implementaion of narrowband lowpass filters.off errors. Adaptive direct form FIR filters. Chebyshev Filter using above methods. Parallel form.Mitra(TMH) 4. . Computation of linear and circular convolution using DFT. Digital Filter Structures: (04) Structure of digital filter realizations-Basic FIR & IIR structures (Direct Form I and II). Part B Finite Word Length Effects: (04) Analysis of Finite Word Length Effects. Discrete Fourier Transform(DFT) and its properties. Introduction of Multi-rate Digital signal Processing: (10) Sampling rate conversion. Adaptive lattice ladder filters Recommended Books: 1. Wavelet Transform-Multi Resolution Analysis. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. advantages and disadvantagesDesign Techniques: Windowing & Frequency sampling. Digital Signal Processing by Proakis & Manolakis(PHI) 2. four from Part-A and four from Part-B of the syllabus. Digital Signal Processing by S. Cascade form. Analysis of arithmetic round. Marks : 50 Time: 3 Hours Course Duration: 45 lecturers of one hour duration each Note: Examiner shall set eight questions.limit cycles in IIR filters. Modern Filter Theory by Johnson & Johnson 5. Introduction of Adaptive filters: (07) System modeling. round-off errors in FFT algorithms.Part A Transformations: (08) Review of Z-transform & inverse Z-Transforms and solution of linear differential equations. Its Relation To Multi –Rate Filter Banks. Bilinear Transformation Method-Direct Design &Magnitude Squared Functions.
reasons for developing a cellular mobile telephone system. Rappaport. a basic cellular system. packet ratio and SDMA. cell clustering. network reference model.Kataria & Co. Intelligent network.K. Marks: 50 Time: 2 Hours/wk Practicals based on theory of the same subject will be conducted. cell sectoring and microcell zone concept Multiple Access Techniques (06) Introduction. characteristics. comparison of multiple access techniques. Diversity schemes : Frequency Diversity. Time Diversity. CDMA (IS-95): (05) Introduction. Channel equalization. Edi 2nd . (04) Paper Title: Wireless & Mobile Communication Paper code: MEIT 104 Max. overview of channel impairment. Part B GSM: (05) Introduction. Rake receiver. handoff strategies. features of CDMA system. Mitigation techniques. design consideration. IEEE Press. co-channel and adjacent interference. radio aspects. Wireless Communications Principles and practice by Theodore S. Bluetooth and cdma-2000. S. Migration to 3G technologies: WiFi. Path Diversity. mechanism for capacity improvement-cell splitting. Cellular communication concepts (10) Cell fundamentals. Wireless and Cellular Communication by Sanjay Sharma . types of mobile communication systems. 3. Receiver techniques for fading dispersive channels: (07) Fading. TDMA. . Space Diversity. Books Recommended: 1. types of fading. GSM channels and burst structure. security aspects and architecture. operating modes of an equalization. 2009 Ed Mobile and Personal Communication Systems and services by Raj Pandya.Part A Introduction (08) Evolution of Mobile radio Communication. Prentice Hall India. security aspects and architecture.. EDGE. WiMax. CDMA. Ed 1999. Frequency reuse. 2. FDMA. service aspects. system architecture. services. improving coverage and capacity in cellular systems. Introduction to mobile communication standard.
Limitations. Secret key block ciphers. and Source Code in C. Bill Cheswick and Steve Bellovin. Addision-Wesley.. Characteristics. Capabilities. Triple DES. Bruce Schneier. (04) IP Security (06) Overview.John Wiley 2nd Ed 4. Reference monitor concepts. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Hash Functions. and Trusted systems. Differential and Linear cryptanalysis. Message Authentication codes. Architecture. Recommended Books 1. Polyalphabetic Substitution Cipher. Digital Signatures And Authentication Protocols Digital Signatures and Digital Signature Standard. Authentication Header. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. Firewalls and Internet Security. Hash Algorithms (MD-5 and SHA-1). Encapsulating Security Payload (Tunnel and Transport mode) Firewalls (06) Design Principles. Authentication Functions. (06) Part B Message Authentication and Hash Functions (06) Authentication Requirements. Monoalphabetic Substitution Cipher. Types of Threats-Passive threats. Controls. RSA Systems.H. Cryptanlysis of DES. Part A Foundation of Cryptography (07) Introduction to Cryptography. Cipher Block and Stream ciphers. Active threats. &Matyas C. Jophn. Note: Examiner shall set eight questions. Types of Firewall.M. John Wiley & Sons.2nd Ed 3. Algorithms. Cryptography and Network Security (Principles and Practices) by William Stallings. 2nd Ed . Asymmetric Key Ciphers Principles of Public Key Cryptosystems. four from Part-A and four from Part-B of the syllabus. Key Management Algo. Applied Cryptography: Protocols. A new Dimensions in Computer data security by Meyer C. Knapsack Systems. Stream ciphers (04) Symmetric Key Ciphers (06) DES Algorithm. 5th Ed Pearson 2.Paper Title: Information Security Paper Code: MEIT 105 Max. Transposition Cipher.
coding data for analysis (03) Statistical Methods of Analysis (07) Descriptive statistics: Meaning. Scope of Review. Marks: 50 Time: 3 hours Course Duration: 45 lecturers of one hour duration each Note: Examiner shall set eight questions. Corelational and Experimental Research Sampling Techniques (06) Concept of population and sample’ sampling techniques-simple random sampling. (08) Procedure of data collection Aspects of data collection. types-basic. Sources-Primary and Secondary. selecting a standardized test. Correlation (rank difference and product moment).SECOND SEMESTER Paper Title: Research Methodology Paper Code: ME IT 201 Max. Steps in conducting review Identifying and defining research problem (05) Locating. Part A Introduction to Educational Research Concept. four from Part-A and four from Part-B of the syllabus. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Chi-square tests. Need for educational research (02) Reviewing Literature (02) Need. graphical representations. ANOVA (one way) Procedure for writing a research proposal (02) . mean. Purposes of Review. Method of Research (08) Descriptive research design-survey. observation schedules. snow ball sampling. quota sampling techniques determining size of sample Part – B Design and development of measuring instruments. content analysis. stratified random sampling. Ex-post Facto Research. questionnaires. Analyzing stating and evaluating problem. case study. Inferential statistics: t-test. applied and action. checklists. systematic sampling and cluster sampling. characteristics and uses of normal curve. Tests. purposive sampling. Generating different types of hypotheses and evaluating them. evaluating research instruments. range and standard deviation.
Marks: 50 Time: 3 hours Course Duration: 45 lecturers of one hour duration each Note: Examiner shall set eight questions. Image Transmission. Image Analysis. Conventional Television Systems. H. Ohio: Charles E. Basic Compression Techniques. Bombay: Vakils Fetter and Simons Ltd. Analysis and Transmission Images and Graphics (05) Digital Image Representation. Gay. Data stream characteristics for Continuous Media. Educational Research. MPEG. Basic Concepts of Computer based Animation. 2000 Paper Title: Multimedia Systems Paper Code: ME IT 202 Max. Video & Animation (06) Video Signal Representation. Part B Data Compression (05) Source. Inc. Colombo Plan Staff College for Technician Education 4. W and Gall. Properties of Multimedia system. Traditional Data Stream Characteristics. disseminating and utilizing research. Borg. L. CPSC: Developing Skills in Technican Education Research Modules 1 to 11 Singapore. four from Part-A and four from Part-B of the syllabus. New York. 2003 5. JPEG. Garrett. Speech-Generation.An Introduction London. Allyn and Bacon. LR. Part A Media & Data Streams (05) Types of media.261.2000 3. Sound & Audio (05) Basics Sound Concepts.Purpose. Format of Research report and journal Strategies for evaluating. 2003 2. Educational Research. M. Merril Publishing Company 2000 Wiersma William Research Methods in Education. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. HE and Woodworth. Computer Image processing-Image Synthesis. Longman. Image Recognition. Entropy & Hybrid Coding.An Overview Recommended Books 1. Image Format. Music: MIDI. DVI . research. RS Statistics in Psychology and Education. HDTV. Educational Research in class rooms and schools! A Manual of Materials and Methods NY: Harper and Row Publishers. Cohen. EDTV. types and components of research proposal Procedure for writing a research report (02) Audiences and types of research reports. Educational Research: An Introduction.
its architecture. memory organization. 2008 Ed Paper Title: Multimedia Systems Practical Paper Code: ME IT 202 Max. Marks: 50 Course Duration: 45 lectures of one hour each. Galgotia Publication 2001 Ed 4. Interrupts. Recommended Book 1. Multimedia Technology and Application by David Hillman . pipe lining. Multimedia In Practice: Technology and Application by Judith Jeffcoate. . Process Management. Architecture Design. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Time: 3 hours Note: Examiner shall set eight questions. Multimedia Syatem by John F. Multimedia :Computing . Resource Management. 5. Embedded software modeling and design. Multimedia In Action by James E Shuman. addressing modes.Multimedia Operating System (06) Real time. Transport Subsystem. Andleigh Kiran Thakkar PHI Paperback Ed. Prentice Hall 2nd Ed. Pearson Education. Micro-controllers: (08) Introduction to Micro-controllers. Operation on Data. Koegel Buford. subroutines. Thompson Wadsworth Vikas Publishing 2002 Ed. Files Systems. modeling of multiprocessing systems. Specific examples of Micro-controllers: PIC. CPU. Marks: 50 Time: 2 hours/wk Practicals based on theory of the same subject will be conducted. CPU family registers. Concepts and Processes of system level design of embedded system. Paper Title: Embedded System Design Paper Code: MEIT 203 Max. Characteristics of MDBMS. Multimedia Systems Design by Prabhat k. 2. System Architecture Multimedia Communication Systems (06) Application Subsystems. Part A Introduction to Embedded System: (05) Their classification & characteristics. 8051 and AVR series. 3. Integration in Database Model. Task Modeling and Management: (08) Timing and clocks in Embedded Systems. instruction set and assembly language programming using timers.Communications & Applications by Ralf Steinmetz Klara Nahrstedt Reference Books 1. Data Analysis. Data Structure. Embedded project management. Quality of Service & Resource Management Database Systems (07) Multimedia DBMS. I/O ports. four from Part-A and four from Part-B of the syllabus.
Practices & conventions. Micro-controllers. Part A Software Quality (07) Ethical Basis for Software Quality.Deshmukh. El.Kopetz (Kluwer Publisher 1st Ed) Digital Design by Wakerly 4th Ed. Books: 1. TMH 2005 Ed. Total quality Management Principles. Overview of Embedded processors like ARM. Paper Title: Embedded System Design Practical Max.g. Time: 3 hours Note: Examiner shall set eight questions. Architecture. 7. SIMD and other high performance approaches. Springee Real Time Systems by H.g. Pearson Hardware/Software Co-Design: Principles and Practices by J. 6. Embedded System Design by Steve Heath (Newnes Publishers. Marks: 50 Course Duration 45 lectures of one hour each. 1st Ed. Instruction Set and programming. Digital Signal Processor (DSP) for Embedded System: (08) Architecture. Introduction to some popular DSP series e. 8. 5.Ajay V. DSPs of Texas Instruments. Software Processes and Methodologies. ELECTIVES Group-I Paper title: Software Testing And Quality Management Paper code: MEIT 204 Max.Part B Embedded Core based Design: (08) System on chip trends. Memory management.Barr (O’Reilly)2nd Ed Specifications and Design of Embedded Systems by D. Organization and Instruction set. MIPS and Intel MMX series. Data parallel issues e.2nd Ed. . Vx Works facilities. Basics of RT. 2.Linux as a RTOS. 3. four from Part-A and four from Part-B of the syllabus. 2nd Ed) ARM system architecture by Steve Furber (Addison Wesley) 1st Ed Programming Embedded System in C/C++ by M.Straunstrup et. Real Time Operating System (RTOS) and RTOS based programming. (08) RTOS Overview.Gajski et. 4.D. Prentice Hall. Interrupt Service Routines. Quality Standards. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Marks: 50 Time: 2 hours/wk Paper Code: MEIT 203 Practicals based on theory of the same subject will be conducted.el.
Benchmarking and Certification. organizational learning. Multilayer NN (05) Learning Methods (04) Backpropagation.Software Management (09) Reviews and Audits. Part B Software Quality Engineering (08) Defining Quality Requirements. designing software measurement programs. Configuration Management Process. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. BAN. Measuring Customer Satisfaction Defect Prevention. Use Of CASE Tool Technology. Problem solving using GA Implementation of GA & GP (05) (04) . Object-Oriented Software. Project Configuration Management (06) Configuration Management Concepts. Counterpropagation. Fuzzy model. Integration & System testing. Architecture of a Neuro Fuzzy systems and its applications (05) GENETIC ALGORITHM: An overview. Marks: 50 Course Duration: 45 lectures of one hour each. Reverse Engineering. Project Tracking And Oversight. Characteristics of ANNs (05) The Biological Prototype. Enterprises Resource Planning Software. (07) Paper title: Soft Computing Paper Code: MEIT 204 Max. Data Quality Control. Perceptron. Software Testing Unit. Fuzzy sets. Fuzzy rule generation (04) Fuzzy inference system. Improving quality with methodologies (08) Structured Information Engineering. ART. Measurement Theory. (04) Part B Introduction to Neuro Fuzzy Systems. four from Part-A and four from Part-B of the syllabus. Part A Fundamentals of Artificial Neural Networks & Applications. Time: 3 hours Note: Examiner shall set eight questions. Document Control. Associative memories (05) Introduction to Fuzzy logic. Requirement Management. Configuration Management Plan of the WAR Project. Defuzzification. Management Issues For Software Quality. Reliability Models. Reliability Growth Models. Role Of Groupware. Software quality metrics. Complexity Metrics And Models.
1st Ed 7. solvability of class.3rd Ed. Normal Form Of WFFs. Pearson Education. partial solvability.Language & Computation) by K. MIT Press 1st Ed. Neural Network in computing Intelligence by Fu. 2003 2. 3. Rules Of Operators. Mathematical theory of computation by Zohar and Manna. 2nd Ed. 1994 6. Validity Theorem. The Ground Resolution Methods Unification Algorithms. An introduction to Genetic Algorithm – Melanie Mitchell. TMH. Verification of programs Flow chart program. formal language. Regular expressions. Kleene's Theorem. Marks: 50 Course Duration: 45 lectures of one hour each. Finite machines with pushdown store. 2nd Ed. Addison Wesley 5. Time: 3 hours Note: Examiner shall set eight questions. Rules For Connectives. Part A Finite Automata (10) Finite state machine & its limitation. Rules For Quantifiers. PHI. Basic Notations. halting problem. Chandrashekharan. Turing Machine (12) Turing machine. Pub-Dover. Herbands Procedure. Theory of Computer science(Auto Mata. The Resolution Rule.1996 2. Davis And Putnam's Method. partial correctness. Learning and soft computing by Kecman. turning machines as acceptors. Fuzzy sets and fuzzy logic-Kir and Yuan PHI. Semantics. Post machines. The Resolution Methods.Applications of GA & GP. Van Nostrand Reinhold. Equivalence Theorem. Neuro fuzzy and soft computing by Jang. Part B Predicate calculus (15) Introduction. 2005 ed 4. termination (10) Recommendation Books 1. Transition Graph. Neural Networks and fuzzy systems by Bar Kosko. Paper title: Theory Of Computation Paper Code: MEIT 204 Max. PHI. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B.P Mishra and N. post correspondence problems. 2nd Ed. inductive assertion methods. PHI . four from Part-A and four from Part-B of the syllabus. primitive recursive function. non-determinism. Hybrid systems (04) Recommended Books 1. Derived Rules Of Inference. Wasserman.L. Natural Deduction. Equivalence Of WFFs. Neurocomputing: Theory & Practice by Philip D.
Education and training. layout for JIT. quality chain. (05) Process Management (06) Factors affecting process management. Just .in. and redressal mechanism. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Customer Satisfaction (05) Internal and external customers. . Kanban. JIT implementation and benefits. MRP Vs. Statistical Process Control (SPC) (06) 7 QC Tools of problem solving. elements. Part A Introduction (04) Quality and Total Quality Management – Concepts. Advanced TQM Tools. concept. Narosa Publishers Group-II Paper title: Total Quality Management Paper Code: MEIT 205 Max. customer focus. Plan formulation and implementation. Note: Examiner shall set eight questions. Quality Planning Process Policy deployment and implementation. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. customer complaints. JIT cause and effect chain. Quality circles. four from Part-A and four from Part-B of the syllabus. Transparent communication. process and types of benchmarking. Control charts. 7 New Tools. satisfaction and delight. Introduction to Formal Language & Automata Peter Linz. JIT. Team building. definition and applications of TQM. Relevance and origin of ISO 9000 and ISO 14000. Quality assurance system and quality audit. Total Employees Involvement (TEI) (04) Empowering employee. Reward and recognition. 4th Ed.3. suggestion schemes. Part B Benchmarking Definition.Time (JIT) (06) JIT Manufacturing and waste elimination. benefits. Quality Function Deployment (QPD). (05) Quality Systems (04) Concept of Quality Systems Standards (QSS).
D. lecture method. education. Sharma. by Dr. simulating real life – role playing and games. Total Quality Management by Sunder Raju. indicators of group development. HRD problems and issues related to Indian Industry and technical.D. Environmental Engineering and Management by Dr. Components of HRD. modalities in training. incidents and cases – individualized training. 6. M/s SK Kataria & Sons. HRD in the context of new Industrial policy. Dhameja. Note: Examiner shall set eight questions. 3. training climate. (05) Evaluation of Training (05) Issues for evaluations. Tata McGraw Hill. role of the training system with evaluators from other constituencies. Training Strategy (05) Strategic issue. seminars and syndicates. 5. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. Zairi. Initial Or Induction Training. Professional Development and Career Development (06) Stages Of HRD. TQM for engineers by M. New Delhi. Developing Group and the Climate The social process. . Aditya books. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. 2. Staff Development. formulating a coherent strategy. Total Quality Management. Part B Training Methods (05) Learning on the job – Training in the field. Delhi. S. action through training or action through force. Mission and Purpose. four from Part-A and four from Part-B of the syllabus. McGraw Hill. Concept of Training (05) Assumptions for prevailing and alternative concept of training.K. Delhi. 4. Sultan Chand & Sons. Total Quality Management Handbook by JL Hradesk. Paper title: Human Resource Development & Training Methods Paper Code: MEIT 205 Max. Training For Horizontal And Vertical Mobility Of Employees. Part A Introduction to Human Resource Development (06) Evolution.Recommended Books 1. basic phases. Training For Job-Related/Professional Development.
On The Job. Note: Examiner shall set eight questions. Strategies For HRD. 2. Introduction to GRAM. Definition And Importance Of Needs Assessment. Web Services Architecture. Service Oriented Architecture. Grid Application Areas. Generalized Resource Management Framework. Virtual Organizations. Web Services. four from Part-A and four from Part-B of the syllabus. Grid Security Frameworks. RFT. Building Blocks for Grid Systems: (06) XML. Design. Relationship between Grid and Web Services. Grid Resource Management Systems. HRD Training and Development by RF Mayer and Peter Pipe. Resource Discovery. WSRF. Grid and Web Services Invocation Data Management: (05) Overview of Data Management in GT4. Records And Reports Study. Grid Architecture and its relationship to other distributed technologies. Data Movement: GridFTP. (04) . Standards. Human Resource Development by PP Arya and BB Tandon. Introduction to MDS in GT4. Authentication Issues. Data Replication: RLS. Implementation And Evaluation. Web Services Security Specifications Monitoring and Discovery Services: Index Services. Questionnaire. OGSI. Off The Job. Higher level data services Resource Management and Scheduling: (06) Resource Management Concepts. SOAP. OGSA. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B Part A Introduction: (06) Grid Computing. QoS. Recommended Books 1. UDDI. Paper: Grid Computing Paper Code: MEIT 205 Max. UDDI. Principles of Human Resource Development by JW Gilley and SA England. Programme Planning. (Interviews. Trust and Privacy related Issues. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. 3. Introduction to Semantic Grids. Benefits of Grid Computing. Authorization Issues. Methods Employed In Needs Assessment. Scheduling in Grids. Tests.Systems Approach to HRD (08) Assessing Need For HRD. Job Analysis And Performance Reviews). Part B Security: (08) Security Issues in Grids.
Craig Fellenstein . Logging. Carl Kesselman. 2003 2. Michael Brown. IBM Red Books. Schopf. 2004. Grid Computing. Image subtraction. Discrete Fourier Transform. 2007 5. 2005. Anirban Chakrabarti. Jennifer M. Zarek Nabrzyski. 3. Kluwer Academic Publishers 4. Wavelet transform. First Edition. Image Enhancement Techniques: (12) Spatial Domain and frequency domain approaches. Lifecycle Management. Text Books: Joshy Joseph. Problem and application areas of digital image processing. high pass filters . Lisa Childers. First Edition. Fast Fourier Transform.Grid Middleware and Programming Model: (10) Study of Globus Toolkit 4 Components and its Programming Model. Median filters. 2005. Hotelling Transform. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. Jan Weglarz. Globus Toolkit 4: Programming Java Services. Note: Examiner shall set eight questions. Butterworth Low pass filters. Morgan Kaufman. Second Edition. Morgan Kaufman.State of the Art and Future Trends. Digital Image representation. The Grid 2: Blueprint for a New Computing Infrastructure. Pearson Education. Discrete Cosine Transform. Reference Books: 1. Intensity transform functions. CRISIS. Study of important distributed systems like Legion. Fourier transforms. Histogram processing. Properties of Fourier Transform. Kentaro Fukul. four from Part-A and four from Part-B of the syllabus. Springer. Walsh Transform. Haar and slant transforms. Sampling and Quantization. Paper: Advanced Digital Image Processing Paper Code: MEIT 205 Max. Building blocks of Digital Image Processing System. Grid Resource Management . Low-pass spatial filters. First Edition. Basic relationship between Pixels. derivative filters .. image average. Nihar Trivedi. Bart Jacob. Introduction to Grid Computing. homomorphic filters . Section A Image fundamentals and Transforms: (06) Steps in Image processing. Grid Computing Security. Frequency domain ideal low-pass filters. Ian Foster. Borja Sotomayor. Notifications. High-pass spatial filters. Singleton and Multiple Resources. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. and Hadamard transforms.
Sonka. edge detections using gradient operator & laplacian operator. Hlavac. polygon approximation. . Color Models. PHI. Jain 2. Pearson educations. Hough transformation Image Representation & Object Recognition: (06) Boundary representation: chain codes. Noise models. Regional descriptors: Simple descriptor & Texture descriptor. Analysis and Machine Vision 2nd Edition. noise removal in color images. Inter-pixel redundancy. S. Estimation of degradation function. segmentation using threshold. Latest edition. line detection. Boyle 3. : Fundamentals of digital image processing. color transformations. image compression models. Boundary descriptors. 2nd Edition. Huffman coding. constrained least square restorations Section B Color Image Processing: (05) Color image representation. Inverse filtering. Fourier descriptor. Psycho-visual redundancy. PWS Publishing. Anil K. Lossy compression techniques.Annadurai & R. Image Compression: (07) Coding redundancy. Pearson education. Vector quantization. : Image Processing.Image Restoration: (06) Image degradation and restoration process. Noise filters. Threshold coding. interactive restoration. Text Book: 1. Simple descriptor. Gonzalez and Woods Reference Books: 1. region oriented segmentation. Shanmugalakshmi : Fundamentals of digital image processing. Least Mean Square filter. Pseduocolor image processing. JPEG compression Image Segmentation: (07) Detection of isolated points. Boundary segments. Introduction to Object Recognition methods. : Digital Image processing. edge linking and boundary detection.
Data Marts. classification data mining systems. integration and transformation. data cubes. Sourcing Acquisition. Embedded data mining. applications of data mining. Parallel RDBMS features. Note: Examiner shall set eight questions. mining class comparisons. data mining in business process. Data Warehouse Database. Alternative Technologies. efficiency. Schemas for multidimensional databases. OLAP Data Warehousing Components (05) Overall Architecture. attribute oriented induction. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each.THIRD SEMESTER Paper title: Data Warehousing and Data Mining Paper Code: MEIT 301 Max. OLAP operations. Cleanup and Transformation Tools. . Mapping the Data Warehouse to a Multiprocessor Architecture (05) Relational Database Technology for Data warehouse. Data reduction. Apriori algorithm. Concept Description (06) Data Mining techniques-Concept description. Data Marts. mining descriptive statistical measures. Applications and Trends In Data Mining (04) Commercial Importance of DW. data warehouse. Information Delivery Systems. mining rules without candidate generation. analytical characterization. Metadata. Multidimensional data model. Association Rule Mining (08) Mining single dimension rules from transactional databases. DBMS vs. need for data warehousing. Database Architectures for Parallel Processing. Introduction to Data Mining (08) Functionalities. four from Part-A and four from Part-B of the syllabus. Metadata Access Tools. Part B Data Preprocessing (06) Data cleaning. Discretization and Concept Hierarchy Generation. Part A Introduction to Data Warehousing (03) Data Warehousing Definition and characteristics. Parallel DBMS Vendors. Data Warehouse Administration and Management. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B.
Host Operating Systems. 2000. John wiley & Sons. Note: Examiner shall set eight questions. Message digest algorithm. Routing Considerations. Message Authentication and Hash Algorithm. Designing Secure Networks (8) Components of a Hardening Strategy. Network Devices. Addison Wesley. 4.S. Threats to Security: Physical security. Sam Anahory & Dennis Murray. Attack Taxonomy. Building the Data Warehouses. by C. Network Security Technologies The Difficulties of Secure Networking. Data Warehousing System. 5. C. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. 1996. Applications. Data Warehouseing in the Real World. Security Technologies. Prabhu Prentice Hall of India. DES. 6. Security Policy and Operations Life Cycle. RSA algorithm. IP Addressing Design Considerations. monitoring controls. Jiawei Han & Micheline Kamber. Techniques. Data Mining –Concepts & Techniques. Appliance-Based Network Services. Authentication requirements and functions secure Hash Algorithm. McGraw Hill. McGraw Hill. PART – A Introduction (5) Classical security Techniques and Computer Network Security Concepts. digital signatures.H. Vulnerability Types. Layer 2 Security Considerations. “Data Warehousing: Concepts. Mallach. Biometric systems. Key management. Rogue Device Detection. Alex Berson. Morgan Kaufmann Publishers. ICMP Design Considerations. Attack Results.Longhman. Modern techniques. ELECTIVE GROUP-III Paper: Network Management and Security Time: 3 hours Paper Code: MEIT 302 Max. DES chaining. Confidentiality and Security. Emerging Security Technologies General Design Considerations. Transport Protocol Design Considerations . four from Part-A and four from Part-B of the syllabus. Dolf Zantinge. 2. Marks: 50 Course Duration: 45 lectures of one hour each. AES Algorithms. 7. Data Mining and OLTP. Triple DES. “Data Mining” by Pieter Adrians. Pearson Education 3. Attacker Types. Products and Applications”. and Data security and intrusion and detection systems. Encryption Techniques (6) Conventional techniques.R. W. 1997.Recommended Books 1. Security System Development and Operations Secure Networking Threats (6) The Attack Process. Data Warehousing.Klelly.
Instant Messaging. First Ed. Cognitive Engineering. goals of user interface design. Site-to-Site Deployment Examples. Tool Capabilities. Visual C++ resources. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. IPsec Modes of Operation and Security Options. 2004 2. Usability. William Stalling “Cryptography and Network Security” Pearson Education References: 1. Pfleeger “Security in Computing” Prentice Hall 2. Published by Cisco Press. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. DNS. “ Network Security Architectures. HTTP/HTTPS. Types of IPsec VPNs. FTP. User Psychology. The Design Team. E-Mail. IPsec VPN Design Considerations (6) VPN Basics. Note: Examiner shall set eight questions. characteristics of graphical and web user interfaces The User Interface Design Process (05) Obstacles And Pitfalls In The Development Path. Network Security Device Best Practices. IT act and cyber laws. . Design Considerations. Interaction Styles And Hypermedia. Secure Management Design Options. Managing Design Process. Jeff Crume “Inside Internet Security” Addison Wesley Paper title: User Interface Design Paper Code: MEIT 302 Max. Secure Network Management and Network Security Management (8) Organizational Realities. Part A User Interface: An introduction and overview (06) Importance of user interface.B Network Security Platform Options (6) Network Security Platform Options. Sean Convery. Visual C++ Basics (06) Introduction to Visual C++.PART . Mental Models. Network Security Management. Text: 1. Common Application Design Considerations. Trusted systems. Protocol Capabilities. Charels P. Topology Considerations. Firewalls. Human Computer Interaction (08) Importance Human Characteristics In Design. four from Part-A and four from Part-B of the syllabus. building a basic applications.
Third Edition. HIPPI. working of menus. MANs. 2nd edition 4. FDDI. Note: Examiner shall set eight questions. Wireless ethernet. Nathan Gurewich and Ori: Visual C++ (Techmedia). Data Access Objects. Application Development in Visual C++ (04) Designing application with security. child windows. Router-Assisted Congestion Control: Active Queue Management. Pearson Education. The IP forwarding path. The IP/TCP split connections.Part B Graphical User Interface (08) Creating menus. DQDB. etc. OLE-DB. Recommended Books 1. RESOURCE MANAGEMENT (6) End-to-End Congestion Control. IPV6. building a database application using ODBC. 2nd Edition. TCP Congestion Control Impediments. Designing the user interface. The Essential Guide to User Interface Design: Wilbert O. TCP/IP suite of protocols. Gigabit Ethernet. combo box. check boxes. radio buttons. Modeling and Measurement: Packet Trains. Galitz. Scaling IP. etc. and wireless LANs. Paper title: Advanced Computer Networks Paper code: MEIT 302 Max.) INTERNETWORKING AND ROUTING (7) Packet Switching. buttons. Johan Paul Mueller: Visual C++ from the Ground UP (PHI Publication). packaging the application. Candidate will be required to attempt any five questions selecting at least two questions from Part A and Part B. Marks: 50 Time: 3 hours Course Duration: 45 lectures of one hour each. Unicast Internet routing: Intra and Inter domain routing. (For example. four from Part-A and four from Part-B of the syllabus. WILEY. dialog boxes. Ben Shneiderman. Router Design and Implementation. The Internetworking Problem. Fair Queuing and Variants. 2. 2nd edition. Part A INTRODUCTION (05) Overview of computer networks. Routers: Forwarding and Routing. MEDIUMACCESS (5) MAC protocols for high-speed LANS. Security problems with Internet Architecture. 3. . building a help file. seven-layer architecture. Visual C++ and Database Management (08) Open Database Connectivity. Adaptive Network Applications.
TCP/IP Illustrated. 1994. Woolf. Stevens. Volume 3: TCP for Transactions. GROUP COMMUNICATION (05) Multicast Routing and Transport. Handel. Volume 2: The Implementation. 5. 4. CE Perkins. R. Agent technology. Key distribution protocols. Stallings. N. Other new options in TCP. 1998. 1997. Applications. PHI REFERENCES: 1. Volume 1: The protocols. session discovery etc. 1996. Computer Networks. Mobile IP. W. R. R. 6 . Mechanisms and Properties. W. 1998. BOOKS: Andrew Tanenbaum. ATM Networks: Concepts. Basic Models and Architecture.. Addison Wesley. W. HTTP. SECURITY (05) Network security at various layers. and the Unix Domain Protocols. G. ESP. Addison Wesley. Huber. Mobile IP: Design Principles and Practices.. Prentice Hall. Wright. M. Multicasting in mobile networks. . 2. Addison Wesley. Digital signatures. and S. IP Multicasting: Multicast routing protocols. Virus Propagation. Authentication header. R. 3. 1995. Modeling and Measurement: Traffic Self-Similarity. TCP extensions for high-speed networks. Satellite technology. Addison Wesley. transaction-oriented applications. Cryptography and Network Security: Principles and Practice. 2nd Ed. Addison Wesley. Broadcast file system. R. TCP/IP Illustrated. digital certificates. NNTP. SSL. Alpert. Schroeder. and S. Stevens. WIRELESS NETWORKS (03) Wireless LAN architecture.Part B QUALITY OF SERVICE (QOS) (04) Why QoS. Secure-HTTP. address assignments. TRANSPORT LAYER PROTOCOL (05) TCP protocol dynamics. Protocols. B. TCP/IP Illustrated.
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 listening from where you left off, or restart the preview.