This action might not be possible to undo. Are you sure you want to continue?
COMPUTER SCIENCE and ENGINEERING III Semester Subject Code 10SCS31 10SCS32x 10SCS33x 10SCS34 10SCS35 Name of the Subject Advances in VLSI Design and Algorithms Elective – III Elective – IV Project Phase - II Evaluation of Project Phase-I Total Hours per Week Field Work/ Lecture Practical Tutorials 04 04 04 --12 -----Elective – IV 10SCS331 10SCS332 10SCS333 Duration of Exam in Hours 03 03 03 03 03 Marks for I.A. 50 50 50 50 200 Exam 100 100 100 -300 Total Marks 150 150 150 -50 500
Elective – III 10SCS321 Wireless and Cellular Networks 10SCS322 10SCS323 Advances in Storage Area Networks Advances in Pattern Classification
Analysis of Computer Networks Advances in Compiler Design Information Security
Note:3 Days Course work and 3 Days for Project Work
Advances in VLSI Design and Algorithms Subject Code : 10SCS31 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100
1. Introduction to Digital systems and VLSI: Why Design Integrated Circuits? Integrated Circuits manufacturing; Integrated Circuit Design Techniques; IP-Based Design. 2. Fabrication and Devices: Introduction; Fabrication processes; Fabrication theory and practice; Reliability. 3. Sequential Machines: Introduction; Latches and Flip-flops; Sequential systems and clocking disciplines; Performance analysis; Clock generators; Sequential systems design, Power optimization, Design validation, Sequential testing. 4. Subsystem Design: Introduction; Combinational shifters; Adders; ALUs; Multipliers; High-density memory; Image sensors; FPGAs; PLA; Buses and networks on chips; Data paths; Subsystems as IP. 5. Architecture Design: Introduction; Hardware description languages; Register Transfer design; Pipelining; High-level synthesis; Architecture for low power; GALS systems; Architecture testing; IP components; Design methodologies; Multiprocessor system-on-Chip design. 6. Simulations: General remarks; Gate-level modeling and simulations; Switch-level modeling and simulation.
TEXT BOOKS: 1. Wayne Wolf: “Modern VLSI design”, 3rd edition, Pearson Education, 2007. 2. Sabih H Gerez: “Algorithms for VLSI Design Automation”, Wiley India, 2007, Wireless and Cellular Networks Subject Code : 10SCS321 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100
Wireless Local Area Networks (WLANs). Third Generation (3G) Wireless Networks. SAN Hardware devices. Configuration options for SANs. 1998. 2. Linear Modulation techniques – Binary phases shift keying (BPSK). 5. The Battle for size and access. third generation. Minimum Shift Keying (MSK). The fibre channel switch. Introduction: Server Centric IT Architecture and its Limitations. adjacent channel interference. Quadrature Phase Shift Keying (QPSK). Shared Disk file systems. Space Division Multiple Access (SDMA). Case study: Replacing a server with Storage Networks The Data Storage and Data Access problem. Bluetooth and Personal Area Networks (PANS) 3. Cellular Networks. Constant envelope modulation – Binary Frequency Shift Keying. Network connectivity. Theodore S Rappaport: Wireless Communications. 6. Introduction. Software Components of SAN: The switch’s Operating system. First generation. The NAS hardware Architecture. SCSI. Mobile Radio Propagation: Introduction to radio wave propagation. 3. Fabric operation from a Hardware perspective. Packet Radio. 7. Hard disks and Internal I/O Channels. Introduction to Wireless Communication Systems: Evolution of Mobile Radio Communications Mobil Radio Systems around the world examples of Wireless Communication Systems. Difference between Wireless and Fixed Telephone Networks. Host Bus Adaptors. Creating a Network for storage. 2. Symmetric and Asymmetric storage virtualization in the Network. Packet Reservation Multiple Access (PRMA). JBOD. TDMA Standards. Pearson Education Asia. 4. Multiple Access Techniques for Wireless Communications: Introduction to Multiple access. Principles and Practice. Network file Systems and file servers. 7. 2002. Caching: Acceleration of Hard Disk Access. William Stallings: Wireless Communications and Networks. Time Division Multiple Access (TDMA). Wireless Networking: Introduction. Device Drivers. Amplitude modulation. Intelligent Disk Subsystems: Architecture of Intelligent Disk Subsystems. Putting the storage in SAN. Digital Modulation. Fibre Channel SAN. Practical Handoff considerations. evolution of 2. NAS as a storage system. The Cellular Concept: System Design Fundamentals. Storage virtualization on Block or file level. File System and NAS: Local File Systems. Storage virtualization on various levels of the storage Network. William C Y Lee: Mobile Communications Engineering Theory and Applications. 2002. Reflection. Comparison of fibre Channel and NAS. Supporting the switch’s components. Fibre Channel Protocol Stack. Modern Wireless Communications Systems: Second generation (2G). Reservation Protocols – Reservation ALOHA. Relating power to electric field.5G. IP Storage. Capacity of cellular systems. Spread Spectrum Multiple Access. handoff strategies – prioritizing handoffs. Differential Phase Shift Keying (DPSK). Cordless Telephone System. SAN Architecture and Hardware devices: Overview. power control for reducing interference. channel planning for wireless systems. Advances in Storage Area Networks Subject Code : 10SCS322 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100 1. channel assignment strategies. Diffraction. 4. Frequency Division Multiple Access (FDMA). Storage Virtualization: Definition of Storage virtualization . . I/O Techniques: The Physical I/O path from the CPU to the Storage System. Protocols. Modulation Techniques for Mobile Radio: Frequency modulation Vs amplitude modulation. Storage – Centric IT Architecture and its advantages. Pearson Education Asia. Free space propagation model. McGraw Hill. 5. Interference and system capacity. 2nd Edition. Gaussian Minimum Shift Keying (GMSK).1. Wireless Local Loop (WLL) and LMDS. The NAS Sotfware Architecture. 6. TEXT BOOKS: 1. 2. Availability of disk subsystems. co-channel interference and system capacity. Storage virtualization using RAID and different RAID levels. Development of Wireless Networks. Implementation Considerations. Paging System. Network Attached Storage: The NAS Architecture. Comparison of Common Wireless Communications Systems. Scattering. 2nd Edition. second generation. REFERENCE BOOKS: 1. 8. Cellular Telephone Systems. Intelligent disk subsystems. Frequency reuse. Angle modulation.
Richard Barker and Paul Massiglia: “Storage Area Network Essentials A CompleteGuide to understanding and Implementing SANs”. Capacity planning. Linear Classifiers with Quadratic Regularization. Marc Farley: Storage Networking Fundamentals – An Introduction to Storage Devices. Mixture Models and EM: Mixtures of Gaussians. and File Systems. and Jerome Friedman: The Elements of Statistical Learning. Ulf Troppens. Managing Serviceability. 2. Sergios Theodoridis and Konstantinos Koutroumbas: Pattern Recognition. Duda. and D. Unsupervised Learning: Introduction. Stork: Pattern Classification by 2 nd edition. Robert Spalding: “Storage Networks The Complete Reference”. Managing availability. Wiley India. Reference Books: 1. Non-negative Matrix Factorization. 2001. High-Dimensional Regression: Supervised Principal Components. 2003. RBF Networks. Multiclass SVMs. 2003. 2005. Information Theory 2. Applications. O. R. Elsevier. The Bias Variance Decomposition. Springer. Probabilistic Discriminative Models. E. 2006. Sparse Kernel Machines: SVMs. Advances in Pattern Classification Subject Code : 10SCS323 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100 1. 2. G. Security considerations. Linear Classifiers with L1 Regularization. Kernel Methods: Dual Representations. Decision Theory. Association Rules. Nonlinear Dimension Reduction and Local Multidimensional Scaling. Springer. 2008. Rainer Erkens and Wolfgang Muller: Storage Networks Explained. Cisco Press. Constructing Kernels. 2nd Edition. Christopher M Bishop: Pattern Recognition and Machine Learning. Text Book: 1. 3. P. Independent Component Analysis and Exploratory Projection Pursuit. Subsystems. The Laplace Approximation. Robert Tibshirani. The Evidence Approximation. 2007. Trevor Hastie. Bayesian Model Comparison. Tata McGraw-Hill. Text Books: 1. High-Dimensional Problems: The Curse of Dimensionality. Probabilistic Generative Models. Analysis of Computer Networks Subject Code : 10SCS331 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100 . Introduction: Polynomial Curve Fitting. Curves and Surfaces. An alternative view of EM. 7. Probability Theory. The Google PageRank Algorithm 6. Model Selection. Linear Models for Classification: Discriminant Functions. 2006. Gaussian Processes. Hart. Feature Assessment and the Multiple-Testing Problem. Limitations of Fixed Basis Functions 3. The EM Algorithm in general. Reference Books: 1. Management. Cluster Analysis.9. Wiley India. Self-Organizing Maps. Bayesian Logistic Regression 4. Linear Models for Regression: Linear Basis Function Models. Principal Components. Bayesian Linear Regression. 2. Management: Planning Business Continuity. Multidimensional Scaling. Diagonal Linear Discriminant Analysis and Nearest Shrunken Centroids. Classification when Features are Unavailable. Wiley –Interscience. Probability Distributions. Relevance Vector Machines 5.
Multihop networks. 3. Lam. 3. Machine-Independent Optimizations: The principle sources of optimization. Application to a packet voice example. Basic-block scheduling. Schwartz: Broadband Integrated Networks. 4. Stream sessions in a packet network: Delay guarantees. Manjunath. Synchronization between parallel loops. Joy Kuri: Communication Networking An Analytical Approach. Bandwidth sharing in a Network. 2. 3. TCP: The Internet’s Adaptive Window Protocol. Software pipelining. 1999. Deterministic traffic models and Network Calculus. Andrew W Apple: Modern Compiler Implementation in C. TEXT BOOKS: 1. Code-scheduling constraints. Loops in flow graphs. Pearson. Achievable throughput in an input-queuing packet switch. Jeffrey D Ullman: Compilers . P. 2. Finding synchronization-free parallelism. 2. REFERENCE BOOKS: 1. The effective bandwidth approach for admission control. Instruction-Level Parallelism: Process architectures. Packet multiplexing over Wireless networks. Long-Range-Dependent traffic. Advances in Compiler Design Subject Code : 10SCS332 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100 1. REFERENCE BOOKS: 1. Additional notation. Array data – dependence analysis. The science of building a compiler. Varaiya: High Performance Communication Networks. Programming language basics. Stream Sessions: Deterministic Network Analysis: Events and processes in packet multiplexer models: Universal concepts. Connection setup: The RSVP approach. Information Security . TEXT BOOKS: 1. Brumelle’s theorem. Network parameters and performance objectives. Introduction and Review: Language processors.1. Locality optimizations.: Crafting a Compiler with C. Performance measures. The evolution of programming languages. Sharing a single link. Anurag Kumar. leBlanc. Dynamic programming code generation. 3. 2nd Edition. Application to the packet voice example. 2nd Edition. Applications of Compiler technology. Morgan Kaufmann. Constant propagation. Jr. Multiplexing: Network performance and source characterization. Affine array indexes. Richard J. Register allocation and assignment. Window-Based Control: General Principles. 1991. Instruction selection by tree rewriting. Optimal code generation for expressions. Scheduling (continued). Pipelining. Foundations of data flow analysis. J. Charles N. Partial-redundancy elimination. Stochastic traffic models. Prentice Hall PTR. M. Topics in Code Generation: Issues in the design of Code Generator. Kenneth C Louden: Compiler Construction Principles & Practice. Scheduling. 1997. Iteration spaces. 2007. The importance of quantitative modeling in the Engineering of Telecommunication Networks. Adaptive Bandwidth Sharing for Elastic Traffic: Elastic transfers in a Network. and applications. Symbolic analysis. Fischer. An example of matrix multiplication. Introduction to data flow analysis. Monica S. Multiplexer analysis with stationary and ergodic traffic. D. 2004. Rate-Based Control. Ravi Sethi. Walrand. Region-based analysis. Introduction: Two examples of analysis: Efficient transport of packet voice calls. Global code scheduling. Stream Sessions: Stochastic Analysis: Deterministic analysis can yield loose bounds. Cambridge University Press. Peephole optimization. Techniques and Tools. 1997. The structure of a Compiler. 1996. Optimizing for Parallelism and Locality: Basic concepts. Cengage Learning. Pearson. Little’s theorem. 5. Stochastic analysis with shaped traffic. 2.Principles. Elastic transfers in a packet network. Alfred V Aho. 4. Data reuse. Elsevier.
Information Security Policy. 2. Approaches to information security implementation. and Practices. 3. Software flaws. 2005. Digital Rights Management. Security Technology: Firewalls and VPNs: Introduction. Standards. 5. Mattord: Principles of Information Security.509 Directory Authentication Service. Access control and Other Security Tools: Introduction. Intrusion Detection. Services. Information Security maintenance: Introduction. Key management. Software: Introduction. Secure Hash functions and HMAC. Cengage Learning. Combining Security Associations. The Maintenance Model. Authentication Header.Subject Code : 10SCS333 No of Lecture Hrs/Week : 4 Total No of Lecture Hours : 52 IA Marks : 50 Exam hours : 3 Exam Marks : 100 1. Location of encryption devices. Planning for Security: Introduction. Tata McGraw-Hill. Internet Standards and RFCs. Wireless network security. Approaches to message authentication. Cipher Block Modes of Operation. Honey Nets. William Stallings: Network Security Essentials Applications and Standards. Security Management Models. Shah: Information Security – Principles and Practice. Key Management. TEXT BOOKS: 1. Electronic Mail Security: Pretty Good Privacy (PGP). Honey Pots. Secure Electronic Transaction (SET). Access Control Devices. 6. Wiley India. REFERENCE BOOKS: 1. What is security? Critical characteristics of information. Forouzan: Cryptography and Network Security. Protecting Remote Connections. and Mechanisms. Physical design. Intrusion Detection Systems (IDS). 11. Authentication Applications: Kerberos. NSTISSC security model. Secure Socket layer (SSL) and Transport layer Security (TLS). Firewalls. 4. The Security System Development Life Cycle. The Information Security Blue Print. Whitman and Herbert J. Web Security: Web security requirements. IP Security: IP Security Overview. 7. Michael E. Security Attacks. Malware. S/MIME. Public Key Cryptography Principles and Algorithms. Information Security Terminology. Deven N. IP Security Architecture. 2000. 2nd Edition. 3. X. 2009. Key distribution. Software-based attacks. Digital Signatures. Cryptography: Conventional Encryption Principles and Algorithms. Introduction to Network Security: Attacks. Introduction to Information Security: Introduction. . Scanning and Analysis Tools. Encapsulating Security Payload. A model for Internetwork Security. 2. Security Services. and Padded cell systems. Behrouz A. 10. Person. 8. 2007. 9.