CS9269 SOFTWARE PROJECT MANAGEMENT Question Paper

M.E./M.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012

Elective

Computer Science and Engineering

CS 9269/241088/8241088/CS 969-SOFTWARE PROJECT MANAGEMENT

(Common to M.Tech Information Technology)

Regulation 2009

Time: Three hours                                                                            Maximum:100 marks

Answer ALL the Questions

PART A-(10 × 2 = 20 marks)

1. List out all software models
2. Define Umbrella activities in project.
3. In what way software standards differ from other product standards.
4. What are ISO Series of Standards?
5. How to identify Risk?
6. How to measure software?
7. How to monitor project?
8. What is project Initiation?
9. How to gather requirement?
10. What is Deployment?

PART B-(5 × 16 = 80 marks)

11. (a) For engineering counseling system, which model would you choose? Explain the model with neat diagram and justify why you have chosen this model? (16)
Or
(b) In what way Spiral model is advantages over the RAD model. Explain with neat diagram. (16)

12. (a) Bring out the importance of CMM model and their relevance to project management. (16)
Or
(b) Distinguished between CMM and People CMM. (16)

13. (a) (i) When to initial Quality process in project? Explain. (8)
(ii) Discuss about software Quality Assurance in project. (8)
Or
(b) What is Configuration Management? Bring out the importance of Configuration management. (16)

14. (a)(i) Distinguish between Milestone and Deliverable. (8)
(ii) How milestones help in Tracking the project. (8)
Or
(b) Bring out the importance of project database.

15. (a) What are the different phases in project development? Explain design phase with its decomposition for ATM system. (16)
Or
(b) In what way geographical Distribution issues affect project development in real time situations. (16)

CP7103 MULTICORE ARCHITECTURES

CP7103 MULTICORE ARCHITECTURES 

UNIT I FUNDAMENTALS OF QUANTITATIVE DESIGN AND ANALYSIS 9

Classes of Computers – Trends in Technology, Power, Energy and Cost – Dependability – Measuring, Reporting and Summarizing Performance – Quantitative Principles of Computer Design – Classes of Parallelism - ILP, DLP, TLP and RLP - Multithreading - SMT and CMP Architectures – Limitations of Single Core Processors - The Multicore era – Case Studies of Multicore Architectures.

UNIT II DLP IN VECTOR, SIMD AND GPU ARCHITECTURES 9

Vector Architecture - SIMD Instruction Set Extensions for Multimedia – Graphics Processing Units - Detecting and Enhancing Loop Level Parallelism - Case Studies. 

UNIT III TLP AND MULTIPROCESSORS 9

Symmetric and Distributed Shared Memory Architectures – Cache Coherence Issues - Performance Issues – Synchronization Issues – Models of Memory Consistency - Interconnection Networks – Buses, Crossbar and Multi-stage Interconnection Networks.

UNIT IV RLP AND DLP IN WAREHOUSE-SCALE ARCHITECTURES 9

Programming Models and Workloads for Warehouse-Scale Computers – Architectures for Warehouse-Scale Computing – Physical Infrastructure and Costs – Cloud Computing – Case Studies.

UNIT V ARCHITECTURES FOR EMBEDDED SYSTEMS 9 Features and Requirements of Embedded Systems – Signal Processing and Embedded Applications – The Digital Signal Processor – Embedded Multiprocessors - Case Studies.

REFERENCES: 

1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A Quantitative

Approach”, Morgan Kaufmann / Elsevier, 5th edition, 2012.

2. Kai Hwang, “Advanced Computer Architecture”, Tata McGraw-Hill Education, 2003

3. Richard Y. Kain, “Advanced Computer Architecture a Systems Design Approach”,

Prentice Hall, 2011.

4. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A Hardware/

Software Approach” , Morgan Kaufmann / Elsevier, 1997.

CP7102 ADVANCED DATA STRUCTURES AND ALGORITHMS

CP7102 ADVANCED DATA STRUCTURES AND ALGORITHMS L T P C

UNIT I ITERATIVE AND RECURSIVE ALGORITHMS 9 Iterative Algorithms: Measures of Progress and Loop Invariants-Paradigm Shift: Sequence of Actions versus Sequence of Assertions- Steps to Develop an Iterative Algorithm-Different Types of Iterative Algorithms--Typical Errors-Recursion-Forward versus Backward- Towers of Hanoi-Checklist for Recursive Algorithms-The Stack Frame-Proving Correctness with Strong Induction- Examples of Recursive Algorithms-Sorting and Selecting Algorithms- Operations on Integers- Ackermann’s Function- Recursion on Trees-Tree Traversals- Examples- Generalizing the Problem - Heap Sort and Priority Queues-Representing Expressions.

