24/7 writing help on your phone
Save to my list
Remove from my list
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
McCabe, Morgan Kaufmann, Third Edition, 2007.
ISBN-13: 978-0123704801
ADVANCED DATA STRUCTURES AND ALGORITHMS 3 0 0 3 OBJECTIVES:
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
IMAGE PROCESSING AND ANALYSIS 3 0 0 3 OBJECTIVES:
UNIT I SPATIAL DOMAIN PROCESSING 9
Introduction to image processing — imaging modalities — image file formats — image sensing and acquisition — image sampling and quantization — noise models — spatial filtering operations — histograms — smoothing filters — sharpening filters — fuzzy techniques for spatial filtering — spatial filters for noise removal
UNIT II FREQUENCY DOMAIN PROCESSING 9
Frequency domain — Review of Fourier Transform (FT), Discrete Fourier Transform (DFT), and Fast Fourier Transform (FFT) — filtering in frequency domain — image smoothing — image sharpening — selective filtering — frequency domain noise filters — wavelets — Haar Transform — multiresolution expansions — wavelet transforms — wavelets based image processing
UNIT III SEGMENTATION AND EDGE DETECTION 9
Thresholding techniques — region growing methods — region splitting and merging — adaptive thresholding — threshold selection — global valley — histogram concavity — edge detection — template matching — gradient operators — circular operators — differential edge operators — hysteresis thresholding — Canny operator — Laplacian operator — active contours — object segmentation
UNIT IV INTEREST POINTS, MORPHOLOGY, AND TEXTURE 9
Corner and interest point detection — template matching — second order derivatives — median filter based detection — Harris interest point operator — corner orientation — local invariant feature detectors and descriptors — morphology — dilation and erosion — morphological operators — grayscale morphology — noise 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 — image segmentation based on color — noise in color images.
Image Compression — redundancy in images — coding redundancy — irrelevant information in images — image compression models — basic compression methods — digital image watermarking.
TOTAL : 45 PERIODS OUTCOMES:
Upon completion of the course, the students will be able to
SOFTWARE REQUIREMENTS ENGINEERING 3 0 0 3 OBJECTIVES:
UNIT I DOMAIN UNDERSTANDING 9
Introduction — Types of requirements — Requirements engineering process — Validating requirements — Requirements and design — Requirements and test cases — introduction to business domain — Problem analysis — Fish bone diagram — Business requirements — Business process modeling — Business use cases — Business modeling notations — UML Activity diagrams.
UNIT II REQUIREMENTS ELICITATION 9
Introduction — Understanding stakeholders’ needs — Elicitation techniques — interviews, questionnaire, workshop, brainstorming, prototyping — Documenting stakeholders’ needs UNIT III FUNCTIONAL REQUIREMENTS 9
Introduction — Features and Use cases — Use case scenarios — Documenting use cases — Levels of details — SRS documents.
UNIT IV QUALITY ATTRIBUTES AND USER EXPERIENCE 9
Quality of solution — Quality attributes — Eliciting quality attributes — Quality attribute workshop (QAW) — Documenting quality attributes — Six part scenarios — Usability requirements — Eliciting and documenting usability requirements — Modeling user experience — Specifying UI design
UNIT V MANAGING REQUIREMENTS 9
Defining scope of the project — Context diagram — Managing requirements — Requirements properties — Traceability — Managing changes — Requirements metrics — Requirements management tools.
TOTAL : 45 PERIODS OUTCOMES:
MULTICORE ARCHITECTURES OBJECTIVES:
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.
eatures and Requirements of Embedded Systems — Signal Processing and Embedded Applications — The Digital Signal Processor — Embedded Multiprocessors — Case Studies.
TOTAL : 45 PERIODS OUTCOMES:
Upon completion of the course, the students will be able to
Srs for Online Shopping System. (2016, Mar 30). Retrieved from https://studymoose.com/srs-for-online-shopping-system-essay
👋 Hi! I’m your smart assistant Amy!
Don’t know where to start? Type your requirements and I’ll connect you to an academic expert within 3 minutes.
get help with your assignment