MASTER OF ENGINEERING IN INFORMATION TECHNOLOGY
First Semester
Paper title: Algorithm Analysis and Design
Paper Code: MEIT 101 Max. Marks: 100 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 from
Part A and Part B.
Part A
Analysis of Algorithms (7)
Asymptotic analysis : upper and average complexity bounds . Identifying differences among
best,average and worst Case Behaviors. Big O, little O, omega and theta notations.Standard
complexity classes. Empirical measurements of performance. Time and space tradeoffs in
algorithms. Analyzing recursive algorithms using recurrence relations, Amortized analysis
Divide and Conquer algorithms and Dynamic Programming (7)
Introduction,Quick sort, Strassen’s multiplication, Knapsack problem, Minimum spanning tree,
Single source shortest path algorithm and their performance analysis
Branch and Bound techniques (5)
0-1 knapsack problem, Traveling salesman problem
Part B
Dynamic 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 problem
Linear Programming and Reductions (6)
Introduction, Flow of Networks, Bipartite Matching, Duality, Zero sum games, The simplex
algorithm
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 Books
1. Cormen, Leiserson, Rivest and Stein,” Introduction to Algorithms”, PHI.
2. Horowitz, Sahni and Rajsekaran, “Fundamentals of Computer Algorithms”, Galgotia
publications.
References
1. Dasgupta, Papadimitriou,Vazirani : “Algorithms” , Tata Mc GrawHill, Ed No-1/2006
2. 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: 100 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 from
Part A and Part B.
Part A
Object Oriented Concepts (02)
Difference between Procedure-Oriented and Object-Oriented Programming, Basic Concepts of
Object Oriented Programming, Abstract data types: Object, Classes, Data Abstraction and
Encapsulation, Inheritance, Polymorphism.
C++ Programming Language and 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, Class
Function Definition, Member Function Definition, Private and Public Member Function, Nesting
of Member Functions, Memory Allocation for objects, Array of objects, Objects as Function
Arguments.
Inheritance: Extending Classes (05)
Base and Derived Classes, Visibility Modes, Concept of Protected Member, Types of
Inheritance- Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical
Inheritance, 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.
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, File
Pointers 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 Object
Oriented Design, System analysis, System Design, Object Design
Object Oriented Methodologies (04)
OMT methodology, Object Model, Dynamic Model, Function Model, Relationship among
models, Jacksons Model, Booch’s 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 Publications
Pvt. Ltd., 1994, paperback Ed
4. Programming with C++, D.Ravichandran, Tata McGraw Hill, 1996, 3rd Ed.
5. Object Oriented Programming with C++, Balagurusamy, Tata McGraw Hill
Publishing Co. Ltd., 2000, 4th Ed.
Paper title: Distributed Operating System
Paper Code: MEIT 103 Max.Marks:100 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 from
Part A and Part B.
Part A
Operating System Structures (05)
Review of structures: monolithic kernel, layered systems, virtual machines, Process based
models and client server.
Distributed Systems (08)
The micro-kernel based client-server approach. Inter process communication and Remote
Procedure Call. Tasks and Threads. Examples from LINUX, Solaris 2 and Windows NT.
Resource Management (08)
Resource allocation and deadlock. Deadlock prevention, avoidance and detection. Resource
management in distributed systems: Logical time, reaching agreement, failure recovery and
distributed deadlocks.
Part B
Protection and Security (08)
Requirements for protection and security regimes. The access matrix model of protection.
System and user modes, rings of protection, access lists, capabilities. User authentication,
passwords and signatures.
File Systems (09)
Issues in the design of distributed file systems: naming, transparency, update semantics and fault
resilience. Use of the Virtual File system layer. Examples of distributed systems including Sun
NFS, and Coda files system. Design of the sever file system. Example systems: NTFS, Unix ext2
and ext3.
Middleware (07)
The common Object Request Broker Architecture and Microsoft DCOM models and software
and their relationship to Operating Systems.
Recommended Books
1. Distributed Systems: Principles and Paradigms by Andrew S.. Tanenbaum,2nd Ed
2. Distributed Operating Systems by Andrew S. Tanenbaum, 1st Ed, Pearson Publishers
3. Distributed Operating Systems: Concepts and Design by Sinha Pradeep K. 3rd Ed, IEEE
Press Publication
Paper Title: Wireless & Mobile Communication
Paper code: MEIT 104 Max. Marks : 100 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 from
Part A and Part B.
Part A
Introduction (08)
Evolution of Mobile radio Communication, reasons for developing a cellular mobile telephone
system, 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 adjacent
interference, improving coverage and capacity in cellular systems, mechanism for capacity
improvement-cell splitting, cell sectoring and microcell zone concept
Multiple Access Techniques (06)
Introduction, FDMA, TDMA, CDMA, comparison of multiple access techniques, packet ratio
and SDMA.
Part B
GSM: (05)
Introduction, design consideration, characteristics, services, system architecture, security aspects
and architecture, GSM channels and burst structure.
CDMA (IS-95): (05)
Introduction, service aspects, network reference model, security aspects and architecture, radio
aspects, features of CDMA system.
Receiver techniques for fading dispersive channels: (07)
Fading, types of fading, overview of channel impairment, Mitigation techniques, Diversity
schemes : 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, Prentice
Hall India, Edi 2nd .
2. Wireless and Cellular Communication by Sanjay Sharma , S.K.Kataria & Co., 2009 Ed
3. Mobile and Personal Communication Systems and services by Raj Pandya, IEEE Press,
Ed 1999.
Paper Title: Information Security
Paper Code: MEIT 105 Max. Marks: 100 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 from
Part A and Part B.
Part A
Foundation of Cryptography (07)
Introduction to Cryptography, Types of Threats-Passive threats, Active threats, Monoalphabetic
Substitution Cipher, Polyalphabetic Substitution Cipher, Transposition Cipher.
Cipher (04)
Block and Stream ciphers, Secret key block ciphers, Stream ciphers
Symmetric Key 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, Hash
Functions, 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 and
Transport mode)
Firewalls (06)
Design Principles, Characteristics, Capabilities, Limitations, Controls, Types of Firewall, and
Trusted systems, Reference monitor concepts.
Recommended Books
1. Cryptography and Network Security (Principles and Practices) by William Stallings, 5th Ed Pearson
2. A new Dimensions in Computer data security by Meyer C.H. &Matyas C.M., John Wiley & Sons.2nd Ed
3. Applied Cryptography: Protocols, Algorithms, and Source Code in C, Bruce Schneier, Jophn.John Wiley 2nd Ed
4. Firewalls and Internet Security, Bill Cheswick and Steve Bellovin, Addision-Wesley. 2nd Ed
SECOND SEMESTER
Paper Title: Research Methodology
Paper Code: ME IT 201 Max. Marks: 100 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 from
Part A and Part B.
Part A
Introduction 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 in
conducting review
Identifying and defining research problem (05)
Locating. Analyzing stating and evaluating problem, Generating different types of hypotheses
and 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, stratified
random sampling, systematic sampling and cluster sampling, snow ball sampling, purposive
sampling, 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)
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 journal
Strategies for evaluating, research, disseminating and utilizing research- An Overview
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 and
Methods 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 and
Education, Educational Research, Bombay: Vakils Fetter and Simons Ltd. 2003
5. Gay, LR, Educational Research, Ohio: Charles E. Merril Publishing Company 2000
Wiersma William Research Methods in Education- An Introduction London, Allyn
and Bacon, Inc. 2000
Paper Title: Multimedia Systems
Paper Code: ME IT 202 Max. Marks: 100 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 from
Part A and Part B.
Part A
Media & Data Streams (05)
Types of media, Properties of Multimedia system, Traditional Data Stream Characteristics, Data
stream 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 Concepts
of Computer based Animation.
Part B
Data Compression (05)
Source, Entropy & Hybrid Coding; Basic Compression Techniques, JPEG; H.261, MPEG, DVI
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 on
Data, Integration in Database Model.
Recommended Books
Basic Book: Multimedia :Computing ,Communications & Applications by Ralf Steinmetz
Klara Nahrstedt
1. 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 Ed
4. 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:Embedded System Design
Paper Code: MEIT 203 Max. Marks: 100 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 from
Part 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, CPU
family registers, addressing modes, instruction set and assembly language programming using
timers, subroutines, Interrupts, I/O ports. Specific examples of Micro-controllers: PIC, 8051 and
AVR series.
Architecture Design, Task Modeling and Management: (08)
Timing and clocks in Embedded Systems, Embedded software modeling and design, modeling of
multiprocessing systems, Embedded project management.
Part B
Embedded Core based Design: (08)
System on chip trends, Overview of Embedded processors like ARM, MIPS and Intel MMX
series, Architecture, Organization and Instruction set, Memory management. High- level logic
synthesis. Introduction to FPGA. Data parallel issues e.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 Service
Routines.
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 Ed
4. Programming Embedded System in C/C++ by M.Barr (O’Reilly)2nd Ed
5. Specifications and Design of Embedded Systems by D.D.Gajski et. El. 1st Ed,
Pearson
6. Hardware/Software Co-Design: Principles and Practices by J.Straunstrup et.el.2nd Ed,
Springee
7. Real Time Systems by H.Kopetz (Kluwer Publisher 1st Ed)
8. Digital Design by Wakerly 4th Ed. Prentice Hall.
9. Principles of CMOS VLSI Design by Neil HE Weste & Eashraghian, Pearson
Education.4th Ed.
Paper Title:Embedded System Design (Practical):
1. PIC Programming.
2. PIC microcontroller based projects.
3. FPGA serial communication controller.
ELECTIVE
Group-I
Paper title: Software Testing And Quality Management
Paper code: MEIT 204 Max. Marks: 100 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 from
Part A and Part B.
Part A
Software Quality (07)
Ethical Basis for Software Quality. Total quality Management Principles, Software Processes
and Methodologies, Quality Standards, Practices & conventions.
Software Management (09)
Reviews and Audits. Enterprises Resource Planning Software, Measurement Theory, Software
quality 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 Tool
Technology, 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: 100 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 from
Part 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 its
applications (05)
GENETIC ALGORITHM: An overview, Problem solving using GA (05)
Implementation of GA & GP (04)
Applications of GA & GP, Hybrid systems (04)
Recommended Books
1. Neuro fuzzy and soft computing by Jang, Pearson Education,1996
2. Learning and soft computing by Kecman, MIT Press 1st Ed.
3. Fuzzy sets and fuzzy logic-Kir and Yuan PHI, 2005 ed
4. Neurocomputing: Theory & Practice by Philip D. Wasserman, Van Nostrand Reinhold,
2nd Ed, Addison Wesley
5. Neural Network in computing Intelligence by Fu, TMH, 1994
6. Neural Networks and fuzzy systems by Bar Kosko, PHI,1st Ed
7. An introduction to Genetic Algorithm – Melanie Mitchell, PHI, 2nd Ed.
Paper title: Theory Of Computation
Paper Code: MEIT 204 Max. Marks: 100 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 from
Part 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, turning
machines 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, Derived
Rules Of Inference, Rules Of Operators, The Resolution Methods, Herbands Procedure, Davis
And Putnam's Method, The Ground Resolution Methods Unification Algorithms, The Resolution
Rule.
Verification of programs (10)
Flow chart program, partial correctness, inductive assertion methods, termination
Recommendation Books
1. Mathematical theory of computation by Zohar and Manna, Pub-Dover, 2nd Ed, 2003
2. Theory of Computer science(Auto Mata,Language & Computation) by K.L.P Mishra and
N. Chandrashekharan,3rd Ed, PHI
3. Introduction to Formal Language & Automata Peter Linz, 4th Ed, Narosa Publishers
Group-II
Paper title: Total Quality Management
Paper Code: MEIT 205 Max. Marks: 100 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 from
Part A and Part B.
Part A
Introduction (04)
Quality and Total Quality Management – Concepts, definition and applications of TQM.
Just - in- Time (JIT) (06)
JIT Manufacturing and waste elimination, layout for JIT, Kanban, MRP Vs. JIT, JIT cause and
effect chain, JIT implementation and benefits.
Total Employees Involvement (TEI) (04)
Empowering employee, Team building, Quality circles, Transparent communication, Reward
and 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, customer
complaints, 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 assurance
system and quality audit.
Recommended Books
1. 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: 100 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 from
Part A and Part B.
Part A
Introduction to Human Resource Development (06)
Evolution, Mission and Purpose, Components of HRD, HRD problems and issues related to
Indian 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/Professional
Development, Training For Horizontal And Vertical Mobility Of Employees.
Concept of Training (05)
Assumptions for prevailing and alternative concept of training; action through training or action
through 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.
Systems Approach to HRD (08)
Assessing Need For HRD, Definition And Importance Of Needs Assessment, Methods
Employed 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: Network Management and Security
Paper Code: MEIT 205 Max. Marks: 100 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 from
Part A and Part B.
PART – A
Introduction (5)
Classical security Techniques and Computer Network Security Concepts. Confidentiality and
Security, 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. Threats
to Security: Physical security, Biometric systems, monitoring controls, and Data security and
intrusion and detection systems.
Encryption Techniques (6)
Conventional techniques, Modern techniques, DES, DES chaining, Triple DES, RSA algorithm, Key
management. Message Authentication and Hash Algorithm, Authentication requirements and
functions 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 The
Difficulties of Secure Networking. Security Technologies. Emerging Security Technologies General
Design Considerations, Layer 2 Security Considerations. IP Addressing Design Considerations.
ICMP Design Considerations. Routing Considerations. Transport Protocol Design Considerations
PART - B
Network Security Platform Options (6)
Network Security Platform Options. Network Security Device Best Practices, Common Application
Design 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. Topology
Considerations. Design Considerations. Site-to-Site Deployment Examples.
Secure Network Management and Network Security Management (8)
Organizational Realities. Protocol Capabilities. Tool Capabilities. Secure Management Design
Options. Network Security Management, Firewalls, Trusted systems, IT act and cyber laws.
Text:
1. Sean Convery, “ Network Security Architectures, Published by Cisco Press, First Ed. 2004
2. William Stalling “Cryptography and Network Security” Pearson Education
References:
1. Charels P. Pfleeger “Security in Computing” Prentice Hall
2. Jeff Crume “Inside Internet Security” Addison Wesley
Paper: Advanced Digital Image Processing
Paper Code: MEIT 205 Max. Marks: 100 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 from
Part A and Part B.
Section A
Image fundamentals and Transforms: (06)
Steps in Image processing, Building blocks of Digital Image Processing System, Digital Image
representation, Sampling and Quantization, Basic relationship between Pixels. Problem and
application areas of digital image processing, Fourier transforms, Discrete Fourier Transform,
Properties of Fourier Transform, Fast Fourier Transform, Discrete Cosine Transform, Haar and
slant transforms, and Hadamard transforms, Walsh Transform, Hotelling Transform, Wavelet
transform, Intensity transform functions, Histogram processing,.
Image Enhancement Techniques: (12)
Spatial Domain and frequency domain approaches, Image subtraction, image average, Low-pass
spatial filters, Median filters, High-pass spatial filters, derivative filters , Frequency domain ideal
low-pass filters, Butterworth Low pass filters, high pass filters , homomorphic filters
Image Restoration: (06)
Image degradation and restoration process, Noise models, Noise filters, Estimation of
degradation function, Inverse filtering, Least Mean Square filter, interactive restoration,
constrained least square restorations
Section B
Color 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 compression
models, 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 using
threshold, Hough transformation
Image Representation & Object Recognition: (06)
Boundary representation: chain codes, polygon approximation, Boundary segments, Boundary
descriptors; 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, 2nd
Edition.
Reference Books:
1. Anil K. Jain : Fundamentals of digital image processing, PHI.
2. Sonka, Hlavac, Boyle : Image Processing, Analysis and Machine Vision
2nd Edition, PWS Publishing.
3. S.Annadurai & R. Shanmugalakshmi : Fundamentals of digital image processing,
Pearson education, Latest edition.
THIRD SEMESTER
Paper title: Data Warehousing and Data Mining
Paper Code: MEIT 301 Max. Marks: 100 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 from
Part A and Part B.
Part A
Introduction to Data Warehousing (03)
Data Warehousing Definition and characteristics, need for data warehousing, DBMS vs. data
warehouse, OLAP
Data Warehousing Components (05)
Overall Architecture, Data Warehouse Database, Sourcing Acquisition, Cleanup and
Transformation Tools, Metadata Access Tools, Data Marts, Data Warehouse Administration and
Management, Information Delivery Systems.
Mapping the Data Warehouse to a Multiprocessor Architecture (05)
Relational Database Technology for Data warehouse, Database Architectures for Parallel
Processing, 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 B
Data Preprocessing (06)
Data cleaning, integration and transformation, Data reduction, Discretization and Concept
Hierarchy Generation.
Concept Description (06)
Data Mining techniques-Concept description, attribute oriented induction, analytical
characterization, 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.
Recommended Books
1. Data Mining –Concepts & Techniques; Jiawei Han & Micheline Kamber, Morgan
Kaufmann Publishers.
2. Data Warehouseing in the Real World; Sam Anahory & Dennis Murray; Pearson
Education
3. “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.
GROUP-III
Paper Title: Advanced Digital Signal Processing
Paper Code: MEIT 302 Max. Marks: 100 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 from
Part A and Part B.
Part A
Transformations: (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 circular
convolution 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), Cascade
form, 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 of
Butterworth, Chebyshev Filter using above methods.
Part B
Finite Word Length Effects: (05)
Analysis of Finite Word Length Effects. Quantization process & errors, A/D conversion noise
analysis, Analysis of arithmetic round- off errors, Dynamic range scaling, Reduction of product
round-off errors ,limit cycles in IIR filters, round-off errors in FFT algorithms.
Introduction of Multi-rate Digital signal Processing: (08)
Filter Banks, Subband Coding, Wavelet Transform-Multi Resolution Analysis, Scaling Functions
And Wavelets, Its Relation To Multi –Rate Filter Banks.
DSP Chips: (08)
DSP chips and their applications.ADSP 21xx architecture and instruction set.
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 & Johnson
5. Theory and Applications of Digital Signal Processing by Rabiner & Gold
Paper title: User Interface Design
Paper Code: MEIT 302 Max. Marks: 100 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 from
Part 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 web
user interfaces
The User Interface Design Process (05)
Obstacles And Pitfalls In The Development Path, Usability, The Design Team, Managing Design
Process.
Human Computer Interaction (08)
Importance Human Characteristics In Design, Cognitive Engineering, Mental Models, User
Psychology, Interaction Styles And Hypermedia.
Visual C++ Basics (06)
Introduction to Visual C++, building a basic applications, Visual C++ resources.
Part B
Graphical User Interface (08)
Creating menus, working of menus, dialog boxes, combo box, child windows, buttons, check
boxes, radio buttons.
Visual C++ and Database Management (08)
Open Database Connectivity, Data Access Objects, OLE-DB, building a database application
using ODBC.
Application Development in Visual C++ (04)
Designing application with security, building a help file, packaging the application.
Recommended Books
1. 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 edition
4. The Essential Guide to User Interface Design: Wilbert O. Galitz, WILEY, 2nd edition.
Paper title: Advanced Computer Networks
Paper code: MEIT 302 Max. Marks: 100 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 from
Part A and Part B.
Part A
Overview: (02)
Elements of computer Network. Computing Models. Networking Topologies. Peer-to- Peer and
Client-server configuration. Broadcast, and Point-to-Point networks. LAN, MAN and WAN,
Packet Switching. Datagram and Virtual Circuit networks.
The OSI reference model layer entities, layer interfaces and service access points. Connectionoriented
and Connectionless services. Reliable and unreliable services. Services primitives.
TCP/IP reference model.
Hubs, Bridges, Switches, Routers and Gateways.
Data link layer: (05)
Flow-control protocols: Stop-and-wait and Sliding-window. ARQ based Error Control and
performance evaluation. Link protocols: HDLC and SLIP and PPP protocols.
Local/Personal Area Networks: (06)
IEEE LAN standards: 802.3 (CSMA/CD), Gigabit Ethernet, Bluetooth 802.11 based Wireless
LAN and 802.16. (Broadband wireless)
Network Layer: (06)
Routing: Dijkstra’s Shortest Path Routing, Flooding, Distance-Vector Routing, Link-State
Routing, Hierarchical Routing, Broadcast Routing And Multicast Routing.
Congestion control: Principles and policies of congestion control in Virtual-circuit and Datagram
subnets.
Load shedding and Jitter control.
Quality of service: Techniques for achieving good QoS. Integrated Services. Differentiated
Services. Label Switching and MPLS.
Part B
Internetworking: (06)
Tunneling, Fragmentation. IP addresses. Subnetting and supernetting. Classless Inter-Domain
Routing (CIDR). Network Address Translation (NAT).
Internet protocols: IPv-4, ICMP,ARP,DHCP,OSPF,BGP and IPv6.
Wide Area Networks: X-25, Frame relay, ATM. (05)
Transport Layer: (06)
Transport layer protocol issues: addressing, establishing connection, releasing connection, flow
control and multiplexing. TCP and UDP.
Network Applications: (06)
DNS, Electronic Mail, TELNET, FTP, SNMP. World-Wide Web Multi-Media.
Network Security: (03)
Introduction to Cryptography. Symmetric- Key and Public Key algorithms. Digital Signatures.
Recommended Books
1. Tanenbaum, A.S. Computer Networks, 4th Edition, PHI
2. Stallings, William Data and Computer Communications, 7th Edition, PHI
3. Forouzan Data Communication And Networks, 2nd Edition, Tata McGraw Hill
4. Comer, D.E., Computer Networks And Internets, 2nd Edition, Delhi: Pearson Education Asia,
1998.
5. Keshav, S., Engineering Approach To Computer Networking: ATM Networks, The Internet,
and The Telephone Network. Addison-Wesely professional computing series, International
student edition, 1997 Edition,
6. Pahlavan, K. and Krishnamurthy, P., Principles of Wireless Networks, 2002; Delhi: Pearson
Education.
7. Stallings, W., High-Speed Networks and Internets: Performance and Quality of Service, 2nd
Edition, Delhi: Pearson Education Asia, 2002.
8. Sheldon, Tom Encyclopedia Of Networking, TMH.
9. Stevens, R.W.TCP/IP Illustrated, vol.1: the protocols, Addison-Wesely.
First Semester
Paper title: Algorithm Analysis and Design
Paper Code: MEIT 101 Max. Marks: 100 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 from
Part A and Part B.
Part A
Analysis of Algorithms (7)
Asymptotic analysis : upper and average complexity bounds . Identifying differences among
best,average and worst Case Behaviors. Big O, little O, omega and theta notations.Standard
complexity classes. Empirical measurements of performance. Time and space tradeoffs in
algorithms. Analyzing recursive algorithms using recurrence relations, Amortized analysis
Divide and Conquer algorithms and Dynamic Programming (7)
Introduction,Quick sort, Strassen’s multiplication, Knapsack problem, Minimum spanning tree,
Single source shortest path algorithm and their performance analysis
Branch and Bound techniques (5)
0-1 knapsack problem, Traveling salesman problem
Part B
Dynamic 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 problem
Linear Programming and Reductions (6)
Introduction, Flow of Networks, Bipartite Matching, Duality, Zero sum games, The simplex
algorithm
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 Books
1. Cormen, Leiserson, Rivest and Stein,” Introduction to Algorithms”, PHI.
2. Horowitz, Sahni and Rajsekaran, “Fundamentals of Computer Algorithms”, Galgotia
publications.
References
1. Dasgupta, Papadimitriou,Vazirani : “Algorithms” , Tata Mc GrawHill, Ed No-1/2006
2. 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: 100 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 from
Part A and Part B.
Part A
Object Oriented Concepts (02)
Difference between Procedure-Oriented and Object-Oriented Programming, Basic Concepts of
Object Oriented Programming, Abstract data types: Object, Classes, Data Abstraction and
Encapsulation, Inheritance, Polymorphism.
C++ Programming Language and 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, Class
Function Definition, Member Function Definition, Private and Public Member Function, Nesting
of Member Functions, Memory Allocation for objects, Array of objects, Objects as Function
Arguments.
Inheritance: Extending Classes (05)
Base and Derived Classes, Visibility Modes, Concept of Protected Member, Types of
Inheritance- Single Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical
Inheritance, 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.
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, File
Pointers 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 Object
Oriented Design, System analysis, System Design, Object Design
Object Oriented Methodologies (04)
OMT methodology, Object Model, Dynamic Model, Function Model, Relationship among
models, Jacksons Model, Booch’s 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 Publications
Pvt. Ltd., 1994, paperback Ed
4. Programming with C++, D.Ravichandran, Tata McGraw Hill, 1996, 3rd Ed.
5. Object Oriented Programming with C++, Balagurusamy, Tata McGraw Hill
Publishing Co. Ltd., 2000, 4th Ed.
Paper title: Distributed Operating System
Paper Code: MEIT 103 Max.Marks:100 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 from
Part A and Part B.
Part A
Operating System Structures (05)
Review of structures: monolithic kernel, layered systems, virtual machines, Process based
models and client server.
Distributed Systems (08)
The micro-kernel based client-server approach. Inter process communication and Remote
Procedure Call. Tasks and Threads. Examples from LINUX, Solaris 2 and Windows NT.
Resource Management (08)
Resource allocation and deadlock. Deadlock prevention, avoidance and detection. Resource
management in distributed systems: Logical time, reaching agreement, failure recovery and
distributed deadlocks.
Part B
Protection and Security (08)
Requirements for protection and security regimes. The access matrix model of protection.
System and user modes, rings of protection, access lists, capabilities. User authentication,
passwords and signatures.
File Systems (09)
Issues in the design of distributed file systems: naming, transparency, update semantics and fault
resilience. Use of the Virtual File system layer. Examples of distributed systems including Sun
NFS, and Coda files system. Design of the sever file system. Example systems: NTFS, Unix ext2
and ext3.
Middleware (07)
The common Object Request Broker Architecture and Microsoft DCOM models and software
and their relationship to Operating Systems.
Recommended Books
1. Distributed Systems: Principles and Paradigms by Andrew S.. Tanenbaum,2nd Ed
2. Distributed Operating Systems by Andrew S. Tanenbaum, 1st Ed, Pearson Publishers
3. Distributed Operating Systems: Concepts and Design by Sinha Pradeep K. 3rd Ed, IEEE
Press Publication
Paper Title: Wireless & Mobile Communication
Paper code: MEIT 104 Max. Marks : 100 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 from
Part A and Part B.
Part A
Introduction (08)
Evolution of Mobile radio Communication, reasons for developing a cellular mobile telephone
system, 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 adjacent
interference, improving coverage and capacity in cellular systems, mechanism for capacity
improvement-cell splitting, cell sectoring and microcell zone concept
Multiple Access Techniques (06)
Introduction, FDMA, TDMA, CDMA, comparison of multiple access techniques, packet ratio
and SDMA.
Part B
GSM: (05)
Introduction, design consideration, characteristics, services, system architecture, security aspects
and architecture, GSM channels and burst structure.
CDMA (IS-95): (05)
Introduction, service aspects, network reference model, security aspects and architecture, radio
aspects, features of CDMA system.
Receiver techniques for fading dispersive channels: (07)
Fading, types of fading, overview of channel impairment, Mitigation techniques, Diversity
schemes : 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, Prentice
Hall India, Edi 2nd .
2. Wireless and Cellular Communication by Sanjay Sharma , S.K.Kataria & Co., 2009 Ed
3. Mobile and Personal Communication Systems and services by Raj Pandya, IEEE Press,
Ed 1999.
Paper Title: Information Security
Paper Code: MEIT 105 Max. Marks: 100 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 from
Part A and Part B.
Part A
Foundation of Cryptography (07)
Introduction to Cryptography, Types of Threats-Passive threats, Active threats, Monoalphabetic
Substitution Cipher, Polyalphabetic Substitution Cipher, Transposition Cipher.
Cipher (04)
Block and Stream ciphers, Secret key block ciphers, Stream ciphers
Symmetric Key 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, Hash
Functions, 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 and
Transport mode)
Firewalls (06)
Design Principles, Characteristics, Capabilities, Limitations, Controls, Types of Firewall, and
Trusted systems, Reference monitor concepts.
Recommended Books
1. Cryptography and Network Security (Principles and Practices) by William Stallings, 5th Ed Pearson
2. A new Dimensions in Computer data security by Meyer C.H. &Matyas C.M., John Wiley & Sons.2nd Ed
3. Applied Cryptography: Protocols, Algorithms, and Source Code in C, Bruce Schneier, Jophn.John Wiley 2nd Ed
4. Firewalls and Internet Security, Bill Cheswick and Steve Bellovin, Addision-Wesley. 2nd Ed
SECOND SEMESTER
Paper Title: Research Methodology
Paper Code: ME IT 201 Max. Marks: 100 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 from
Part A and Part B.
Part A
Introduction 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 in
conducting review
Identifying and defining research problem (05)
Locating. Analyzing stating and evaluating problem, Generating different types of hypotheses
and 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, stratified
random sampling, systematic sampling and cluster sampling, snow ball sampling, purposive
sampling, 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)
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 journal
Strategies for evaluating, research, disseminating and utilizing research- An Overview
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 and
Methods 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 and
Education, Educational Research, Bombay: Vakils Fetter and Simons Ltd. 2003
5. Gay, LR, Educational Research, Ohio: Charles E. Merril Publishing Company 2000
Wiersma William Research Methods in Education- An Introduction London, Allyn
and Bacon, Inc. 2000
Paper Title: Multimedia Systems
Paper Code: ME IT 202 Max. Marks: 100 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 from
Part A and Part B.
Part A
Media & Data Streams (05)
Types of media, Properties of Multimedia system, Traditional Data Stream Characteristics, Data
stream 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 Concepts
of Computer based Animation.
Part B
Data Compression (05)
Source, Entropy & Hybrid Coding; Basic Compression Techniques, JPEG; H.261, MPEG, DVI
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 on
Data, Integration in Database Model.
Recommended Books
Basic Book: Multimedia :Computing ,Communications & Applications by Ralf Steinmetz
Klara Nahrstedt
1. 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 Ed
4. 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:Embedded System Design
Paper Code: MEIT 203 Max. Marks: 100 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 from
Part 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, CPU
family registers, addressing modes, instruction set and assembly language programming using
timers, subroutines, Interrupts, I/O ports. Specific examples of Micro-controllers: PIC, 8051 and
AVR series.
Architecture Design, Task Modeling and Management: (08)
Timing and clocks in Embedded Systems, Embedded software modeling and design, modeling of
multiprocessing systems, Embedded project management.
Part B
Embedded Core based Design: (08)
System on chip trends, Overview of Embedded processors like ARM, MIPS and Intel MMX
series, Architecture, Organization and Instruction set, Memory management. High- level logic
synthesis. Introduction to FPGA. Data parallel issues e.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 Service
Routines.
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 Ed
4. Programming Embedded System in C/C++ by M.Barr (O’Reilly)2nd Ed
5. Specifications and Design of Embedded Systems by D.D.Gajski et. El. 1st Ed,
Pearson
6. Hardware/Software Co-Design: Principles and Practices by J.Straunstrup et.el.2nd Ed,
Springee
7. Real Time Systems by H.Kopetz (Kluwer Publisher 1st Ed)
8. Digital Design by Wakerly 4th Ed. Prentice Hall.
9. Principles of CMOS VLSI Design by Neil HE Weste & Eashraghian, Pearson
Education.4th Ed.
Paper Title:Embedded System Design (Practical):
1. PIC Programming.
2. PIC microcontroller based projects.
3. FPGA serial communication controller.
ELECTIVE
Group-I
Paper title: Software Testing And Quality Management
Paper code: MEIT 204 Max. Marks: 100 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 from
Part A and Part B.
Part A
Software Quality (07)
Ethical Basis for Software Quality. Total quality Management Principles, Software Processes
and Methodologies, Quality Standards, Practices & conventions.
Software Management (09)
Reviews and Audits. Enterprises Resource Planning Software, Measurement Theory, Software
quality 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 Tool
Technology, 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: 100 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 from
Part 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 its
applications (05)
GENETIC ALGORITHM: An overview, Problem solving using GA (05)
Implementation of GA & GP (04)
Applications of GA & GP, Hybrid systems (04)
Recommended Books
1. Neuro fuzzy and soft computing by Jang, Pearson Education,1996
2. Learning and soft computing by Kecman, MIT Press 1st Ed.
3. Fuzzy sets and fuzzy logic-Kir and Yuan PHI, 2005 ed
4. Neurocomputing: Theory & Practice by Philip D. Wasserman, Van Nostrand Reinhold,
2nd Ed, Addison Wesley
5. Neural Network in computing Intelligence by Fu, TMH, 1994
6. Neural Networks and fuzzy systems by Bar Kosko, PHI,1st Ed
7. An introduction to Genetic Algorithm – Melanie Mitchell, PHI, 2nd Ed.
Paper title: Theory Of Computation
Paper Code: MEIT 204 Max. Marks: 100 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 from
Part 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, turning
machines 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, Derived
Rules Of Inference, Rules Of Operators, The Resolution Methods, Herbands Procedure, Davis
And Putnam's Method, The Ground Resolution Methods Unification Algorithms, The Resolution
Rule.
Verification of programs (10)
Flow chart program, partial correctness, inductive assertion methods, termination
Recommendation Books
1. Mathematical theory of computation by Zohar and Manna, Pub-Dover, 2nd Ed, 2003
2. Theory of Computer science(Auto Mata,Language & Computation) by K.L.P Mishra and
N. Chandrashekharan,3rd Ed, PHI
3. Introduction to Formal Language & Automata Peter Linz, 4th Ed, Narosa Publishers
Group-II
Paper title: Total Quality Management
Paper Code: MEIT 205 Max. Marks: 100 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 from
Part A and Part B.
Part A
Introduction (04)
Quality and Total Quality Management – Concepts, definition and applications of TQM.
Just - in- Time (JIT) (06)
JIT Manufacturing and waste elimination, layout for JIT, Kanban, MRP Vs. JIT, JIT cause and
effect chain, JIT implementation and benefits.
Total Employees Involvement (TEI) (04)
Empowering employee, Team building, Quality circles, Transparent communication, Reward
and 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, customer
complaints, 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 assurance
system and quality audit.
Recommended Books
1. 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: 100 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 from
Part A and Part B.
Part A
Introduction to Human Resource Development (06)
Evolution, Mission and Purpose, Components of HRD, HRD problems and issues related to
Indian 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/Professional
Development, Training For Horizontal And Vertical Mobility Of Employees.
Concept of Training (05)
Assumptions for prevailing and alternative concept of training; action through training or action
through 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.
Systems Approach to HRD (08)
Assessing Need For HRD, Definition And Importance Of Needs Assessment, Methods
Employed 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: Network Management and Security
Paper Code: MEIT 205 Max. Marks: 100 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 from
Part A and Part B.
PART – A
Introduction (5)
Classical security Techniques and Computer Network Security Concepts. Confidentiality and
Security, 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. Threats
to Security: Physical security, Biometric systems, monitoring controls, and Data security and
intrusion and detection systems.
Encryption Techniques (6)
Conventional techniques, Modern techniques, DES, DES chaining, Triple DES, RSA algorithm, Key
management. Message Authentication and Hash Algorithm, Authentication requirements and
functions 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 The
Difficulties of Secure Networking. Security Technologies. Emerging Security Technologies General
Design Considerations, Layer 2 Security Considerations. IP Addressing Design Considerations.
ICMP Design Considerations. Routing Considerations. Transport Protocol Design Considerations
PART - B
Network Security Platform Options (6)
Network Security Platform Options. Network Security Device Best Practices, Common Application
Design 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. Topology
Considerations. Design Considerations. Site-to-Site Deployment Examples.
Secure Network Management and Network Security Management (8)
Organizational Realities. Protocol Capabilities. Tool Capabilities. Secure Management Design
Options. Network Security Management, Firewalls, Trusted systems, IT act and cyber laws.
Text:
1. Sean Convery, “ Network Security Architectures, Published by Cisco Press, First Ed. 2004
2. William Stalling “Cryptography and Network Security” Pearson Education
References:
1. Charels P. Pfleeger “Security in Computing” Prentice Hall
2. Jeff Crume “Inside Internet Security” Addison Wesley
Paper: Advanced Digital Image Processing
Paper Code: MEIT 205 Max. Marks: 100 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 from
Part A and Part B.
Section A
Image fundamentals and Transforms: (06)
Steps in Image processing, Building blocks of Digital Image Processing System, Digital Image
representation, Sampling and Quantization, Basic relationship between Pixels. Problem and
application areas of digital image processing, Fourier transforms, Discrete Fourier Transform,
Properties of Fourier Transform, Fast Fourier Transform, Discrete Cosine Transform, Haar and
slant transforms, and Hadamard transforms, Walsh Transform, Hotelling Transform, Wavelet
transform, Intensity transform functions, Histogram processing,.
Image Enhancement Techniques: (12)
Spatial Domain and frequency domain approaches, Image subtraction, image average, Low-pass
spatial filters, Median filters, High-pass spatial filters, derivative filters , Frequency domain ideal
low-pass filters, Butterworth Low pass filters, high pass filters , homomorphic filters
Image Restoration: (06)
Image degradation and restoration process, Noise models, Noise filters, Estimation of
degradation function, Inverse filtering, Least Mean Square filter, interactive restoration,
constrained least square restorations
Section B
Color 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 compression
models, 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 using
threshold, Hough transformation
Image Representation & Object Recognition: (06)
Boundary representation: chain codes, polygon approximation, Boundary segments, Boundary
descriptors; 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, 2nd
Edition.
Reference Books:
1. Anil K. Jain : Fundamentals of digital image processing, PHI.
2. Sonka, Hlavac, Boyle : Image Processing, Analysis and Machine Vision
2nd Edition, PWS Publishing.
3. S.Annadurai & R. Shanmugalakshmi : Fundamentals of digital image processing,
Pearson education, Latest edition.
THIRD SEMESTER
Paper title: Data Warehousing and Data Mining
Paper Code: MEIT 301 Max. Marks: 100 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 from
Part A and Part B.
Part A
Introduction to Data Warehousing (03)
Data Warehousing Definition and characteristics, need for data warehousing, DBMS vs. data
warehouse, OLAP
Data Warehousing Components (05)
Overall Architecture, Data Warehouse Database, Sourcing Acquisition, Cleanup and
Transformation Tools, Metadata Access Tools, Data Marts, Data Warehouse Administration and
Management, Information Delivery Systems.
Mapping the Data Warehouse to a Multiprocessor Architecture (05)
Relational Database Technology for Data warehouse, Database Architectures for Parallel
Processing, 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 B
Data Preprocessing (06)
Data cleaning, integration and transformation, Data reduction, Discretization and Concept
Hierarchy Generation.
Concept Description (06)
Data Mining techniques-Concept description, attribute oriented induction, analytical
characterization, 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.
Recommended Books
1. Data Mining –Concepts & Techniques; Jiawei Han & Micheline Kamber, Morgan
Kaufmann Publishers.
2. Data Warehouseing in the Real World; Sam Anahory & Dennis Murray; Pearson
Education
3. “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.
GROUP-III
Paper Title: Advanced Digital Signal Processing
Paper Code: MEIT 302 Max. Marks: 100 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 from
Part A and Part B.
Part A
Transformations: (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 circular
convolution 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), Cascade
form, 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 of
Butterworth, Chebyshev Filter using above methods.
Part B
Finite Word Length Effects: (05)
Analysis of Finite Word Length Effects. Quantization process & errors, A/D conversion noise
analysis, Analysis of arithmetic round- off errors, Dynamic range scaling, Reduction of product
round-off errors ,limit cycles in IIR filters, round-off errors in FFT algorithms.
Introduction of Multi-rate Digital signal Processing: (08)
Filter Banks, Subband Coding, Wavelet Transform-Multi Resolution Analysis, Scaling Functions
And Wavelets, Its Relation To Multi –Rate Filter Banks.
DSP Chips: (08)
DSP chips and their applications.ADSP 21xx architecture and instruction set.
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 & Johnson
5. Theory and Applications of Digital Signal Processing by Rabiner & Gold
Paper title: User Interface Design
Paper Code: MEIT 302 Max. Marks: 100 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 from
Part 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 web
user interfaces
The User Interface Design Process (05)
Obstacles And Pitfalls In The Development Path, Usability, The Design Team, Managing Design
Process.
Human Computer Interaction (08)
Importance Human Characteristics In Design, Cognitive Engineering, Mental Models, User
Psychology, Interaction Styles And Hypermedia.
Visual C++ Basics (06)
Introduction to Visual C++, building a basic applications, Visual C++ resources.
Part B
Graphical User Interface (08)
Creating menus, working of menus, dialog boxes, combo box, child windows, buttons, check
boxes, radio buttons.
Visual C++ and Database Management (08)
Open Database Connectivity, Data Access Objects, OLE-DB, building a database application
using ODBC.
Application Development in Visual C++ (04)
Designing application with security, building a help file, packaging the application.
Recommended Books
1. 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 edition
4. The Essential Guide to User Interface Design: Wilbert O. Galitz, WILEY, 2nd edition.
Paper title: Advanced Computer Networks
Paper code: MEIT 302 Max. Marks: 100 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 from
Part A and Part B.
Part A
Overview: (02)
Elements of computer Network. Computing Models. Networking Topologies. Peer-to- Peer and
Client-server configuration. Broadcast, and Point-to-Point networks. LAN, MAN and WAN,
Packet Switching. Datagram and Virtual Circuit networks.
The OSI reference model layer entities, layer interfaces and service access points. Connectionoriented
and Connectionless services. Reliable and unreliable services. Services primitives.
TCP/IP reference model.
Hubs, Bridges, Switches, Routers and Gateways.
Data link layer: (05)
Flow-control protocols: Stop-and-wait and Sliding-window. ARQ based Error Control and
performance evaluation. Link protocols: HDLC and SLIP and PPP protocols.
Local/Personal Area Networks: (06)
IEEE LAN standards: 802.3 (CSMA/CD), Gigabit Ethernet, Bluetooth 802.11 based Wireless
LAN and 802.16. (Broadband wireless)
Network Layer: (06)
Routing: Dijkstra’s Shortest Path Routing, Flooding, Distance-Vector Routing, Link-State
Routing, Hierarchical Routing, Broadcast Routing And Multicast Routing.
Congestion control: Principles and policies of congestion control in Virtual-circuit and Datagram
subnets.
Load shedding and Jitter control.
Quality of service: Techniques for achieving good QoS. Integrated Services. Differentiated
Services. Label Switching and MPLS.
Part B
Internetworking: (06)
Tunneling, Fragmentation. IP addresses. Subnetting and supernetting. Classless Inter-Domain
Routing (CIDR). Network Address Translation (NAT).
Internet protocols: IPv-4, ICMP,ARP,DHCP,OSPF,BGP and IPv6.
Wide Area Networks: X-25, Frame relay, ATM. (05)
Transport Layer: (06)
Transport layer protocol issues: addressing, establishing connection, releasing connection, flow
control and multiplexing. TCP and UDP.
Network Applications: (06)
DNS, Electronic Mail, TELNET, FTP, SNMP. World-Wide Web Multi-Media.
Network Security: (03)
Introduction to Cryptography. Symmetric- Key and Public Key algorithms. Digital Signatures.
Recommended Books
1. Tanenbaum, A.S. Computer Networks, 4th Edition, PHI
2. Stallings, William Data and Computer Communications, 7th Edition, PHI
3. Forouzan Data Communication And Networks, 2nd Edition, Tata McGraw Hill
4. Comer, D.E., Computer Networks And Internets, 2nd Edition, Delhi: Pearson Education Asia,
1998.
5. Keshav, S., Engineering Approach To Computer Networking: ATM Networks, The Internet,
and The Telephone Network. Addison-Wesely professional computing series, International
student edition, 1997 Edition,
6. Pahlavan, K. and Krishnamurthy, P., Principles of Wireless Networks, 2002; Delhi: Pearson
Education.
7. Stallings, W., High-Speed Networks and Internets: Performance and Quality of Service, 2nd
Edition, Delhi: Pearson Education Asia, 2002.
8. Sheldon, Tom Encyclopedia Of Networking, TMH.
9. Stevens, R.W.TCP/IP Illustrated, vol.1: the protocols, Addison-Wesely.