UNIT II OPTIMISATION ALGORITHMS 9

Optimization Problems-Graph Search Algorithms-Generic Search-Breadth-First Search- Dijkstra’s Shortest-Weighted-Path -Depth-First Search-Recursive Depth-First Search-Linear Ordering of a Partial Order- Network Flows and Linear Programming-Hill Climbing-Primal Dual Hill Climbing- Steepest Ascent Hill Climbing-Linear Programming-Recursive Backtracking-Developing Recursive Backtracking Algorithm- Pruning Branches-Satisfiability 

UNIT III DYNAMIC PROGRAMMING ALGORITHMS 9

Developing a Dynamic Programming Algorithm-Subtle Points- Question for the Little Bird- Subinstances and Subsolutions-Set of Substances-Decreasing Time and Space-Number of Solutions-Code. Reductions and NP-Completeness-Satisfiability-Proving NP-Completeness- 3-Coloring- Bipartite Matching. Randomized Algorithms-Randomness to Hide Worst Cases- Optimization Problems with a Random Structure.

UNIT IV SHARED OBJECTS AND CONCURRENT OBJECTS 9

Shared Objects and Synchronization -Properties of Mutual Exclusion-The Mora l- The Producer–Consumer Problem -The Readers–Writers Problem-Realities of Parallelization- Parallel Programming- Principles- Mutual Exclusion-Time- Critical Sections--Thread Solutions-The Filter Lock-Fairness-Lamport’s Bakery Algorithm-Bounded Timestamps-Lower Bounds on the Number of Locations-Concurrent Objects- Concurrency and Correctness- Sequential Objects-Quiescent Consistency- Sequential Consistency-Linearizability- Formal Definitions- Progress Conditions- The Java Memory Model

UNIT V CONCURRENT DATA STRUCTURES 9

Practice-Linked Lists-The Role of Locking-List-Based Sets-Concurrent Reasoning- Coarse- Grained Synchronization-Fine-Grained Synchronization-Optimistic Synchronization- Lazy Synchronization-Non-Blocking Synchronization-Concurrent Queues and the ABA Problem- Queues-A Bounded Partial Queue-An Unbounded Total Queue-An Unbounded Lock-Free Queue-Memory Reclamation and the ABA Problem- Dual Data Structures- Concurrent Stacks and Elimination- An Unbounded Lock-Free Stack- Elimination-The Elimination Backoff Stack

TOTAL : 45 PERIODS

REFERENCES:

1. Jeff Edmonds, “How to Think about Algorithms”, Cambridge University Press, 2008.

2. M. Herlihy and N. Shavit, “The Art of Multiprocessor Programming”, Morgan Kaufmann,

2008.

3. Steven S. Skiena, “The Algorithm Design Manual”, Springer, 2008.

4. Peter Brass, “Advanced Data Structures”, Cambridge University Press, 2008.

5. S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, “Algorithms” , McGrawHill, 2008.

6. J. Kleinberg and E. Tardos, "Algorithm Design“, Pearson Education, 2006.

7. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms“,

PHI Learning Private Limited, 2012.

8. Rajeev Motwani and Prabhakar Raghavan, “Randomized Algorithms”, Cambridge

University Press, 1995.

CP7101 DESIGN AND MANAGEMENT OF COMPUTER NETWORKS

CP7101 DESIGN AND MANAGEMENT OF COMPUTER NETWORKS


UNIT I INTRODUCTION TO NETWORK MANAGEMENT 9
Overview of Analysis, Architecture and Design Process-System Methodology, Service
methodology, Service Description - Service characteristics - Performance Characteristics -
Network supportability - Requirement analysis – User Requirements – Application
Requirements – Device Requirements – Network Requirements – Other Requirements -
Requirement specification and map.

UNIT II REQUIREMENTS ANALYSIS 9
Requirement Analysis Process – Gathering and Listing Requirements- Developing service
metrics – Characterizing behavior – Developing RMA requirements – Developing delay
Requirements - Developing capacity Requirements - Developing supplemental performance
Requirements –Requirements mapping – Developing the requirements specification

UNIT III FLOW ANALYSIS 9

Individual and Composite Flows – Critical Flows - Identifying and developing flows – Data
sources and sinks – Flow models- Flow prioritization – Flow specification algorithms –
Example Applications of Flow Analysis

UNIT IV NETWORK ARCHITECTURE 9
Architecture and design – Component Architectures – Reference Architecture – Architecture
Models – System and Network Architecture – Addressing and Routing Architecture –
Addressing and Routing Fundamentals – Addressing Mechanisms – Addressing Strategies
– Routing Strategies – Network Management Architecture – Network Management
Mechanisms Performance Architecture – Performance Mechanisms – Security and Privacy
Architecture – Planning security and privacy Mechanisms

UNIT V NETWORK DESIGN 9
Design Concepts – Design Process - Network Layout – Design Traceability – Design Metrics
– Logical Network Design – Topology Design – Bridging, Switching and Routing Protocols-
Physical Network Design – Selecting Technologies and Devices for Campus and Enterprise
Networks – Optimizing Network Design

TOTAL : 45 PERIODS

REFERENCES:

1. Network Analysis, Architecture, and Design By James D. McCabe, Morgan Kaufmann,
Third Edition, 2007.ISBN-13: 978-0123704801
2. Computer Networks: A Systems Approach by Larry L. Peterson, Bruce S. Davie - 2007,
Elsevier Inc.
3. Top-down Network Design: [a Systems Analysis Approach to Enterprise Network
Design] By Priscilla Oppenheimer, Cisco Press , 3rd Edition, ISBN-13: 978-1-58720-
283-4 ISBN-10: 1-58720-283-2
4. Integrated Management of Networked Systems: Concepts, Architectures, and Their
Operational Application (The Morgan Kaufmann Series in Networking), Heinz-Gerd
Hegering, Sebastian Abeck, and Bernhard Neumair, 1999.
5. “Network Design and Management” – by Steven T.Karris, Orchard publications, Second
edition, Copyright 2009, ISBN 978-1-934404-15-7
6. “Network Design, Management and Technical Perspective”, Teresa C. Mann-Rubinson
and Kornel Terplan, CRC Press, 1999
7. “Ethernet Networks-Design, Implementation, Operation and Management by Gilbert
Held, John Wiley and sons, Fourth Edition
8. James Kurose and Keith Ross, “Computer Networking: A Top-Down Approach Featuring
the Internet”, 1999

MA7155 APPLIED PROBABILITY AND STATISTICS

MA7155 APPLIED PROBABILITY AND STATISTICS


UNIT I ONE DIMENSIONAL RANDOM VARIABLES 9+3

Random variables - Probability function – Moments – Moment generating functions and
their properties – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal
distributions – Functions of a Random Variable.

UNIT II TWO DIMENSIONAL RANDOM VARIABLES 9+3

Joint distributions – Marginal and Conditional distributions – Functions of two dimensional
random variables – Regression Curve – Correlation.

UNIT III ESTIMATION THEORY 9+3

Unbiased Estimators – Method of Moments – Maximum Likelihood Estimation - Curve fitting
by Principle of least squares – Regression Lines.

UNIT IV TESTING OF HYPOTHESES 9+3

Sampling distributions - Type I and Type II errors - Tests based on Normal, t,2 and F
distributions for testing of mean, variance and proportions – Tests for Independence of
attributes and Goodness of fit.

UNIT V MULTIVARIATE ANALYSIS 9+3

Random Vectors and Matrices - Mean vectors and Covariance matrices - Multivariate
Normal density and its properties - Principal components Population principal
components - Principal components from standardized variables.

 TOTAL 45+15=60 PERIODS


REFERENCES:

1 Jay L. Devore, “Probability and Statistics For Engineering and the Sciences”,Thomson
and Duxbury, 2002.
2.Richard Johnson. ”Miller & Freund’s Probability and Statistics for Engineer”, Prentice –
Hall , Seventh Edition, 2007.
3.Richard A. Johnson and Dean W. Wichern, “Applied Multivariate Statistical Analysis”,
Pearson Education, Asia, Fifth Edition, 2002.
4.Gupta S.C. and Kapoor V.K.”Fundamentals of Mathematical Statistics”, Sultan an Sons,
2001.
5.Dallas E Johnson , “Applied Multivariate Methods for Data Analysis”, Thomson an Duxbury
press,1998.

Anna University PG time table for Nov / Dec 2013

