20120719152941-changed-on-9.4

Upload: vatsgaurav

Post on 03-Apr-2018

212 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/28/2019 20120719152941-changed-on-9.4

    1/25

    PANJ AB UNIVERSITY

    CHANDIGARH

    REVISED STUDY AND EVAL UATION SCHEME

    FROM

    1st TO 4th SEMESTER

    MASTER OF ENGINEERING

    REGULAR PROGRAMME

    IN

    INFORMATION TECHNOLOGY

    Examination 2012-13

  • 7/28/2019 20120719152941-changed-on-9.4

    2/25

    Scheme of Evaluation (Semester-wise) 2012-13M.E. (INFORMATION TECHNOLOGY)

    Scheme of Examination for M.E. in Information Technology for Examination 2012-13.

    First Semester:

    Paper

    CodePaper title

    Theory Practical

    Hrs/wkMarksUnivExam

    MarksInternal

    AssessmentCredits Hrs/wk

    Marks*Credits

    MEIT101

    Algorithm Analysis &Design

    4 50 5 _ _ _

    MEIT102

    Object Oriented Analysi 4 50 5 2 50 1

    MEIT103

    Advanced Digital SignalProcessing

    4 50 5 _ _ _

    MEIT

    104

    Wireless & Mobile

    Comm.

    4 50 5 2 50 1

    MEIT105

    Information Security 4 50 5 _ _ _

    Total 20 25 25 2 4 10 2

    Total Hrs/wk =24 Total Credits =22*-Marks refer to mid semester evaluation and end semester evaluation

    Second Semester:

    PaperCode

    Paper title Theory Practical

    Hrs/wkMarksUnivExam

    MarksInternal

    AssessmentCredits Hrs/wk

    Marks*Credits

    MEIT201

    Research Methodology 4 50 5_ _ _

    MEIT202

    Multimedia Systems 4 50 52 50 1

    MEIT203

    Embedded SystemDesign

    4 50 52 50 1

    MEIT

    204

    Elective I 3 50 5 3 _ _ _

    MEIT205

    Elective - II 3 50 5 3 _ _ _

    MEIT206

    Research Seminar - - - - 3 10 2

    Total 18 25 25 1 7 20

    Total Hrs/wk =25 Total Credits =22*-Marks refer to mid semester evaluation and end semester evaluation

  • 7/28/2019 20120719152941-changed-on-9.4

    3/25

    Third Semester:

    PaperCode

    Paper title Theory Practical

    Hrs/wk

    MarksUnivExam

    MarksInternal

    AssessmentCredits Hrs/wk

    Marks*

    Credits

    MEIT

    301

    Data Warehousing &

    Data Mining

    3 50 5 3

    _ _ _

    MEIT302

    Elective II I 3 50 5 3_ _ _

    MEIT303

    Project-based ThesisWork I

    _ _ _ _20 100 10

    Total 10 10 20 10 10

    Total Hrs/wk =26 Total Credits =16*-Marks refer to mid semester evaluation and end semester evaluation

    Fourth Semester:

    PaperCode

    Paper title Theory Practical

    Hrs/wk

    MarksUnivExam

    MarksInternal

    AssessmentCredits Hrs/wk

    Marks*Credits

    MEIT401

    Thesis Work II _ _ _ _25 100 15

    Total _ _ _ _ 25 10 15

    Total Hrs/wk =25 Total Credits =15*-Marks refer to mid semester evaluation and end semester evaluation

    ELECTIVES

    Group I Group II Group II ISoftware Testing & QualityAssurance

    Total Quality Management Network Management and Security

    Soft Computing HRD & Training Methods User Interface DesignTheory of Computation Grid Computing Advanced Computer Networks

    Advanced Digital Image Processing

  • 7/28/2019 20120719152941-changed-on-9.4

    4/25

    MASTER OF ENGINEERING IN INFORMATION TECHNOLOGY

    First Semester

    Paper title: Algorithm Analysis and Design

    Paper Code: MEIT 101 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part AAnalysis of Algorithms (7)Asymptotic analysis : upper and average complexity bounds . Identifying differences amongbest,average and worst Case Behaviors. Big O, little O, omega and theta notations.Standardcomplexity classes. Empirical measurements of performance. Time and space tradeoffs inalgorithms. Analyzing recursive algorithms using recurrence relations, Amortized analysis

    Divide and Conquer algorithms and Dynamic Programming (7)Introduction,Quick sort, Strassens multiplication, Knapsack problem, Minimum spanning tree,Single source shortest path algorithm and their performance analysis

    Branch and Bound techniques (5)0-1knapsack problem, Traveling salesman problem

    Part BDynamic Programming and Backtracking algorithms (7)Introduction, Knapsack problem, Traveling salesperson problem, Multistage graph problem,Floyd- Warshall algorithm, N- Queens algorithm, Sum of subsets,Hamiltonian Circuit problemLinear Programming and Reductions (6)Introduction, Flow of Networks, Bipartite Matching, Duality, Zero sum games, The simplexalgorithm

    String Matching Algorithms (7)

    The Brute force algorithm, String matching with finite automata, Knuth-Morries-Pratt-Algorith

    NP-Hard , NP-Complete and Approximation Algorithm (6)Non-deterministic problem, NP-hard and NP-complete Classes, Introduction to approximation,absolute approximation, polynomial time approximation scheme.

    Text Books1. Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, PHI.2. Horowitz, Sahni and Rajsekaran, Fundamentals of Computer Algorithms, Galgotia

    publications.

  • 7/28/2019 20120719152941-changed-on-9.4

    5/25

    References

    1. Dasgupta, Papadimitriou,Vazirani : Algorithms , Tata Mc GrawHill, Ed No-1/20062. Aho, Hopcraft, Ullman : The Design and Analysis of Algorithms, Pearson

    Education Ed-2008

    Paper Title: Object Oriented Analysis And Design

    Paper Code:ME IT 102 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lecturers of one hour duration each

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Object Oriented Concepts (02)

    Difference between Procedure-Oriented and Object-Oriented Programming, Basic Concepts ofObject Oriented Programming, Abstract data types: Object, Classes, Data Abstraction andEncapsulation, Inheritance, Polymorphism.

    C++Programming Languageand Functions (05)

    Tokens, Keywords, Identifiers,Basic Data Types, User Defined Data Types, Derived Data Type,Variables, Scope Resolution Operator, Memory Management Operator, Manipulators, Type Cast

    Operator, Operator Overloading, Operator Precedence, Control Structure, Function Prototype,Call by Reference, Call by Value, Inline functions, Default Argument, Function Overloading

    Classes and Objects (06)

    Structures and Classes, Class declaration, Creating Objects, Assessing Class Members, ClassFunction Definition, Member Function Definition, Private and Public Member Function, Nestingof Member Functions, Memory Allocation for objects, Array of objects, Objects as FunctionArguments.

    Inheritance: Extending Classes (05)

    Base and Derived Classes, Visibility Modes, Concept of Protected Member, Types ofInheritance- Single Inheritance, Multilevel Inheritance, Multiple Inheritance, HierarchicalInheritance, Hybrid Inheritance.

    Operator overloading (05)

    Definition, Overloading Unary Operators, Overloading Binary Operators, Type Conversions-Built in to Class Type, Class Type to Built in Type, One Class conversion to another Class.

  • 7/28/2019 20120719152941-changed-on-9.4

    6/25

    Part - B

    Streams and Templates (05)

    C++ Streams, C++ Stream Classes, Unformatted I/O Operations, Formatted I/O Operations,Manipulators.

    Templates.

    File Streams (05)

    Classes for File Stream Operation, Opening and Closing a File, Detecting End-of-File, FilePointers and Manipulators, Functions- put() and get(), write() and read().

    Object Oriented Analysis and Object Oriented Design (08)

    Object Oriented Notations and Graphs, Steps in Object Oriented Analysis, Steps in ObjectOriented Design, System analysis, System Design, Object Design

    Object Oriented Methodologies (04)

    OMT methodology, Object Model, Dynamic Model, Function Model, Relationship amongmodels, Jacksons Model, Boochs OOA and OOD approach.

    Recommended Books

    1. The C++Programming Language, Bjarne Stroustrup, Addison Wesley, 2000.2. Objecting Modeling and Design, James, Rumbaugh, Michael Blaha, William

    Premerlani, Frederick Eddy and William Lorensen, PHI 1998,2nd Ed.

    3. Object Oriented Programming in TURBO C++, Robert Lafore, Galgotia PublicationsPvt. Ltd., 1994, paperback Ed

    4. Programming with C++, D.Ravichandran, Tata McGraw Hill, 1996, 3rdEd.5. Object Oriented Programming with C++, Balagurusamy, Tata McGraw Hill

    Publishing Co. Ltd., 2000, 4th

    Ed.

    Paper Title: Object Oriented Analysis and DesignPractical

    Paper Code:ME IT 102 Max. Marks: 50 Time: 2 hours/wk

    Practicals based on theory of the same subject will be conducted.

    Paper Title: Advanced Digital Signal Processing

    Paper Code: MEIT 103 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

  • 7/28/2019 20120719152941-changed-on-9.4

    7/25

    Part ATransformations: (08)Review of Z-transform & inverse Z-Transforms and solution of linear differential equations.Discrete Fourier Transform(DFT) and its properties, Computation of linear and circularconvolution using DFT, Fast Fourier Transform(FFT) algorithms.

    Digital Filter Structures: (04)

    Structure of digital filter realizations-Basic FIR & IIR structures (Direct Form I and II), Cascadeform, Parallel form.

    Design of Digital Filters: (12)(a)Finite Impulse Response (FIR) filter-Basic design steps, advantages and disadvantages-

    Design Techniques: Windowing & Frequency sampling.(b)Infinite Impulse Response (IIR) filter-Design from analog filters-Impulse Invariance,

    Bilinear Transformation Method-Direct Design &Magnitude Squared Functions. Design ofButterworth, Chebyshev Filter using above methods.

    Part BFinite Word Length Effects: (04)Analysis of Finite Word Length Effects. Quantization process & errors, A/D conversion noiseanalysis, Analysis of arithmetic round- off errors, Dynamic range scaling, Reduction of productround-off errors ,limit cycles in IIR filters, round-off errors in FFT algorithms.

    Introduction of Multi-rate Digital signal Processing: (10)Sampling rate conversion, Digital Filter Banks, Implementaion of narrowband lowpass filters,Subband Coding of speech signals, Wavelet Transform-Multi Resolution Analysis, ScalingFunctions And Wavelets, Its Relation To Multi Rate Filter Banks.

    Introduction of Adaptive filters: (07)System modeling, Adaptive direct form FIR filters, Adaptive lattice ladder filters

    Recommended Books:1. Digital Signal Processing by Proakis & Manolakis(PHI)2. Digital Signal Processing Oppenheim and RW Schieffer.3. Digital Signal Processing by S.K.Mitra(TMH)4. Modern Filter Theory by Johnson & Johnson5. Theory and Applications of Digital Signal Processing by Rabiner & Gold

    Paper Title: Wireless & Mobile Communication

    Paper code: MEIT 104 Max. Marks : 50 Time: 3 Hours

    Course Duration: 45 lecturers of one hour duration each

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

  • 7/28/2019 20120719152941-changed-on-9.4

    8/25

    Part A

    Introduction (08)Evolution of Mobile radio Communication, reasons for developing a cellular mobile telephonesystem, a basic cellular system, types of mobile communication systems, Intelligent network,Introduction to mobile communication standard.

    Cellular communication concepts (10)Cell fundamentals, Frequency reuse, cell clustering, handoff strategies, co-channel and adjacentinterference, improving coverage and capacity in cellular systems, mechanism for capacityimprovement-cell splitting, cell sectoring and microcell zone concept

    Multiple Access Techniques (06)Introduction, FDMA, TDMA, CDMA, comparison of multiple access techniques, packet ratioand SDMA.

    Part B

    GSM: (05)Introduction, design consideration, characteristics, services, system architecture, security aspectsand architecture, GSM channels and burst structure.

    CDMA (IS-95): (05)Introduction, service aspects, network reference model, security aspects and architecture, radioaspects, features of CDMA system.

    Receiver techniques for fading dispersive channels: (07)Fading, types of fading, overview of channel impairment, Mitigation techniques, Diversityschemes : Frequency Diversity, Time Diversity, Space Diversity, Path Diversity, Rake receiver,

    Channel equalization, operating modes of an equalization.

    Migration to 3G technologies: (04)WiFi, WiMax, EDGE, Bluetooth and cdma-2000.

    Books Recommended:

    1. Wireless Communications Principles and practice by Theodore S. Rappaport, PrenticeHall India, Edi 2nd .

    2. Wireless and Cellular Communication by Sanjay Sharma , S.K.Kataria & Co., 2009 Ed3. Mobile and Personal Communication Systems and services by Raj Pandya, IEEE Press,

    Ed 1999.

    Paper Title: Wireless & Mobile Communication

    Paper code: MEIT 104 Max. Marks: 50 Time: 2 Hours/wk

    Practicals based on theory of the same subject will be conducted.

  • 7/28/2019 20120719152941-changed-on-9.4

    9/25

    Paper Title: Information Security

    Paper Code: MEIT 105 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Foundation of Cryptography (07)Introduction to Cryptography, Types of Threats-Passive threats, Active threats, MonoalphabeticSubstitution Cipher, Polyalphabetic Substitution Cipher, Transposition Cipher.

    Cipher (04)Block and Stream ciphers, Secret key block ciphers, Stream ciphers

    Symmetric K ey Ciphers (06)DES Algorithm, Triple DES, Cryptanlysis of DES, Differential and Linear cryptanalysis.

    Asymmetric Key Ciphers (06)Principles of Public Key Cryptosystems, RSA Systems, Knapsack Systems.

    Part B

    Message Authentication and Hash Functions (06)Authentication Requirements, Authentication Functions, Message Authentication codes, HashFunctions, Hash Algorithms (MD-5 and SHA-1), Key Management Algo.

    Digital Signatures And Authentication Protocols (04)Digital Signatures and Digital Signature Standard.

    IP Security (06)Overview, Architecture, Authentication Header, Encapsulating Security Payload (Tunnel andTransport mode)

    Firewalls (06)Design Principles, Characteristics, Capabilities, Limitations, Controls, Types of Firewall, andTrusted systems, Reference monitor concepts.

    Recommended Books1. Cryptography and Network Security (Principles and Practices) by William Stallings, 5th Ed Pearson2. A new Dimensions in Computer data security by Meyer C.H. &Matyas C.M., John Wiley & Sons.2nd Ed3. Applied Cryptography: Protocols, Algorithms, and Source Code in C, Bruce Schneier, J ophn.John Wiley 2nd Ed4. Firewalls and Internet Security, Bill Cheswick and Steve Bellovin, Addision-Wesley. 2nd Ed

  • 7/28/2019 20120719152941-changed-on-9.4

    10/25

    SECOND SEMESTER

    Paper Title: Research Methodology

    Paper Code:ME IT 201 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lecturers of one hour duration each

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part AIntroduction to Educational Research (02)Concept, types-basic, applied and action, Need for educational research

    Reviewing Literature (02)Need, Sources-Primary and Secondary, Purposes of Review, Scope of Review, Steps inconducting review

    Identifying and defining research problem (05)Locating. Analyzing stating and evaluating problem, Generating different types of hypothesesand evaluating them.

    Method of Research (08)Descriptive research design-survey, case study, content analysis, Ex-post Facto Research,Corelational and Experimental Research

    Sampling Techniques (06)Concept of population and sample sampling techniques-simple random sampling, stratifiedrandom sampling, systematic sampling and cluster sampling, snow ball sampling, purposivesampling, quota sampling techniques determining size of sample

    Part B

    Design and development of measuring instruments, Tests, questionnaires, checklists,observation schedules, evaluating research instruments, selecting a standardized test.(08)

    Procedure of data collection (03)Aspects of data collection, coding data for analysis

    Statistical Methods of Analysis (07)Descriptive statistics: Meaning, graphical representations, mean, range and standard deviation,characteristics and uses of normal curve.Inferential statistics: t-test. Chi-square tests. Correlation (rank difference and product moment),ANOVA (one way)

    Procedure for writing a research proposal (02)

  • 7/28/2019 20120719152941-changed-on-9.4

    11/25

    Purpose, types and components of research proposal

    Procedure for writing a research report (02)Audiences and types of research reports, Format of Research report and journalStrategies for evaluating, research, disseminating and utilizing research- An Overview

    Recommended Books

    1. Borg, W and Gall, M. Educational Research: An Introduction, New York, Longman,2003

    2. Cohen, L. Educational Research in class rooms and schools! A Manual of Materials andMethods NY : Harper and Row Publishers,2000

    3. CPSC: Developing Skills in Technican Education Research Modules 1 to 11 Singapore,Colombo Plan Staff College for Technician Education

    4. Garrett, HE and Woodworth, RS Statistics in Psychology andEducation, Educational Research, Bombay: Vakils Fetter and Simons Ltd. 2003

    5. Gay, LR, Educational Research, Ohio: Charles E. Merril Publishing Company 2000Wiersma William Research Methods in Education- An Introduction London, Allynand Bacon, Inc. 2000

    Paper Title: Multimedia Systems

    Paper Code:ME IT 202 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lecturers of one hour duration each

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part AMedia & Data Streams (05)

    Types of media, Properties of Multimedia system, Traditional Data Stream Characteristics, Datastream characteristics for Continuous Media,

    Sound & Audio (05)Basics Sound Concepts, Music: MIDI, Speech-Generation, Analysis and Transmission

    Images and Graphics (05)

    Digital Image Representation, Image Format, Computer Image processing-Image Synthesis,Image Analysis, Image Recognition, Image Transmission.

    Video & Animation (06)Video Signal Representation, Conventional Television Systems, EDTV, HDTV, Basic Conceptsof Computer based Animation.

    Part BData Compression (05)Source, Entropy & Hybrid Coding; Basic Compression Techniques, JPEG; H.261, MPEG, DVI

  • 7/28/2019 20120719152941-changed-on-9.4

    12/25

    Multimedia Operating System (06)Real time, Resource Management, Process Management, Files Systems, System Architecture

    Multimedia Communication Systems (06)Application Subsystems, Transport Subsystem, Quality of Service & Resource Management

    Database Systems (07)

    Multimedia DBMS, Characteristics of MDBMS, Data Analysis, Data Structure, Operation onData, Integration in Database Model.

    Recommended Book1. Multimedia :Computing ,Communications & Applications by Ralf Steinmetz Klara Nahrstedt

    Reference Books1. Multimedia In Action by James E Shuman, Thompson Wadsworth Vikas Publishing 2002 Ed.2. Multimedia In Practice: Technology and Application by Judith Jeffcoate, Prentice Hall 2nd Ed.3. Multimedia Technology and Application by David Hillman , Galgotia Publication 2001 Ed4. Multimedia Systems Design by Prabhat k. Andleigh Kiran Thakkar PHI Paperback Ed.

    5. Multimedia Syatem by John F. Koegel Buford, Pearson Education, 2008 Ed

    Paper Title: Multimedia Systems Practical

    Paper Code:ME IT 202 Max. Marks: 50 Time: 2 hours/wk

    Practicals based on theory of the same subject will be conducted.

    Paper Title: Embedded System Design

    Paper Code: MEIT 203 Max. Marks: 50 Time: 3 hoursCourse Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Introduction to Embedded System: (05)Their classification & characteristics, Concepts and Processes of system level design of

    embedded system.Micro-controllers: (08)Introduction to Micro-controllers, CPU, its architecture, pipe lining, memory organization, CPUfamily registers, addressing modes, instruction set and assembly language programming usingtimers, subroutines, Interrupts, I/O ports. Specific examples of Micro-controllers: PIC, 8051 andAVR series.Architecture Design, Task Modeling and Management: (08)Timing and clocks in Embedded Systems, Embedded software modeling and design, modeling ofmultiprocessing systems, Embedded project management.

  • 7/28/2019 20120719152941-changed-on-9.4

    13/25

    Part B

    Embedded Core based Design: (08)System on chip trends, Overview of Embedded processors like ARM, MIPS and Intel MMXseries, Architecture, Organization and Instruction set, Memory management. Data parallel issuese.g. SIMD and other high performance approaches.

    Digital Signal Processor (DSP) for Embedded System: (08)Architecture, Instruction Set and programming. Introduction to some popular DSP series e.g.DSPs of Texas Instruments.Real Time Operating System (RTOS) and RTOS based programming. (08)RTOS Overview, Basics of RT- Linux as a RTOS, Vx Works facilities, Interrupt ServiceRoutines.

    Books:1. Micro-controllers- Ajay V.Deshmukh, TMH 2005 Ed.2. Embedded System Design by Steve Heath (Newnes Publishers, 2nd Ed)3. ARM system architecture by Steve Furber (Addison Wesley) 1st Ed4. Programming Embedded System in C/C++by M.Barr (OReilly)2nd Ed5. Specifications and Design of Embedded Systems by D.D.Gajski et. El. 1st Ed,

    Pearson6. Hardware/Software Co-Design: Principles and Practices by J.Straunstrup et.el.2nd Ed,

    Springee7. Real Time Systems by H.Kopetz (Kluwer Publisher 1st Ed)8. Digital Design by Wakerly 4th Ed. Prentice Hall.

    Paper Title: Embedded System Design Practical

    Paper Code: MEIT 203 Max. Marks: 50 Time: 2 hours/wk

    Practicals based on theory of the same subject will be conducted.

    ELECTIVESGroup-I

    Paper title:Software Testing And Quality Management

    Paper code: MEIT 204 Max. Marks: 50 Time: 3 hours

    Course Duration 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part ASoftware Quality (07)Ethical Basis for Software Quality. Total quality Management Principles, Software Processesand Methodologies, Quality Standards, Practices & conventions.

  • 7/28/2019 20120719152941-changed-on-9.4

    14/25

    Software Management (09)Reviews and Audits. Enterprises Resource Planning Software, Measurement Theory, Softwarequality metrics, designing software measurement programs, organizational learning.

    Improving quality with methodologies (08)Structured Information Engineering, Object-Oriented Software, Reverse Engineering, Measuring

    Customer Satisfaction Defect Prevention, Reliability Models, Reliability Growth Models.Part B

    Software Quality Engineering (08)Defining Quality Requirements, Requirement Management, Complexity Metrics And Models,Management Issues For Software Quality, Project Tracking And Oversight, Use Of CASE ToolTechnology, Role Of Groupware, Data Quality Control.

    Project Configuration Management (06)Configuration Management Concepts, Configuration Management Process, Document Control,Configuration Management Plan of the WAR Project.

    Software Testing (07)Unit, Integration & System testing, Benchmarking and Certification.

    Paper title: Soft Computing

    Paper Code: MEIT 204 Max. Marks: 50 Time: 3 hoursCourse Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Fundamentals of Artificial Neural Networks & Applications, Characteristics of ANNs(05)

    The Biological Prototype, Perceptron, Multilayer NN (05)Learning Methods (04)Backpropagation, Counterpropagation, ART, BAN, Associative memories (05)Introduction to Fuzzy logic, Fuzzy sets, Fuzzy model, Fuzzy rule generation (04)Fuzzy inference system, Defuzzification. (04)

    Part B

    Introduction to Neuro Fuzzy Systems, Architecture of a Neuro Fuzzy systems and itsapplications (05)

    GENETIC ALGORITHM: An overview, Problem solving using GA (05)Implementation of GA & GP (04)

  • 7/28/2019 20120719152941-changed-on-9.4

    15/25

    Applications of GA & GP, Hybrid systems (04)

    Recommended Books1. Neuro fuzzy and soft computing by Jang, Pearson Education,19962. Learning and soft computing by Kecman, MIT Press 1st Ed.3. Fuzzy sets and fuzzy logic-Kir and Yuan PHI, 2005 ed4. Neurocomputing: Theory & Practice by Philip D. Wasserman, Van Nostrand Reinhold,

    2nd Ed, Addison Wesley5. Neural Network in computing Intelligence by Fu, TMH, 19946. Neural Networks and fuzzy systems by Bar Kosko, PHI,1st Ed7. An introduction to Genetic Algorithm Melanie Mitchell, PHI, 2nd Ed.

    Paper title:Theory Of Computation

    Paper Code: MEIT 204 Max. Marks: 50 Time: 3 hoursCourse Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Finite Automata (10)Finite state machine & its limitation, Regular expressions, Transition Graph, Kleene's Theorem,Equivalence Theorem.

    Turing Machine (12)Turing machine, Post machines, Finite machines with pushdown store, non-determinism, turningmachines as acceptors, formal language, primitive recursive function, halting problem,solvability of class, post correspondence problems, partial solvability.

    Part B

    Predicate calculus (15)Introduction, Basic Notations, Semantics, Equivalence Of WFFs, Normal Form Of WFFs,Validity Theorem, Natural Deduction, Rules For Connectives, Rules For Quantifiers, DerivedRules Of Inference, Rules Of Operators, The Resolution Methods, Herbands Procedure, Davis

    And Putnam's Method, The Ground Resolution Methods Unification Algorithms, The ResolutionRule.

    Verification of programs (10)Flow chart program, partial correctness, inductive assertion methods, termination

    Recommendation Books1. Mathematical theory of computation by Zohar and Manna, Pub-Dover, 2nd Ed, 20032. Theory of Computer science(Auto Mata,Language & Computation) by K.L.P Mishra and

    N. Chandrashekharan,3rdEd, PHI

  • 7/28/2019 20120719152941-changed-on-9.4

    16/25

    3. Introduction to Formal Language & Automata Peter Linz, 4th Ed, Narosa PublishersGroup-II

    Paper title:Total Quality Management

    Paper Code: MEIT 205 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Introduction (04)Quality and Total Quality Management Concepts, definition and applications of TQM.

    J ust - in- Time (J IT) (06)JIT Manufacturing and waste elimination, layout for JIT, Kanban, MRP Vs. JIT, JIT cause andeffect chain, J IT implementation and benefits.

    Total Employees Involvement (TEI) (04)Empowering employee, Team building, Quality circles, Transparent communication, Rewardand recognition, Education and training, suggestion schemes.

    Statistical Process Control (SPC) (06)7 QC Tools of problem solving. 7 New Tools, Advanced TQM Tools, Control charts.

    Part B

    Benchmarking (05)Definition, concept, process and types of benchmarking.

    Quality Systems (04)Concept of Quality Systems Standards (QSS), Relevance and origin of ISO 9000 and ISO 14000,elements, benefits.

    Customer Satisfaction (05)

    Internal and external customers, quality chain, customer focus, satisfaction and delight, customercomplaints, and redressal mechanism.

    Quality Planning Process (05)Policy deployment and implementation, Plan formulation and implementation.

    Process Management (06)Factors affecting process management, Quality Function Deployment (QPD), Quality assurancesystem and quality audit.

  • 7/28/2019 20120719152941-changed-on-9.4

    17/25

    Recommended Books1. Total Quality Management, by Dr. D.D. Sharma, Sultan Chand & Sons, New Delhi.2. Total Quality Management by Sunder Raju, Tata McGraw Hill, Delhi.3. TQM for engineers by M. Zairi, Aditya books.4. Total Quality Management Handbook by JL Hradesk, McGraw Hill.5. Environmental Engineering and Management by Dr. S.K. Dhameja.6. M/s SK Kataria & Sons, Delhi.

    Paper title:Human Resource Development & Training Methods

    Paper Code: MEIT 205 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    Introduction to Human Resource Development (06)Evolution, Mission and Purpose, Components of HRD, HRD problems and issues related toIndian Industry and technical, education, HRD in the context of new Industrial policy.

    Staff Development, Professional Development and Career Development (06)Stages Of HRD, Initial Or Induction Training, Training For Job-Related/ProfessionalDevelopment, Training For Horizontal And Vertical Mobility Of Employees.

    Concept of Training (05)Assumptions for prevailing and alternative concept of training; action through training or actionthrough force.

    Training Strategy (05)Strategic issue; basic phases; modalities in training; formulating a coherent strategy.

    Part B

    Training Methods (05)Learning on the job Training in the field, simulating real life role playing and games,incidents and cases individualized training, seminars and syndicates; lecture method.

    Developing Group and the Climate (05)The social process; indicators of group development; training climate.

    Evaluation of Training (05)Issues for evaluations; role of the training system with evaluators from other constituencies.

  • 7/28/2019 20120719152941-changed-on-9.4

    18/25

    Systems Approach to HRD (08)Assessing Need For HRD, Definition And Importance Of Needs Assessment, MethodsEmployed In Needs Assessment, (Interviews, Questionnaire, Tests, Records And Reports Study,Job Analysis And Performance Reviews), Strategies For HRD, On The Job, Off The Job,Programme Planning, Design, Implementation And Evaluation.

    Recommended Books

    1. Principles of Human Resource Development by JW Gilley and SA England.2. Human Resource Development by PP Arya and BB Tandon.3. HRD Training and Development by RF Mayer and Peter Pipe.Paper: Grid Computing

    Paper Code: MEIT 205 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B

    Part AIntroduction: (06)Grid Computing, Benefits of Grid Computing, Virtual Organizations, Grid Architecture and itsrelationship to other distributed technologies, Grid Application Areas, OGSA, OGSI,Introduction to Semantic Grids.

    Building Blocks for Grid Systems: (06)

    XML, SOAP, UDDI, Service Oriented Architecture, Web Services, Web Services Architecture,WSRF, Relationship between Grid and Web Services, Grid and Web Services Invocation

    Data Management: (05)Overview of Data Management in GT4, Data Movement: GridFTP, RFT, Data Replication: RLS,Higher level data services

    Resource Management and Scheduling: (06)Resource Management Concepts, Generalized Resource Management Framework, GridResource Management Systems, Scheduling in Grids, QoS, Introduction to GRAM.

    Part B

    Security: (08)Security Issues in Grids, Authentication Issues, Trust and Privacy related Issues, AuthorizationIssues, Grid Security Frameworks, Standards, Web Services Security Specifications

    Monitoring and Discovery Services: (04)Index Services, Resource Discovery, UDDI, Introduction to MDS in GT4.

  • 7/28/2019 20120719152941-changed-on-9.4

    19/25

    Grid Middleware and Programming Model: (10)Study of Globus Toolkit 4 Components and its Programming Model, Singleton and MultipleResources, Logging, Lifecycle Management, Notifications, Study of important distributedsystems like Legion, CRISIS.

    Text Books: Joshy Joseph, Craig Fellenstein , Grid Computing, First Edition, Pearson Education,

    2004.

    Reference Books:

    1. Ian Foster, Carl Kesselman, The Grid 2: Blueprint for a New Computing Infrastructure,Second Edition, Morgan Kaufman, 2003

    2. Bart Jacob, Michael Brown, Kentaro Fukul, Nihar Trivedi, Introduction to GridComputing, First Edition, IBM Red Books, 2005.

    3. Zarek Nabrzyski, J ennifer M. Schopf, Jan Weglarz, Grid Resource Management - Stateof the Art and Future Trends, Kluwer Academic Publishers

    4. Anirban Chakrabarti, Grid Computing Security, Springer, 20075. Borja Sotomayor, Lisa Childers, Globus Toolkit 4: Programming Java Services, First

    Edition, Morgan Kaufman, 2005.

    Paper: Advanced Digital Image Processing

    Paper Code: MEIT 205 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Section A

    Image fundamentals and Transforms: (06)Steps in Image processing, Building blocks of Digital Image Processing System, Digital Imagerepresentation, Sampling and Quantization, Basic relationship between Pixels. Problem andapplication areas of digital image processing, Fourier transforms, Discrete Fourier Transform,

    Properties of Fourier Transform, Fast Fourier Transform, Discrete Cosine Transform, Haar andslant transforms, and Hadamard transforms, Walsh Transform, Hotelling Transform, Wavelettransform, Intensity transform functions, Histogram processing,.

    Image Enhancement Techniques: (12)Spatial Domain and frequency domain approaches, Image subtraction, image average, Low-passspatial filters, Median filters, High-pass spatial filters, derivative filters , Frequency domain ideallow-pass filters, Butterworth Low pass filters, high pass filters , homomorphic filters

  • 7/28/2019 20120719152941-changed-on-9.4

    20/25

    Image Restoration: (06)Image degradation and restoration process, Noise models, Noise filters, Estimation ofdegradation function, Inverse filtering, Least Mean Square filter, interactive restoration,constrained least square restorations

    Section BColor Image Processing: (05)

    Color image representation, Color Models, Pseduocolor image processing, color transformations,noise removal in color images.

    Image Compression: (07)Coding redundancy, Inter-pixel redundancy, Psycho-visual redundancy, image compressionmodels, Huffman coding, Lossy compression techniques, Threshold coding, Vector quantization,JPEG compression

    Image Segmentation: (07)Detection of isolated points, line detection, edge detections using gradient operator & laplacian

    operator, edge linking and boundary detection, region oriented segmentation, segmentation usingthreshold, Hough transformation

    Image Representation & Object Recognition: (06)

    Boundary representation: chain codes, polygon approximation, Boundary segments, Boundarydescriptors; Simple descriptor, Fourier descriptor, Regional descriptors: Simple descriptor &Texture descriptor. Introduction to Object Recognition methods.

    Text Book:

    1. Gonzalez and Woods : Digital Image processing, Pearson educations, 2ndEdition.

    Reference Books:

    1. Anil K. Jain : Fundamentals of digital image processing, PHI.

    2. Sonka, Hlavac, Boyle : Image Processing, Analysis and Machine Vision2nd Edition, PWS Publishing.

    3. S.Annadurai & R. Shanmugalakshmi : Fundamentals of digital image processing,Pearson education, Latest edition.

  • 7/28/2019 20120719152941-changed-on-9.4

    21/25

    THIRD SEMESTER

    Paper title: Data Warehousing and Data Mining

    Paper Code: MEIT 301 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part AIntroduction to Data Warehousing (03)Data Warehousing Definition and characteristics, need for data warehousing, DBMS vs. datawarehouse, OLAP

    Data Warehousing Components (05)Overall Architecture, Data Warehouse Database, Sourcing Acquisition, Cleanup andTransformation Tools, Metadata Access Tools, Data Marts, Data Warehouse Administration andManagement, Information Delivery Systems.

    Mapping the Data Warehouse to a Multiprocessor Architecture (05)Relational Database Technology for Data warehouse, Database Architectures for ParallelProcessing, Parallel RDBMS features, Alternative Technologies, Parallel DBMS Vendors.

    Introduction to Data Mining (08)Functionalities, classification data mining systems, Multidimensional data model, data cubes,Schemas for multidimensional databases, OLAP operations, Data Marts, Metadata.

    Part BData Preprocessing (06)Data cleaning, integration and transformation, Data reduction, Discretization and ConceptHierarchy Generation.

    Concept Description (06)Data Mining techniques-Concept description, attribute oriented induction, analyticalcharacterization, mining class comparisons, mining descriptive statistical measures.

    Association Rule Mining (08)Mining single dimension rules from transactional databases, Apriori algorithm, efficiency,mining rules without candidate generation.

    Applications and Trends In Data Mining (04)Commercial Importance of DW, applications of data mining, data mining in business process,Embedded data mining.

  • 7/28/2019 20120719152941-changed-on-9.4

    22/25

    Recommended Books1. Data Mining Concepts & Techniques; J iawei Han & Micheline Kamber, Morgan

    Kaufmann Publishers.2. Data Warehouseing in the Real World; Sam Anahory & Dennis Murray; Pearson

    Education3. Data Mining by Pieter Adrians, Dolf Zantinge, Addison Wesley, 1996.4. Data Warehousing, Data Mining and OLTP; Alex Berson, 1997, McGraw Hill.5. Data Warehousing System; Mallach; 2000, McGraw Hill.6. Building the Data Warehouses; W.H.Longhman, C.Klelly, John wiley & Sons.7. Data Warehousing: Concepts, Techniques, Products and Applications, by C.S.R.

    Prabhu Prentice Hall of India.

    ELECTIVE

    GROUP-III

    Paper: NetworkManagement and Security

    Paper Code: MEIT 302 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    PART A

    Introduction (5)Classical security Techniques and Computer Network Security Concepts. Confidentiality andSecurity, Security Policy and Operations Life Cycle, Security System Development and Operations

    Secure Networking Threats (6)The Attack Process. Attacker Types. Vulnerability Types. Attack Results. Attack Taxonomy. Threatsto Security: Physical security, Biometric systems, monitoring controls, and Data security andintrusion and detection systems.

    Encryption Techniques (6)Conventional techniques, Modern techniques, DES, DES chaining, Triple DES, RSA algorithm, Keymanagement. Message Authentication and Hash Algorithm, Authentication requirements andfunctions secure Hash Algorithm, Message digest algorithm, digital signatures. AES Algorithms.

    Designing Secure Networks (8)Components of a Hardening Strategy. Network Devices. Host Operating Systems. Applications.Appliance-Based Network Services. Rogue Device Detection, Network Security Technologies TheDifficulties of Secure Networking. Security Technologies. Emerging Security Technologies GeneralDesign Considerations, Layer 2 Security Considerations. IP Addressing Design Considerations.ICMP Design Considerations. Routing Considerations. Transport Protocol Design Considerations

  • 7/28/2019 20120719152941-changed-on-9.4

    23/25

    PART - B

    Network Security Platform Options (6)Network Security Platform Options. Network Security Device Best Practices, Common ApplicationDesign Considerations. E-Mail. DNS. HTTP/HTTPS. FTP. Instant Messaging.

    IPsec VPN Design Considerations (6)VPN Basics. Types of IPsec VPNs. IPsec Modes of Operation and Security Options. TopologyConsiderations. Design Considerations. Site-to-Site Deployment Examples.

    Secure Network Management and Network Security Management (8)Organizational Realities. Protocol Capabilities. Tool Capabilities. Secure Management DesignOptions. Network Security Management, Firewalls, Trusted systems, IT act and cyber laws.

    Text:1. Sean Convery, Network Security Architectures, Published by Cisco Press, First Ed. 20042. William Stalling Cryptography and Network Security Pearson Education

    References:1. Charels P. Pfleeger Security in Computing Prentice Hall2. Jeff Crume Inside Internet Security Addison Wesley

    Paper title: User Interface Design

    Paper Code: MEIT 302 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    User Interface: An introduction and overview (06)Importance of user interface, goals of user interface design, characteristics of graphical and webuser interfaces

    The User Interface Design Process (05)Obstacles And Pitfalls In The Development Path, Usability, The Design Team, Managing DesignProcess.

    Human Computer Interaction (08)Importance Human Characteristics In Design, Cognitive Engineering, Mental Models, UserPsychology, Interaction Styles And Hypermedia.

    Visual C++Basics (06)Introduction to Visual C++, building a basic applications, Visual C++resources.

  • 7/28/2019 20120719152941-changed-on-9.4

    24/25

    Part B

    Graphical User Interface (08)Creating menus, working of menus, dialog boxes, combo box, child windows, buttons, checkboxes, radio buttons.

    Visual C++and Database Management (08)

    Open Database Connectivity, Data Access Objects, OLE-DB, building a database applicationusing ODBC.

    Application Development in Visual C++ (04)Designing application with security, building a help file, packaging the application.

    Recommended Books1. Designing the user interface, Ben Shneiderman, Third Edition, Pearson Education.2. Johan Paul Mueller: Visual C++from the Ground UP (PHI Publication), 2nd Edition.3. Nathan Gurewich and Ori: Visual C++(Techmedia), 2nd edition4. The Essential Guide to User Interface Design: Wilbert O. Galitz, WILEY, 2nd edition.

    Paper title: Advanced Computer Networks

    Paper code: MEIT 302 Max. Marks: 50 Time: 3 hours

    Course Duration: 45 lectures of one hour each.

    Note: Examiner shall set eight questions, 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 fromPart A and Part B.

    Part A

    INTRODUCTION (05)Overview of computer networks, seven-layer architecture, TCP/IP suite of protocols, etc.

    MEDIUMACCESS (5)MAC protocols for high-speed LANS, MANs, and wireless LANs. (For example, FDDI, DQDB,HIPPI, Gigabit Ethernet, Wireless ethernet, etc.)

    INTERNETWORKING AND ROUTING (7)

    Packet Switching, The Internetworking Problem, The IP/TCP split connections, Scaling IP,Routers: Forwarding and Routing, The IP forwarding path, Unicast Internet routing: Intra andInter domain routing, Router Design and Implementation, Security problems with InternetArchitecture, IPV6.

    RESOURCE MANAGEMENT (6)End-to-End Congestion Control, Router-Assisted Congestion Control: Active QueueManagement, Fair Queuing and Variants, Modeling and Measurement: Packet Trains, TCPCongestion Control Impediments, Adaptive Network Applications.

  • 7/28/2019 20120719152941-changed-on-9.4

    25/25

    Part B

    QUALITY OF SERVICE (QOS) (04)Why QoS; Basic Models and Architecture, Mechanisms and Properties, Modeling andMeasurement: Traffic Self-Similarity; Virus Propagation.

    GROUP COMMUNICATION (05)Multicast Routing and Transport, IP Multicasting: Multicast routing protocols, addressassignments, session discovery etc., Multicasting in mobile networks.

    TRANSPORT LAY ER PROTOCOL (05)TCP protocol dynamics, TCP extensions for high-speed networks, transaction-orientedapplications. Other new options in TCP.

    WIREL ESS NETWORKS (03)Wireless LAN architecture, Mobile IP, Broadcast file system, Agent technology, Satellitetechnology.

    SECURITY (05)Network security at various layers. Secure-HTTP, SSL, ESP, Authentication header, Keydistribution protocols. Digital signatures, digital certificates.

    BOOKS:Andrew Tanenbaum. Computer Networks, PHI

    REFERENCES:

    1. W. R. Stevens. TCP/IP Illustrated, Volume 1: The protocols, Addison Wesley, 1994.2. G. R. Wright. TCP/IP Illustrated, Volume 2: The Implementation, Addison Wesley,1995.

    3. W. R. Stevens. TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, andthe Unix Domain Protocols, Addison Wesley, 1996.

    4. R. Handel, M. N. Huber, and S. Schroeder. ATM Networks: Concepts, Protocols,Applications, Addison Wesley, 1998.

    5. W. Stallings. Cryptography and Network Security: Principles and Practice, 2nd Ed.,Prentice Hall, 1998.

    6 . CE Perkins, B. Woolf, and S. R. Alpert. Mobile IP: Design Principles and Practices,Addison Wesley, 1997.