G. B. Technical University, Lucknow: Syllabus
G. B. Technical University, Lucknow: Syllabus
G. B. Technical University, Lucknow: Syllabus
SYLLABUS
B. Tech Fourth Year (Semester VII)
B.Tech Study and Evaluation Scheme Effective from session 2011-12 Computer Science & Engineering Year-IV, Semester VII
S.No Subject Code Subject Perio d Evaluation Scheme Sessional CT TA Total 1 2 3 4 EOE-071 ECS-701 ECS-702 ECS-073
Entrepreneurship Development
Total Exam
30 30 30 30
20 20 20 20
50 50 50 50
Distributed Systems Digital Image Processing Parallel Algorithms Data Mining & Data Warehousing
ECS-075
3-1-0
30
20
50
100
150
Practicals / Training /Projects 6 7 8 9 10 ECS-751 ECS-752 ECS-753 ECS-754 GP-701 Distributed Systems Lab* Digital Image Processing Lab* Project Industrial Training Viva-Voce General Proficiency 0-0-2 0-0-2 0-0-4 0-0-2 25 25 50 50 25 25 50 50 25 25 50 50 50 50 50
ECS-701
UnitI
DISTRIBUTED SYSTEMS
Characterization of Distributed Systems: Introduction, Examples of distributed Systems, Resource sharing and the Web Challenges. Architectural models, Fundamental Models. Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock, shared memory, Logical clocks, Lamports & vectors logical clocks. Concepts in Message Passing Systems: causal order, total order, total causal order, Techniques for Message Ordering, Causal ordering of messages, global state, termination detection. Unit-II Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual exclusion theorem, Token based and non token based algorithms, performance metric for distributed mutual exclusion algorithms. Distributed Deadlock Detection: system model, resource Vs communication deadlocks, deadlock prevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms. UnitIII Agreement Protocols: Introduction, System models, classification of Agreement Problem, Byzantine agreement problem, Consensus problem, Interactive consistency Problem, Solution to Byzantine Agreement problem, Application of Agreement problem, Atomic Commit in Distributed Database system.
Distributed Resource Management: Issues in distributed File Systems, Mechanism for building distributed file systems, Design issues in Distributed Shared Memory, Algorithm for Implementation
of Distributed Shared Memory. UnitIV Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery, Recovery in Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed Database Systems. Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting protocols, Dynamic voting protocols. Unit V Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic Concurrency control, Timestamp ordering, Comparison of methods for concurrency control. Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery. Replication: System model and group communication, Fault - tolerant services, highly available services, Transactions with replicated data. References: 1. 2. 3. 4. 5. Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill Ramakrishna,Gehrke, Database Management Systems, Mc Grawhill Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design, Pearson Education Tenanuanbaum, Steen, Distributed Systems, PHI Gerald Tel, "Distributed Algorithms", Cambridge University Press
ECS-702
UNIT-I Introduction and Fundamentals Motivation and Perspective, Applications, Components of Image Processing System, Element of Visual Perception, A Simple Image Model, Sampling and Quantization. Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters Low-pass, High-pass; Correspondence Between Filtering in Spatial and Frequency Domain; Smoothing Frequency Domain Filters Gaussian Lowpass Filters; Sharpening Frequency Domain Filters Gaussian Highpass Filters; Homomorphic Filtering. UNIT-II Image Enhancement in Spatial Domain
Introduction; Basic Gray Level Functions Piecewise-Linear Transformation Functions: Contrast Stretching; Histogram Specification; Histogram Equalization; Local Enhancement; Enhancement using Arithmetic/Logic Operations Image Subtraction, Image Averaging; Basics of Spatial Filtering; Smoothing Mean filter, Ordered Statistic Filter; Sharpening The Laplacian.
UNIT-III Image Restoration A Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-Spatial Filtering Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic Filters Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain Filtering Bandpass Filters; Minimum Mean-square Error Restoration. UNIT-IV Morphological Image Processing Introduction, Logic Operations involving Binary Images, Dilation and Erosion, Opening and Closing, Morphological Algorithms Boundary Extraction, Region Filling, Extraction of Connected Components, Convex Hull, Thinning, Thickening UNIT-V Registration Introduction, Geometric Transformation Plane to Plane transformation, Mapping, Stereo Imaging Algorithms to Establish Correspondence, Algorithms to Recover Depth Segmentation Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local Thresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements Extraction by Thresholding, Edge Detector Performance, Line Detection, Corner Detection. References:
1. Digital Image Processing 2 Edition, Rafael C. Gonzalvez and Richard E. Woods. Published by: Pearson Education. 2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by: John Wiley and Sons, NY. 3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice Hall, Upper Saddle River, NJ.
nd
ECS-073
Unit-I:
PARALLEL ALGORITHMS
Sequential model, need of alternative model, parallel computational models such as PRAM, LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle Computers, Tree model, Pyramid model, Fully Connected model, PRAM-CREW, EREW models, simulation of one model from another one. Unit-II: Performance Measures of Parallel Algorithms, speed-up and efficiency of PA, Costoptimality, An example of illustrate Cost- optimal algorithms- such as summation, Min/Max on various models. Unit-III: Parallel Sorting Networks, Parallel Merging Algorithms on CREW/EREW/MCC, Parallel Sorting Networks on CREW/EREW/MCC/, linear array Unit-IV: Parallel Searching Algorithm, Kth element, Kth element in X+Y on PRAM, Parallel Matrix Transportation and Multiplication Algorithm on PRAM, MCC, Vector-Matrix Multiplication, Solution of Linear Equation, Root finding. Unit-V: Graph Algorithms - Connected Graphs, search and traversal, Combinatorial Algorithms-Permutation, Combinations, Derrangements. References: 1. M.J. Quinn, Designing Efficient Algorithms for Parallel Computer, McGrawHill. 2. S.G. Akl, Design and Analysis of Parallel Algorithms 3. S.G. Akl, Parallel Sorting Algorithm by Academic Press
ECS-075
Unit-I
Overview, Motivation(for Data Mining),Data Mining-Definition & Functionalities, Data Processing, Form of Data Prepro cessing, Data Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression, Computer and Human inspection),Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering, Discretization and Concept hierarchy generation
Unit-II Concept Description:- Definition, Data Generalization, Analytical Characterization, Analysis of attribute relevance, Mining Class comparisons, Statistical measures in large Databases. Measuring Central Tendency, Measuring Dispersion of Data, Gr aph Displays of Basic Statistical class Description, Mining Association Rules in Large Databases, Association rule mining, mining Single- Dimensional Boolean Association rules from Transactional Databases Apriori Algorithm, Mining Multilevel Association rules from Transaction Databases and Mining Multi-Dimensional Association rules from Relational Databases Unit-III Classification and Predictions: What is Classification & Prediction, Issues regarding Classification and prediction, Decision tree, Bayesian Classification, Classification by Back propagation, Multilayer feed-forward Neural Network, Back propagation Algorithm, Classification methods K-nearest neighbor classifiers, Genetic Algorithm. Cluster Analysis: Data types in cluster analysis, Categories of clustering methods, Partitioning methods. Hierarchical Clustering- CURE and Chameleon, Density Based Method s-DBSC AN, OPTICS, Grid Based Methods- STING, CLIQUE, Model Based Method Statistical Approach, Neural Network approach, Outlier Analysis Unit-IV Data Warehousing: Overview, Definition, Delivery Process, Difference between Database System and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept hierarch y, Process Architecture, 3 Tier Architecture, Data Marting. Unit-V Aggregation, Historical information, Query Facility, OLAP function and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery, Tuning Data Warehouse, Testing Data Warehouse. References: 1. M.H.Dunham, Data Mining: Introductory and Advanced Topics Pearson Education 2. Jiawei Han, Micheline Kamber, Data Mining Concepts & Techniques Elsevier 3. Sam Anahory, Dennis Murray, Data Warehousing in the Real World : A Practical Guide for Building Decision Support Systems, Pearson Education