Anna University PG time table for Nov / Dec 2013

AP9224 EMBEDDED SYSTEMS

AP9224 EMBEDDED SYSTEMS

UNIT I EMBEDDED PROCESSORS

Embedded Computers, Characteristics of Embedded Computing Applications,
Challenges in Embedded Computing system design, Embedded system design processRequirements, Specification, Architectural Design, Designing Hardware and Software
Components, System Integration, Formalism for System Design- Structural Description,
Behavioural Description, Design Example: Model Train Controller, ARM processorprocessor and memory organization.

UNIT II EMBEDDED PROCESSOR AND COMPUTING PLATFORM

Data operations, Flow of Control, SHARC processor- Memory organization, Data
operations, Flow of Control, parallelism with instructions, CPU Bus configuration, ARM
Bus, SHARC Bus, Memory devices, Input/output devices, Component interfacing,
designing with microprocessor development and debugging, Design Example : Alarm
Clock. Hybrid Architecture

UNIT III NETWORKS

Distributed Embedded Architecture- Hardware and Software Architectures, Networks for
embedded systems- I2C, CAN Bus, SHARC link supports, Ethernet, Myrinet, Internet,
Network-Based design- Communication Analysis, system performance Analysis,
Hardware platform design, Allocation and scheduling, Design Example: Elevator
Controller.

UNIT IV REAL-TIME CHARACTERISTICS

Clock driven Approach, weighted round robin Approach, Priority driven Approach,
Dynamic Versus Static systems, effective release times and deadlines, Optimality of the
Earliest deadline first (EDF) algorithm, challenges in validating timing constraints in
priority driven systems, Off-line Versus On-line scheduling.

UNIT V SYSTEM DESIGN TECHNIQUES

Design Methodologies, Requirement Analysis, Specification, System Analysis and
Architecture Design, Quality Assurance, Design Example: Telephone PBX- System
Architecture, Ink jet printer- Hardware Design and Software Design, Personal Digital
Assistants, Set-top Boxes.

REFERENCES:

1. Wayne Wolf, “Computers as Components: Principles of Embedded Computing
System Design”, Morgan Kaufman Publishers.
2. Jane.W.S. Liu, “Real-Time systems”, Pearson Education Asia.
3. C. M. Krishna and K. G. Shin, “Real-Time Systems” , McGraw-Hill, 1997
4. Frank Vahid and Tony Givargis, “Embedded System Design: A Unified
Hardware/Software Introduction” , John Wiley & Sons.

CP9212 HIGH PERFORMANCE COMPUTER NETWORKS

CP9212 HIGH PERFORMANCE COMPUTER NETWORKS

UNIT I INTRODUCTION

Review of OSI, TCP/IP; Multiplexing, Modes of Communication, Switching, Routing.
SONET – DWDM – DSL – ISDN – BISDN,ATM.

UNIT II MULTIMEDIA NETWORKING APPLICATIONS

Streaming stored Audio and Video – Best effort service – protocols for real time
interactive applications – Beyond best effort – scheduling and policing mechanism –
integrated services – RSVP- differentiated services.

UNIT III ADVANCED NETWORKS CONCEPTS

VPN-Remote-Access VPN, site-to-site VPN, Tunneling to PPP, Security in VPN.MPLSoperation, Routing, Tunneling and use of FEC, Traffic Engineering, MPLS based VPN,
overlay networks-P2P connections.

UNIT IV TRAFFIC MODELLING

Little’s theorem, Need for modeling , Poisson modeling and its failure, Non- poisson
models, Network performance evaluation.

UNIT V NETWORK SECURITY AND MANAGEMENT

Principles of cryptography – Authentication – integrity – key distribution and certification
– Access control and: fire walls – attacks and counter measures – security in many
layers. Infrastructure for network management – The internet standard management
framework – SMI, MIB, SNMP, Security and administration – ASN.1

REFERENCES:

1. J.F. Kurose & K.W. Ross,”Computer Networking- A top down approach featuring the
internet”, Pearson, 2nd edition, 2003.
2. Walrand .J. Varatya, High performance communication network, Morgan Kauffman –
Harcourt Asia Pvt. Ltd. 2nd Edition, 2000.
3. LEOM-GarCIA, WIDJAJA, “Communication networks”, TMH seventh reprint 2002.
4. Aunurag kumar, D. MAnjunath, Joy kuri, “Communication Networking”, Morgan
Kaufmann Publishers, 1ed 2004.
5. Hersent Gurle & petit, “IP Telephony, packet Pored Multimedia communication
Systems”, Pearson education 2003.
6. Fred Halsall and Lingana Gouda Kulkarni,”Computer Networking and the Internet”
fifth edition, Pearson education
7. Nader F.Mir ,Computer and Communication Networks, first edition.
8. Larry l.Peterson&Bruce S.David, “Computer Networks: A System Approach”- 1996

