This action might not be possible to undo. Are you sure you want to continue?
List of Electives Elective-I S.No. Paper Code 1. TIT 011 2. TCS 033 3. TIT 012 Elective-II 1. TCS 031 2. TIT 021 3. TCS 034 Elective-III 1. TCS 041 2. TIT 031 3. TCS 044 4. TIT 032 Elective-IV 1. TCS 054 2. TIT 041 3. TIT 042
Paper Name Digital Image Processing Bioinformatics Multimedia Systems
Data Mining & Data Warehousing IT for Forensic Science Data Compression
Real Time Systems Advance Computer Architecture Embedded Systems Storage & Information Management
Mobile Computing Soft Computing Software Quality Engineering
(TIT 701 ) CRYPTOGRAPHY AND NETWORK SECURITY
Unit-I Introduction to security attacks, services and mechanism, introduction to cryptography. Conventional Encryption: Conventional encryption model, classical encryption techniques- substitution ciphers and transposition ciphers, cryptanalysis, stereography, stream and block ciphers. Modern Block Ciphers: Block ciphers principals, Shannon’s theory of confusion and diffusion, fiestal structure, data encryption standard(DES), strength of DES, differential and linear crypt analysis of DES, block cipher modes of operations, triple DES, IDEA encryption and decryption, strength of IDEA, confidentiality using conventional encryption, traffic confidentiality, key distribution, random number generation. Unit-II Introduction to graph, ring and field, prime and relative prime numbers, modular arithmetic, Fermat’s and Euler’s theorem, primality testing, Euclid’s Algorithm, Chinese Remainder theorem, discrete logarithms. Principals of public key crypto systems, RSA algorithm, security of RSA, key management, Diffle-Hellman key exchange algorithm, introductory idea of Elliptic curve cryptography, Elganel encryption.
Unit-III Message Authentication and Hash Function: Authentication requirements, authentication functions, message authentication code, hash functions, birthday attacks, security of hash functions and MACS, MD5 message digest algorithm, Secure hash algorithm(SHA). Digital Signatures: Digital Signatures, authentication protocols, digital signature standards (DSS), proof of digital signature algorithm. Unit-IV Authentication Applications: Kerberos and X.509, directory authentication service, electronic mail security-pretty good privacy (PGP), S/MIME. Unit-V IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security associations, key management. Web Security: Secure socket layer and transport layer security, secure electronic transaction (SET). System Security: Intruders, Viruses and related threads, firewall design principals, trusted systems. Books: 1. William Stallings, “Cryptography and Network Security: Principals and Practice”, Prentice Hall, New Jersy. 2. Johannes A. Buchmann, “Introduction to Cryptography”, Springer-Verlag. 3. Bruce Schiener, “Applied Cryptography”.
(TIT 702 ) ARTIFICIAL INTELLIGENCE
Unit-I: Introduction Introduction to Artificial Intelligence, Simulation of sophisticated & Intelligent Behavior in different area, problem solving in games, natural language, automated reasoning visual perception, heuristic algorithm versus solution guaranteed algorithms. Unit-II: Understanding Natural Languages Parsing techniques, context free and transformational grammars, transition nets, augmented transition nets, Fillmore’s grammars, Shanks Conceptual Dependency, grammar free analyzers, sentence generation, and translation. Unit-III: Knowledge Representation First order predicate calculus, Horn Clauses, Introduction to PROLOG, Semantic Nets Partitioned Nets, Minskey frames, Case Grammar Theory, Production Rules Knowledge Base, The Inference System, Forward & Backward Deduction. Unit-IV: Expert System
A Simple Image Model. domain exploration. Rich & Knight. Element of Visual Perception. Histogram Specification. Periodic Noise Reduction by Frequency Domain Filtering – Bandpass Filters.” Addision Wesley 2. Image Averaging. Local Enhancement. Foundation of Logic Programming. Line Finding. Semantic. Applications. Unit-V: Pattern Recognition Introduction to pattern Recognition. Smoothing Frequency Domain Filters – Gaussian Lowpass Filters. Basics of Spatial Filtering. Marcellous. Sharpening Frequency Domain Filters – Gaussian Highpass Filters. Ordered Statistic Filter. Sampling and Quantization. Self Explaining System. “Academic Press 6. Components of Image Processing System. Lioyed. “LISP”.Mean filter. Sharpening – The Laplacian. Structured Description. Object Identification. MYCIN). “Artificial Intelligence” 3. Basic Gray Level Functions – Piecewise-Linear Transformation Functions: Contrast Stretching. Meta Knowledge.” Artificial Intelligence. Correspondence Between Filtering in Spatial and Frequency Domain. . Image Restoration A Model of Restoration Process. & Model. Max and Min filters. Filters – Low-pass. UNIT-II Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain.”Springer Verlag (TIT 011 ) DIGITAL IMAGE PROCESSING UNIT-I Introduction and Fundamentals Motivation and Perspective. High-pass. Addison Wesley 4. Interception. Symbolic Description. Programming Language: Introduction to programming Language. Speech Recognition. Expertise Transfer. LISP. “Expert Systems Programming”. Winston. PROLOG Books: 1. Elamie. Basis of Filtering in Frequency Domain.Existing Systems (DENDRAL. Enhancement using Arithmetic/Logic Operations – Image Subtraction. Charnick “Introduction to Artificial Intelligence. Minimum Mean-square Error Restoration. Smoothing . Image Enhancement in Spatial Domain Introduction. Histogram Equalization. PHI 5. Order Statistic Filters – Median Filter. Noise Models. Machine perception. Homomorphic Filtering. Geometric Mean Filter. Restoration in the presence of Noise only-Spatial Filtering – Mean Filters: Arithmetic Mean filter.
Local Thresholding. Mapping. Extraction of Connected Components.UNIT-III Color Image Processing Color Fundamentals. Digital Image Processing 2nd Edition. Pixel-Based Approach. Metadata: Summary & reference systems. Edge Elements Extraction by Thresholding.K. Data integration. R. Color Segmentation. UNIT-V Feature Extraction Representation. A. Algorithms to Recover Depth Segmentation Introduction. Region-based Approach. Geometric Attributes Description Boundary-based Description. Data analysis. Thinning. Object Recognition Deterministic Methods. Rafael C. Topological Attributes. Gonzalvez and Richard E. Syntactic Recognition. Published by: John Wiley and Sons. Multi-level Thresholding. NJ. Relationship. Geometric Transformation – Plane to Plane transformation. Tree Search. Convex Hull. Fundamentals of Digital Image Processing. Edge Operators. 2. Corner Detection. Thickening UNIT-IV Registration Introduction. Stereo Imaging – Algorithms to Establish Correspondence. Major Bioinformatics databases and tools. Converting Colors to different models. Upper Saddle River. Dilation and Erosion. Published by Prentice Hall. Edge and Line Detection: Edge Detection.J. 3. Pattern Fitting Approach. Woods. Digital Image Processing and Computer Vision. Edge Linking and Edge Following. Region Filling. Color Transformation. Clustering. Line Detection. Morphological Image Processing Introduction. finding new type of data online. Region-based Description. . Morphological Algorithms – Boundary Extraction. Published by: Pearson Education. Interdisciplinary nature of Bioinformatics. Region Extraction. (TCS 033 ) BIOINFORMATICS Unit I: Introduction Bioinformatics objectives and overviews. Smoothing and Sharpening. Statistical Classification. Logic Operations involving Binary Images. Color Models. Edge Detector Performance. Graph Matching Books: 1. NY. Opening and Closing. Schalkoff. Jain.
Indian Edition’s publication 2. Computational representations of molecular biological data storage techniques: databases (flat. GenesAnalyzing DNA.Central dogma of molecular biology. Addison Wesley 5. Proteins: Amino Tertiary and Quaternary structure. and controlled vocabularies. acids. 4. Multimedia Information. CORBA. Mendiratta. relational and object oriented). Introduction to biostatics. Secondary.DNA sequencing. chemical compounds. “ Developing Bio informatics computer skills”.Molecular Biology and Bioinformatics: Systems approach in biology.Bioperl. “Bioinformatics Basic Applications” CRC Press. Boolean search. Linux Operating System. expressed sequence tags. -Transcription. DNA the functional elements in DNA. Communication and Entertainment . O’Reilly. Rastogi. general data retrieval techniques: indices. Multimedia in business and work. Protein folding interaction. Perl applications for bioinformatics. “Bioinformatics” . application to biological data warehouses. Structure of Replication. macromolecular structures. Convergence of Computer. Unit V: Biological data types and their special requirements: sequences. gene expression. and function. -Translation. Nucleic acid-Protein Unit III: Perl Perl Basics. generic variability and its connection to clinical data. Books: 1. regular expressions. Representation of patterns and relationships: alignments. Unit IV: Nucleotide sequence data Genome. hierarchies and graphical models. Rastogi. Overview of the bioinformatics applications. Understanding and Using Biological Databases.Methods & Protocols” (TIT 012 ) MULTIMEDIA SYSTEMS Unit-I: Introduction Introduction to Multimedia. Hooman and Lukas K. Rashidi. “Bioinformatics concepts. problems in molecular approach and the bioinformatics approach. Structure of RNA. Java clients. skills & Applications”. Genomic sequencing. Unit II: The Information Molecules and Information Flow Basic chemistry of nucleic acids. transcription factor binding sites and single nucleotide polymorphism. CBS Publishers 3. Stephen Misner & Stephen Krawetz. Multimedia Objects. Buehler. fuzzy search and neighboring. Protein structure. DNA. “ Bioinformatics.
Shannon Fano Algorithm.products Stages of Multimedia Projects Multimedia hardware. Sleinreitz “Multimedia System” Addison Wesley. Sampling Variables. 8. Books: 1. 4. Making IT Work” Osborne McGraw Hill. recent development in Multimedia. video. David Hillman “Multimedia technology and Applications” Galgotia Publications.Data Mining-Definition & Functionalities. authoring tools. image capturing. Noisy . Zig Zag Coding. Dictionary based Compression. Compression ratio loss less & lossy compression. Indexing and retrieval of Video Database. Buford “Multimedia Systems” Addison Wesley. MIDI under windows environment Audio & Video Capture. JPEG Compression. MPEG standards. bitmaps. Memory & storage devices. lossy graphic compression. 3. card and page based authoring tools. Data Cleaning: Missing Values. James E Skuman “Multimedia in Action” Vikas. Multimedia Database. Unit-II: Multimedia Building Blocks Text. Mark Nelson “Data Compression Book” BPB. Arithmetic Coding Higher Order Modelling. Colors. Video Compression. Data Processing. loss compression & silence compression. Unit-III: Data Compression Huffman Coding. Video Conferencing. Digital Audio. Rosch “Multimedia Bible” Sams Publishing.Video:Video representation. 5.Content based retrieval for text and images. Sliding Window Compression. Tay Vaughan “Multimedia. 6. Huffman Algorithms. Loss less compression of sound. Unit-IV: Speech Compression & Synthesis Digital Audio concepts. presentation tools. Agrawal & Tiwari “Multimedia Systems” Excel. Finite Context Modelling. audio file formats. Unit-V: Images Multiple monitors. Compression. 7. Form of Data Preprocessing. Multimedia software's. Motivation(for Data Mining). 2. sound. tools for object generations. LZW compression. Communication devices. Sound MIDI. image file formatic animations Images standards. MHEG Standard Video Streaming on net. (TCS 031 ) DATA MINING AND WAREHOUSING Unit-I Overview. Adaptive Coding. Multimedia Broadcast Services. LZ77. Vector drawing.
“Data Warehousing in the Real World : A Practical Guide for Building Decision Support Systems. Sam Anahory. Data Cubes. Cluster Analysis: Data types in cluster analysis. 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. Testing Data Warehouse.H. Process Architecture.McGraw –Hill .”Data Mining:Introductory and Advanced Topics” Pearson Education 2. Numerosity Reduction. Delivery Process. Tuning Data Warehouse. Data Compression. Data Reduction:-Data Cube Aggregation. Regression. Analytical Characterization. Data Mining interface. Measuring Central Tendency. Multi Dimensional Data Model.(Binning. OLAP Servers. Dennis Murray. Statistical measures in large Databases. Back propagation Algorithm. Clustering. Data Integration and Transformation. ”Data Mining Concepts & Techniques” Elsevier 3. Jiawei Han. Snow Flakes. Historical information. Neural Network approach. Classification methods Knearest neighbor classifiers.”Data Warehousing System”.Definition. Mallach. Classification by Back propagation. Categories of clustering methods. Analysis of attribute relevance. Difference between Database System and Data Warehouse. Association rule mining. Density Based Methods-DBSCAN. Fact Constellations. OPTICS.STING. ROLAP. Multilayer feed-forward Neural Network. Clustering. Discretization and Concept hierarchy generation. Partitioning methods.Data. Unit-II Concept Description:. Concept hierarchy. Graph Displays of Basic Statistical class Description. MOLAP. Backup and Recovery. Query Facility.Inconsistent Data. 1/e “ Pearson Education 4. Issues regarding Classification and prediction. Stars.Dunham. Books: 1. Data Generalization. Measuring Dispersion of Data. Decision tree. Dimensionality reduction. mining Single-Dimensional Boolean Association rules from Transactional Databases– Apriori Algorithm. Data Marting. Security. Model Based Method –Statistical Approach. Bayesian Classification. HOLAP. Hierarchical Clustering. Mining Class comparisions. Outlier Analysis Unit-IV Data Warehousing: Overview. Definition. Computer and Human inspection). Micheline Kamber. Genetic Algorithm. Grid Based Methods. 3 Tier Architecture. M. Unit-V Aggregation. OLAP function and Tools. CLIQUE. Mining Association Rules in Large Databases.CURE and Chameleon.
Modeling and coding. Discrete Cosine Transformation. Models: Physical models. Elsevier 3. 2. Split Images in Perceptual Bands.. Wisdom from Cryptography Principles of Steganography: Framework for Secret Communication. Active and Malicious Attackers. Evaluation and Benchmarking of Watermarking system. Information hiding in Written Text. Verification by humans. Lossy Compression. Mathematical Preliminaries for Lossless compression: A brief introduction to information theory. Authentication Methods. Access Control Security Services. References: 1. Matching Biometric Samples. UNIT V Transform Methods: Fourier Transformation. Security of Steganography System. Steganalysis: Looking for Signatures: . UNIT IV Watermarking and Copyright Protection: Basic Watermarking. UNIT I I Introduction to Information Hiding: Technical Steganography. Definition of FAR and FRR. Watermarking Applications. Error Rate of Match Engines.Spread Spectrum and Information hiding. "Disappearing Cryptography: Information Hiding. Statistical Steganography. Fast Fourier Transformation. Score distribution. Biometric Verification. al. Requirements and Algorithmic Design Issues. Adaptive versus non-Adaptive Algorithms. Iris Recognition. Petitcolas. Peter Wayner. Measures of prefonnance. Speaker Recognition. " Information Hiding Techniques for Steganography and Digital Watermarking". UNIT I I I A Survey of Steganographic Techniques: Substitution systems and Bit Plane Tools. Wavelets. Katzendbisser.(TIT 021 ) IT FOR FORENSIC SCIENCE UNIT I Overview of Biometrics. Signature Verification. Matching: Two kinds of errors. . Common biometrics: Finger Print Recognition. Hand Geometry. Connell et. Steganography and Watermarking 2/e". Biometric Enrollment. Linguistic Steganography.Extracting hidden Information. Disabling Hidden Information. Face Recognition. Biometric. Information Hiding in Noisy Data . Estimating Errors from Data. Sp ringer (TCS 034 ) DATA COMPRESSION Unit . Distortion Techniques. Transform Domain Techniques: . Bolle. Applications of Transformation in Steganography. System Security. Mellin-Fourier Transformation. Positive and Negative of Biometrics. Cover Generation Techniques. Copy Right Enforcement. "Guide to Biometrics". Biometric Identification.I: Introduction Compression Techniques: Loss less compression. Authentication Protocols. Artech House. Authentication and Biometrics: Secure Authentication Protocols.
Adaptive Huffman coding: Update procedure. Compression over Modems: V. Generating a binary code. Adaptive Quantization. Applications: File Compression-UNIX compress. Golomb codes. Dynamic Markoy Compression. Comparison of Binary and Huffman coding. The BurrowsWheeler Transform: Move-to-front coding. Predictive Coding: Prediction with Partial match (ppm): The basic algorithm. length of context.Probability models. Facsimile Encoding. The LZ78 Approach. Applications of Hoffman coding: Loss less image compression. Structured Vector Quantizers. Image compression. Encoding procedure. Uniform Quantizer. Fundamental Models . JPEG-LS. Books: 1. Decoding procedure. Models. Coding: uniquely decodable codes. Text compression. Markov models. System Models: Architectural models. Dictionary Techniques: Introduction. Introduction to Data Compression. Adaptive Dictionary. Tree structured Vector Quantizers. Audio Compression. Scalar Ouantization: The Quantization problem. Applications: Bi-level image compression-The JBIG standard. Rice codes. The ESCAPE SYMBOL. Static Dictionary: Diagram Coding. Morgan Kaufmann Publishers (TCS 801 ) DISTRIBUTED SYSTEMS Unit–I Characterization of Distributed Systems: Introduction. composite source model. Multi-resolution Approaches. Tunstall codes. Unit-III: Arithmetic Coding Coding a sequence. Examples of distributed Systems. JBIG2. Unit – II: Huffman coding The Huffman coding algorithm: Minimum variance Huffman codes. Unit – IV: Mathematical Preliminaries for Lossy Coding Distortion criteria. Prefix codes. Unit-V: Vector Quantization Advantages of Vector Quantization over Scalar Quantization. Image Compression: The Graphics Interchange Format (GIF). The Exclusion Principle. Resource sharing and the Web Challenges. The LZ77 Approach. CALIC.42 bits. Non uniform Quantization. The Linde-BuzoGray Algorithm. Khalid Sayood.
Balanced sliding window protocol. Locks. 3. shared memory. Security: Overview of security techniques. Cambridge University Press (TIT 802 ) IT INFRASTRUCTURE MANAGEMENT . Application of Agreement problem. SSL & Millicent. path pushing algorithms. Causal ordering of messages. Comparison of methods for concurrency control. edge chasing algorithms. Distributed deadlocks. "Advanced Concept in Operating Systems". Books: 1. Token based and non token based algorithms. Unit –V Distributed Algorithms: Introduction to communication protocols. Deadlock free Packet switching. Solution to Byzantine Agreement problem. Byzantine agreement problem. performance metric for distributed mutual exclusion algorithms. McGraw Hill 2. Logical clocks. Atomic Commit in Distributed Database system. Unit–II Distributed Deadlock Detection: system model. Transactions with replicated data. The Andrew File System. Unit–IV Transactions and Concurrency Control: Transactions. avoidance. Unit–III Distributed Objects and Remote Invocation: Communication between distributed objects. Concurrency control in distributed transactions. Kerberos. highly available services. CORBA services. Consensus problem. Routing algorithms. Distributed Mutual Exclusion: Classification of distributed mutual exclusion. Replication: System model and group communication. Recent advances. Sun Network File System. resource Vs communication deadlocks. Election algorithm. Fault tolerant services. Pearson Ed. Case studies: Needham Schroeder. System models. Java RMI case study. Transaction recovery. APP problem. detection & resolution. classification of Agreement Problem. Singhal & Shivaratri.Theoretical Foundation for Distributed System: Limitation of Distributed system. centralized dead lock detection. Distributed File Systems: File service architecture. Distributed Transactions: Flat and nested distributed transactions. global state. Atomic Commit protocols. Events and notifications. Interactive consistency Problem. Introduction to Wave & traversal algorithms. Kindberg. termination detection. Digital signatures Cryptography pragmatics. Cryptographic algorithms. Agreement Protocols: Introduction. Coulouris. requirement of mutual exclusion theorem. deadlock prevention. distributed dead lock detection. Destination based routing.CORBA Case Study: CORBA RMI. Dollimore. "Distributed System: Concepts and Design”. "Distributed Algorithms". Optimistic Concurrency control. absence of global clock. Gerald Tel. Lamport’s & vectors logical clocks. Nested transactions. Timestamp ordering. Remote procedure call.
Backup & Restore. financial management and costing. Michael Hawkins. Data. Determining customer's Requirements. Introduction to the design process for information systems. 2nd edition 2005 • High Availability: Design. growth of internet. UNIT II • Preparing for Infrastructure Management Factors to consider in designing IT organizations and IT infrastructure. firewall. Incident management. Intrusion detection. current business demands and IT systems issues. Prentice Hall. Release management. Change management. Basics of network security. and Processe. Disaster Recovery. UNIT III • Service Delivery Processes Service-level management. Availability management. and Managing World-Class Infrastructures Rich Schiesser. Guy Nemiro. Total cost of complexity issues. Van Haren Publishing. Identifying System Components to manage. 2001 (TCS 041 ) REAL TIME SYSTEMS . Publisher: Prentice Hall. Infrastructure management activities. SAN & NAS. by Floyd Piedad. by Harris Kem. Tools and their integration. Information Technology Infrastructure Library (ITIL). security information management Introduction to Storage. Access Management. Capacity management. complexity of today's computing environment. Space Management. UNIT IV • Service Support Processes Configuration Management. LDAP fundamentals.UNIT I • Infrastructure Management Overview Definitions. Data retention Reference Books: • Foundations of IT Service Management: based on ITIL. Techniques. Prentice Hall PTR. Database & Application protection. Service desk. Evolutions of Systems since 1960s (Mainframes-to-Midrange-to-PCs-to-Client-server computing-to-New age systems) and their management. Patterns for IT systems management. Stuart Gaiup. Single sign-on. IT services continuity management. Problem management. 2000 • IT Organization: Building a Worldclass Infrastructure. applications. Models. Archive & Retrieve. Identity management. UNIT V • Storage and Security Management Introduction Security. Bare machine recovery. Hierarchical space management. by Jan Van Bon. Value of Systems management for business. Exist Processes. Implementing. 2000 • IT Systems Management: Designing.
performance of parallel processors. Offline Versus Online Scheduling. Scheduling Aperiodic and Sporadic jobs in Priority Driven and Clock Driven Systems. Flynn’s . Real-Time Systems: Scheduling.. and Verification by Prof. An Overview of Real Time Operating Systems. Pearson Education Publication. Books: 1. Basic Priority-Inheritance and Priority-Ceiling Protocols. Reference Models for Real Time Systems: Processors and Resources. S. Access Control in Multiple-Unit Resources. Albert M. Predictability and Validation of Dynamic Multiprocessor Systems. Typical Real Time Applications: Digital Control. Hard Real Time Systems and Soft Real Time Systems. Optimality of Effective-Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms. John Wiley and Sons Publications. Temporal Parameters of Real Time Workload. Scheduling of Tasks with Temporal Distance Constraints. Multiprocessor Priority-Ceiling Protocol. parallel architectural classification schemes. Use of Priority-Ceiling Protocol in Dynamic Priority Systems. Scheduling Algorithms for End-to-End Periodic Tasks. Nonpreemptive Critical Sections. Liu. Release Times. Real Time Systems by Jane W. Medium Access Control Protocols for Broadcast Networks. Priority-Based Service and Weighted Round-Robin Service Disciplines for Switched Networks. Controlling Concurrent Accesses to Data Objects. Dynamic Versus Static Systems. Precedence Constraints and Data Dependency. Signal Processing etc. UNIT-III: Resources Access Control Effect of Resource Contention and Resource Access Control (RAC). Deadlines. End-to-End Tasks in Heterogeneous Systems. (TIT 031 ) ADVANCE COMPUTER ARCHITECTURE Unit-I: Introduction Introduction to parallel computing.UNIT-I: Introduction Definition. . K. UNIT-V: Real Time Communication Model of Real Time Communication. High Level Controls. Schedulability of Fixed-Priority End-to-End Periodic Tasks. Cheng. Real Time Protocols. UNIT-II: Real Time Scheduling Common Approaches to Real Time Scheduling: Clock Driven Approach. Internet and Resource Reservation Protocols. Weighted Round Robin Approach. 2. Fengs classification. need for parallel computing. UNIT-IV: Multiprocessor System Environment Multiprocessor and Distributed System Model. Stack Based Priority-Ceiling Protocol. Priority Driven Approach. Communication in Multicomputer System. Periodic Task Model. Preemption Ceiling Protocol. and Timing Constraints. Analysis.
McGraw Hill (TCS 044 ) EMBEDDED SYSTEMS . Usual OS scheduling techniques. Shared memory programming. Distributed scheduler. Chip multiprocessor case studies: Intel Montecito and dual-core. PSO. New Age International 2. TSO. Snoopy coherence: invalidate vs. Threads. MOSI. PC. barriers: central and tree. Performance issues: Brief introduction to cache hierarchy and communication latency. tiled CMP. Hwang. General architectures and the problem of cache coherence. Data dependence analysis. performance trade-offs. wire delay). introduction to super scalar architectures. Shared memory multiprocessors. Quin. WO/WC. IBM Power4. “ Advanced Computer Architecture”. issues involved into writing code for multi-core architectures. Unit-III: Multi-threaded Architectures Parallel computers. MPI and case studies Case studies from Applications: Digital Signal Processing. Theory & Practices”. building of some of these techniques in compilers. Scheduling Techniques. Distributed Semaphores. update. Image processing. Multiprocessor scheduling. pointer analysis. quantitative evaluation of performance gain using memory. Sharing issues and Synchronization. Implementation techniques on multi-cores. Pentium4. Message boxes. spin-locks. Books: 1. program optimizations techniques. Speech processing. Unit-V: Operating System Issues and Applications Operating System issues for multiprocessing Need for pre-emptive OS. Memory consistency models: SC. MOESI. threads. pipelined snoopy bus design. Gang scheduling. RC. shared L2 vs. bus. monitors. alias analysis.distributed processing. “Parallel Computing. OpenMP and other message passing libraries. OpenMP. Dataflow analysis. development of programs for these architectures. cache miss/hits. Synchronization primitives: Atomic primitives. cache & shared memory. Sun Niagara Unit-IV: Compiler Optimization Issues Introduction to optimization. array. locks: TTS. overview of parallelization. introduction to OpenMP. power/performance. ticket. Unit-II: Multi-core Architectures Introduction to multi-core architectures. core complexity. Sharing memory and other structures. Loop optimizations. Communication between processes. mutex etc. Chip multiprocessors: Why CMP (Moore's law. MESI. MSI. performance implications in shared memory programs. Instruction level parallelism (ILP) vs. Shared memory. processor and memory hierarchy. thread level parallelism (TLP). Memory hierarchy issues in code optimization. Sharing I/O devices. solving data dependence equations (integer linear programming problem).
Unit-III Signals. Task Modeling and management. Data center requirements and evolution to accommodate storage needs. Evolution of storage. frequency spectrum and sampling. Characteristics and requirements Unit-II Timing and clocks in Embedded systems. Overview of storage infrastructure components. Overview of basic storage management skills and activities. R. Unit-V Fault-Tolerance Formal Verification. H. “Co-synthesis of Hardware and Software for Embedded Systems”. Signal Conditioning and Processing. Real time operating system issues.Kopetz.Gupta. DAC).Unit-I Introduction to embedded systems: Classification. . Modeling and Characterization of Embedded Computation System. Information Lifecycle Management concept. Unit-IV Embedded Control and Control Hierarchy. (TIT 032 ) STORAGE & INFORMATION MANAGEMENT Unit-I: Introduction to Storage Technology Data proliferation and the varying value of data with time & usage. Data categorization within an enterprise. Sources of data and states of data creation. Books: 1. 2. Kluwer 1995. Storage and Regulations. “Real-Time Systems”. Communication strategies for embedded systems: Encoding and Flow control. The five pillars of technology. digitization (ADC. Kluwer. 1997.
Unit-V: Managing & Monitoring Management philosophies (holistic vs.Unit-II: Storage Systems Architecture Intelligent disk subsystems overview. & management. Unit-III: Introduction to Networked Storage JBOD. Fibre Channel principles. IP SAN elements. Standard framework applications. connectivity protocols (NFS. and back end management. and operation. logical disk organization. SMI-S. SAN. Key management metrics (thresholds. capacity. Metric analysis methodologies & trend analysis. FCP). standards (SCSI. Industry management standards (SNMP. performance). Array caching properties and algorithms. hierarchical. Hybrid Storage solutions overview including technologies like virtualization & appliances. Interaction of file systems with storage. CDMA. modular arrays. CIFS. connectivity options. security. security. & management principles. standards. Direct Attached Storage (DAS) environments: elements. overview of wireless telephony: cellular concept. channel structure. Logical partitioning of disks. Remote business continuity techniques. GSM: air-interface. Disk physical structure components. SAN management principles. and handling techniques. GPRS. Local business continuity techniques. RAID & parity algorithms. FCIP. Provisioning & configuration change planning. Disaster Recovery principles & techniques. (TCS 054 ) MOBILE COMPUTING Unit – I Introduction. availability. system & component). Storage Area Networks (SAN): elements & connectivity. location management: HLR-VLR. Component architecture of intelligent disk subsystems. CIM). and management principles. connectivity options. Physical vs. handoffs. Management tools overview. NAS. prioritization. Network Attached Storage (NAS): elements. standards. connectivity principles. Front end connectivity and queuing properties. issues in mobile computing. Unit-IV: Introduction to Information Availability Business Continuity and Disaster Recovery Basics. connectivity. Problem reporting. protection. and specifications. performance. channel allocation in cellular systems. DAS. and management principles. Front end to host storage provisioning. hot sparing. Contrast of integrated vs. Storage system connectivity protocols. Reactive and pro-active management best practices. ftp). & network management principles.II . Unit . properties. & CAS evolution. Content Addressable Storage (CAS): elements. mapping.
IEEE 802. Mehrotra . Charles Perkins. application environment.11.Fuzzy matrices . Ad Hoc on demand distance vector routing (AODV). J. Schiller. Temporary ordered routing algorithm (TORA). Wireless LAN Overview: MAC issues.Single layer perception . Addison Wesley. Ad hoc Networks. Unit-II: FUZZY SYSTEMS Fuzzy sets and Fuzzy reasoning . MAC issues.Decomposition Fuzzy automata and languages . 5. data replication for mobile computers.Wireless Networking.Fuzzy functions . D. applications. GSM System Engineering. Books: 1. M.Kohnen's self organizing networks . File system. Wireless applications. Addison Wesley.IV Mobile Agents computing. A. Mobile IP. Wireless multiple access protocols. protocol stack.Supervised and Unsupervised learning – Back propagation networks .Fuzzy decision making. localization.Fuzzy control methods . V. (TIT 041 ) SOFT COMPUTING Unit-I: ARTIFICIAL NEURAL NETWORKS Basic concepts . Taylor. applications. Unit – V Ad Hoc networks. data broadcasting. Unit . Blue Tooth. Charles Perkins. Routing protocols. WAP: Architecture. Mobile Communications. TCP over wireless. 4. QoS in Ad Hoc Networks. Artech House. adaptive clustering for mobile wireless networks.Multilayer Perception . Disconnected operations. security and fault tolerance. Understanding WAP. Heijden. 3. Unit-III: NEURO . Destination sequenced distance vector routing (DSDV). Unit – III Data management issues. Mobile IP. Dynamic source routing (DSR).Hopfield network. global state routing (GSR). transaction processing in mobile computing environment. M. 2. Addison Wesley.FUZZY MODELING .
"Genetic Algorithms: Search. 3.Y. 1998.Mutation . Phase-Based Defect Removal Pattern. Laurene Fausett. "Fuzzy Logic with Engineering Applications". 4.A New Synthesis". Sun C. Nelsson. Introduction to Measurement and Inspection Process. Failures.E. Defects. and Mizutani E. Unit-V: SOFTCOMPUTING AND CONVENTIONAL AI AI search algorithm . In-Process Quality Metrics: Defect Arrival Pattern.Classification and Regression Trees Data clustering algorithms . "Neuro-Fuzzy and Soft computing". Jang J. N.S. Documents and Metrics.. 1989. Timothy J.Hybrid models . "Fuzzy sets and Fuzzy Logic".Rules of interference – Semantic networks Frames . Software Quality Attributes and Specification. (TIT 042 ) SOFTWARE QUALITY ENGINEERING UNIT-I: Introduction Defining Software Quality.Cross over . Klir and Bo Yuan. Customer Satisfaction Metrics. Goldberg. "Fundamentals of Neural Networks". Prentice Hall 1998. Fix Response Time. UNIT-III: Software Quality Management and Models . 2. and Containment. UNIT-II: Software Quality Metrics Product Quality Metrics: Defect Density. Harcourt Asia Ltd. USA 1995. Books: 1. Ross.Neuro-Fuzzy controls Simulated annealing – Evolutionary computation. Faults. Cost of Quality. J. D. Reduction. McGraw Hill.T. N. Prentice Hall. "Artificial Intelligence . Prentice Hall. Function Points. Defect Rate and Reliability. 1994. Metrics for Software Maintenance: Backlog Management Index.Rule based structure identification .Adaptive networks based Fuzzy interface systems . Fix Quality. Defect Removal Effectiveness. Software Quality Indicators. 1997.Fitness Computations . 6..R.Reproduction Rank method . 5. Customer Problems Metric. Unit-IV: GENETIC ALGORITHMS Survival of the Fittest .Objects . Defect Prevention. George J. Optimization and Machine Learning".Predicate calculus . Overview of Different Types of Software Review.Applications. Addison Wesley.Rank space method.
Proof of Correctness. Evolutionary Nature of Verification and Validation. Quality Improvement Process. Statistical Quality Assurance. Evolution of Software Quality Assurance (SQA). SQA Techniques. UNIT-IV: Software Quality Assurance Quality Planning and Control. Metrics and Models in Software Quality Engineering. Validation & Testing: Verification and Validation. Implement ‘Linear Congruential Algorithm’ to generate 5 pseudo-random numbers in ‘C’. Books: 1. Impracticality of Testing all Data and Paths. 2005. Software Testing. AddisonWesley (2002). Implement RSA algorithm for encryption and decryption in ‘C’. Characteristics of Modern Testing Tools.Modeling Process. Software Quality Engineering (SQE). 3. 7. Kan. Configure a mail agent to support Digital Certificates. Software Reliability Allocation Models. ISBN: 0201729156 (TIT-751) CRYPTOGRAPHY AND NETWORK SECURITY LAB The following programs should be implemented preferably on ‘UNIX’ platform using ‘C’ language (for 1-5) and other standard utilities available with ‘UNIX’ systems (for 6-8) :- 1. 2. send a mail and verify the correctness of this system using the configured parameters. Edward Schaefer) in ‘C’. Major SQA Activities. 4. Configure SSH (Secure Shell) and send/receive a file on this connection to verify the correctness of this system using the configured parameters. Major SQA Issues. Software Quality Assessment Models: Hierarchical Model of Software Quality Assessment. 5. Criteria for Model Evaluation. Stephen H. Functional. Static and Dynamic Testing Tools. Implement the encryption and decryption of 8-bit data using ‘Simplified DES Algorithm’ (created by Prof. Configure a firewall to block the following for 5 minutes and verify the correctness of 2. Jeff Tian. Zero Defect Software. Structural and Error-Oriented Analysis & Testing. UNIT-V: Software Verification. Total Quality Management. 8. Software Reliability Models: The Rayleigh Model. Wiley-Interscience. Implement the Euclid Algorithm to generate the GCD of an array of 10 integers in ‘C’. ISBN 0-471-71345-7. 6. Implement Rabin-Miller Primality Testing Algorithm in ‘C’. . Exponential Distribution and Software Reliability Growth Models. Quality Standards and Processes.
(d) Use the ‘patch’ command to patch the original file to make it similar to the edited copy. (b) Save this file and edit its copy for some changes and save it. (a) Create a text file containing records of employees in text form line wise. (b) Save this file and edit its two copies independent of each other. 4. Create a compound object using Prolog. 3. Write a Prolog program to show the advantage and disadvantage of green and red cuts.this system using the configured parameters: (a) (b) (c) Two neighborhood IP addresses on your LAN All ICMP requests All TCP SYN Packets (TIT-752) ARTIFICIAL INTELLIGENCE LAB The following programs should be implemented preferably on ‘UNIX’ platform: 1. . 7. 2. (e) Use ‘tcpdump’ to monitor ‘ping’ and ‘traceroute’ from your machine. (c) Inspect the Routing table and ARP cache of a LAN server. These tools expose the basic functionalities required by an integrated IT Infrastructure Management System. 3. 6. (c) Configure the ‘Cron’ daemon to stop ‘Telnet’ service and reboot the system after five minutes of usage by at least three users. Implement (a) Forward Chaining (b) Backward Chaining (c) Problem Reduction Implement STEEPEST ASCENT HILL CLIMBING using LISP Implement COUNT PROPAGATION NETWORK using Prolog 5. Write a LISP program to solve water-jug problem using heuristic function. (c) Use ‘diff ‘command to generate a patch for the original file. (a) Create a user group and permit it to access ‘Telnet’ service over a LAN. 4. (a) Create a text file containing records of employees in text form line wise. (TIT-851) IT INFRASTRUCTURE MANAGEMENT LAB The following exercises should be done preferably on ‘UNIX’ platform using the IT Infrastructure Management tools available with all the standard distributions. (b) Check the basic IP connectivity using ‘ping’ command. (d) Use ‘traceroute’ to watch the route your IP packet takes for reaching destination. Write a Prolog program to use the BEST FIRST SEARCH applied to the 8-puzzle problem. (a) Configure the IP addressing and subnetting on a LAN using ‘ifconfig’. 2. (b) Restrict the ‘Telnet’ service to maximum five users at a time. 1.
(e) Again create the merged file using ‘–m’ option of the ‘diff3’ command.(c) Save both new versions as two new files. (c) Now extract the contents of both the tarballs to two different directories. 6. (b) Establish the ‘CVS’ repository over a network and store the original file in it. 5. Implement RPC mechanism for a file transfer across a network in ‘C’ Implement ‘Java RMI’ mechanism for accessing methods of remote systems. 2. (TCS-852) DISTRIBUTED SYSTEMS LAB The following programs should be developed preferably on ‘UNIX’ platform:1. (b) Update the non-zipped tarball by adding three new files to it and list its final contents. (a) Use LDAP to access ‘Telnet’ service on a LAN server. Implement CORBA mechanism by using ‘C++’ program at one end and ‘Java’ program on the other. Implement a Distributed Chat Server using TCP Sockets in ‘C’. (d) Inspect the retention of user permissions on the files before the archiving & after the extraction. 7. snort) to track changes in /var/log/messages after every 5 minutes and to monitor the ICMP requests coming to the host.allow and /etc/hosts. Simulate the Distributed Mutual Exclusion in ‘C’. tripwire. 4.0 and 3. (b) Use /etc/hosts. (c) Now edit the file and save its edited version in the repository.0 from the repository. Simulate Balanced Sliding Window Protocol in ‘C’.g. (d) Use an IDS tool (e. (c) Use ‘iptables’ or similar utility to block TCP SYN segments from a particular IP address for port 25 using firewall rules. 5. (e) Now retrieve version 1. 6. .deny to allow & deny access to web service to two hosts on the LAN. (a) Use ‘tar’ to create multi-file non-zipped and zipped archives (using gzip and bzip2). (a) Create a text file containing records of employees in text form line wise and save it. 7. 3. Simulate the functioning of Lamport’s Logical Clock in ‘C’. (d) Store at least five continuously edited versions of the file in the ‘CVS’ repository. (d) Now use ‘diff3’ command to compare and create a third file containing merged output.
P.U. VII & Sem. TECHNICAL UNIVERSITY LUCKNOW Syllabus of 4 Year (Sem. TECH. VIII) th B. INFORMATION TECHNOLOGY .
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.