1 . DESIGN AND MANAGEMENT OF COMPUTER SITES
UNIT I INTRODUCTION TO NETWORK MANAGEMENT 9
Overview of Analysis, Architecture and Design Process-System Technique, Service strategy, 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 being unfaithful
Requirement Evaluation Process — Gathering and Listing Requirements- Producing service metrics — Characterizing behavior — Developing RMA requirements — Growing delay Requirements — Developing capability Requirements — Producing supplemental overall performance Requirements —Requirements mapping — Growing the requirements requirements
UNIT III FLOW ANALYSIS being unfaithful
Individual and Composite Flows — Critical Flows — Identifying and developing flows — Data sources and sinks — Flow models- Flow prioritization — Flow requirements algorithms — Model Applications of Flow Analysis
PRODUCT IV NETWORK STRUCTURES 9
Structures 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 Supervision Architecture — Network Management Mechanisms Performance Architecture — Performance Mechanisms — Security and Privacy Architecture — Planning secureness and privateness Mechanisms
UNIT V NETWORK DESIGN 9
Style Concepts — Style Process — Network Layout — Design Traceability — Style Metrics — Reasonable Network Design — Topology Design — Bridging, Transitioning and Redirecting Protocols- Physical Network Design — Selecting Technology and Gadgets for Grounds and Business Networks — Enhancing Network Design
REFERENCES:
- Network Evaluation, Architecture, and Design By James D.
McCabe, Morgan Vertreter, Third Edition, 2007.
ISBN-13: 978-0123704801
- Computer Networks: A Systems Approach by Larry L. Peterson, Bruce T. Davie — 3 years ago, Elsevier Inc.
- Top-down Network Design: [a Systems Research Approach to Enterprise Network Design] By Priscilla Oppenheimer, Cisco Press, 3 rd Edition, ISBN-13: 978-1-58720- 283-4 ISBN-10: 1-58720-283-2
- Integrated Supervision of Networked Systems: Concepts, Architectures, and Their Detailed Application (The Morgan Vertreter Series in Networking), Heinz-Gerd Hegering, Sebastian Abeck, and Bernhard Neumair, 99.
- “Network Design and style and Management” — by Steven Capital t. Karris, Orchard publications, Second edition, Copyright laws 2009, ISBN 978-1-934404-15-7
- “Network Design, Managing and Technological Perspective”, Teresa C. Mann-Rubinson and Kornel Terplan, CRC Press, 1999
- “Ethernet Networks-Design, Rendering, Operation and Management by Gilbert Held, John Wiley and sons, Fourth Edition
- Adam Kurose and Keith Ross, “Computer Marketing: A Top-Down Way Featuring the Internet”, 99
2 . ADVANCED DATA SET UPS AND ALGORITHMS 3 0 zero 3 OBJECTIVES:
- To understand the guidelines of iterative and recursive methods.
- To learn the graph search algorithms.
- To study network circulation and linear programming concerns.
- To learn the hill rising and powerful programming style techniques.
- To develop recursive backtracking algorithms.
- To get an awareness of NP completeness and randomized algorithms.
- To learn the principles of shared and concurrent items.
- To learn concurrent data structures.
UNIT I ITERATIVE AND RECURSIVE ALGORITHMS being unfaithful
Iterative Methods: Measures of Progress and Loop Invariants-Paradigm Switch: Sequence of Actions versus Series of Assertions- Methods to Develop an Iterative Algorithm-Different Types of Iterative Algorithms—Typical Errors-Recursion-Forward compared to Backward- Systems of Hanoi-Checklist to get 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.
DEVICE II OPTIMISATION ALGORITHMS 9
Search engine optimization Problems-Graph Search Algorithms-Generic Search-Breadth-First Search- Dijkstra’s Shortest-Weighted-Path -Depth-First Search-Recursive Depth-First Search-Linear Placing your order of a Partial Order- Network Runs and Linear Programming-Hill Climbing-Primal Dual Hillside Climbing- Steepest Ascent Slope Climbing-Linear Programming-Recursive Backtracking-Developing Recursive Backtracking Algorithm- Pruning Branches-Satisfiability
UNIT III DYNAMIC PROGRAMMING ALGORITHMS being unfaithful
Developing a Dynamic Programming Algorithm-Subtle Points- Issue for the small 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 Difficulties with a Random Framework.
UNIT IV SHARED OBJECTS AND CONCURRENT OBJECTS 9
Distributed Objects and Synchronization -Properties of Mutual Exclusion-The Mora l- The Producer—Consumer Problem -The Readers—Writers Problem-Realities of Parallelization- Seite an seite Programming- Principles- Mutual Exclusion-Time- Critical Sections—Thread Solutions-The Filtration system Lock-Fairness-Lamport’s Food handling business Algorithm-Bounded Timestamps-Lower Bounds on the Number of Locations-Concurrent Objects- Concurrency and Correctness- Sequential Objects-Quiescent Consistency- Continuous Consistency-Linearizability- Formal Definitions- Progress Conditions- The Java Storage Model
DEVICE V CONCURRENT INFO STRUCTURES on the lookout for
Practice-Linked Lists-The Role of Locking-List-Based Sets-Concurrent Reasoning- Coarse- Grained Synchronization-Fine-Grained Synchronization-Optimistic Synchronization- Sluggish Synchronization-Non-Blocking Synchronization-Concurrent Queues and the ABA Problem- Queues-A Bounded Partial Queue-An Unbounded Total Queue-An Uncontained Lock-Free Queue-Memory Reclamation and the ABA Problem- Dual Info Structures- Concurrent Stacks and Elimination- An Unbounded Lock-Free Stack- Elimination-The Eradication Backoff Stack
REFERENCES:
- Jeff Edmonds, “How to Think about Algorithms”, Cambridge College or university Press, 2008.
- M. Herlihy and And. Shavit, “The Art of Multiprocessor Programming”, Morgan Kaufmann, 08.
- Steven H. Skiena, “The Algorithm Style Manual”, Springer, 2008.
- Peter Brass, “Advanced Data Structures”, Cambridge University Press, 2008.
- S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, “Algorithms”, McGrawHill, 08.
- J. Kleinberg and E. Tardos, “Algorithm Design”, Pearson Education, 2006.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms”, PHI Learning Private Limited, 2012.
- Rajeev Motwani and Prabhakar Raghavan, “Randomized Algorithms”, Cambridge University Press, 1995
- A. V. Aho, M. E. Hopcroft, and M. D. Ullman, “The Design and style and Analysis of Computer Algorithms”, Addison-Wesley, 75.
- A. V. Aho, M. E. Hopcroft, and M. D. Ullman, “Data Set ups and Algorithms”, Pearson, 2006.
a few. IMAGE DIGESTING AND ANALYSIS a few 0 0 3 OBJECTIVES:
- To understand the basics of digital pictures
- To understand sound models
- To understand spatial domain filters
- To understand frequency domain name filters
- To learn basic photo analysis — segmentation, border detection, and corner recognition
- To learn morphological operations and texture evaluation
- To understand digesting of color photos
- To understand photo compression approaches
PRODUCT I SPATIAL DOMAIN FINALIZING 9
Advantages to image processing — imaging modalities — image document formats — graphic sensing and acquisition — picture sampling and quantization — noises models — space filtering operations — histograms — smoothing filters — maintenance filters — unclear techniques for spatial filtering — space filters intended for noise removing
UNIT II FREQUENCY DOMAIN PROCESSING 9
Regularity domain — Assessment of Fourier Enhance (FT), Under the radar Fourier Change (DFT), and Fast Fourier Transform (FFT) — filtering in frequency domain — photo smoothing — photo sharpening — selective filtering — consistency domain sound filters — wavelets — Haar Transform — multiresolution expansions — wavelet transforms — wavelets centered image digesting
UNIT III SEGMENTATION AND EDGE DETECTION 9
Thresholding techniques — area growing methods — region breaking and merging — adaptive thresholding — threshold selection — global valley — histogram concavity — edge detection — template matching — gradient operators — circular operators — differential border operators — hysteresis thresholding — Canny operator — Laplacian operator — lively contours — subject segmentation
DEVICE IV INTEREST DETAILS, MORPHOLOGY, AND TEXTURE 9
Part and interest point detection — template matching — second order derivatives — median filter based detection — Harris interest stage operator — corner orientation — regional invariant feature detectors and descriptors — morphology — dilation and erosion — morphological operators — grayscale morphology — noises and morphology — texture — texture analysis — co-occurrence matrices — Laws’ texture energy approach — Ade’s eigen filter approach
26UNIT V COLOR IMAGES AND IMAGE COMPRESSION 9
Color models — pseudo colors — full-color image processing — color transformations — smoothing and sharpening of color images — graphic segmentation centered on color — sound in color images.
Image Compression — redundancy in images — coding redundancy — irrelevant info in images — picture compression models — basic compression methods — digital image watermarking.
TOTAL: 45 PERIODS OUTCOMES:
Upon completion of the course, the scholars will be able to
- Make clear image modalities, sensing, buy, sampling, and quantization
- Clarify image noise models
- Put into practice spatial filtering operations
- Clarify frequency domain transformations
- Put into practice frequency site filters
- Apply segmentation algorithms
- Apply advantage detection approach
- Apply nook and curiosity point recognition algorithms
- Apply morphological procedures
- Perform structure analysis
- Evaluate color images
- Implement picture compression methods
REFERRALS:
- At the. R. Davies, “Computer & Machine Vision”, 4th Edition, Educational Press, 2012.
- W. Burger and Meters. Burge, “Digital Image Finalizing: An Algorithmic Intro using Java”, Springer, 2008.
- John C. Russ, “The Image Digesting Handbook”, 6th Edition, CRC Press, 2011.
- L. C. Gonzalez and 3rd there�s r. E. Woods, “Digital Photo Processing”, Third Edition, Pearson, 2008.
- Draw Nixon and Alberto S i9000. Aquado, “Feature Extraction & Image Processing pertaining to Computer Vision”, Third Model, Academic Press, 2012.
- Deb. L. Baggio et al., “Mastering OpenCV with Practical Pc Vision Projects”, Packt Publishing, 2012.
- January Erik Solem, “Programming Computer Vision with Python: Tools and algorithms for inspecting images”, O’Reilly Media, 2012.
some. SOFTWARE REQUIREMENTS ENGINEERING several 0 0 3 OBJECTIVES:
- Understand program requirements
- Identify different types of requirement
- Generate requirements be elicitation
- Develop requirements documentation
- Evaluate the requirements
UNIT I DOMAIN UNDERSTANDING 9
Introduction — Types of requirements — Requirements executive process — Validating requirements — Requirements and design — Requirements and test cases — introduction to business domain — Trouble analysis — Seafood bone diagram — Business requirements — Business method modeling — Business use cases — Business building notations — UML Activity diagrams.
UNIT II REQUIREMENTS ELICITATION being unfaithful
Introduction — Understanding stakeholders’ needs — Elicitation techniques — interviews, set of questions, workshop, idea, prototyping — Recording stakeholders’ requirements UNIT III FUNCTIONAL REQUIREMENTS 9
Introduction — Features and Use cases — Use case scenarios — Documenting use cases — Levels of details — SRS files.
UNIT IV QUALITY ATTRIBUTES AND USER EXPERIENCE being unfaithful
Quality of solution — Quality attributes — Eliciting top quality attributes — Quality attribute workshop (QAW) — Creating quality attributes — Six component scenarios — User friendliness requirements — Eliciting and documenting usability requirements — Modeling end user experience — Specifying UI design
PRODUCT V MANAGING REQUIREMENTS 9
Identifying scope of the project — Context diagram — Managing requirements — Requirements properties — Traceability — Managing changes — Requirements metrics — Requirements supervision tools.
TOTAL: 45 PERIODS FINAL RESULTS:
- After Completion of the course, the students will be able to
- Establish aprocess intended for requirments anatomist
- Execute a process for gathering requirments through elicitation methods.
- Validate requirements according to criteria such as feasibility, clarity, preciseness etc .
- Develop and document functional requirements for different types of systems.
- Develop and doc quality features of the program to be implemented
- Talk the requirments to stakeholders
- Work out with stakeholders in order to agree on a set of requirements.
- Detect and resolve characteristic interactions
REFERENCES:
- Axel van Lamsweerde, “Requirements Engineering”, Wiley, 2009
- Gerald Kotonya, Ian Sommerville, “Requirements Engineering: Procedures and Techniques”, John Wiley and Daughters, 1998
- Leader Leffingwell and Don Widrig, “Managing Computer software Requirements: A Use Case Strategy (2nd Edition) “, Addison-wesley, 2003
- SEI Report, “Quality Qualities Workshophttp://www.sei.cmu.edu/library/abstracts/reports/03tr016.cfm, 20035. J Nielsen, “Usability Engineering”, Educational Press, 1993
a few. MULTICORE ARCHITECTURES OBJECTIVES:
- To understand the recent tendencies in the discipline of Computer Structures and discover performance related parameters
- To appreciate the need for parallel processing
- To expose the students to the problems related to multiprocessing
- To understand the different types of multicore architectures
- To expose the students to warehouse-scale and embedded architectures
DEVICE I FUNDAMENTALS OF QUANTITATIVE DESIGN AND ANALYSIS 9
Classes of Computers — Developments in Technology, Electrical power, Energy and Cost — Dependability — Measuring, Credit reporting and Summarizing Performance — Quantitative Principles of Computer Design — Classes of Parallelism — ILP, DLP, TLP and RLP — Multithreading — SMT and CMP Architectures — Restrictions of Single Key Processors — The Multicore era — Case Research of Multicore Architectures.
UNIT II DLP IN VECTOR, SIMD AND GPU ARCHITECTURES on the lookout for
Vector Architecture — SIMD Teaching Set Extensions for Multimedia — Graphics Control Units — Detecting and Improving Loop Level Parallelism — Case Studies.
PRODUCT III TLP AND MULTIPROCESSORS 9
Symmetric and Distributed Shared Memory Architectures — Cache Accordance Issues — Performance Issues — Sync Issues — Types of Memory Consistency — Interconnection Networks — Buses, Crossbar and Multi-stage Interconnection Systems.
UNIT IV RLP AND DLP IN WAREHOUSE-SCALE ARCHITECTURES being unfaithful
Programming Types and Workloads for Warehouse-Scale Computers — Architectures for Warehouse-Scale Computing — Physical Infrastructure and Costs — Impair Computing — Case Studies.
6. UNIT V ARCHITECTURES FOR EMBEDDED SYSTEMS 9
eatures and Requirements of Embedded Systems — Signal Finalizing and Inserted Applications — The Digital Transmission Processor — Inserted Multiprocessors — Circumstance Studies.
TOTAL: 45 PERIODS EFFECTS:
Upon completion of the course, the students will be able to
- Identify the limitations of ILP and the dependence on multicore architectures
- Discuss the issues related to multiprocessing and advise solutions
- Explain the prominent features of different multicore architectures and how they exploit parallelism
- Critically examine the different types of inter interconnection networks
- Discuss the buildings of GPUs, warehouse-scale computers and embedded cpus
RECOMMENDATIONS:
- David L. Hennessey and David A. Patterson, ” Computer Architecture — A Quantitative Approach”, Morgan Kaufmann / Elsevier, 5th release, 2012.
- Kai Hwang, “Advanced Computer Architecture”, Tata McGraw-Hill Education, the year 2003
- Richard Y. Kain, “Advanced Computer Buildings a Systems Style Approach”, Prentice Hall, 2011.
- David Elizabeth. Culler, Jaswinder Pal Singh, “Parallel Processing Architecture: A Hardware/ Software Approach”, Morgan Kaufmann / Elsevier, 97.
1