AP9256 ELECTROMAGNETIC INTERFERENCE AND COMPATIBILITY IN SYSTEM DESIGN

AP9256 ELECTROMAGNETIC INTERFERENCE AND COMPATIBILITY IN SYSTEM DESIGN

UNIT I EMI/EMC CONCEPTS

EMI-EMC definitions and Units of parameters; Sources and victim of EMI; Conducted
and Radiated EMI Emission and Susceptibility; Transient EMI, ESD; Radiation Hazards.
UNIT II EMI COUPLING PRINCIPLES

Conducted, radiated and transient coupling; Common ground impedance coupling ;
Common mode and ground loop coupling ; Differential mode coupling ; Near field cable
to cable coupling, cross talk ; Field to cable coupling ; Power mains and Power supply
coupling.

UNIT III EMI CONTROL TECHNIQUES

Shielding, Filtering, Grounding, Bonding, Isolation transformer, Transient suppressors,
Cable routing, Signal control.

UNIT IV EMC DESIGN OF PCBS

Component selection and mounting; PCB trace impedance; Routing; Cross talk control;
Power distribution decoupling; Zoning; Grounding; VIAs connection; Terminations.
UNIT V EMI MEASUREMENTS AND STANDARDS

Open area test site; TEM cell; EMI test shielded chamber and shielded ferrite lined
anechoic chamber; Tx /Rx Antennas, Sensors, Injectors / Couplers, and coupling
factors; EMI Rx and spectrum analyzer; Civilian standards-CISPR, FCC, IEC, EN;
Military standards-MIL461E/462.


REFERENCES:

1. V.P.Kodali, “Engineering EMC Principles, Measurements and Technologies”, IEEE
Press, Newyork, 1996.
2. Henry W.Ott.,”Noise Reduction Techniques in Electronic Systems”, A Wiley Inter
Science Publications, John Wiley and Sons, Newyork, 1988.
3. Bemhard Keiser, “Principles of Electromagnetic Compatibility”, 3rd Ed, Artech house,
Norwood, 1986.
4. C.R.Paul,”Introduction to Electromagnetic Compatibility” , John Wiley and Sons, Inc,
1992.
5. Don R.J.White Consultant Incorporate, “Handbook of EMI/EMC” , Vol I-V, 1988.

CU9255 INTERNETWORKING MULTIMEDIA

CU9255 INTERNETWORKING MULTIMEDIA

UNIT I INTRODUCTION

Digital sound, video and graphics, basic multimedia networking, multimedia
characteristics, evolution of Internet services model, network requirements for
audio/video transform, multimedia coding and compression for text, image, audio and
video. Multimedia communication in wireless network.18

UNIT II SUBNETWORK TECHNOLOGY

Broadband services, ATM and IP , IPV6, High speed switching, resource reservation,
Buffer management, traffic shaping, caching, scheduling and policing, throughput, delay
and jitter performance.

UNIT III MULTICAST AND TRANSPORT PROTOCOL

Multicast over shared media network, multicast routing and addressing, scaping
multicast and NBMA networks, Reliable transport protocols, TCP adaptation algorithm,
RTP, RTCP.

UNIT IV MEDIA - ON – DEMAND

Storage and media servers, voice and video over IP, MPEG-2 over ATM/IP, indexing
synchronization of requests, recording and remote control.

UNIT V APPLICATIONS

MIME, Peer-to-peer computing, shared application, video conferencing, centralized and
distributed conference control, distributed virtual reality, light weight session philosophy.

REFERENCES:
1. Jon Crowcroft, Mark Handley, Ian Wakeman. “Internetworking Multimedia”,
Harcourt Asia Pvt.Ltd.Singapore, 1998.
2. B.O. Szuprowicz, “Multimedia Networking”, McGraw Hill, NewYork. 1995
3. Tay Vaughan,Multimedia making it to work, 4ed,Tata McGrawHill,
NewDelhi,2000.
4. Ellen kayata wesel, Ellen Khayata, “Wireless Multimedia Communication: Networking
Video, Voice and Data”, Addison Wesley Longman Publication, USA, 1998.

