S6 - Project Management and Quality Assurance

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

S6 - PROJECT MANAGEMENT AND QUALITY ASSURANCE Module 1 PROJECT PLANNING Overview Capital expenditure Phases of capital budgeting Project

ect development cycle 7-s of project management Requirements of a project manager Forms of project organization. Module 2 PROJECT ANALYSIS Market Analysis Technical Analysis Financial Analysis Risk Analysis Social cost Benefit Analysis. Module 3 CONTROL OF PROJECT Control Systems Control of major constraints Project management software & information systems. REVIEW: Performance of Evaluation Abandonment Analysis Behavioral issues in Project Management Module 4 TOTAL QUALITY MANAGEMENT Quality systems ISO 9000 series ISI Benchmarking Quality Function development (QFD) Total Productive Maintenance (TPM) ISO 14000. Module 5 CONCEPTS IN SAMPLING Sampling designs and schemes Errors in sampling Simple random sample stratified random sample Cluster sample. Sample size destination Estimating population mean Estimating population proportion.

References 1. Projects preparation, Apprisal, Budgeting & Implementation Prasanna Chandra Tata McGraw Hill 2. Projects Planning, Analysis, Selection, Implementation & Review Prasanna Chandra Tata McGraw Hill 3. Project Management Harvey Maylor Pearson Education 4. Total Quality Management Dale H. Besterfield Pearson Education 5. Quality control and Improvement Amitava Mitra Pearson Education 6. Quality assurance and TQM Jain & Chitale Khanna Publishers

S6 - ALGORITHM ANALYSIS AND DESIGN Module 1 Introduction and Complexity What is an algorithm Properties of an Algorithm, Difference between Algorithm, Computational Procedure and Program, Study of Algorithms; Pseudo-code Conventions; Recursive Algorithms Space and Time Complexity Asymptotic Notations Oh, Omega, Theta, Common Complexity Functions; Recurrence Relations and Recurrence Trees for Complexity Calculations; Profiling. Deterministic and non deterministic algorithms. Module 2 Divide and Conquer Control Abstraction, Finding Maximum and Minimum, Binary Search, Divide and Conquer Matrix Multiplication, Stressens Matrix Multiplication, Merge Sort, Quick Sort. Module 3 Greedy Strategy Control Abstraction, General Knapsack Problem, Optimal Storage on Tapes, Minimum Cost Spanning Trees Prims Algorithm, Kruskals Algorithm Job sequencing with deadlines. Module 4 Dynamic Programming Principle of Optimality, Multi-stage Graph, All-Pairs Shortest Paths, Travelling Salesman Problem. Lower Bound Theory Comparison Trees for Searching and Sorting, Oracles and Adversary Arguments Merging, Insertion & Selection Sort; Selection of kth Smallest Element. Module 5 Backtracking Control Abstraction Bounding Functions, Control Abstraction, N-Queens Problem, Sum of Subsets, Knapsack problem. Branch and Bound Techniques FIFO, LIFO, and LC Control Abstractions, 15-puzzle, Travelling Salesman Problem. Text Book 1. Fundamentals of Computer Algorithms Horowitz and Sahni, Galgotia References 1. Computer Algorithms Introduction to Design and Analysis Sara Baase & Allen Van Gelder, Pearson Education 2. Data Structures algorithms and applications Sahni, Tata McGrHill 3. Foundations of Algorithms Richard Neapolitan, Kumarss N., DC Hearth & Company 4. Introduction to algorithm- Thomas Coremen, Charles, Ronald Rivest PHI

S6 - PC & PC BASED SYSTEMS

Module 1 - Introduction to PC Hardware components study of motherboards Different types of ports, slots and connectors-Add-on cards-Power supply SMPS- function & operations. Module 2 - Storage Devices Floppy Floppy Disk Controller Disk Physical specification & operations Disk magnetic properties Cylinders Clusters Hard disks Hard disk drive operation Magnetic data storage Sectors Disk formatting partitioning Hard disk features Hard disk data transfer modes Programmed I/O Direct memory access Ultra DMA Data addressing Standard CHS addressing Extended CHS addressing Logical Block Addressing. Module 3 - Optical Storage CD ROM, CD Technology, Sector layout, CD-R, CD-RW, CDROM, drive specifications- data transfer rate Access time Constant linear velocity constant angular velocity Buffers Interface Magneto optical drives WORM devices DVD- RAID Holographic storage. Module 4 - Memory Management in PC Parity ECC Static & Dynamic RAM Memory Addressing Segmented addressing 64 KB Limits 640 KB barrier Logical, segmented, virtual, linear and physical memory addresses Extended and Expanded memory Cache memory Video memory HMA Flat memory model Advanced memory technologies. Module 5 - Bus Structures ISA, PCI, PCMCIA, AGP, USB, Hard Disk Interfaces IDE, EIDE, ATA Communication ports Serial Parallel port Keyboard / Mouse Interface connectors.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy