Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download M.Tech (Information Technology) - National Institute Of Engineering
Document related concepts
Computer security wikipedia , lookup
Zero-configuration networking wikipedia , lookup
Distributed operating system wikipedia , lookup
Distributed firewall wikipedia , lookup
Airborne Networking wikipedia , lookup
Internet protocol suite wikipedia , lookup
Recursive InterNetwork Architecture (RINA) wikipedia , lookup
Transcript
THE NATIONAL INSTITUTE OF ENGINEERING, MYSORE – 8. (Autonomous Institution under VTU) M.Tech (Information Technology) Scheme and syllabus I-IV Semester M.Tech (Information Technology) (2014-2016) Department of CS&E NIE, Mysore-08 PREFACE Dear Students, The National Institute of Engineering (NIE) was started in the year 1946, a year before India’s independence. The Board of Directors is always promoting continuous improvement in delivery of technical education. The quality factors considered to sustain and grow as a top-ranking institution are: Faculty Development Programme, Infrastructure, Continuing Education System, Consultancy and Research. The concerted effort of stake holders at NIE has made it get autonomous status, grants under prestigious TEQIP-I & II (Technical Education Quality Improvement Program of World Bank-MHRD) and get accreditation from National Board of Accreditation, New Delhi. NIE is one of the only two colleges in Karnataka that has been granted permanent affiliation by VTU for all its courses. Today NIE boasts of 7 UG, 10 M.Tech and 5 post graduate diploma programmes, and 13 Center of Excellence with overall student strength of over 3000. NIE’s journey to excellence, with the main objective of continuous improvements of administrative and academic competence, is envisioned in reference to three major pillars: intellectual infrastructure, courses/services offering and institution building. From the academic year 2014-15 there is a slight change in the syllabus structure and question paper pattern. This change is due to the philosophy of Outcome Based Education and requirement as per the National Board of Accreditation (NBA), Government of India, New Delhi. Sixteen countries including New Zealand, Australia, Singapore, Russia and India are the signatories of the Washington Accord, which has come out with the new process of accreditation. This would enable every institution, including NIE to attain high standards of technical education in the respective countries and to create level playing ground. The outcome based education is one of the important components of NBA. NIE is making sincere efforts in meeting the global standards through new formats of NBA and timely World Bank-MHRD initiative TEQIP (Technical Education Quality Improvement Program). Efforts are being made to revise the syllabi regularly to meet the challenges of the current technical education. . Dr. B. K. Sridhara Dean (Academic Affairs) August 2014 2 Department of CS&E NIE, Mysore-08 BLUEPRINT OF SYLLABUS STRUCTURE AND QUESTION PAPER PATTERN (to be effective from the odd semester of the academic year 2014-15 for all semester students) Blue Print of Syllabus Structure 1. Complete syllabus is prescribed in SIX units as Unit 1, Unit 2, etc. 2. In each unit there is one topic under the heading “Self Learning Exercises” (SLE). These are the topics to be learnt by the student on their own under the guidance of the course instructors. Course instructors will inform the students about the depth to which SLE components are to be studied. Thus there will be six topics in the complete syllabus which will carry questions with a weightage of 10% in SEE only. No questions will be asked on SLE components in CIE. Blue Print of Question Paper 1. Question paper will have seven full questions. 2. One full question each of 15 marks (Question No 1, 2, 3, 4, 5 and 6) will be set from each unit of the syllabus. Out of these six questions, two questions will have internal choice from the same unit. The unit in which choice is to be given is left to the discretion of the course instructor. 3. Question No 7 will be set for 10 marks only on those topics prescribed as “Self Learning Exercises”. Dr. B. K. Sridhara Dean (Academic Affairs) July 2014 3 Department of CS&E NIE, Mysore-08 I Semester M.Tech IT Sl. No Subject Code Subject Teaching Dept. Contact Hrs./Week L T P No. of Credits 1 MIT0514 Advances in Computer Networks CS&E 4 0 2 5 2 MIT0502 Storage Area Networks CS&E 4 0 2 5 3 MIT0503 Web commerce CS&E 4 0 2 5 4 AMT0401 Advanced Mathematics CS&E 4 0 0 4 5 MIT05__ Elective – I CS&E 4 0 2 5 6 MIT05__ Elective – II CS&E 4 0 2 5 TOTAL 29 Total Contact Hrs./Week: 34 4 Department of CS&E NIE, Mysore-08 II Semester M.Tech IT Sl.No 1 Subject Code MIT0401 2 MIT0801 3 MIT0201 Teaching Hours/ Week Subject Credits L T P Industrial Training for 8 weeks duration (At the end of the training, students are required to submit a report and present a seminar) - - - 4 Project-work ( preliminary)(Students have to initiate the project-work during III semester and are required to submit a report and present a seminar) - - - 8 Subject Seminar on current topic - - - 2 Total Credits Subject Code Subject 1 MIT0504 Data warehouse and Data Mining 2 MIT0505 3 Sl. No Teaching Dept. III Semeste r 14 Contact Hrs./Week No. of Credits L T P CS&E 4 0 2 5 Cloud Computing CS&E 4 0 2 5 MIT0506 Protocol Engineering CS&E 4 0 2 5 4 MIT0402 Advanced Database Management Systems CS&E 4 0 0 4 5 MIT05__ Elective – III CS&E 4 0 2 5 6 MIT05__ Elective – IV CS&E 4 0 2 5 TOTAL 29 Total Contact Hrs./Week: 34 5 Department of CS&E NIE, Mysore-08 IV Semester Sl.No 1 Subject Code MIT2801 Subject Teaching Hours/ Week L T P - - - Credits Project Work (Students have to submit the final project report at the end of the semester which will be evaluated followed by a seminar, presentation and viva voce examination) Total Credits 28 28 6 Department of CS&E NIE, Mysore-08 ELECTIVE COURSES Sl.No Subject Code Subject Teaching Hours/ Week L T P Credits 1 MIT0501 Distributed systems 4 0 2 5 2 MIT0508 Computer Graphics and Visualization 4 0 2 5 3 MIT0509 E-Commerce 4 0 2 5 4 MIT0511 Multimedia Information Systems 4 0 2 5 5 MIT0512 Information and Network Security 4 0 2 5 6 MIT0515 C# and .NET 4 0 2 5 7 MIT0516 Web Programming 4 0 2 5 8 MIT0517 OOAD & Design Patterns 4 0 2 5 9 MIT0518 Web 2.0 and Rich Internet Applications 4 0 2 5 10 MIT0519 Optical Networks 4 0 2 5 11 MIT0520 User Interface Design 4 0 2 5 12 MIT0521 Client Server computing 4 0 2 5 13 MIT0522 Network Management 4 0 2 5 14 MIT0523 Supply Chain Management 4 0 2 5 15 MIT0524 System Modeling and Simulation 4 0 2 5 16 MIT0525 Information Retrieval 4 0 2 5 17 MIT0526 Advanced Digital Communication 4 0 2 5 7 Department of CS&E NIE, Mysore-08 Credits Division of the programme Core Courses 38 Elective Courses 20 Seminars/Industrial Training 14 Major Project 28 TOTAL 100 8 Department of CS&E NIE, Mysore-08 Advances in Computer Networks (4:0:2) Sub Code : MIT0514 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 COURSE OUTCOMES On successful completion of the course the students will be able to 1. Familiar with the basics of Computer Networks. 2. Understand Network architectures. 3. Understand Concepts of fundamental protocols. 4. Gain the knowledge of internetworking concepts. 5. Understand the knowledge of internetworking concepts in various applications. 6. Acquire knowledge of implementation concepts in congestion control and error detections. 1. Foundation Building a Network, Requirements, Perspectives, Scalable Connectivity, Cost-Effective Resource sharing, Support for Common Services, Manageability, Protocol layering, Performance, Bandwidth and Latency, Delay X Bandwidth Product, Perspectives on Connecting, Classes of Links, Reliable Transmission, Stop-and-Wait , Sliding Window Self learning component: Concurrent Logical Channels. 2. Internetworking- I Switching and Bridging, Datagrams, Virtual Circuit Switching, Source Routing, Bridges and LAN Switches, Basic Internetworking (IP), What is an Internetwork ?, Service Model, Global Addresses, Datagram Forwarding in IP, subnetting and classless addressing, Address Translation(ARP), Host Configuration(DHCP), Error Reporting(ICMP) Self learning component: Virtual Networks and Tunnels. 3. Internetworking- II Network as a Graph, Distance Vector(RIP), Link State(OSPF), Metrics, The Global Internet, Routing Areas, Routing among Autonomous systems(BGP), IP Version 6(IPv6), Mobility Self learning component: Mobile IP 4. End-to-End Protocols Simple Demultiplexer (UDP), Reliable Byte Stream(TCP), End-to-End Issues, Segment Format, Connecting Establishment and Termination, Sliding Window Revisited, Triggering Transmission, Adaptive Retransmission, Record Boundaries SLC: TCP Extensions 9 Department of CS&E NIE, Mysore-08 5. Queuing Disciplines, FIFO, Fair Queuing, TCP Congestion Control, Additive Increase/ Multiplicative Decrease, Slow Start, Fast Retransmit Self learning component: Fast Recovery. 6. Congestion Control and Resource Allocation Congestion-Avoidance Mechanisms, DEC bit, Random Early Detection (RED), Source-Based Congestion Avoidance. The Domain Name System(DNS),Electronic Mail(SMTP,POP,IMAP,MIME),World Wide Web(HTTP) Self learning component: Network Management(SNMP) . LABORATORY WORK PART A: Implement the following using C/C++: 1. Write a program to transfer the contents of a requested file from server to the client using TCP/IP Sockets (using TCP/IP Socket programming). 2. Write a program to archive Traffic management at Flow level by implementing Closed Loop Control technique. (Leaky Bucket Algorithm) 3. Write a program to implement dynamic routing strategy in finding optimal path for data transmission. (Bellman ford algorithm). 4. Write a program to implement Link State Routing (Dijkstra Algorithm). 5. Write a program for implementing the error detection technique while data transfer in unreliable network code using CRC (16-bits) Technique. 6. Write a program for providing security for transfer of data in the network. (RSA Algorithm) 7. Write a program for encrypting 64 bit playing text using DES algorithm. PART B: Simulation Programs using OPNET /NS2 or any other equivalent software 1. Simulate a 3 node point to point network with duplex links between them. Set the Queue size and vary the bandwidth and find the number of packets dropped. 2. Simulate a four-node point-to-point network, and connect the links as follows: n0->n2, n1->n2 and n2->n3. Apply TCP agent changing the parameters and determine the number of packets sent/received by TCP/UDP 3. Simulate the different types of internet traffic such as FTP and TELNET over network and analyze the throughput. Text books: 1. T1: Larry Peterson and Bruce S Davis “Computer Networks :A System Approach” 5th Edition , Elsevier -2014 (Ch 1.1, 1.2, 1.5.1, 1.5.2, 2.1, 2.5, 3.1, 3.2, 3.3, 4.1.1, 4.1.3, 5.1, 5.2.1 to 5.2.8, 6.2, 6.3, 6.4) 2. T2: Douglas E Comer, “Internetworking with TCP/IP, Principles, Protocols and Architecture” 6th Edition, PHI - 2014 (Ch 4, Ch 13.1 to 13.18 , Ch 18,Ch 23.1 to 23.16, Ch 24, Ch 25, Ch 27.1 to 27.8) 10 Department of CS&E NIE, Mysore-08 References: 1. Uyless Black “Computer Networks, Protocols , Standards and Interfaces” 2nd Edition - PHI Behrouz A Forouzan “TCP/IP Protocol Suite” 4th Edition – Tata McGraw-Hill Storage Area Networks (4:0:2) Sub Code : MIT0502 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 05 Course Outcomes On successful completion of the course the students will be able to 1. Differentiate the server centric and storage centric networks, and its advantages and disadvantages, understand the importance of SAN 2. Identify the different types of Disks , other storages and their operations useful in SAN 3. Understand the various I/O techniques used in SAN , and differentiate between NAS and SAN 4. Understand the local , network file systems and shared disk file systems of NAS 5. Understand the concepts of storage virtualization , and identify the various levels of storages for virtualization 6. Design a network for storage using various SAN devices 1. Introduction: Server Centric IT Architecture and its Limitations; Storage – Centric IT Architecture and its advantages. Case study: Replacing a server with Storage Networks; The Data Storage and Data Access problem. Self learning component:- The Battle for size and access 2. Intelligent Disk Subsystems: Architecture of Intelligent Disk Subsystems; Hard disks and Internal I/O Channels; JBOD, Storage virtualization using RAID and different RAID levels; Caching: Intelligent disk subsystems, Availability of disk subsystems. Self learning component:- Acceleration of Hard Disk Access 11 Department of CS&E NIE, Mysore-08 3. I/O Techniques and Network Attached Storage : The Physical I/O path from the CPU to the Storage System; SCSI; Fibre Channel Protocol Stack; Fibre Channel SAN; IP Storage. The NAS Architecture. The NAS Software Architecture, Network connectivity, NAS as a storage system. Self learning component:- The NAS hardware Architecture 4. File System and NAS: Local File Systems; Network file Systems and file servers; Comparison of fibre Channel and NAS. Self learning component:- Shared Disk file systems; 5. Storage Virtualization: Definition of Storage virtualization; Implementation Considerations; Storage virtualization on Block or file level; Storage virtualization on various levels of the storage Network. Self learning component:- Symmetric and Asymmetric storage virtualization in the Network 6. SAN Architecture and Hardware devices and Software Components of SAN : Overview, Creating a Network for storage; SAN Hardware devices; The fibre channel switch; Host Bus Adaptors; Putting the storage in SAN; Fabric operation from a Hardware perspective. The switch’s Operating system; Device Drivers; Supporting the switch’s components. Self learning component:- Configuration options for SANs. Text books: 1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India, 2007 2. Robert Spalding: Storage Networks The Complete Reference, Tata McGraw-Hill, 2003. Reference books: 1. Richard Barker and Paul Massiglia: Storage Area Network Essentials A Complete Guide to understanding and Implementing SANs, John Wiley India, 2002. 2. G. Somasundaram, Alok Shrivastava (Editors): Information Storage and Management, EMC Education Services, Wiley- India, 2009. 12 Department of CS&E NIE, Mysore-08 Web-Commerce(4:0:2) Sub Code : MIT0503 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 05 Course outcomes On successful completion of the course, students will be able to: 1. Understand the scope of e-commerce in the realm of modern business. 2. Know the various business models of e-commerce. 3. Find out the technologies used to develop e-commerce applications. 4. Familiar with marketing methods used in e-commerce. 5. Operate the legal and regulatory framework in e-commerce. 6. Keep track of the methods and metrics used to measure effectiveness of e-commerce activities . 1. E-commerce in Indian business context: Definition of e-commerce advantages of ecommerce, disadvantages of e-commerce, e-transition challenges for Indian corporate. Self learning component:- e-commerce opportunities for industries 2. Business models for e-commerce: e-business models based on relationship of transaction parties – B2C, B2B, C2C and C2B; e-business models based on relationship of transaction types – Brokerage model, Aggregator model, value chain model, advertising model, subscription model. Self learning component:- Info-mediary model, community model 13 Department of CS&E NIE, Mysore-08 3. Enabling Technologies of www : Internet client-server applications, Networks and Internets, IPV4, IPV6, Search Engines, software agents, Internet standards and specifications, ISP, Broadband technologies. Self learning component:- – types of broadband technology 4. E-marketing : Traditional marketing, identifying web-presence goods, Browsing behavior model, online marketing, e-advertising, e-branding, Marketing strategies. Self learning component:- 5. E-payment Systems : Main concerns in Internet banking, Digital payment, requirements, Digital token based e-payment systems, classification of new payment systems, Properties of e-cash, cheque payment on Internet, Risk of e-payment systems, Designing e-payment systems, digital signatures. Self learning component:- 6. Other issues : E-CRM solutions; e-supply chain management – strategic advantage, ESCM components; Information and Strategy – The virtual value chain, Self learning component:- seven dimensions of e-commerce strategy. Text Books 1. P.T. Joseph, S.J. “E Commerce – and Indian perspective” – Third edition, PHI 2010. Ch. 1,2,3,4,6 and related sections of 7,8 and 9 only. 2. Daniel Minoli and Emma Minoli “Web commerce Technology”, Tata McGraw Hill – 2000. Advanced Mathematics (4:0:0) Sub Code : MIT0401 CIE Hrs/Week : 04 SEE SEE Hours : 3 Hrs Max Marks : 100 Designation: : 50% : 50% CORE Course outcomes On successful completion of the course, students will be able to: 14 Department of CS&E NIE, Mysore-08 1. Construct the matrix, digraphs of relations and prove some results on different types of relation and also obtain equivalence classes. 2. Identify different types of functions, find composition and inverse of a function and solve problems using pigeon-hole principle. 3. Apply the concepts of graph theory to solve some application problems. 4. Solve problems associated with basic probability, Baye’s rule, discrete & continuous probability distributions. 5. Evaluate estimators, construct confidence intervals, and perform hypothesis tests and obtain regression lines. 6. Solve problems of Joint Distribution, Markov chain using transition probability matrix and also the problems in queuing theory. 1. Relations Binary relations, Matrix and Digraph representation of a relation, Operations on binary relations, (SLE: Composition of relations), Properties of relations, Equivalence relations. - 9 Hrs 2.Functions Function, Types of functions, Composition of functions, Invertible functions, Recursive function, (SLE: Hash function), The Pigeonhole-principle. - 8 Hrs 3.Graph Theory Graphs and Multigraphs, Subgraphs, Isomorphic and Homomorphic graphs, Paths, Cycles and Circuits in a graph. Connected graphs. Euler’s and Hamiltonian graphs. The Konigsberg Bridge problem.Trees, Kruskal’s algorithm(SLE: Prim’s algorithm), Cut sets and cut vertices, Network flow problems. - 9 Hrs 4. Probability (SLE: Basic probability upto Baye’s Theorem ) Random variables – Discrete and continuous random variables, Binomial, Poisson’s, Exponential and Normal Distributions. - 9 Hrs 5.Statistical Inference (SLE: Basic concept of statistics viz mean and standard deviation) Random sampling, Sampling distributions, Parameter estimation, Testing of hypothesis, Correlation and regression, Analysis of variance. 15 Department of CS&E NIE, Mysore-08 - 8Hrs 6.Joint Distribution and Markov Chains Concept of joint probability: Joint probability distribution, (discrete) Independent random variables, Expectation, Covariance, Correlation Coefficient.(SLE: Continuous joint probability distributions) Probability vectors, Stochastic matrices, Regular stochastic matrices, Markov chains, Concept of a queue, the M/G/I and M/M/I queuing systems, analysis. - 9Hrs Books for Reference : 1. 2. 3. 4. 5. Discrete Mathematics and its Applications – Kenneth.H.Rosen V edition Elements of Discrete Mathematics – C.L. Liu, D.P. Mohapatra. Discrete and Combinatorial Mathematics – Ralph P. Grimaldi. Probability and Statistics – Schaum Series (All latest editions) Engineering Mathematics – T. Veerarajan, edition 2, Tata McGraw-Hill Publications. Data Warehousing and Data Mining (4:0:2) Sub Code : MIT0504 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 05 Course Outcomes: On successful completion of the course the students will be able to 1. Understand the concepts of Data Warehousing, modeling and OnLine Analytical Processing 2. Identify the challenges , tasks , technologies , and kind of applications demanded by Data Mining 3. Decide about the data , data preprocessing and applications 4. use the algorithms for association analysis and evaluate the association patterns 5. Understand and use the various data classification methods 6. identify the various clustering methods to classify the data and perform analysis 16 Department of CS&E NIE, Mysore-08 1.Data Warehousing and OLAP Data Warehouse basic concepts, Data Warehouse Modeling, Data Cube. Self learning component:- OLAP 2.Data Mining Introduction, What is Data Mining, Motivating Challenges, Which technologies are used, which kinds of applications are targeted by Data Mining Self learning component:- Data Mining Tasks 3. Data Mining-Which type of data Types of Data, Data Preprocessing, Measures of Similarity and Dissimilarity, Self learning component:- Data Mining Applications 4. Association Analysis: Basic Concepts and Algorithms Frequent Item set Generation, Rule Generation, Compact Representation of Frequent Itemsets, Alternative methods for generating Frequent Item sets, FP Growth Algorithm, Self learning component:- Evaluation of Association Patterns 5. Classification Basics, General approach to solve classification problem, Decision Trees, Rule Based Classifiers, and Nearest Neighbor Classifiers. Bayesian Classifiers, Estimating Predictive accuracy of classification methods, improving accuracy of clarification methods, Multiclass Problem. Self learning component:- Evaluation criteria for classification methods 6. Clustering Techniques Overview, Features of cluster analysis, Types of Data and Computing Distance, Types of Cluster Analysis Methods, Partitional Methods, Hierarchical Methods, Density Based Methods. Quality and Validity of Cluster Analysis. Outlier detection methods, Classification based approached Self learning component:- Statistical Approaches, Clustering based applications Text Books: 1.Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Addison-Wesley, 2005. 2.G. K. Gupta: Introduction to Data Mining with Case Studies, 3rd Edition, PHI, New Delhi, 2009. Reference Books: 1. Arun K Pujari: Data Mining Techniques University Press, 2nd Edition, 2009. 2. Jiawei Han and Micheline Kamber: Data Mining - Concepts and Techniques, 2nd Edition, Morgan Kaufmann Publisher, 2006. 3. Alex Berson and Stephen J. Smith: Data Warehousing, Data Mining, and OLAP Computing Mc GrawHill Publisher, 1997. 17 Department of CS&E NIE, Mysore-08 Cloud Computing (4:0:2) Sub Code : MIT0505 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 05 Course Outcomes On successful completion of the course, the student will be able 1. 2. 3. 4. 5. 6. To learn how to use Cloud Services. To gain knowledge on Virtualization To gain knowledge of Task Scheduling algorithms. Apply Map-Reduce concept to applications. To build Private Cloud. To gain knowledge in cloud resource virtualization and scheduling. 1. Introduction, Cloud Infrastructure Cloud computing, Cloud computing delivery models and services, Ethical issues, Cloud vulnerabilities, Cloud computing at Amazon, Cloud computing the Google perspective, Microsoft Windows Azure and online services, Open-source software platforms for private clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological impact, Service level agreements, Exercises Self learning component:-. User experience and software licensing. 2. Cloud Computing: Application Paradigms. Challenges of cloud computing, Architectural styles of cloud computing, Workflows: Coordination of multiple activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce programming model, A case study: The GrepTheWeb application , Cloud for science and engineering, High-performance computing on a cloud, SLC:Cloud computing for Biology research, Social computing. Self learning component:- Digital content and cloud computing 3. Cloud Resource Virtualization. Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines, Performance and Security Isolation, Full virtualization and paravirtualization, Hardware support for virtualization, Case Study:Xen a VMM based paravirtualization, Optimization of network virtualization, vBlades, Performance comparison of virtual machines, Exercises and problems. Self learning component:- The dark side of virtualization 18 Department of CS&E NIE, Mysore-08 4. Cloud Resource Management and Scheduling. Policies and mechanisms for resource management, Application of control theory to task scheduling on a cloud, Stability of a two-level resource allocation architecture, Feedback control based on dynamic thresholds, Coordination of specialized autonomic performance managers, A utility-based model for cloud-based Web services, Resourcing bundling: Combinatorial auctions for cloud resources, Scheduling algorithms for computing clouds, Fair queuing, Start-time fair queuing, Borrowed virtual time, Cloud scheduling subject to deadlines, Scheduling Map Reduce applications subject to deadlines , Exercises and problems. Self learning component:- SLC:Resource management and dynamic scaling 5. Cloud Security, Cloud Application Development. Cloud security risks, Security: The top concern for cloud users, Privacy and privacy impact assessment, Trust, Operating system security, Virtual machine Security, Security of virtualization, Security risks posed by shared images, Security risks posed by a management OS, A trusted virtual machine monitor, Amazon web services: EC2 instances, Connecting clients to cloud instances through firewalls, Security rules for application and transport layer protocols in EC2, How to launch an EC2 Linux instance and connect to it SLC. Self learning component:- How to use S3 in java 6. Cloud-based simulation of a distributed trust algorithm, A trust management service, A cloud service for adaptive data streaming,:Exercises and problems. Self learning component:- Cloud based optimal FPGA synthesis SLC Text Book: 1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013. REFERENCES: 1. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and Paradigms, Willey 2014. 2. John W Rittinghouse, James F Ransome:Cloud Computing Implementation, Management and Security, CRC Press 2013. Protocol Engineering (4:0:2) Sub Code : MIT0506 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 05 19 Department of CS&E NIE, Mysore-08 Course Outcomes On successful completion of the course the students will be able to 1. Familiar with the concept of protocols and their representation and discuss the phases of protocol engineering 2. Identify the components of protocol to be specified and to create formal specification of protocol using communicating finite state machine 3. Design and develop SDL based specification of a protocol 4. Apply different types of protocol verification techniques and tools 5. Identify a generally applicable and efficient procedure for generating a conformance test suite for a given protocol implementation, to compare different types of protocol testing methods, to familiarize concepts of performance, interoperability and scalability testing of protocol 6. Discuss methods for interactively build correct protocol specification and its implementation issues 1. Introduction, Error Control, Flow Control: Communication Software, Communication Subsystems, Communication Protocol Definition/Representation, Formal and Informal Protocol Development Methods, Protocol Engineering Phases, Type of Transmission Errors, Linear Block Code, Cyclic Redundancy Checks, Introduction to Flow Control, Window Protocols, Sequence Numbers, Negative Acknowledgments, Congestion Avoidance Self learning component:- Communication model, 2. Network Reference Model: Layered Architecture, Network Services and Interfaces, Protocol Functions: Encapsulation, Segmentation, Reassembly, Multiplexing, Addressing, TCP/IP Protocol Suite, Application Protocols. Self learning component:- OSI Model Layer Functions, 3. Protocol Specification: Components of specification, Service specification, Communication Service Specification Protocol entity specification: Sender, Receiver and Channel specification, Interface specifications, Interactions, Multimedia specifications, RSVP specification. Self learning component:- Alternating Bit Protocol Specification 4. Protocol Specification Language (SDL), Protocol Verification / Validation: Salient Features. Communication System Description using SDL, Structure of SDL. Data types and communication 20 Department of CS&E NIE, Mysore-08 paths, Examples of SDL based Protocol Specifications: Question and answer protocol, X-on-X-off protocol, Alternating bit protocol, Sliding window protocol specification, TCP protocol specification, SDL based platform for network, OSPF, BGP Multi Protocol Label Switching SDL components, Protocol Verification using FSM, ABP Verification, Protocol Design Errors, Deadlocks, Unspecified Reception, Non-executable Interactions, State Ambiguities, Protocol Validation Approaches: Perturbation Technique, Reachability Analysis, Fair Reachability Graphs: ABP Verification, Liveness Properties, SDL Based Protocol Validation: ABP Validation. Self learning component:- Process Algebra based Validation, SDL Based Protocol Verification 5. Protocol Conformance and Performance Testing: Conformance Testing Methodology and Framework, Local and Distributed Conformance Test Architectures, Test Sequence Generation Methods: T, U, D and W methods, Distributed Architecture by Local Methods, Synchronizable Test Sequence, Conformance testing with Tree and Tabular Combined Notation (TTCN), Conformance Testing of RIP, Testing Multimedia Systems, quality of service test architecture(QOS), Performance Test methods, SDL Based Performance Testing of TCP, OSPF, Interoperability testing, Self learning component:- Scalability testing protocol synthesis problem 6. Protocol Synthesis and Implementation: Synthesis methods, Interactive Synthesis Algorithm, Automatic Synthesis Algorithm, Automatic Synthesis of SDL from MSC, Protocol Re-synthesis, Requirements of Protocol Implementation, Objects Based Approach To Protocol Implementation, Protocol Compilers. Self learning component:- Code generation from Estelle, LOTOS, SDL and CVOPS Text books: 1. Pallapa Venkataram and Sunilkumar S. Manvi: Communication Protocol Engineering, PHI, 2004. Reference books: 1. Mohammed G. Gouda: Elements of Protocol Design, Wiley Student Edition, 2004. 21 Department of CS&E NIE, Mysore-08 Advanced Database Management systems (4:0:0) Sub Code : MIT0402 CIE : 50% Hrs/Week : 04 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 04 Course Outcomes: On successful completion of the course, student will be able to 1. 2. 3. 4. 5. 6. Understanding different file storage structures. Compare different types of tree indexing Understand the query evaluation and different types of sorting. Familiar with the query optimizer. Tuning of the data base. Compare the advanced applications of the database. 1.Over view of Storage and Indexing, Disks and Files Data on external storage; File organizations and indexing; Index data structures; Comparison of file organizations; Indexes and performance tuning Memory hierarchy; RAID; Disk space management; Buffer manager; Files of records; Self learning component:- Page formats and record formats 2.Tree Structured Indexing Intuition for tree indexes ;Indexed sequential access method; B+trees, Search, Insert, Delete, Duplicates, B+tress in practice, Hash-Based Indexing; Static hashing, Extendible hashing. Self learning component :- Linear hashing, comparisons 3.Overview of Query Evaluation, External Sorting 22 Department of CS&E NIE, Mysore-08 The system catalog, Introduction to operator evaluation; Introduction to query optimization; Alternative plans; A motivating example; what a typical optimizer does. When does a DBMS sort data? A simple two-way merge sort; External merge sort Self learning component:- Algorithm for relational operations 4. A Typical Relational Query Optimizer Translating SQL queries in to Relational Algebra; Estimating the cost of a plan; Relational algebra equivalences; Enumeration of alternative plans; Nested sub-queries. Self learning component:- other approaches to query optimization. 5. Physical Database Design and Tuning Introduction; Guidelines for index selection ,examples; Clustering and indexing; Indexes that enable index-only plans, Tools to assist in index selection; Overview of database tuning; Choices in tuning the conceptual schema; Impact of concurrency; DBMS benchmarking. Self learning component:- Choices in tuning queries and views 6. More Recent Applications Mobile databases; Multimedia databases; Geographical Information Systems; Self learning component:- Genome data management. Text Books: 1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems,3rd Edition,McGraw-Hill,2003 2. Elmasri and Navathe:Fundamentals of Database Systems,5th Edition,Pearson Education,2007. Reference Books: 1. Conolly and Begg:Database Systems,4th Edition,Pearson Education,2002. 23 Department of CS&E NIE, Mysore-08 ELECTIVES 24 Department of CS&E NIE, Mysore-08 DISTRIBUTED SYSTEMS(4 : 0 : 2) Sub Code : MIT0501 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: CORE Credits: 05 Course outcomes On successful completion of the course, students will be able to: 1. Perceptive of the principles and concepts involved in designing distributed systems 2. Master the general properties of networked communication necessary for distributed systems on the Internet 3. Master basic algorithms for failure detection, leader elections, broadcast and multicast, basic shared memory in distributed systems, agreement protocols, and group communication 4. Employ and create common paradigms for easing the task of distributed systems programming, such as RPC 5. Identify the security challenges faced by distributed systems. Be able to select appropriate security solutions to meet the needs of commonly encountered distributed programming scenarios. 6. Analyze the distributed algorithms for locking, synchronization and concurrency scheduling. 1. Characterization of Distributed Systems and System Models: Introduction, Resource sharing and the Web, Challenges, Architectural models, Fundamental models. Self learning component:- Examples of distributed systems 2. Networking and Internetworking: Types of Networks, Internet protocols Self learning component:- Networks principles 3. Interprocess Communication: Introduction, The API for the Internet protocols, External data representation and marshalling, Client -Server communication, Group communication, 25 Department of CS&E NIE, Mysore-08 Self learning component:- Case study: Interprocess communication in UNIX 4. Distributed Objects and Remote Invocation: Communication between distributed objects, events and notifications Self learning component:- Remote procedure call 5. Operating System Support and Security: The Operating system layer, protection, processes and threads, communication and invocation. Self learning component:- operating system architecture 6. Transactions and Concurrency Control: Transactions, nested transactions, locks, optimistic concurrency control, timestamp ordering, comparison of methods for concurrency control. Design and Implementation issues, sequential consistency and Ivy. Self learning component:- Distributed Shared Memory TEXT BOOKS: 1. George Coulouris, Jean Dollimore, Tim Kindberg: Distributed Systems, Concept and Design, 3rd Edition, Pearson Education, 2005. REFERENCE BOOKS: 1. Sukumar Ghosh: Distributed Systems, An Algorithmic Approach, Chapman &Hall / CRC, 2007. 2. Pradeep K. Sinha: Distributed Operating Systems, Concepts and Design, PHI, 2007. 3. Randy Chow, Theodore Johnson: Distributed Operating Systems and Algorithm Analysis, Pearson, 2009. Computer Graphics and Visualization (4:0:2) Sub Code : MIT0508 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Designation: ELECTIVE Credits: 05 Course outcome On successful completion of the course the students will be able to 26 Department of CS&E NIE, Mysore-08 1. Explain the basic components in computer graphic system. 2. Identify and Illustrate the OpenGL APIs with examples. 3. Identify and illustration of Interactive Programs and Animating Interactive Programs. Design of Interactive Programs. 4. Explain and identify basics of Geometric Objects and Transformations 5. Explain, identify and illustrate Geometric Objects and Transformations in Homogeneous Coordinates using OpenGL. 6. Analyze and compare Classical and computer viewing. 1. INTRODUCTION Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging systems; The synthetic camera model; The programmer’s interface; Graphics architectures; Programmable pipelines; Performance characteristics. Graphics Programming: The Sierpinski gasket; Programming two dimensional applications. The OpenGL API; Primitives and attributes; Color; Viewing; Control functions; The Gasket program; Polygons and recursion; Plotting implicit functions. Self learning component:- The three dimensional gasket; 2. Input and Interaction Interaction; Input devices; Clients and servers; Display lists; Display lists and modeling; Programming event-driven input; Menus; Picking; A simple CAD program; Animating interactive programs; Design of interactive programs; Logic operations. Self learning component:- Building interactive models 3. Geometric Objects and Transformations - 1 Scalars, points, and vectors; Three-dimensional primitives; Coordinate systems and frames; Modeling a colored cube;Affine transformations; Rotation, translation and scaling. Transformations in homogeneous coordinates; OpenGL transformation matrices; Interfaces to threedimensional applications; Quaternions. Self learning component:- Concatenation of transformations 4. Viewing Classical and computer viewing; Viewing with a computer; Positioning of the camera; Simple projections; Projections in OpenGL; Hidden-surface removal; Interactive mesh displays; Parallelprojection matrices. 27 Department of CS&E NIE, Mysore-08 Self learning component:- Perspective-projection matrices; Projections and shadows 5. Lighting and Shading Light and matter; Light sources; The Phong lighting model; Computation of vectors; Polygonal shading; Approximation of a sphere by recursive subdivisions; Light sources in OpenGL; Shading of the sphere model; Global illumination. Self learning component:- Specification of materials in OpenGL 6. Implementation Basic implementation strategies; The major tasks; Clipping; Line-segment clipping; Polygon clipping; Clipping of other primitives; Clipping in three dimensions; Rasterization; Bresenham’s algorithm; Polygon rasterization; Antialiasing; Display considerations. Self learning component:- Hidden-surface removal Text Books: 1. Edward Angel: Interactive Computer Graphics A Top-Down Approach with OpenGL, 5th Edition, Addison-Wesley, 2008. (Chapters 1, 2, 3, 4, 5, 6, 7) Reference Books: 1. F.S. Hill,Jr.: Computer Graphics Using OpenGL, 2nd Edition, Pearson education, 2001. 2. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes, Computer Graphics, Addisonwesley 1997. 3. Donald Hearn and Pauline Baker: Computer Graphics- OpenGL Version,2nd Edition, Pearson Education, 2003. E-Commerce(4:0:2) Sub Code : MIT0509 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcomes On successful completion of the course, the students will be able to 1 Discuss the network infrastructure and introduction to concept of electronic commerce and the various types of consumer and organizational applications. 28 Department of CS&E NIE, Mysore-08 2 Compare and contrast the various network infrastructure alternatives: the various types of on-ramps being built for the Information Superhighway, discuss the immediate future and provide guidelines for experimenting with various access methods. 3. Get a clear flow about network infrastructure and transaction security issues that concern both the individual consumer and the organization protecting its perimeter(privacy). 4. Discuss the business applications of the Information Superhighway and the Technologies, rules, and regulations involved in designing electronic commerce applications. 5. Get a clear overview of three broad applications of electronic commerce: Consumer-oriented electronic commerce, Inter-organizational electronic commerce and Intra-organizational electronic commerce 6. Examine the emerging changes in marketing and advertising that have been facilitated by technology. 1. Introduction, Electronic Commerce and Word Wide Web Electronic Commerce Frame work, Electronic Commerce and Media Convergence, The anatomy of E-Commerce Application. Architectural Framework for Electronic Commerce, World Wide Web (WWW) as the Architecture, Web Background Hypertext Publishing, Technology behind the Web. Self learning component:- Security and the Web 2. Consumer-Oriented Electronic Commerce and Electronic Payment Systems Consumer – Oriented Applications, Mercantile Process Models, Mercantile Models from the Consumer’s Perspective, Merchant’s Models from the Merchant’s Perspective. Types of Electronic Payment Systems, Digital Token-Based Electronic Payment Systems, Smart Cards and Electronic Payment Systems, Credit Card-Based Electronic Payment Systems. Self learning component:- Designing Electronic Payment Systems. 3. Inter organizational Commerce and EDI Electronic Data Interchange, EDI Applications in Business, EDI: Legal, Security, and Privacy Issues. Self learning component:- EDI and Electronic Commerce 29 Department of CS&E NIE, Mysore-08 4. EDI Implementation, MIME, and Value-Added Networks, Intraorganizational Electronic Commerce Standardization and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Value Added Networks (VANs), Internet-Based EDI.Internal Information Systems, Macro forces and Internal Commerce, Customization and Internal Commerce, Supply Chain Management. Self learning component :- Work-Flow Automation and Coordination 5. The Corporate Digital Library Dimensions of Internal Electronic Commerce Systems, Making a Business Case for a Document Library, Types of Digital Documents, Issues behind Document Infrastructure, Self learning component :- Corporate Data Warehouses. 6. Advertising and Marketing on the Internet, On-Demand Education and Digital Copyrights The New Age of Information – Based Marketing, Advertising on the Internet, Charting the On-Line Marketing Process, Market Research. Technological Components of Education On-Demand, Digital Copyrights and Electronic Commerce. Self learning component:- Computer-Based Education and Training Text Book: 1. Ravi Kalakota, Andrew B Winston: Frontiers of Electronic Commerce, Addison Wesley, 1996. Reference Books 1. Daniel Lynch and Lesllie Lundquist: Digital Money: The New Era of Internet Commerce, John Wiley, 1996. 2. Daniel Minoli, Emma Minoli: Web Commerce Technology Handbook, Tata McGrawHill, 1998. 30 Department of CS&E NIE, Mysore-08 Multimedia Information Systems (4:0:2) Sub Code : MIT0511 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcomes On successful completion of the course, the students will be able to 1. Describe multimedia objects and systems 2. Compare representation of different types of multimedia data 3. Identify and describe different compression techniques 4. Analyze and Compare different optical storage medias 5. Describe content analysis and its importance 6. Identify and describe multimedia application classes 1. Introduction, Media and Data Streams, Audio Technology: Multimedia Elements; Multimedia Applications; Multimedia Systems Architecture; Evolving Technologies for Multimedia Systems; Defining Objects for Multimedia Systems; Multimedia Data Interface Standards; The need for Data Compression; Multimedia Databases. Media : Perception Media, Representation Media, Presentation Media, Storage Media, Transmission Media, Information Exchange Media, Presentation Spaces & Values, and Presentation Dimensions; Key Properties of a Multimedia System : Discrete & Continuous Media, Independence Media, Computer Controlled Systems, Integration; Characterizing Data Streams: Characterizing Continuous Media Data Streams. Sound: Frequency, Amplitude, Sound Perception and Psycho - acoustics; Audio Representation on Computers; Three Dimensional Sound Projection; Music and MIDI Standards; Speech Signals; Speech Output; Speech Input; Speech Transmission. Self learning component:- Transmission Modes 2. Graphics and Images, Video Technology, Computer-Based Animation: Capturing Graphics and Images Computer Assisted Graphics and Image Processing; Reconstructing Images; Graphics and Image Output Options. Basics; Television Systems; Digitalization of Video Signals; Digital Television; Basic Concepts; Specification of Animations; Methods of Controlling Animation; Display of Animation; Transmission of Animation; 31 Department of CS&E NIE, Mysore-08 Self learning component:- Virtual Reality Modeling Language. 3. Data Compression: Storage Space; Coding Requirements; Source, Entropy, and Hybrid Coding; Basic Compression Techniques; JPEG: Image Preparation, Lossy Sequential DCT-based Mode, Expanded Lossy DCT-based Mode, Lossless Mode, Hierarchical Mode. MPEG: Video Encoding, Audio Coding, DataStream, Self learning component:- MPEG compression types. 4. Optical Storage Media: History of Optical Storage; Basic Technology; Video Discs and Other WORMs; Compact Disc Digital Audio; Compact Disc Read Only Memory; CD-ROM Extended Architecture; Further CD-ROM-Based Developments; Compact Disc Recordable; Compact Disc Magneto-Optical; Compact Disc Read/Write; Self learning component:- Digital Versatile Disc. 5. Content Analysis: Simple Vs. Complex Features; Analysis of Individual Images; Analysis of Image Sequences; Audio Analysis; Applications. Self learning component:- Video Analysis 6. Multimedia Application Design: Multimedia Application Classes; Types of Multimedia Systems; Virtual Reality Design; Components of Multimedia Systems; Organizing Multimedia Databases; Application Workflow Design Issues; Self learning component:- Distributed Application Design Issues. TEXT BOOKS: 1. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol1-Media Coding and Content Processing, 2nd Edition, PearsonEducation / PHI, 2003. 2. Prabhat K. Andleigh, Kiran Thakrar: Multimedia SystemsDesign, PHI, 2003. REFERENCE BOOKS: 1. K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic: Multimedia Communication Systems: Techniques, Standards, and Networks, Pearson Education, 2002. 2. Nalin K Sharda: Multimedia information Networking, PHI,2002. 32 Department of CS&E NIE, Mysore-08 Information and Network Security (4:0:2) Sub Code : MIT0512 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcomes On successful completion of the course, the students will be able to, 1. Identify common network security vulnerabilities/attacks 2. Explain and analyze the basic Cryptographic algorithms for security 3. Critically evaluate the risks and threats to networked computers how provide security using public key cryptography. 4. Demonstrate detailed knowledge of the role of encryption in email sort of communication. 5. Analyze security issues of IP security. 6. Identify the appropriate procedures required for secure electronic transactions. 1. Introduction - Attacks, Services and mechanisms, security attacks, security services, security services, model for internet security, Conventional Encryption: Conventional encryption model, Steganography, Self learning component:- Classical Encryption Techniques. 2. Modem Techniques- Simplified DES, Block cipher principles, data encryption standard Strength of DES, Differential and Linear Cryptanalysis, Block cipher Design Principles, Self learning component:- Block Cipher Modes of Operations. 3. Public key cryptography: Principles of public key cryptosystems, RSA Management, Diffie Hellman Key Exchange, algorithms, Key Self learning component:- Digital signature, DSS 4. Electronic Mail Security : Pretty Good Privacy (PGP); KEY RINGS . Self learning component:- S/MIME 33 Department of CS&E NIE, Mysore-08 5. IP Security : IP Security Overview; IP Security Architecture; Authentication Header; Encapsulating Security Payload; Combining Security Associations. Self learning component:- Key Management 6. Web Security : Web security requirements; Secure Socket layer (SSL) and Transport layer Security (TLS); Secure Electronic Transaction (SET). Intruders, Viruses, and Worms Viruses and Related Threats, Firewalls, Trusted Systems. Self learning component:- Firewall Design Principles Text Books: 1. William Stallings: Cryptography and network security, 3rd edition, Pearson education, 2003 Reference Book: 1. Behrouz A. Forouzan: Cryptography and Network Security, Special Indian Edition, Tata McGraw-Hill, 2007. C# and .NET(4:0:2) Sub Code : MIT0515 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcomes On successful completion of the course the students will be able to 1. Explain the basics of .Net platform and the role of base class libraries, role of common intermediate language and namespaces. 2. Explain the method to Define and deploy the different command line compiler options. 3. Discuss the fundamentals of c# and to build the basic c# program using different constructs. 4. Review the basic pillars of object oriented programming concepts Exception Handling and basics of object lifetime. 5. Discuss the different system defined interfaces and collections and also define the custom interfaces 34 Department of CS&E NIE, Mysore-08 with examples. 6. Explain the callback interfaces, delegates, advanced C# keywords and its implementation, Build and deploy local and shared assemblies. . Part A 1. The Philosophy of .NET Understanding the Previous State of Affairs, The .NET Solution, The Building Block of the .NET Platform (CLR,CTS, and CLS), The Role of the .NET Base Class Libraries, What C# Brings to the Table, An Overview of .NET Binaries ( aka Assemblies ), the Role of the Common Intermediate Language , The Role of .NET Type Metadata, The Role of the Assembly Manifast, Compiling CIL to Platform –Specific Instructions, Understanding the Common Type System, Intrinsic CTS Data Types, Understanding the Common Languages Specification, Understanding the Common Language Runtime A tour of the .NET Namespaces, Self study component:- Increasing Your Namespace Nomenclature, Deploying the .NET Runtime. 2. Building C# Applications The Role of the Command Line Complier (csc.exe), Building C # Application using csc.exe Working with csc.exe Response Files, Generating Bug Reports , Remaining C# Compiler Options, Visual Studio .NET IDE, Other Key Aspects of the VS.NET IDE, C# “Preprocessor:” Directives, An Interesting Aside: The System. Environment Class. Self study component:- The Command Line Debugger (cordbg.exe) Using the 3. C# Language Fundamentals. The Anatomy of a Basic C# Class, Creating objects: Constructor Basics, The Composition of a C# Application, Default Assignment and Variable Scope, The C# Member Initialization Syntax, Basic Input and Output with the Console Class, Understanding Value Types and Reference Types, The Master Node: System, Object, The System Data Types (and C# Aliases), Converting Between Value Types and Reference Types: Boxing and Unboxing, Defining Program Constants, C# Iteration Constructs, C# Controls Flow Constructs, The Complete Set of C# Operators, Defining Custom Class Methods, Understating Static Methods, Methods Parameter Modifies, Array Manipulation in C#, String Manipulation in C#, C# Enumerations, Self study component:- Defining Structures in C#, Defining Custom Namespaces. 35 Department of CS&E NIE, Mysore-08 4. Object- Oriented Programming with C# Forms Defining of the C# Class, Definition the “Default Public Interface” of a Type, Recapping the Pillars of OOP, The First Pillars: C#’s Encapsulation Services, Pseudo- Encapsulation: Creating Read-Only Fields The Second Pillar: C#’s Inheritance Supports, keeping Family Secrets: The “ Protected” Keyword, Nested Type Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between . Exceptions and Object Lifetime. Ode to Errors, Bugs, and Exceptions, The Role of .NET Exception Handing, the System. Exception Base Class, Throwing a Generic Exception, Catching Exception, CLR System – Level Exception (System, System Exception), Custom Application-Level Exception (System. System Exception), Handling Multiple Exception, The Family Block, the Last Chance Exception Dynamically Identifying mApplication – and System Level Exception Debugging System Exception Using VS. NET, Understanding Object Lifetime, the CIT of “new’, The Basics of Garbage Collection,, Finalization a Type, The Finalization Process, Building an Ad Hoc Destruction Method. Self study component:- Garbage Collection Optimizations, The System. GC Type. 5. Interfaces and Collections Defining Interfaces Using C# Invoking Interface Members at the object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation, Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing, Implementation, Interfaces Using VS .NET, understanding the IConvertible Interface, Building a Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects ( ICloneable), Building Comparable Objects ( I Comparable ), Exploring the system. Collections Namespace, Self study component:- Building a Custom Container (Retrofitting the Cars Type). 6. Callback Interfaces, Delegates, and Events, Advanced Techniques Understanding Callback Interfaces, Understanding the .NET Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate Example, , Building More a Elaborate Delegate Example, Understanding Asynchronous Delegates, Understanding (and Using)Events.The Advances Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation of the Cars Indexer Internal Representation of Type Indexer . Using C# Indexer from VB .NET. Overloading operators, The Internal Representation of Overloading Operators, interacting with Overload Operator from Overloaded- Operator- Challenged Languages, Creating Custom Conversion Routines, Defining Implicit Conversion Routines, The Internal Representations of Customs Conversion Routines 36 Department of CS&E NIE, Mysore-08 Understanding .NET Assembles. Problems with Classic COM Binaries, An Overview of .NET Assembly, Building a Simple File Test Assembly, A C#. Client Application, A Visual Basic .NET Client Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring the CarLibrary’s Types, Building the Multifile Assembly ,Using Assembly, Understanding Private Assemblies, Probing for Private Assemblies (The Basics), Private A Assemblies XML Configurations Files, Probing for Private Assemblies ( The Details), Understanding Shared Assembly, Understanding Shared Names, Building a Shared Assembly, Self study component:- Understanding Delay Signing, Installing/Removing Shared Assembly, Using a Shared Assembly. Text Books: 1. Andrew Troelsen: Pro C# with .NET 3.0, Special Edition, Dream tech Press, India, 2007. 2. E. Balagurusamy: Programming in C#, , 5th Reprint, Tata McGraw Hill, 2004. Reference Books: 1. Tom Archer: Inside C#, WP Publishers, 2001. 2. Herbert Schildt: C# The Complete Reference, Tata McGraw Hill, 2004. Web Programming (4:0:2) Sub Code : MIT0516 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcomes On successful completion of the course the students will be able to 1. Explain the importance of MIME and HTTP in Internet 2. Prepare web pages using HTML/XHTML and CSS. 37 Department of CS&E NIE, Mysore-08 3. Analyze working of simple JavaScript programs on client side 4. Demonstrate how to embed JavaScript into HTML and handle different types of events 5. Create dynamic documents using JavaScript 6. Demonstrate the importance of XML in web page creation and Displaying XML documents with CSS and XSLT style sheets. Part-A 1. Fundamentals of Web: Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; The Web Programmers Toolbox. Self study component:- Security 2. XHTML and CSS: Origins and evolution of HTML and XHTML; Basic syntax; Standard XHTML document structure; Basic text markup. Images; Hypertext Links; Lists; Tables; Forms; Frames; Syntactic differences between HTML and XHTML.. Introduction; Levels of style sheets; Style specification formats; Selector forms; Property value forms; Font properties; List properties; Color; Alignment of text; The Box model; Background images; The <span> and<div> tags; Self study component:- Conflict resolution. 3. Javascript: Overview of JavaScript; Object orientation and JavaScript; General syntactic characteristics; Primitives, operations, and expressions; Screen output and keyboard input; Control statements; Object creation and modification; Arrays; Functions; Constructor;; Errors in scripts; Examples. Self study component:- Pattern matching using regular expressions 4. JavaScript and HTML Documents: The Javascript execution environment; The Document Object Model; Element access in Javascript; Events and event handling; Handling events from the Body elements, Button elements, Text box and Password elements; The DOM 2 event model; The navigator object. Self study component:- DOM tree traversal and modification 5. Dynamic Documents with JavaScript: Introduction to dynamic documents; Positioning elements; Moving elements; Element visibility; Changing colors and fonts; Dynamic content; Stacking elements; Locating the mouse cursor; Reacting to a mouse click; Slow movement of elements; Self study component:- Dragging and dropping elements. 38 Department of CS&E NIE, Mysore-08 6. XML: Introduction; Syntax; Document structure; Document Type definitions; Namespaces; XML schemas; Displaying raw XML documents; Displaying XML documents with CSS; XSLT style sheets; XML processors. Self study component:- Web services Text books: 1. Robert W. Sebesta: Programming the World Wide Web, 4th Edition, Pearson Education, 2008. Reference books: 1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World WideWeb How to program, 3rd Edition, Pearson Education / PHI,2004. 2. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley India, 2006. 3. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003. OOAD & Design Patterns (4:0:2) Sub Code : MIT0517 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcomes On successful completion of the course, the students will be able to, 1. Understanding of the fundamental concepts and historical evolution of the object model 2. Explain the class modeling, notations and the process of object-oriented analysis. 3. Acquire the knowledge about the state modeling, system conception and prepare problem statement. 4. Analyze realistic application of object-oriented analysis and design within a variety of problem domains 5. Realize and understand the implementation of class modeling 6. Address the practical needs and concerns of software engineering practitioners with the help of design patterns. 39 Department of CS&E NIE, Mysore-08 1. Introduction, Modeling Concepts What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO development. Modeling as Design Technique: Modeling; abstraction; The three models. Self study component:- OO modeling history 2. Class Modeling Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models. Advanced object and class concepts; Association ends; N-ary associations; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages. Self study component:- Aggregation; Abstract classes 3. State Modeling, Interaction Modeling and Process Overview, System Conception State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Practical tips. Advanced State Modeling; Signal generalization; Concurrency. A sample state model; Relation of class and state models; Practical tips. Interaction Modeling: Use case models; Sequence models; Activity models; Use case relationships; Procedural sequence models; Special constructs for activity models. Process Overview: Development stages; Development life cycle. System Conception: Devising a system concept; Elaborating a concept; Preparing a problem statement. Self study component:- Nested state diagrams; Nested states 4. Domain Analysis, Application Analysis, System Design Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis. Application Analysis: Application interaction model; Application class model; Application state model; Adding operations. Overview of system design; Estimating performance; Making a reuse plan; Breaking a system in to sub systems; Identifying concurrency; Allocation of sub-systems; Choosing a software control strategy; Handling boundary conditions; Setting the trade-off priorities; Common architectural styles; Architecture of the ATM system as the example. Self study component:- Management of data storage; Handling global resources 5. Class Design, Implementation Modeling 40 Department of CS&E NIE, Mysore-08 Class Design: Overview of class design; Bridging the gap; Realizing use cases; Designing algorithms; Recursing downwards, Refactoring; Design optimization; Reification of behavior; Adjustment of inheritance; Organizing a class design; ATM example. Implementation Modeling: Overview of implementation; Realizing associations. Self study component:- Fine-tuning classes; Fine-tuning generalizations 6. Design Patterns What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern description. Structural Decomposition: Whole-Part; Organization of Work: Master- Slave; Management: Command processor; View handler; Communication: Forwarder-Receiver. Self study component:- Client-Dispatcher-Server; Publisher-Subscriber. Text Books: 1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML, 2nd Edition, Pearson Education, 2005. 2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal: PatternOriented Software Architecture, A System of Patterns, Volume 1, John Wiley and Sons, 2006. Reference Books: 1. Grady Booch et al: Object-Oriented Analysis and Design with Applications, 3rd Edition, Pearson, 2007. 2. Mark Priestley: Practical Object-Oriented Design with UML, 2nd Edition, Tata McGraw-Hill, 2003. 3. K. Barclay, J. Savage: Object-Oriented Design with UML and JAVA, Elsevier, 2008. 4. Booch, G., Rumbaugh, J., and Jacobson, I.: The Unified Modeling Language User Guide, 2nd Edition, Pearson, 2005. 5. E. Gamma, R. Helm, R. Johnson, J. Vlissides: Design Patterns- Elements of Reusable ObjectOriented Software, Addison-Wesley, 1995. 6. Simon Bennett, Steve McRobb and Ray Farmer: Object-Oriented Systems Analysis and Design Using UML, 2nd Edition, Tata McGraw-Hill, 2002. 41 Department of CS&E NIE, Mysore-08 Web 2.0 and Rich Internet Applications (4:0:2) Sub Code : MIT0518 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcomes On successful completion of the course students will be able to: 1. Introduced to web services such as SOAP, RPC style SOAP, Document style SOAP, WSDL, REST services. 2. Introduced to AJAX and various AJAX pattern 3. Understanding XMLHTTP objects 4. Design internet applications with flex, flash player, MXML, Action Script. 5. Understanding of OO design and UI components. 6. Design advanced web applications using AJAX, flex and mash up techniques 1. Introduction, Web Services What is Web 2.0?, Folksonomies and Web 2.0, Software As a Service (SaaS), Data and Web 2.0, Convergence, Iterative development, Rich User experience, Multiple Delivery Channels, Social Networking. Web Services: SOAP, RPC Style SOAP, Document style SOAP, WSDL, REST services, JSON format, What is JSON?, Array literals, Object literals, Mixing literals, JSON Syntax, JSON Encoding and Decoding. Self study component:- JSON versus XML 2. Building Rich Internet Applications with AJAX Building Rich Internet Applications with AJAX: Limitations of Classic Web application model, AJAX principles, Technologies behind AJAX, Examples of usage of AJAX, Dynamic web applications through Hidden frames for both GET and POST methods. IFrames, Asynchronous communication. Self study component:- AJAX application model 42 Department of CS&E NIE, Mysore-08 3. XMLHTTP objects XMLHTTP Object – properties and methods, handling different browser implementations of XMLHTTP, The same origin policy, Cache control, AJAX Patterns (Only algorithms – examples not required), Submission throttling pattern, Periodic refresh, Multi stage download, Fall back patterns. Self study component:- Predictive fetch pattern 4. Building Rich Internet Applications with Flex 24 Hrs Flash player, Flex framework, MXML and Actionscript, Working with Data services, Understanding differences between HTML and Flex applications, Understanding how Flex applications work, Understanding Flex and Flash authoring, MXML language, a simple example. Using Actionscript, MXML and Actionscript correlations. Understanding Actionscript 3.0 language syntax: Language overview, Objects and Classes, Packages and namespaces, Variables & scope of variables, case sensitivity and general syntax rules, Operators, Conditional, Looping, Functions, Nested functions, Functions as Objects, Function scope, OO Programming in Actionscript: Classes, Interfaces, Inheritance, Working with String objects, Working with Arrays, Error handling in Actionscript: Try/Catch, Working with XML Framework fundamentals, Understanding application life cycle, Differentiating between Flash player and Framework, Bootstrapping Flex applications, Loading one flex application in to another, Understanding application domains, Understanding the preloader., Working with children, Container types, Layout rules, Padding, Borders and gaps, Nesting containers, Making fluid interfaces. Self study component:- Managing layout, Flex layout overview 5. Working with UI componenets Working with UI components: Understanding UI Components, Creating component instances, Common UI Component properties, Handling events, Button, Value selectors, Text components, List based controls, Data models and Model View Controller, Creating collection objects, Setting the data provider, Using Data grids, Using Tree controls, Working with selected values and items, Pop up controls, Navigators, Control bars Working with data: Using data models, Using XML, Using Action script classes. Self study component:- Data Binding 6. Building Advanced Web 2.0 applications Definition of mash up applications, Mash up Techniques, Building a simple mash up application with AJAX, Remote data communication, strategies for data communication, Simple HTTPServices, URLLoader in Flex, Web Services in Flex, Examples: Building an RSS reader with AJAX. Self study component:- Building an RSS reader with Flex. 43 Department of CS&E NIE, Mysore-08 Text Books: 1. Nicholas C Zakas et al: Professional AJAX, Wrox publications, 2006. (Chapters 1 to 4, Chapter 6 pp157-166, Chapter 7 pp191-196) 2. Chafic Kazoun: Programming Flex 2, O’Reilly publications, 2007. (Chapters 1, Chapters 3 to 7, Chapter 12, Chapter 16 pp380-403) 3. Francis Shanahan: Mashups, Wrox, 2007. (Chapters 1, 6) Reference Books: 1. Thomas A. Powel: Ajax The Complete reference, McGraw Hill, 2008. 2. Gottfried Vossen, Stephan Hagemann: Unleashing Web 2.0 From Concepts to Creativity, Elsevier, 2007. 3. Colin Moock: Essential Action script 3.0, O’Reilly Publications, 2007. 4. Steven Holzner : Ajax Bible Wiley India , 2007. 5. Justin Gehtland et al: A Web 2.0 primer Pragmatic Ajax, SPD Publications, 2006. 6. Eric Van derVlist et al: Professional Web 2.0 Programming, Wiley India, 2007. Optical Networks (4:0:2) Sub Code : MIT0519 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcomes: 1. Discuss the different generations of digital transport networks 2. Diagnose the timing and synchronization in digital networks 3. Describe architecture of OTN 4. Discuss WDM 5. Discuss the concept of label switching and its importance in OTN 6. Describe LMP and optical routers 44 Department of CS&E NIE, Mysore-08 Part-A 1. Introduction, Telecommunications Infrastructure, Characteristics of Optical Fiber: Three generations of Digital Transport Networks; A brief introduction to WDM and TDM; The Optical Marketplace; Key Optical Nodes; Other Key Terms; Evolution of Optical Systems; Key attributes of Optical Fiber, The Local Connections; The Backbone Connections; The Digital Multiplexing Hierarchy; The Digital Signaling Hierarchies; T1 / DS1 and T3 / DS3; The Layered Protocol Model in the Transport Network; considerations for Interworking Layer1, Layer 2, and Layer 3 Networks, The Basics; The Wavelength; The Basic Components; Structure of the Fiber; Fiber Types; Key Performance Properties of Fiber; Attenuation; Amplifier Spontaneous Emission; Chromatic Dispersion;. Self study component:- Wireless Optical Systems, Lasers 2. Timing and Synchronization, SONET and SDH: Timing and Synchronization in Digital Networks; Effect of a Timing error; The Clocking Signal; Types of Timing in Networks; Timing Variations; Methods of Clock Exchange; Distribution of Timing Using SONET and DS1; Timing Downstream Devices; Synchronization Status Messages and Timing Loops, The SONET Multiplexing Hierarchy; SONET and SDH Multiplexing Structure; The SONET / SDH Frame Structure; SONET and SDH Functional Components; SONET and SDH Problem Detection; Locating and Adjusting Payload with Pointers; Virtual Tributaries in more detail; Virtual Tributaries in Virtual Containers; The Overhead Bytes;. Self study component:- Building Integrated Timing Supply, SONET and SDH Concatenation 3. Architecture of Optical Transport Networks, WDM, Network Topologies and Protection Schemes: The Digital Wrapper; Control Planes; In-Band and Out-Band Control Signaling; Importance of Multiplexing and Multiplexing Hierarchies; Current Digital Transport Hierarchy; SONET Multiplexing Hierarchy; SDH Multiplexing Hierarchy; Key Indexes and Other Terms; The New Optical Transport and Digital Transport Hierarchy; The OTN Layered Model; Encapsulation and Decapsulation Operations; Self study component:- Generic Framing Procedure, 4. The WDM Operation; DWDM, TDM and WDM Topologies; Relationship of WDM to SONET / SDH; EDF; WDM Amplifiers; Add-Drop Multiplexers; WDM Cross-Connects; Wavelength Continuity Property; Examples of DWDM Wavelength Plan; Higher Dispersion for DWDM; Tunable DWDM Lasers, The Non-Negotiable Requirement Robust Networks; Diversity in the Network; Line and Path Protection Switching; Types of Topologies; Working and Protection Fibers; Point-to-Point 45 Department of CS&E NIE, Mysore-08 Topology; BLSR; Protection Switching on Four-Fiber BLSR; Meshed Topologies; PONs; Ethernet in the Wide Area Backbone, Self study component:- Metro Optical Networking. 5. MPLS and Optical Networks, Architecture of IP and MPLS-Based OTNs: Label Switching; FEC; Types of MPLS Nodes; Label Distribution and Binding; Label Switching and Traffic Forwarding; MPLS Support of VPNs; MPLS Traffic Engineering; Multiprotocol Lambda Switching; MPLS and Optical TE Similarities; Possibilities for the MPIS Network; Control and Data Planes Interworking, IP, MPLS, and Optical Control Planes; Interworking the three Control Planes; Management of the Planes; A Framework for the IP over Optical Networks; An Opposing View; Generalized MPLS use in Optical Networks; Bi-Directional LSPs in Optical Networks; GMPLS Extensions for G.709; Self study component:- GMPLS with SONET and SDH. 6. The Link Management Protocol, Optical Routers: Keep the Optical Link up and running; What is managed? Data-bearing Links; Clarification of terms; Basic functions of LMP; Control Channel Management; Link Property Correlation; Fault Management; Extending LMP operations for Optical Link Systems., Optical Switching; Implementation Preferences; Key Terms; Evolution of Switching Networks; Optical Router; Optical Switching Technologies; Optical Resources; Protecting the Label Switched Paths; Protection of the OSP; Wavelength OSP and MPLS LSP; Nesting the LSPs and OSPs; Topologies for a Node Failure; Plane Coupling and De-Coupling; Some End-to-End Wavelengths and Node-to-Node Wavelengths; Granularity of Labels versus Wavelength Support; Approach to the Problem of LSP and OSP Interworking; Self study component:- MEMS and Optical Switching; Thermo-Optic Switches. TEXT BOOKS: 1. Uyless Black: Optical Networks, Pearson Education Asia, 2002. REFERENCE BOOKS: 1. Rajiv Ramaswami and Kumar N.Sivaranjan: Optical Networks - A Practical Perspective, Morgan Kaufuann, 2000. 2. Paul E.Green Jr.: Fiber Optic Network, Prentice Hall, 1993. 3. Jeff Hecht: Understanding Fiber Optics, 4th Edition, PHI 1999. 46 Department of CS&E NIE, Mysore-08 User Interface Design(4:0:2) Sub Code : MIT0520 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcomes On successful completion of the course, the students will be able to, 1. Analyze Diversity, Principle and rules of Interface Design 2. Describe the organizational design , development and methodologies to Support Usability 3. Use interface-Building Tools like Menus, Forms, Dialog Boxes 4. Use Interaction Devices, Pointing Devices, display devices ,Speech Recognizers etc 5. Manage presentations with good presentation styles 6. Prepare manuals by using online facilities and multiple window design. 1. Human Factors of Interactive Software, Theories, Principles and Guidelines Introduction, Goals of Systems Engineering, Goals of Interface Design, Motivation for Human Factors in Design, Accommodation of Human Diversity, Goals for the Profession, High Level Theories, Object-Action Interface Model, Principle 1: Recognize the Diversity, Principle 2: Use the Eight Golden Rules of Interface Design, Principle 3: Prevent Errors, Guidelines for Date Display, Guidelines for Data Entry. Self study component:- Balance of Automation and Human Control 2. Management Issue Introduction, Organizational Design to Support Usability, The Three Pillars of Design, Development Methodologies, Ethnographic Observation, Participatory Design, Scenario Development, Social Impact Statement for Early Design Review, Legal Issues. Expert Reviews, Usability Testing and Laboratories, Surveys, Acceptance Tests, Evaluation During Active Use, 47 Department of CS&E NIE, Mysore-08 Self study component:- Controlled Psychologically Oriented Experiments 3. Tools and Environments , Menus, Forms, Dialog Boxes and Commands Introduction, Specification Methods, Interface-Building Tools, Evaluation and Critiquing Tools. Introduction, Examples of Direct-Manipulation Systems, Explanations of Direct Manipulation, Visual Thinking and Icons, Direct Manipulation Programming, Home Automation, Remote Direct Manipulation Virtual Environments. Task Related Organization, Item Presentation Sequence, Response Time and Display Rate, Fast Movement through Menus, Menu Layout, Form Fillin, Dialog Boxes. Functionality to support Users Tasks, Command-Organization Strategies, The Benefits of Structure, Naming and Abbreviations. Self study component:- Command Menus, Natural Language in Computing 4. Interaction Devices and Response Time Interaction Devices, Introduction, Keyboards and Function Keys, Pointing Devices, Speech Recognition, Digitization, and Generation, Image and Vide Displays, Printers. Self study component:- Theoretical Foundations, Expectations and Attitudes. 5. Presentation Styles, Manuals, Help, and Tutorials Error Messages, Non-anthropomorphic Design, Display Design, Color. Self study component:- Reading from Paper Versus from Displays. 6. Presentation Styles, Manuals, Help, and Tutorials – 2, Multiple-Window Strategies, Hypermedia and the World Wide Web – Preparation of Printed Manuals, Preparation of Online Facilities. Multiple-Window Strategies: Introduction, Individual-Window Design, Multiple- window Design, Co-ordination by Tightly Coupled Windows, Image Browsing and Tightly Coupled Windows, Personal Role Management an Elastic Windows.Genres and Goals and Designers, Users and Their Tasks. Self study component:- Object-Action Interface Model for Web Site Design. Text Books: 1. Ben Shneiderman: Designing the User Interface, 3rd Edition, Addison-Wesley, 1998. (Chapters 1 to 13, and 16) Reference Books: 1. Alan J Dix et. al.: Human-Computer Interaction, II Edition, Prentice- Hall, India,1998 48 Department of CS&E NIE, Mysore-08 2. Eberts: User Interface Design, Prentice-Hall, 1994. 3. Wilber O Galitz: The Essential Guide to User Interface Design – An Introduction to GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt. Ltd, 1998. Client Server Computing(4:0:2) Sub Code : MIT0521 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcome On successful completion of the course, students will be able to: 1. 2. 3. 4. 5. 6. Analyze the requirements of the client and server environment. Familiar with socket level programming and with designing and programming client server systems based on TCP/IP and http protocols to run across a range of computing platforms. Demonstrate knowledge and understanding of current client/server system. technologies for application across intranet/internet. Develop and evaluate client server solutions. Algorithms and issues in server software design. Design example server systems. 1. The Client Server Model and Software Design, Concurrent Processing in Client-Server software : Introduction, Motivation, Terminology and Concepts, Concurrency in Networks, Concurrency in Servers, Terminology and Concepts, An example of Concurrent Process Creation, Executing New Code, Context Switching and Protocol Software Design. Self study component:- Concurrency and Asynchronous I/O. 2. Program Interface to Protocols, The Socket Interface : Introduction, Loosely Specified Protocol Software Interface, Interface Functionality, Conceptual Interface Specification, System Calls, Two Basic Approaches to Network Communication, The Basic I/O Functions available in UNIX, Using UNIX I/O with TCP/IP. Introduction, Berkley Sockets, Specifying a Protocol Interface, The Socket Abstraction, Specifying an End Point Address, A Generic Address Structure, Major System Calls used with Sockets, Utility Routines for Integer Conversion, Using Socket Calls in a Program. Self study component:- Symbolic Constants for Socket Call Parameters. 49 Department of CS&E NIE, Mysore-08 3. Algorithms and Issues in Client Software Design: Introduction, Learning Algorithms instead of Details, Client Architecture, Identifying the Location of a Server, Parsing an Address Argument, Looking up a Domain Name, Looking up a well-known Port by Name, Port Numbers and Network Byte Order, Looking up a Protocol by Name, The TCP Client Algorithm, Allocating a Socket, Choosing a Local Protocol Port Number, A fundamental Problem in choosing a Local IP Address, Connecting a TCP Socket to a Server, Communicating with the Server using TCP, Reading a response from a TCP Connection, Closing a TCP Connection, Programming a UDP Client, Connected and Unconnected UDP Socket, Using Connect with UDP, Communicating with a Server using UDP, Closing a Socket that uses UDP. Self study component:- Partial Close for UDP, A Warning about UDP Unreliability. 4. Example Client Software: Introduction, The Importance of Small Examples, Hiding Details, An Example Procedure Library for Client Programs, Implementation of Connect TCP, Implementation of Connect UDP, A Procedure that Forms Connections, Using the Example Library, The DAYTIME Service, Implementation of a TCP Client for DAYTIME, Reading from a TCP Connection, The Time Service, Accessing the TIME Service, Accurate Times and Network Delays, A UDP Client for the TIME Service, The ECHO Service, A TCP Client for the ECHO Service, Self study component:- A UDP Client for the ECHO Service. 5. Algorithms and Issues in Server Software Design: Introduction, The Conceptual Server Algorithm, Concurrent Vs Iterative Servers, Connection-Oriented Vs Connectionless Access, Connection-Oriented Servers, Connectionless Servers, Failure, Reliability and Statelessness, Optimizing Stateless Servers, Four Basic Types of Servers, Request Processing Time, Iterative Server Algorithms, An Iterative Connection-Oriented Server Algorithm, Binding to a Well Known Address using INADDR_ANY, Placing the Socket in Passive Mode, Accepting Connections and using them. An Iterative Connectionless Server Algorithm, Forming a Reply Address in a Connectionless Server, Concurrent Server Algorithms, Master and Slave Processes, A Concurrent Connectionless Server Algorithm, A concurrent Connection-Oriented Server Algorithm, Using separate Programs as Slaves, Apparent Concurrency using a Single Process, When to use each Server Types, Self study component:- The Important Problem of Server Deadlock, Alternative Implementations. 6. Iterative, Connectionless Servers (UDP), Iterative, Connection-Oriented Servers (TCP): Introduction, Creating a Passive Socket, Process Structure, An example TIME Server. TCP Introduction, Allocating a Passive TCP Socket, A Server for the DAYTIME Service, Process Structure, An Example DAYTIME Server, Closing Connections. Self study component:- Connection Termination and Server Vulnerability. 50 Department of CS&E NIE, Mysore-08 Text book: 1. Douglas E.Comer, David L. Stevens: Internetworking with TCP/IP – Vol. 3, Client-Server Programming and Applications, BSD Socket Version with ANSI C, 2nd Edition, Pearson, 2001. Network Management (4:0:2) Sub Code : MIT0522 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcomes: 1. Describe the importance of Network topology, discuss the common network problems 2. Discuss the Network management standards, terminology , symbols and conventions, data types etc., 3. Discuss the SNMP V1 network management and communication model 4. Analyze the RMON, SMI, MIB, distinguish relationship between control and data tables 5. Explain the broadband network management ATM Networks, discriminate M1, M2 and M2 interface 6. Explain the broadband access networks and technologies 1. Introduction Analogy of Telephone Network Management, Data and Telecommunication Network Distributed computing Environments, TCP/IP-Based Networks: The Internet and Intranets, Case Histories of Networking and Management – The Importance of topology , Filtering Does Not Reduce Load on Node, Some Common Network Problems; Challenges of Information Technology Managers, Network Management: Goals, Organization, and Functions- Goal of Network Management, Network Provisioning, Network Operations and the NOC, Network Installation and Maintenance; Network and System Management, Network Management System platform, Current Status and Future of Network Management. Self study component:- Communications Protocols and Standards- Communication Architectures, Protocol Layers and Services; 2. Basic Foundations: Standards, Models, and Language Network Management Standards, Network Management Model, 51 Department of CS&E NIE, Mysore-08 Organization Model, Information Model – Management Information Trees, Managed Object Perspectives, Communication Model; ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Self study component:- Macros, Functional Model. 3. SNMPv1 Network Management Managed Network:, Internet Organizations and standards, Internet Documents, The SNMP Model, The Organization Model, System Overview. The Information Model – Introduction, The Structure of Management Information, Managed Objects, Management Information Base. The SNMP Communication Model – The SNMP Architecture, Administrative Model, SNMP Specifications, SNMP Operations, SNMP MIB Group, Functional Model. Self study component:- The History of SNMP Management 4. SNMP Management – RMON Remote Monitoring, RMON SMI and MIB, RMONI1- RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship Between Control and Data Tables, RMON1 Common and Ethernet Groups, RMON Token Ring Extension Groups, RMON2 – The RMON2 Management Information Base, RMON2 Conformance Specifications; ATM Remote Monitoring. Self study component:- A Case Study of Internet Traffic Using RMON. 5. Broadband Network Management: ATM Networks Broadband Networks and Services, ATM Technology – Virtual Path-Virtual Circuit, TM Packet Size, Integrated Service, SONET, ATM LAN Emulation, Virtual LAN; ATM Network Management – The ATM Network Reference Model, The Integrated Local Management Interface, The ATM Management Information Base, The Role of SNMP and ILMI in ATM Management, M1 Interface: Management of ATM Network Element, M2 Interface: Management of Private Networks, M3 Interface: Customer Network Management of Public Networks, M4 Interface: Public Network Management, Management of LAN Emulation, Self study component:- ATM Digital Exchange Interface Management. 6. Broadband Network Management Broadband Access Networks and Technologies – Broadband Access Networks, roadband Access Technology; HFCT Technology – The Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC Plant, The RF Spectrum for Cable Modem; Data Over Cable Reference Architecture; HFC Management – Cable Modem and CMTS Management, HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber Line 52 Department of CS&E NIE, Mysore-08 Technology , ADSL Channeling Schemes, ADSL Encoding Schemes; ADSL Management – ADSL Network Management Elements, ADSL Configuration Management, ADSL Fault Management, ADSL Performance Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2, ADSL Configuration Profiles. Self study component:- Role of the ADSL Access Network in an Overall Network, ADSL Architecture Text Books: 1. Mani Subramanian: Network Management- Principles and Practice, Pearson Education Publication, 2003. Reference Books: 1. J. Richard Burke: Network management Concepts and Practices: a Hands- On Approach, PHI, 2008. Supply Chain Management (4:0:2) Sub Code : MIT0523 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course outcome On successful completion of the course, students will be able to: 1. Develop a general understanding of supply chain strategies. 2. Identify performance of supply chain drivers and distribution network design. 3. Understand the role of network design and types of uncertainties in the Supply Chains. 4. Identify the functions and costs associated with inventory. 53 Department of CS&E NIE, Mysore-08 5. Manage and coordinate the revenue in Supply chains. 6. Find the scope of IT in Supply Chain. 1. Introduction to Supply Chain, Performance of Supply Chain What is a Supply Chain; Decision phases in a supply Chain; Process view of a Supply Chain; The importance of Supply Chain Flows; Examples of Supply Chains. Achieving strategic fit; Expanding strategic scope. Self study component:- Competitive and Supply Chain strategies 2. Supply Cain drivers and Obstacles, Designing Distribution Network Drivers of Supply Chain Performance; A framework for structuring drivers; Facilities, Inventory, Transportation, and Information; Obstacles to achieve strategic fit. The role of distribution in the Supply Chain; factors influencing distribution network design; Design options for a distribution network; the value of distributors in the Supply Chain. Self study component:- Distribution Networks in practice, 3. Network Design, Demand Forecasting, Aggregate Planning The role of network design in the Supply Chain; Factors influencing Network design Decisions; A framework for Network Design Decisions; Models for facility Location and Capacity Allocation; making Network Design decisions in practice. The impact of uncertainty on Network design; Discounted cash flow analysis; Representations of uncertainty; Evaluating Network Design decisions using Decision Trees; Making Supply Chain decisions under uncertainty in practice. The role of forecasting in a Supply Chain Characteristics of forecast; Basic approach of Demand forecasting; Time series forecasting methods; Measures of forecast errors; The role of aggregate planning in a supply Chain; The aggregate planning problem; Aggregate planning strategies. Self study component:- Components of a forecast and forecasting methods 4. Inventory Management, Transportation The role of cycle inventory in a supply Chain; Economies of scale to exploit fixed costs, quantity discounts; Short-term discounting; Managing multi-echelon cycle inventory; Estimating cycle inventory related costs in practice. The role of transportation in the Supply Chain; Modes of transportation and their performance characteristics; Design options for a transportation network; Trade-offs in transportation design; Tailored transportation; Routing and scheduling in transportation; Making transportation decisions in practice. Self study component:- Factors affecting transportation decisions; 54 Department of CS&E NIE, Mysore-08 5. Pricing and Revenue Management, Coordination The role of revenue management in Supply Chain; revenue management for multiple customer segments, perishable assets, seasonal demand, and bulk and spot contracts; Using revenue management in practice. Lack of Supply Chain coordination and Bullwhip effect; Effect of lack of coordination on performance; Obstacles to coordination in the Supply Chain; managerial levers to achieve coordination; Achieving coordination in practice. Self study component:- Building strategic partnerships and trust within a supply Chain 6. IT, Internet and Supply Chain The role of IT in the Supply Chain; The Supply Chain IT framework; CRM; Internal SCM; Supplier Relationship Management; The transaction management foundation; The future if IT in SCM; Supply Chain It in practice. The role of E-Business in Supply Chain; The E-Business framework; The B2B addition to the E-Business framework. Self study component:- E-Business in practice Text Books : 1. Sunil Chopra, Pter Meindl: Supply Chain Management Strategy, Planning, and Operation, 2nd Edition, Prentice-Hall of India, 2004. (Chapters 1, 2, 4, 4, 5, 6, 7, 8.1 to 8.3, 10, 14, 15, 16, 17, 18) Reference Books: 1. David Simchi-Levi, Philp Kaminky, Edith Simchi-Levi: Designing and Managing The Supply Chain Concepts, Strategies & Case Studies, 3rd Edition, tata McGraw Hill, 2003. 2. R.P. Mohanty, S.G. Deshmukh: Supply Chain Management Theories & Practices, Bizmantra, 2005. 6. Rahul V. Altekar: Supply Chain Management Concepts and Cases, PHI, 2005. 7. M Martin Christopher: Logistics and Supply Chain Management, 2nd Edition, Pearson Education, 1998. 55 Department of CS&E NIE, Mysore-08 System Modeling and Simulation (4:0:2) Sub Code : MIT0524 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcome On successful completion of the course, the student will be able to 1. Identify situations where one should use simulation and where not to. 2. Analyze various probability distribution functions. 3. Generate and test random number sequences. 4. Select suitable data collection methods and build and run simulation methods. 5. Understand Input Modeling, Output Analysis for a Single Model 5. Verify, validate and calibrate simulation models. 1. Introduction When simulation is the appropriate tool and when it is not appropriate; Advantages and disadvantages of Simulation; Areas of application;Systems and system environment; Components of a system; Discrete andcontinuous systems; Model of a system; Types of Models; Discrete-EventSystem Simulation; Steps in a Simulation Study.Simulation examples: Simulation of queuing systems; Other examples of simulation. Self study component:- Simulation of inventory systems 2. General Principles, Simulation Software Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance Algorithm, World Views, Manual simulation Using EventScheduling; List processing.Simulation in Java; Self study component:- Simulation in GPSS. 3. Statistical Models in Simulation, Queuing Models Review of terminology and concepts; Useful statistical models; Discretedistributions; Continuous distributions; Poisson process; Empiricaldistributions. Characteristics of queuing systems; Queuing notation; Long-run measuresof performanceof queuing systems; Steady-state behavior of M/G/1queue; 56 Department of CS&E NIE, Mysore-08 Self study component:- Networks of queues. 4. Random-Number Generation, Random-Variate Generation Properties of random numbers; Generation of pseudo-random numbers;Techniques for generating random numbers; Tests for Random Numbers.Random-Variate Generation:Inverse transform technique; Special properties. Self study component:- Acceptance-Rejection technique 5. Input Modeling, Output Analysis for a Single Model Data Collection; Identifying the distribution with data; Parametere stimation; Goodness of Fit Tests; Fitting a non-stationary Poisson process; Selecting input models without data; Multivariate and TimeSeries input models. Types of simulations with respect to output analysis; Stochastic nature of output data; Measures of performance and their estimation; Output analysis for terminating simulations;. Self study component:- Output analysis for steady-state simulations 6. Variance Reduction, Verification and Validation, Optimization Variance reduction techniques; Model building, verification andvalidation; Verification of simulation models; Calibration and validationof models. Self study component:- Optimization via Simulation Text Books: 1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System Simulation, 4th Edition, Pearson Education, 2007. Reference Books: 1. Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course, Pearson / Prentice-Hall, 2006. 2. Averill M. Law: Simulation Modeling and Analysis,4th Edition, Tata McGraw-Hill, 2007. 57 Department of CS&E NIE, Mysore-08 Information Retrieval (4:0:2) Sub Code :MIT0525 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcome After successful completion of the course, the students will be 1. 2. 3. 4. 5. 6. The genesis and variety of information retrieval situations; The variety of information retrieval models and techniques; Design principles for information retrieval systems; Methods for implementing information retrieval systems; Characteristics of operational and experimental information retrieval systems; Methods and principles for the evaluation of information retrieval systems. 1. Introduction, Retrieval Strategies - 1 Introduction; Retrieval Strategies: Vector Space Model; Self study component:- Probabilistic Retrieval strategies 2. Retrieval Strategies – 2 Some More Retrieval Strategies: Language Models; Inference Networks; Extended Retrieval; Latent Semantic Indexing; Neural Networks; Genetic Algorithms; Boolean Self study component:- Fuzzy Set Retrieval. 3. Retrieval Utilities, Indexing and Searching Relevance feedback; Clustering; Passage-Based Retrieval; N-Grams; Regression Analysis; Thesauri; Semantic Networks; Parsing.Searching Introduction; Inverted Files; Other indices for text; Boolean queries; Sequential searching; Structural queries; Compression. Self study component:- Pattern matching 4. Cross-Language Information Retrieval and Efficiency, Integrating Structured Data and Text Introduction; Crossing the language barrier; Cross-Language retrieval strategies; Cross language utilities. Duplicate Document Detection.Review of the relational model; A historical progression; Information retrieval as a relational application; Semi-structured search using a relational schema. Self study component:- Multi-dimensional data model 58 Department of CS&E NIE, Mysore-08 5. Parallel Information Retrieval, Distributed Information Retrieval Parallel text scanning; Parallel indexing; Clustering and classification; Large parallel systems; A theoretic model of distributed information retrieval; Web search; Result fusion; Other architectures. Self study component:- Peer-to-Peer information systems 6. Multimedia IR Introduction; data modeling; Query languages; Spatial access methods; A general multimedia indexing approach; One-dimensional time series; Two-dimensional color images; Self study component:- Automatic picture extraction. Text Books: 1. David A. Grossman, Ophir Frieder: Information Retrieval Algorithms and Heuristics, 2nd Edition, Springer, 2004. (Chapters 1, 2, 3, 4, 5, 6, 7, 8) 2. Ricardo Baeza-Yates, Berthier Ribeiro-Neto: Modern Information Retrieval, Pearson Education, 1999 (Chapters 8, 11, 12) Reference Books : 1. William B. Frakes, Ricardo Baeza-Yates (Editors):Information Retrieval Data Structures & Algorithms, Prentice Hall PTR, 1992. ADVANCED DIGITAL COMMUNICATION(4:0:2) Sub Code : MIT0526 CIE : 50% Hrs/Week : 06 SEE : 50% SEE Hours : 3 Hrs Max Marks : 100 Course Outcomes 1. Describe fundamentals of digital transmission 2. Compare different techniques for error Detection and Correction 3. Identify and describe elements of DCS 59 Department of CS&E NIE, Mysore-08 4. Analyze and Compare different waveform coding techniques 5. Describe Nyquest Criterion and correlative coding 6. Analyzing zero forcing and LMA algorithm 1. Digital Transmission Fundamentals: Digital Representation of Information: Block-Oriented Information, Stream Information; Why Digital Communications? Comparison of Analog and Digital Transmission , Basic properties of Digital Transmission Systems; Digital Representation of Analog Signals: Bandwidth of Analog Signals, Sampling of an Analog Signal, Digital Transmission of Analog Signals; Characterization of Communication Channels: Frequency Domain Characterization, Time Domain Characterization; Fundamental Limits in Digital Transmission: The Nyquist Signaling Rate, The Shannon Channel Capacity; Line Coding ; Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations, Telephone Modem Standards; Self study component:- Modems and Digital Modulation: Binary Phase Modulation, QAM and Signal Constellations, 2. Properties of Media and Digital Transmission Systems: Twisted Pair, Coaxial Cable, Optical Fiber, Radio Transmission, Infrared Light; Error Detection and Correction: Error Detection, Two Dimensional Parity Checks, Internet Checksum, Polynomial Codes, Standardized Polynomial Codes, Error Detecting Capability of a Polynomial Code. Self study component:- Error Detecting Capability of a Polynomial Code 3. Brief Review of digital communication systems: Elements of Digital communication systems; Communication channels and their characteristics; Self study component:- Historical perspective in the development of digital communication 4. Wave form Coding Techniques: PCM, Channel. Noise and error probability, DPCM, DM,. Self study component:- coding speech at low bit rates, Applications 5. Base band Shaping for data transmission: Discrete PAM signals, Inter-symbol interference (ISI) Nyquist criterion for distortion-less Base band binary transmission. Self study component:- correlative coding. 6. Eye-pattern, transmission, correlative coding, Eye-patterns Based and M-ary PAM system, Adoptive Equalization, SLC: The zero forcing algorithm, The LMA algorithm 60 Department of CS&E NIE, Mysore-08 TEXT BOOKS: 1. Alberto Leon – Garcia and Indra Widjaja: Communication Networks - Fundamental Concepts and Key architectures, 2nd Edition, Tata McGrawHill, 2006. 2. Simon Haykin: Digital Communication, Wiley India, 2007. REFERENCE BOOKS: 1. John G Proakis: Digital Communications, 3rd Edition, McGraw Hill, 2008. 61