AP9251 DIGITAL IMAGE PROCESSING

AP9251 DIGITAL IMAGE PROCESSING 

UNIT I DIGITAL IMAGE FUNDAMENTALS

Elements of digital image processing systems, Vidicon and Digital Camera working principles, Elements of visual perception, brightness, contrast, hue, saturation, Mach Band effect, Image sampling, Quantization, Dither, Two dimensional mathematical preliminaries.

UNIT II IMAGE TRANSFORMS

1D DFT, 2D transforms - DFT, DCT, Discrete Sine, Walsh, Hadamard, Slant, Haar, KLT, SVD, Wavelet transform.

UNIT III IMAGE ENHANCEMENT AND RESTORATION

Histogram modification, Noise distributions, Spatial averaging, Directional Smoothing, Median, Geometric mean, Harmonic mean, Contraharmonic and Yp mean filters . Design of 2D FIR filters. Image restoration - degradation model, Unconstrained and Constrained restoration, Inverse filtering-removal of blur caused by uniform linear motion, Wiener filtering, Geometric transformations-spatial transformations, Gray Level interpolation. .

UNIT IV IMAGE SEGMENTATION AND RECOGNITION

Image segmentation - Edge detection, Edge linking and boundary detection, Region growing, Region splitting and Merging, Image Recognition - Patterns and pattern classes, Matching by minimum distance classifier, Matching by correlation., Neural networks-Backpropagation network and training, Neural network to recognize shapes.

UNIT V IMAGE COMPRESSION

Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding, Vector Quantization, Block Truncation Coding, Transform coding, JPEG standard, JPEG 2000, EZW, SPIHT, MPEG. 

REFERENCES:

1. Rafael C. Gonzalez, Richard E. Woods, “ Digital Image Processing”, Pearson Education, Inc., Second Edition, 2004

2. Anil K. Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India, 2002.

3. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,” Digital Image Processing using MATLAB”, Pearson Education, Inc., 2004.

4. D.E. Dudgeon and R.M. Mersereau, “Multidimensional Digital Signal Processing”, Prentice Hall Professional Technical Reference, 1990.

5. William K. Pratt, “ Digital Image Processing”, John Wiley, New York, 2002. 

6. Milan Sonka et al, “Image Processing, Analysis and Machine Vision”, Brookes/Cole, Vikas Publishing House, 2nd edition, 1999;

7. Sid Ahmed, M.A., “ Image Processing Theory, Algorithms and Architectures”, McGrawHill, 1995.

AP9213 ADVANCED MICROPROCESSORS AND MICROCONTROLLERS

AP9213 ADVANCED MICROPROCESSORS AND MICROCONTROLLERS

UNIT I MICROPROCESSOR ARCHITECTURE

Instruction Set – Data formats –Addressing modes – Memory hierarchy –register file – Cache – Virtual memory and paging – Segmentation- pipelining –the instruction pipeline – pipeline hazards – instruction level parallelism – reduced instruction set –Computer principles – RISC versus CISC.

UNIT II HIGH PERFORMANCE CISC ARCHITECTURE – PENTIUM

CPU Architecture- Bus Operations – Pipelining – Brach predication – floating point unit- Operating Modes –Paging – Multitasking – Exception and Interrupts – Instruction set – addressing modes – Programming the Pentium processor. 

UNIT III HIGH PERFORMANCE RISC ARCHITECTURE – ARM

Organization of CPU – Bus architecture –Memory management unit - ARM instruction set- Thumb Instruction set- addressing modes – Programming the ARM processor.

UNIT IV MOTOROLA 68HC11 MICROCONTROLLERS

Instruction set addressing modes – operating modes- Interrupsystem- RTC-Serial Communication Interface – A/D Converter PWM and UART.

UNIT V PIC MICROCONTROLLER

CPU Architecture – Instruction set – interrupts- Timers- I2C Interfacing –UART- A/D Converter –PWM and introduction to C-Compilers.

REFERENCES:
1. Daniel Tabak , ‘’ Advanced Microprocessors” McGraw Hill.Inc., 1995
2. James L. Antonakos , “ The Pentium Microprocessor ‘’ Pearson Education , 1997.
3. Steve Furber , ‘’ ARM System –On –Chip architecture “Addision Wesley , 2000.
4. Gene .H.Miller .” Micro Computer Engineering ,” Pearson Education , 2003.
5. John .B.Peatman , “ Design with PIC Microcontroller , Prentice hall, 1997.
6. James L.Antonakos ,” An Introduction to the Intel family of Microprocessors ‘’
Pearson Education 1999.
7. Barry.B.Breg,” The Intel Microprocessors Architecture , Programming and
Interfacing “ , PHI,2002.
8. Valvano "Embedded Microcomputer Systems" Thomson Asia PVT LTD first reprint

CU9254 DIGITAL COMMUNICATION RECEIVERS

CU9254 DIGITAL COMMUNICATION RECEIVERS

UNIT I REVIEW OF DIGITAL COMMUNICATION TECHNIQUES

Base band and band pass communication; signal space representation, linear and
nonlinear modulation techniques, and Spectral characteristics of digital modulation

UNIT II OPTIMUM RECEIVERS FOR AWGN CHANNEL

Correlation demodulator, matched filter , maximum likelihood sequence detector,
optimum receiver for CPM signals, M-ary orthogonal signals, envelope detectors for
M-ary and correlated binary signals

UNIT III RECEIVERS FOR FADING CHANNELS

Characterization of fading multiple channels, statistical models, slow fading, frequency
selective fading,, diversity technique, RAKE demodulator, coded waveform for fading
channel

UNIT IV SYNCHRONIZATION TECHNIQUES

Carrier and signal synchronization, carrier phase estimation-PLL, Decision directed
loops, symbol timing estimation, maximum likelihood and non-decision directed timing
estimation, joint estimation

UNIT V ADAPTIVE EQUALIZATION

Zero forcing algorithm, LMS algorithm, adaptive decision-feedback equalizer and
Equalization of Trellis-coded signals. Kalman algorithm, blind equalizers and stochastic
gradient algorithm.


REFERENCES:

1. Heinrich Meyer, Mare Moeneclacy, Stefan.A.Fechtel, " Digital communication
receivers ",Vol I & Vol II, John Wiley, New York, 1997.
2. John.G.Proakis, “Digital communication “4th Edition, McGraw-Hill, New York, 2001.
3. E.A.Lee and D.G. Messerschmitt, “Digital communication ", 2nd Edition, Allied
Publishers, New Delhi, 1994.
4. Simon Marvin, “Digital communication over fading channel; An unified approach to
performance Analysis ", John Wiley, New York, 2000.

CP9254 SOFT COMPUTING

CP9254 SOFT COMPUTING

UNIT I INTRODUCTION TO SOFT COMPUTING AND NEURAL
NETWORKS

Evolution of Computing - Soft Computing Constituents – From Conventional AI to
Computational Intelligence - Machine Learning Basics

UNIT II GENETIC ALGORITHMS

Introduction to Genetic Algorithms (GA) – Applications of GA in Machine Learning -
Machine Learning Approach to Knowledge Acquisition.

UNIT III NEURAL NETWORKS

Machine Learning Using Neural Network, Adaptive Networks – Feed forward Networks –
Supervised Learning Neural Networks – Radial Basis Function Networks -
Reinforcement Learning – Unsupervised Learning Neural Networks – Adaptive
Resonance architectures – Advances in Neural networks.

UNIT IV FUZZY LOGIC

Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership Functions-
Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems – Fuzzy Expert Systems
– Fuzzy Decision Making.
UNIT V NEURO-FUZZY MODELING

Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling –
Classification and Regression Trees – Data Clustering Algorithms – Rulebase Structure
Identification – Neuro-Fuzzy Control – Case studies.


TEXT BOOKS:
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft
Computing”, Prentice-Hall of India, 2003.
2. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and
Applications”,Prentice Hall, 1995.
3. James A. Freeman and David M. Skapura, “Neural Networks Algorithms,
Applications, and Programming Techniques”, Pearson Edn., 2003.

REFERENCES:
1. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
2. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine
Learning”, Addison Wesley, 1997.
3. S. N. Sivanandam, S. Sumathi and S. N. Deepa, “Introduction to Fuzzy Logic using
MATLAB”, Springer, 2007.
4. S.N.Sivanandam · S.N.Deepa, “ Introduction to Genetic Algorithms”, Springer, 2007.
5. Jacek M. Zurada, “Introduction to Artificial Neural Systems”, PWS Publishers, 1992.