(PDF) VTU Mtech SE Syllabus 2015 - PDFSLIDE.NET (2023)

  • 1



    I Semester Total Credits: 23

    Subject Code Name of the Subject

    Teaching hours/week Duratio

    n of Exam

    in Hours

    Marks for

    Total Marks



    Practical / Fieldwork / Assignment/

    Tutorials I.A. Exam

    14SSE11 Software Testing 4 2 * 03 50 100 150


    14SSE12 Advanced Algorithms 4 2 * 03 50 100 150 4

    14SSE13 Advances in Data Base Management Systems 4 -- 03 50 100150


    14SSE14 Computer Systems Performance Analysis 4 2 03 50 100150


    14SSE15x Elective I 4 2 03 50 100 150 4

    14SSE16 Advances in Data Base Management Systems

    Laboratory 0 3

    03 25 50 75


    14SSE17 Seminar 0 3

    -- 25 -- 25 1

    Total 20 13 18 300 550 850 23 Elective I

    14SSE151 Advances in Computer Networks 14SSE152 DistributedOperating Systems 14SSE153 Web Services 14SSE154 Advances inStorage Area Networks

  • 2



    II Semester Total Credits: 23

    Subject Code Name of the Subject

    Teaching hours/week

    Duration of Exam in


    Marks for

    Total Marks



    Practical / Fieldwork / Assignment/ Tutorials

    I.A. Exam

    14SSE21 Software Project Planning & Management 4 2 * 03 50100 150


    14SSE22 Enterprise Application Programming 4 2 * 03 50 100150


    14SSE23 Design Patterns 4 -- 03 50 100 150 4

    14SSE24 Software Metrics & Quality Assurance 4 2 03 50 100150


    14SSE25x Elective II 4 2 03 50 100 150 4

    14SSE26 Design Patterns Laboratory 0 3 03 25 50 75

    2 14SSE27 Seminar 0 3 -- 25 -- 25 1

    ** Project Phase I (6 Week Duration) -- -- -- -- -- --


    Total 20 13 18 300 550 850 23

    ELECTIVE- II: 14SSE251 Information and Network Security 14SSE252Data Mining & Data Warehousing 14SSE253 Information Retrieval14SSE254 Information Storage Management

    ** Between the II Semester and III Semester after availing avacation of 2 weeks.

  • 3



    III Semester: INTERNSHIP Total Credits: 20

    *The student shall make a midterm presentation of the activitiesundertaken during the first 8 weeks of internship to a panelcomprising Internship Guide, a senior faculty from the departmentand Head of the Department.

    # The College shall facilitate and monitor the studentinternship program.

    The internship report of each student shall be submitted to theUniversity.

    **Between the III Semester and IV Semester after availing avacation of 2 weeks.

    Subject Code Name of the Subject

    No. of Hrs./Week Duration of the Exam in Hours

    Marks for Total Mark



    Lecture Practical / Field Work I.A. Exam


    Seminar / Presentation on Internship (After 8 weeks from thedate of

    commencement) * -- -- - 25 0 25


    14SSE32 Report on Internship

    ** -- -- - 0 75 75


    14SSE33 Evaluation and Viva-

    voce -- -- 3 0 50 50


    Total -- -- 03 25 125 150 20

  • 4



    IV Semester Total Credits: 28

    Subject Code Name of the Subject

    Teaching hours/week

    Duration of Exam in Hours

    Marks for

    Total Marks



    Fieldwork /

    Assignment /


    I.A. Exam

    14SSE41 Distributed Computing 4 2 * 03 50 100 150 4

    14SSE42x Elective-III 4 2 03 50 100 150 4

    14SSE43 Evaluation of Project Phase-II -- -- 0 25 -- 25 1

    14SSE44 Evaluation of Project Phase-III -- -- 0 25 -- 25 1

    14SSE45 Evaluation of Project Work and Viva-voce -- 03 03 -- 100+ 100 200


    Total 08 07 09 150 400 550


    Grand Total (I to IV Sem.) Total Marks: 2400 ; Total Credits:94

    Elective III

    14SSE421 Agile Technologies 14SSE422 Soft Computing 14SSE423Service Oriented Architecture 14SSE424 Supply Chain Management

    L- Lecture , T- Tutorial, P- Practical

    Note: *Lab Classes for these Core Subjects are Compulsory(Practical will be Evaluated for 20 marks and Internal assessmentfor 30 marks).Lab journals Should be Maintained.

    # Seminar : Topics should be chosen fromIEEE/ACM/Elsevier/Springer/any Refereed - Journals /Transactions.Encourage students to convert these seminar topics into a goodsurvey paper or Technical paper.

  • 5

    1).Project Phase I : 6 weeks duration shall be carried outbetween II and III Semester. Candidates in consultation with guideshall carryout literature survey / visit to Industries to finalizethe topic of dissertation.

    2) Internship:- 24 weeks Duration in 3rd Semester, Evaluation ofMarks - Presentation : 25 marks, Report writing and Submission :75marks and At the end of Internship Viva-Voce Exams shall beconducted for 50 marks.

    3).Project Work : 20 weeks duration in IV Semester carries totalmarks of 250.

    4)Project Phase II: 4 days for project work in a week during IVSemester. Evaluation shall be taken during the 8th week of the IVSemester. Total Marks shall be 25.

    5).Project Phase III : Evaluation shall be taken up at the endof the IV Semester for 25 marks. After the Project report issubmitted, Project Work Evaluation and Viva-Voce Examination shallbe conducted. Total Marks Shall be 50+50+100=200 ( 50 Marks forInternal Guide, 50 Marks for External and 100 for Viva-Voce )

    Marks of Evaluation of Project:

    I) The I.A. Marks of Project Phase II & III shall be sent tothe University along with Project Work report at the end of theSemester.

    II) The Project Valuation and Viva-Voce will be conducted by acommittee consisting of the following:

    a) Head of the Department (Chairman) b) Guide c) Two Examinersappointed by the university.(out of two external examiners at leastone should be present).

  • 6

    Semester I Year: 2014-2015

    COURSE OBJECTIVES To explore the basics and goals of softwaretesting. To discuss various types of software testing and itstechniques To list out various tools which can be used forautomating the testing process To introduce various softwarequality standards for establishing quality environment To discussvarious methods and evaluation procedures for improving the qualityModels



    Basics of Software Testing and Examples: Basic definitions, Testcases, Insights from a Venn diagram, Identifying test cases, Errorand fault taxonomies, Levels of testing. Examples: Generalizedpseudocode, The triangle problem, The NextDate function, Thecommission problem, The SATM (Simple Automatic Teller Machine)problem. 10 hours MODULE-II

    Decision Table-Based Testing: Decision tables, Test cases forthe triangle problem, Test cases for the NextDate function, Testcases for the commission problem, Guidelines and observations. DataFlow Testing: Definition-Use testing, Slice-based testing,Guidelines and observations. Levels of Testing: Traditional view oftesting levels, Alternative life-cycle models, The SATM system,Separating integration and system testing. Integration Testing: Acloser look at the SATM system, Decomposition-based, callgraph-based, Path-based integrations, Case study. 10 hours


    System Testing: Threads, Basic concepts for requirementsspecification, Finding threads, Structural strategies andfunctional strategies for thread testing, SATM test threads, Systemtesting guidelines, ASF (Atomic System Functions) testing example.Interaction Testing: Context of interaction, A taxonomy ofinteractions, Interaction, composition, and determinism,Client/Server Testing,. Issues in Object-Oriented Testing: Unitsfor object-oriented testing, Implications of composition andencapsulation, inheritance, and polymorphism, Levels ofobject-oriented testing, GUI testing, Dataflow testing forobject-oriented software, Examples. Class Testing: Methods asunits, Classes as units. 10 hours


    Object-Oriented Integration Testing: UML support for integrationtesting, MM-paths for object-oriented software, A framework forobject-oriented dataflow integration testing.GUI Testing: Thecurrency conversion program, Unit testing, Integration Testing andSystem testing for the currency conversion program. Object-OrientedSystem Testing: Currency converter UML description, UML-basedsystem testing, Statechart-based system testing. 10 hours

    Course Title: Software Testing Course Code: 14SSE11Credits(L:T:P): 3:0:1 Core/Elective: Core Type of Course: Lecture& Practical Total Contact Hours:50

  • 7


    Exploratory Testing: The context-driven school, Exploringexploratory testing, Exploring a familiar example, Exploratory andcontext-driven testing observations. Model-Based Testing: Testingbased on models, Appropriate models, Use case-based testing,Commercial tool support for model-based testing. Test-DrivenDevelopment: Test-then-code cycles, Automated test execution, Javaand JUnit example, Remaining questions, Pros, cons, and openquestions of TDD, Retrospective on MDD versus TDD.

    10 hours


    1. Design, develop, code and run the program in any suitablelanguage to solve the commission problem. Analyze it from theperspective of dataflow testing, derive at least 10 different testcases, execute these test cases and discuss the test results.

    2. Design, develop, code and run the program in any suitablelanguage to solve the NextDate problem. Analyze it from theperspective of decision table-based testing, derive at least 10different test cases, execute these test cases and discuss the testresults.

    3. Design, develop, code and run the program in any suitableobject-oriented language to solve the calendar problem. Analyze itfrom the perspective of OO testing, derive test cases to test themethod that increment the date and the method that increments themonth., execute these test cases and discuss the test results.

    4. Design, develop, code and run the program in any suitableobject-oriented language to solve the currency converter problem.Analyze it from the perspective of use case-based system testing,derive appropriate system test cases., execute these test cases anddiscuss the test results.

    COURSE OUTCOMES: Upon Completion of the course, students shallbe able to

    Compare and pick out the right type of software testing processfor any given real world problem Carry out the software testingprocess in efficient way Automate the testing process by usingseveral testing tools Establish a quality environment as specifiedin standards for developing quality software Analyze and improvethe quality procedures based on the past experience


    1. Paul C. Jorgensen: Software Testing, A Craftsmans Approach,3rd Edition, Auerbach Publications, 2013.


    1. Aditya P Mathur: Foundations of Software Testing, Pearson,2008.

    2. Mauro Pezze, Michal Young: Software Testing and AnalysisProcess, Principles and Techniques, John Wiley & Sons,2008.

  • 8

    Semester I Year: 2014-2015

    COURSE OBJECTIVES To learn the graph search algorithms. To studynetwork flow and linear programming problems. To learn the hillclimbing and dynamic programming design techniques. To developrecursive backtracking algorithms. To get an awareness of NPcompleteness and randomized algorithms.



    Review of Analysis Techniques: Growth of Functions: Asymptoticnotations; Standard notations and common functions; Recurrences andSolution of Recurrence equations- The substitution method, Therecurrence tree method, The master method; Amortized Analysis:Aggregate, Accounting and Potential Methods. 10 hours


    Graph Algorithms: Bellman - Ford Algorithm; Single sourceshortest paths in a DAG; Johnsons Algorithm for sparse graphs; Flownetworks and Ford-Fulkerson method; maximum bipartite matching.Polynomials and the FFT: Representation of polynomials; The DFT andFFT; Efficient implementation of FFT. 10 hours


    Number -Theoretic Algorithms: Elementary notions; GCD; ModularArithmetic; Solving modular linear equations; The Chinese remaindertheorem; Powers of an element; RSA cryptosystem; Primality testing;Integer factorization. 10 hours


    String-Matching Algorithms: Nave string Matching; Rabin - Karpalgorithm; String matching with finite automata; Knuth-Morris-Prattalgorithm; Boyer Moore algorithms. 10 hours


    Probabilistic and Randomized Algorithms: Probabilisticalgorithms; Randomizing deterministic algorithms, Monte Carlo andLas Vegas algorithms; Probabilistic numeric algorithms. 10hours

    Course Title: Advanced Algorithms Course Code: 14SSE12Credits(L:T:P): 3:0:1 Core/Elective: Core Type of Course: Lecture& Practical Total Contact Hours:50

  • 9

    LABORATORY WORK 1. Design, develop, and run a program in anylanguage to implement the Bellman-Ford algorithm and determine itsperformance. 2. Design, develop, and run a program in any languageto implement Johnsons algorithm and determine its performance. 3.Design, develop, and run a program in any language to implement aMonte Carlo algorithm to test the primality of a given integer anddetermine its performance. 4. Design, develop, and run a program inany language to solve the string matching problem using naveapproach and the KMP algorithm and compare their performances. 5.Design, develop, and run a program in any language to solve modularlinear equations. 6. Design, develop, and run a program in anylanguage to implement the FFT algorithm efficiently.

    COURSE OUTCOMES: Upon completion of the course, students shallbe able to

    Design and apply iterative and recursive algorithms. Design andimplement optimization algorithms in specific applications. Designappropriate shared objects and concurrent objects for applications.Implement and apply concurrent linked lists, stacks, andqueues.

    TEXT BOOKS: 1. T. H Cormen, C E Leiserson, R L Rivest and CStein: Introduction to Algorithms, 3rd Edition, Prentice-Hall ofIndia, 2010. 2. Kenneth A. Berman, Jerome L. Paul: Algorithms,Cengage Learning, 2002.

    REFERENCE BOOKS: 1. Ellis Horowitz, Sartaj Sahni,S.Rajasekharan: Fundamentals of Computer Algorithms, 2nd Edition,Universities press, 2007.

  • 10

    Semester I Year: 2014-2015

    COURSE OBJECTIVES: To acquire knowledge on parallel anddistributed databases and its applications. To study the usage andapplications of Object Oriented database To understand the basicconcepts, principles of intelligent databases. To understand theadvanced topics of data warehousing and mining . To learn emergingand advanced data models To acquire inquisitive attitude towardsresearch topics in databases.


    MODULE I Review of Relational Data Model and Relational DatabaseConstraints: Relational model concepts; Relational modelconstraints and relational database schemas; Update operations,transactions and dealing with constraint violations. Overview ofObject-Oriented Concepts Objects, Encapsulation, Polymorphism, Typeand class hierarchies etc. 10 Hours

    Module II Object and Object-Relational Databases: ObjectOriented Concepts: Objects, complex objects; Object model of ODMG,Object definition Language ODL; Object Query Language OQL; Overviewof C++ language binding; Conceptual design of Object database.Overview of object relational features of SQL; Object-relationalfeatures of Oracle; Implementation and related issues for extendedtype systems; The nested relational model.

    10 Hours Module III Parallel and Distributed Databases:Architectures for parallel databases; Parallel query evaluation;Parallelizing individual operations; Parallel query optimizations;Introduction to distributed databases; Distributed DBMSarchitectures; Storing data in a Distributed DBMS; Distributedcatalog management; Distributed Query processing; Updatingdistributed data; Distributed transactions; Distributed Concurrencycontrol and Recovery.

    10 Hours Module IV Data Warehousing, Decision Support and DataMining: Introduction to decision support; OLAP, multidimensionalmodel; Window queries in SQL; Finding answers quickly;Implementation techniques for OLAP; Data Warehousing; Views andDecision support, View materialization, Maintaining materializedviews. Introduction to Data Mining; Counting co-occurrences; Miningfor rules; Tree-structured rules; Clustering; Similarity searchover sequences; Incremental mining and data streams; Additionaldata mining tasks. 10 Hours Module V Enhanced Data Models for SomeAdvanced Applications: Active database concepts and triggers;Temporal, Spatial, and Deductive Databases Basic concepts. MoreRecent Applications: Mobile databases; Multimedia databases;Geographical Information Systems; Genome data management. 10 HoursCOURSE OUTCOMES:

    Upon completion of the course, the students will be able to

    Course Title: Advances In Database Management Systems CourseCode: 14SSE13 Credits(L:T:P): 4:0:0 Core/Elective: Core Type ofCourse: Lecture Total Contact Hours:50

  • 11

    Select the appropriate high performance database like paralleland distributed database Model and represent the real world datausing object oriented database Embed the rule set in the databaseto implement data warehousing of mining Choose and design databasefor recent applications database for better interoperability


    1. Elmasri and Navathe: Fundamentals of Database Systems,Pearson Education, 2013.

    2. Raghu Ramakrishnan and Johannes Gehrke: Database ManagementSystems, 3rd Edition, McGraw-Hill, 2013.


    1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan: DatabaseSystem Concepts, 6th Edition, McGraw Hill, 2010.

  • 12

    Semester I Year: 2014-2015

    COURSE OBJECTIVES: To understand the mathematical foundationsneeded for performance evaluation of computer systems To understandthe metrics used for performance evaluation To understand theanalytical modeling of computer systems To enable the students todevelop new queueing analysis for both simple and complex systemsTo introduce the students to analytical techniques for evaluatingscheduling policies

    TOPICS: MODULE I Introduction: The art of PerformanceEvaluation; Common Mistakes in Performance Evaluation, A SystematicApproach to Performance Evaluation, Selecting an EvaluationTechnique, Selecting Performance Metrics, Commonly used PerformanceMetrics, Utility Classification of Performance Metrics, SettingPerformance Requirements. 10 Hours

    MODULE II Workloads, Workload Selection and Characterization:Types of Work loads, addition instructions, Instruction mixes,Kernels; Synthetic programs, Application benchmarks, Popularbenchmarks. Work load Selection: Services exercised, level ofdetail; Representativeness; Timeliness, Other considerations inworkload selection. Work load characterization Techniques:Terminology; Averaging, Specifying dispersion, Single ParameterHistograms, Multi Parameter Histograms, Principle ComponentAnalysis, Markov Models, Clustering. 10 Hours

    MODULE III Monitors, Program Execution Monitors and AccountingLogs: Monitors: Terminology and classification; Software andhardware monitors, Software versus hardware monitors, Firmware andhybrid monitors, Distributed System Monitors, Program ExecutionMonitors and Accounting Logs, Program Execution Monitors,Techniques for Improving Program Performance, Accounting Logs,Analysis and Interpretation of Accounting log data, Usingaccounting logs to answer commonly asked questions. 10 Hours

    MODULE IV Capacity Planning and Benchmarking: Steps in capacityplanning and management; Problems in Capacity Planning; CommonMistakes in Benchmarking; Benchmarking Games; Load Drivers; Remote-Terminal Emulation; Components of an RTE; Limitations of RTEs.Experimental Design and Analysis: Introduction: Terminology, Commonmistakes in experiments, Types of experimental designs, 2kFactorial Designs, Concepts, Computation of effects, Sign tablemethod for computing effects; Allocation of variance; General 2kFactorial Designs, General full factorial designs with k factors:Model, Analysis of a General Design, Informal Methods. 10 Hours

    MODULE V Queuing Models: Introduction: Queuing Notation; Rulesfor all Queues; Littles Law, Types of Stochastic Process. Analysisof Single Queue: Birth-Death Processes; M/M/1 Queue; M/M/m Queue;M/M/m/B Queue with finite buffers; Results for other M/M/1 QueuingSystems. Queuing Networks: Open and Closed Queuing Networks;Product form networks, queuing Network models of Computer Systems.Operational Laws: Utilization Law; Forced Flow Law; Littles Law;General Response Time Law; Interactive Response Time Law;Bottleneck Analysis; Mean Value Analysis and Related Techniques;Analysis of Open Queuing Networks; Mean Value Analysis; ApproximateMVA; Balanced Job Bounds; Convolution Algorithm, Distribution ofJobs in a System, Convolution Algorithm for Computing G(N),Computing Performance using G(N), Timesharing Systems, HierarchicalDecomposition of Large Queuing Networks: Load Dependent ServiceCenters, Hierarchical Decomposition, Limitations of Queuing Theory.10 Hours

    Course Title: Computer Systems Performance Analysis Course Code:14SSE14 Credits(L:T:P): 4:0:0 Core/Elective: Core Type of Course:Lecture Total Contact Hours:50

  • 13

    COURSE OUTCOMES: Upon completion of the course, students shallbe able to

    Identify the need for performance evaluation and the metricsused for it Implement Little law and other operational laws Applythe operational laws to open and closed systems Use discrete-timeand continuous-time Markov chains to model real world systemsDevelop analytical techniques for evaluating schedulingpolicies

    Text Book: 1. Raj Jain: The Art of Computer Systems PerformanceAnalysis, John Wiley and Sons, 2013.

    Reference Books: 1. Paul J Fortier, Howard E Michel: computerSystems Performance Evaluation and prediction, Elsevier, 2003. 2.Trivedi K S: Probability and Statistics with Reliability, Queuingand Computer Science Applications, 2nd Edition, Wiley India,2001.

  • 14

    Semester I Year: 2014-2015

    COURSE OBJECTIVES: Become familiar with the basics of ComputerNetworks Network architectures Concepts of fundamentalprotocols



    Foundation: Building a Network, Requirements, Perspectives,Scalable Connectivity, Cost-Effective Resource sharing, Support forCommon Services, Manageability, Protocol layering, Performance,Bandwidth and Latency, Delay X Bandwidth Product, Perspectives onConnecting, Classes of Links, Reliable Transmission, Stop-and-Wait, Sliding Window, Concurrent Logical Channels. T1: Chapter 1.1,1.2, 1.5.1, 1.5.2., 2.1, 2.5 T2: Chapter 4 10 hours


    Internetworking- I: Switching and Bridging, Datagrams, VirtualCircuit Switching, Source Routing, Bridges and LAN Switches, BasicInternetworking (IP), What is an Internetwork ?, Service Model,Global Addresses, Datagram Forwarding in IP, subnetting andclassless addressing, Address Translation(ARP), HostConfiguration(DHCP), Error Reporting(ICMP), Virtual Networks andTunnels. T1: Chapter 3.1, 3.2, 10 hours


    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), Mobilityand Mobile IP. T1: Chapter 3.3, 4.1.1,4.1.3 T2: Chapter 13.1 to13.18 , Chapter 18. 10 hours


    End-to-End Protocols: Simple Demultiplexer (UDP), Reliable ByteStream(TCP), End-to-End Issues, Segment Format, ConnectingEstablishment and Termination, Sliding Window Revisited, TriggeringTransmission, Adaptive Retransmission, Record Boundaries, TCPExtensions, Queuing Disciplines, FIFO, Fair Queuing, TCP CongestionControl, Additive Increase/ Multiplicative Decrease, Slow Start,Fast Retransmit and Fast Recovery. T1: Chapter 5.1, 5.2.1 to 5.2.8,6.2, 6.3 10 hours


    Congestion Control and Resource Allocation: Congestion-AvoidanceMechanisms, DEC bit, Random Early Detection (RED), Source-BasedCongestion Avoidance. The Domain Name System(DNS), ElectronicMail(SMTP,POP,IMAP,MIME),World Wide Web(HTTP),NetworkManagement(SNMP) . T1: Chapter 6.4 T2: Chapter 23.1 to 23.16,Chapter 24, Chapter 25, Chapter 27.1 to 27.8 10 hours

    Course Title: Advances in Computer Networks Course Code:14SSE151 Credits(L:T:P): 4:0:0 Core/Elective: Elective Type ofCourse: Lecture Total Contact Hours:50

  • 15


    Upon completion of the course, students shall be able to

    List and classify network services, protocols and architectures,explain why they are layered. Key Internet applications and theirprotocols, and will apply to develop their own applications (e.g.Client Server

    applications, Web Services) using the sockets API. Explainvarious congestion control techniques.

    Text books: 1. T1: Larry Peterson and Bruce S Davis ComputerNetworks :A System Approach 5th Edition , Elsevier -2014 2. T2:Douglas E Comer, Internetworking with TCP/IP, Principles, Protocolsand Architecture 6th Edition, PHI - 2014

    References: 1. Uyless Black Computer Networks, Protocols ,Standards and Interfaces 2nd Edition - PHI 2. Behrouz A ForouzanTCP/IP Protocol Suite 4th Edition Tata McGraw-Hill.

  • 16

    Semester I Year: 2014-2015

    COURSE OBJECTIVE: To explore distributed systems principlesassociated with communication, naming, synchronization, distributedfile

    systems, system design, distributed scheduling, and several casestudies To understand both foundational concepts and well aspractical deployments. To gain knowledge on Distributed operatingsystem concepts that includes architecture, Mutual exclusionalgorithms,

    Deadlock detection algorithms and agreement protocols To gaininsight on to the distributed resource management components viz.the algorithms for implementation of

    distributed shared memory, recovery and commit protocols



    Fundamentals: What is Distributed Computing Systems? Evolutionof Distributed Computing System; Distributed Computing SystemModels; What is Distributed Operating System? Issues in Designing aDistributed Operating System; Introduction to Distributed ComputingEnvironment (DCE). Message Passing: Introduction, Desirablefeatures of a Good Message Passing System, Issues in PC by MessagePassing, Synchronization, Buffering, Multidatagram Messages,Encoding and Decoding of Message Data, Process Addressing, FailureHandling, Group Communication, Case Study: 4.3 BSD UNIX IPCMechanism. 10 hours


    Remote Procedure Calls: Introduction, The RPC Model,Transparency of RPC, Implementing RPC Mechanism, Stub Generation,RPC Messages, Marshaling Arguments and Results, Server Management,Parameter-Passing Semantics, Call Semantics, CommunicationProtocols for RPCs, Complicated RPCs, Client-Server Binding,Exception Handling, Security, Some Special Types of RPCs, RPC inHeterogeneous Environments, Lightweight RPC, Optimization forBetter Performance, Case Studies: Sun RPC. 10 hours


    Distributed Shared Memory: Introduction, General Architecture ofDSM Systems, Design and Implementation Issues of DSM, Granularity,Structure of Shared Memory Space, Consistency Models, ReplacementStrategy, Thrashing, Other approaches to DSM, Heterogeneous DSM,Advantages of DSM. Synchronization: Introduction, ClockSynchronization, Event Ordering, Mutual Exclusion, Dead Lock,Election Algorithms. 10 hours


    Resource Management: Introduction, Desirable Features of a GoodGlobal Scheduling Algorithm, Task Assignment Approach, LoadBalancing Approach, Load Sharing Approach Process Management:Introduction, Process Migration, Threads. 10 hours


    Course Title: Distributed Operating Systems Course Code:14SSE152 Credits(L:T:P): 4:0:0 Core/Elective: Elective Type ofCourse: Lecture Total Contact Hours:50

  • 17

    Distributed File Systems: Introduction, Desirable Features of aGood Distributed File System, File models, FileAccessing Models,File Sharing Semantics, File Caching Schemes, File Replication,Fault Tolerance, Atomic Transactions, Design Principles. 10hours

    COURSE OUTCOMES: Upon completion of the course, students shallbe able to

    Underlying distributed systems concepts Demonstrate an abilityto apply theory and techniques to unseen problems. Demonstrate theMutual exclusion, Deadlock detection and agreement protocols ofDistributed operating system Explore the various resourcemanagement techniques for distributed systems

    TEXT BOOK: 1. Pradeep. K. Sinha: Distributed Operating Systems:Concepts and Design, PHI, 2007.

    REFERENCE BOOK: 1 Andrew S. Tanenbaum: Distributed OperatingSystems, Pearson Education, 2013.

  • 18

    Semester I Year: 2014-2015

    COURSE OBJECTIVES To provide an in-depth knowledge of WebServices. To understand the fundamental concepts of Web services.To understand the fundamental concepts of WSDL Web Services. Todesign Web service Architecture. To Study Building Blocks of Webservices.



    Middleware: Understanding the middle ware, RPC and RelatedMiddle ware , TP Monitors , Object Brokers, Message-OrientedMiddleware. 10 hours

    MODULE-II Web Services: Web Services Technologies, Web ServicesArchitecture. 10 hours

    MODULE-III Basic Web Services Technology: WSDL Web ServicesDescription Language, UDDI Universal Description Discovery andIntegration, Web Services at work interactions between theSpecifications, Related Standards. 10 hours

    MODULE-IV Service Coordination Protocols: Infrastructure forCoordination Protocols,WS-Coordination , WS-Transaction,RosettaNet, Other Standards Related to Coordination Protocols. 10hours

    MODULE-V Service Composition: Basic of Service Composition, ANew Chance of Success for Composition, Services Composition Models,Dependencies between Coordination and Composition, BPEL: BusinessProcess Execution Language for Web Services, OutLook, Applicabilityof the Web Services, Web services as a Problem and a Solution : ANExample. 10 hours

    COURSE OUTCOMES Upon completion of the course, students shall beable to

    Bind and unbind services in UDDI. Develop WSDL documentImplement web service client to call public service. Implement aservice and exposing it as public service.

    Text Book 1. Gustavo Alonso, Fabio Casati, Harumi Kuno, VijayMachiraju: Web Services(Concepts , Architectures and

    Applications ), Springer International Edition 2009..

    Course Title: Web Services Course Code: 14SSE153 Credits(L:T:P):4:0:0 Core/Elective: Elective Type of Course: Lecture Total ContactHours:50

  • 19

    Semester I Year: 2014-2015

    COURSE OBJECTIVES To understand the fundamentals of storagecentric and server centric systems To understand the metrics usedfor Designing storage area networks To understand the RAID conceptsTo enable the students to understand how data centres maintain thedata with the concepts of backup

    mainly remote mirroring concepts for both simple and complexsystems



    Introduction: Server Centric IT Architecture and itsLimitations; Storage Centric IT Architecture and its advantages.Case study: Replacing a server with Storage Networks The DataStorage and Data Access problem; The Battle for size and access.Intelligent Disk Subsystems: Architecture of Intelligent DiskSubsystems; Hard disks and Internal I/O Channels; JBOD, Storagevirtualization using RAID and different RAID levels; Caching:Acceleration of Hard Disk Access; Intelligent disk subsystems,Availability of disk subsystems. 10 hours


    I/O Techniques: The Physical I/O path from the CPU to theStorage System; SCSI; Fibre Channel Protocol Stack; Fibre ChannelSAN; IP Storage. Network Attached Storage: The NAS Architecture,The NAS hardware Architecture, The NAS Software Architecture,Network connectivity, NAS as a storage system. File System and NAS:Local File Systems; Network file Systems and file servers; SharedDisk file systems; Comparison of Fibre Channel and NAS.

    10 hours MODULE-III

    Storage Virtualization: Definition of Storage virtualization;Implementation Considerations; Storage virtualization on Block orfile level; Storage virtualization on various levels of the storageNetwork; Symmetric and Asymmetric storage virtualization in theNetwork.

    10 hours MODULE-IV

    SAN Architecture and Hardware devices: Overview, Creating aNetwork for storage; SAN Hardware devices; The Fibre channelswitch; Host Bus Adaptors; Putting the storage in SAN; Fabricoperation from a Hardware perspective. Software Components of SAN:The switchs Operating system; Device Drivers; Supporting theswitchs components; Configuration options for SANs. 10 hours


    Management of Storage Network: System Management, Requirement ofmanagement System, Support by Management System, ManagementInterface, Standardized Mechanisms, Property Mechanisms, In-bandManagement, Use of SNMP, CIM and WBEM, Storage ManagementInitiative Specification (SMI-S), CMIP

    Course Title: Advances in Storage Area Networks Course Code:14SSE154 Credits(L:T:P): 4:0:0 Core/Elective: Elective Type ofCourse: Lecture Total Contact Hours:50

  • 20

    and DMI, Optional Aspects of the Management of Storage Networks,Summary. 10 hours

    COURSE OUTCOMES: The students are be able to

    Identify the need for performance evaluation and the metricsused for it Apply the techniques used for data maintenance. Realizestorage virtualization concept, Develop techniques for evaluatingpolicies for LUN masking, file systems

    Text Book: 1. Ulf Troppens, Rainer Erkens and Wolfgang Muller:Storage Networks Explained, Wiley India, 2013.

    Reference Books: 1. Robert Spalding: Storage Networks TheComplete Reference, Tata McGraw-Hill, 2011. 2. Marc Farley: StorageNetworking Fundamentals An Introduction to Storage Devices,Subsystems,

    Applications, Management, and File Systems, Cisco Press, 2005.3. Richard Barker and Paul Massiglia: Storage Area NetworkEssentials A Complete Guide to understanding and

    Implementing SANs, Wiley India, 2006.

  • 21

    Semester I Year: 2014-2015

    LABORATORY OBJECTIVES: To acquire practical knowledge onadvanced databases and its applications. To understand and work onareas like Storage, Retrieval, Multi valued attributes, Triggersand other complex objects,

    Algorithms etc related to ADBMS. To design and implement recentapplications database for better interoperability

    Note: The following experiments may be implemented onMySQL/ORACLE or any other suitable RDBMS with support for Objectfeatures

    1. Develop a database application to demonstrate storing andretrieving of BLOB and CLOB objects. a) Write a binary large object(BLOB) to a database as either binary or character (CLOB) data,depending on the type of the

    field in your data source. To write a BLOB value to thedatabase, issue the appropriate INSERT or UPDATE statement and passthe BLOB value as an input parameter. If your BLOB is stored astext, such as a SQL Server text field, pass the BLOB as a stringparameter. If the BLOB is stored in binary format, such as a SQLServer image field, pass an array of type byte as a binaryparameter.

    b) Once storing of BLOB and CLOB objects is done, retrieve themand display the results accordingly.

    2. Develop a database application to demonstrate therepresentation of multi valued attributes, and the use of nestedtables to represent complex objects. Write suitable queries todemonstrate their use. Consider Purchase Order Example: Thisexample is based on a typical business activity: managing customerorders. Need to demonstrate how the application might evolve fromrelational to object-relational, and how you could write it fromscratch using a pure object-oriented approach.

    a) Show how to implement the schema -- Implementing theApplication under the Relational Model -- using only Oracle'sbuilt-in data types. Build an object-oriented application on top ofthis relational schema using object views.

    3. Design and develop a suitable Student Database application byconsidering appropriate attributes. Couple of attributes to bemaintained is the Attendance of a student in each subject for whichhe/she has enrolled and Internal Assessment Using TRIGGERS, writeactive rules to do the following:

    a) Whenever the attendance is updated, check if the attendanceis less than 85%; if so, notify the Head of the Departmentconcerned.

    b) Whenever, the marks in an Internal Assessment Test areentered, check if the marks are less than 40%; if so, notify theHead of the Department concerned.

    Use the following guidelines when designing triggers:

    Use triggers to guarantee that when a specific operation isperformed, related actions are performed.

    Use database triggers only for centralized, global operationsthat should be fired for the triggering statement, regardless ofwhich user or database application issues the statement.

    Course Title: Advances In Database Management Systems LaboratoryCourse Code: 14SSE16 Credits(2) (L:T:P):0:0:3 Core/Elective: CoreType of Course: Practical Total Contact Hours:42

  • 22

    Do not define triggers that duplicate the functionality alreadybuilt into Oracle. For example, do not define triggers to enforcedata integrity rules that can be easily enforced using declarativeintegrity constraints.

    Limit the size of triggers (60 lines or fewer is a goodguideline). If the logic for your trigger requires much more than60 lines of PL/SQL code, it is better to include most of the codein a stored procedure, and call the procedure from the trigger.

    Be careful not to create recursive triggers. For example,creating an AFTER UPDATE statement trigger on the EMP table thatitself issues an UPDATE statement on EMP causes the trigger to firerecursively until it has run out of memory.

    4. Design, develop, and execute a program to implement specificApriori algorithm for mining association rules. Run the programagainst any large database available in the public domain anddiscuss the results.

    Association rules are if/then statements that help uncoverrelationships between seemingly unrelated data in a relationaldatabase or other information repository. An example of anassociation rule would be "If a customer buys a dozen eggs, he is80% likely to also purchase milk."

    LABORATORY OUTCOMES: Upon completion of the laboratory, studentsshall be able to

    Work on the concepts of ADBMS at the practical level Model andrepresent the real world data using object oriented database Embedthe rules set in the database to implement various features ofADBMS Choose, design and implement recent applications database forbetter interoperability.

  • 23

    Course Title: Software Project Planning And Management CourseCode: 14SSE21 Credits(L:T:P): 3:0:1 Core/Elective: Core Type ofCourse: Lecture & Practical Total Contact Hours:50

  • 24

    Semester II Year: 2014-2015

    COURSE OBJECTIVES To define and highlight importance of softwareproject management. To formulate strategy in managing projects Toestimate the cost associated with a project To plan, schedule andmonitor projects for the risk management To define the softwaremanagement metrics


    Metrics: Introduction, The Metrics Roadmap, A Typical MetricsStrategy, What Should you Measure?, Set Targets and track Them,Understanding and Trying to minimize variability, Act on data,People and Organizational issues in Metrics Programs, CommonPitfalls to watch out for in Metrics Programs, Matricesimplementation checklists and tools, Software configurationmanagement: Introduction, Some Basic Definitions and terminology,the processes and activities of software configuration management,configuration status accounting, configuration audit, softwareconfiguration management in geographically distributed teams,Metrics in software configuration management, softwareconfiguration management tools and automation. 10 hours


    Risk Management: Introduction, What is risk management and whyis it important?, Risk management cycle, Risk identification:common tools and techniques, Risk Quantifications, Risk Monitoring,Risk Mitigation, Risks and Mitigation in the context of globalproject teams, some practical techniques risk management, Metricsin risk management. Project Planning and Tracking: Components ofProject Planning and Tracking, The What Part of a Project Plan, TheWhat Cost Part of a Project Plan, The When Part of ProjectPlanning, The How Part of a Project Planning: Tailoring ofOrganizational Processes For the Project, The By Whom Part of theProject Management Plan : Assigning Resources, Putting it alltogether : The Software Management Plan, Activities Specific toProject Tracking, Interfaces to the Process Database. ProjectClosure: When Does Project Closure Happen?. Why Should WeExplicitly do a Closure?, An Effective Closure Process, Issues thatGet Discussed During Closure, Metrics for Project Closure,Interfaces to the Process Database. 10 hours


    Software Requirements gathering: Inputs and start criteria forrequirements gathering, Dimensions of requirements gathering, Stepsto be followed during requirements gathering, outputs and qualityrecords from the requirements phase, skill sets required duringrequirements phase, differences for a shrink-wrapped software,challenges during the requirements management phase, Metrics forrequirements phase. Estimation: What is Estimation? when and why isEstimation done?, the three phases of Estimation, Estimationmethodology, formal models for size Estimation, Translating sizeEstimate into effort Estimate, Translating effort Estimates intoschedule Estimate, common challenges during Estimation , Metricsfor the Estimation processes. Design and Development Phases: Somedifferences in our chosen approach, salient features of design,evolving an architecture/ blueprint, design for reusability,technology choices/ constraints, design to standards, design forportability, user interface issues, design for testability, designfor diagnose ability, design for maintainability, design forinstall ability, inter-operability design, challenges during designand

  • 25

    development phases, skill sets for design and development,metrics for design and development phases. 10 hours


    Project management in the testing phase: Introduction, What istesting?, what are the activities that makeup testing?, testscheduling and types of tests, people issues in testing, managementstructures for testing in global teams, metrics for testing phase.Project management in the Maintenance Phase: Introduction,Activities during Maintenance Phase, management issues duringMaintenance Phase, Configuration management during MaintenancePhase, skill sets for people in the maintenance phase, estimatingsize, effort, and people resources for the maintenance phase,advantages of using geographically distributed teams for themaintenance phase, metrics for the maintenance phase.

    10 hours MODULE-V

    Globalization issues in project management: Evolution ofglobalization, challenges in building global teams, Models for theexecution of global projects, some effective management techniquesfor managing global teams. Impact of the internet on projectmanagement: Introduction, the effect of internet on projectmanagement, managing projects for the internet, Effect on theproject management activities. People focused process models:Growing emphasis on people centric models, people capabilitymaturity model(P-CMM), other people focused models in theliterature, how does an organization choose the models to use? 10hours


    USE STAR UML TOOL or VISUAL PARADIGMN or any other equivalenttool to develop ATM and Restaurant systems

    UML diagrams to be developed are:

    1. Use Case Diagram. 2. Class Diagram. 3. Sequence Diagram. 4.Collaboration Diagram. 5. State Diagram 6. Activity Diagram. 7.Component Diagram 8. Deployment Diagram.


    The software to be designed will control a simulated automatedteller machine (ATM) having a magnetic stripe reader for reading anATM card, a customer console (keyboard and display) for interactionwith the customer, a slot for depositing envelopes, a dispenser forcash (in multiples of Rs. 100, Rs. 500 and Rs. 1000), a printer forprinting customer receipts, and a key-operated switch to allow anoperator to start or stop the ma-chine. The ATM will communicatewith the bank's computer over an appropriate communication link.(The software on the latter is not part of the requirements forthis problem.) The ATM will service one customer at a time. Acustomer will be required to insert an ATM card and enter apersonal identification number (PIN) - both of which will be sentto the bank for validation as part of each transaction. Thecustomer will then be able to perform one or more transactions. Thecard will be retained in the machine until the customer indicatesthat he/she desires no further transactions, at which point it willbe returned - except as noted below. The ATM must be able toprovide the following services to the customer:

  • 26

    1. A customer must be able to make a cash withdrawal from anysuitable account linked to the card, in multiples of Rs. 100 or Rs.500 or Rs. 1000. Approval must be obtained from the bank beforecash is dispensed. 2. A customer must be able to make a deposit toany account linked to the card, consisting of cash and/or checks inan envelope. The customer will enter the amount of the deposit intothe ATM, subject to manual verification when the envelope isremoved from the machine by an operator. Approval must be ob-tainedfrom the bank before physically accepting the envelope. 3. Acustomer must be able to make a transfer of money between any twoaccounts linked to the card. 4. A customer must be able to make abalance inquiry of any account linked to the card. 5. A customermust be able to abort a transaction in progress by pressing theCancel key instead of responding to a request from the machine.

    The ATM will communicate each transaction to the bank and obtainverification that it was allowed by the bank. Ordinarily, atransaction will be considered complete by the bank once it hasbeen approved. In the case of a deposit, a second message will besent to the bank indicating that the customer has deposited theenvelope. (If the custom-er fails to deposit the envelope withinthe timeout period, or presses cancel instead, no second messagewill be sent to the bank and the deposit will not be credited tothe cus-tomer.)

    If the bank determines that the customer's PIN is invalid, thecustomer will be required to re-enter the PIN before a transactioncan proceed. If the customer is unable to successfully enter thePIN after three tries, the card will be permanently retained by themachine, and the customer will have to contact the bank to get itback If a transaction fails for any reason other than an invalidPIN, the ATM will display an explanation of the problem, and willthen ask the customer whether he/she wants to do anothertransaction. The ATM will provide the customer with a printedreceipt for each successful transaction

    The ATM will have a key-operated switch that will allow anoperator to start and stop the servicing of customers. Afterturning the switch to the "on" position, the operator will berequired to verify and enter the total cash on hand. The machinecan only be turned off when it is not servicing a customer. Whenthe switch is moved to the "off" position, the machine will shutdown, so that the operator may remove deposit envelopes and reloadthe machine with cash, blank receipts, etc.

    2. Restaurant System The system is intended to support theday-to-day operations of a restaurant by improving the processes ofmaking reservations and allocating tables to customers. TheRestaurant system provides the facilities like

    Record Booking Cancel Booking Record Arrival Table Transfer

    The new system can offer diners eat at the restaurant withoutmaking an advance booking, if a free table is available. This isknown as Walk-in.

    The new system should display the same information as theexisting booking sheet and in same format, to make it easy forrestaurant staff to transfer, to the new system. When new bookingsare recorded or changes made to existing bookings, the displayshould be immediately updated, so that restaurant staff is workingwith the latest information available.

    COURSE OUTCOMES: At the end of this course students will be ableto: Evaluate a project to develop the scope of work, provideaccurate cost estimates and to plan the various activities Applyrisk management analysis techniques that identify the factors thatput a project at risk and to quantify the likely effect of risk onproject timescales Identify the resources required for a projectand to produce a work plan and resource schedule Monitor theprogress of a project and to assess the risk of slippage, revisingtargets counteract drift Use appropriate metrics to management thesoftware development outcome

  • 27

    Develop research methods and techniques appropriate to defining,planning and carrying out a research project within your chosenspecialist area within the management of software projects.

    Text Book

    1. Ramesh Gopalaswamy: Managing Global Projects ", Tata McGrawHill, 2013.

    REFERENCES: 1.Watts Humphrey, Managing the Software Process ,Pearson Education, New Delhi, 2000 2. PankajJalote, SoftwareProject Management in practice, Pearson Education, New Delhi,2002.

  • 28

    Semester II Year: 2014-2015

    COURSE OBJECTIVES: To gain knowledge about metrics WebApplication Development and related terminologies To gain knowledgeabout persistent framework and other ORM tools. To learn to buildsolutions using Design Patterns To get introduced to latest WEBframeworks



    Web application and java EE 6:Exploring the HTTP Protocol,Introducing web applications, describing web containers, exploringweb architecture models, exploring the MVC architecture. Workingwith servlets 3.0Exploring the features of java servlet, Exploringnew features in servlet 3.0, Exploring the servlet API, explain theservlet life cycle, creating a sample servlet, creating a servletby using annotation, working with servletconfig and servlet contextobjects, working with the Http servlet request and Http servletresponse interfaces, Exploring request delegation and requestscope, implementing servlet collaboration.

    10 hours


    Handling sessions in servlet 3.0:Describing a session,introducing session tracking, Exploring the session tracking,mechanisms, using the java servlet API for session tracking,creating login application using session tracking. Implementingevent handling Introducing events, Introducing event handling,working with the servlet events, developing the online shop webapplication. Working with java server pages: Introducing JSPtechnology, Exploring new features of JSP2.1, listing advantages ofJSP over java servlet, Exploring the architecture of a JSP page,Describing the life cycle of a JSP page, working with JSP basictags and implicit objects, working with the action tags in JSP,exploring the JSP unified EL, using functions with EL.

    10 hours


    Implementing JSP tag extensions: Exploring the elements of tagextensions, Working with classic tag handlers , Exploring the tagextensions, Working with simple tag handlers. Implementing javaserver pages standard tag library 1.2: Introducing JSTL, Exploringthe tag libraries JSTL, working with the core tag library.Implementing filters: Exploring the need of filters, exploring theworking of filters, exploring filters API, configuring a filter,creating a web application using filters, using initializingparameter in filters. 10 hours


    Persistence Management and Design Patterns : Implementing javapersistence using hibernate Introducing hibernate, exploring thearchitecture of hibernate, downloading hibernate, exploring HQL,understanding hibernate O/R mapping, working with hibernate,Implementing O/R mapping with hibernate. Java EE design patterns:Describing the java EE application architecture, Introducing adesign patterns, discussing the role of design patterns, exploringtypes of patterns.

    10 hours

    Course Title: Enterprise Application Programming Course Code:14SSE22 Credits(L:T:P): 3:0:1 Core/Elective: Core Type of Course:Lecture & Practical Total Contact Hours:50

  • 29


    Web Frameworks: Working with struts 2Introducing struts 2,understanding actions in struts 2.Working with java server faces2.0:Introducing JSF, Explaining the features of JSF, Exploring theJSF architecture, describing JSF elements, Exploring the JSFrequest processing life cycle. Working with spring 3.0:Introducingfeatures of the spring framework, exploring the spring frameworkarchitecture, exploring dependency injection & inversion ofcontrol, exploring AOP with spring, managing transactions. Securingjava EE 6 applications: Introducing security in java EE 6,exploring security mechanisms, implementing security on anapplication server. 10 hours


    Design Develop and Implement the following modules using anysuitable language/tools.

    1. Developing the profile management module Design, develop andimplement the following theory models using any suitable languagetools Implementing logic with servlet. creating the people_employeeservlet. creating the employeeobj class. creating theemployeedbmethods class. creating the generateid class, creatingviews. creating the people_insert JSP page. creating thepeople_search JSP page. creating the people_edit JSP page. creatingthe people_list JSP page. creating the people_ profile JSPpage.

    2. Developing the recruitment module Registering a newapplicant. creating the people_applicant servlet. creating theapplicantDBObj class. creating the applicantDBmethods class.creating the generated class. creating an interface for applicantregistration. conducting rounds of test. creating theapplicant_test_dtl servlet. designing JSP views. working of therecruitment module.


    3. Developing the payroll module Updating salary statement,creating the people_payroll servlet. creating the empsal class.creating the employee agreement class. creating the payrollbeanmethods class. designing JSP views. creating the people_agreementJSP page. creating the people_agreement_edit JSP page. creating thesalary_search.jsp file. creating the salary_slip JSP page.

  • 30

    COURSE OUTCOMES: Upon completion of the course, students shallbe able to

    Implement a WEB application. Manage deployment configurationsare Implement Security mechanisms

    Text Book:

    1. Kogent learning solution: JAVA SERVER PROGRAMMING JAVAEE6(J2EE 1.6), Dreamtech press 2014

  • 31

    Semester II Year: 2014-2015

    OBJECTIVES: To Learn How to add functionality to designs whileminimizing complexity. What code qualities are required to maintainto keep code flexible? To Understand the common design patterns. Toexplore the appropriate patterns for design problems.



    Introduction: what is a design pattern? describing designpatterns, the catalog of design pattern, organizing the catalog,how design patterns solve design problems, how to select a designpattern, how to use a design pattern. What is object-orienteddevelopment? , key concepts of object oriented design other relatedconcepts, benefits and drawbacks of the paradigm.

    10 hours


    Analysis a System: overview of the analysis phase, stage 1:gathering the requirements functional requirements specification,defining conceptual classes and relationships, using the knowledgeof the domain. Design and Implementation, discussions and furtherreading. 10 hours MODULE-III

    Design Pattern Catalog: Structural patterns, Adapter, bridge,composite, decorator, facade, flyweight, proxy. 10 hours


    Interactive systems and the MVC architecture: Introduction , TheMVC architectural pattern, analyzing a simple drawing program ,designing the system, designing of the subsystems, getting intoimplementation , implementing undo operation , drawing incompleteitems, adding a new feature , pattern based solutions. 10 hoursMODULE-V

    Designing with Distributed Objects: Client server system, javaremote method invocation, implementing an object oriented system onthe web (discussions and further reading) a note on input andoutput, selection statements, loops arrays. 10 hours

    COURSE OUTCOMES: The student should be able to

    Design and implement codes with higher performance and lowercomplexity Be aware of code qualities needed to keep code flexibleExperience core design principles and be able to assess the qualityof a design with respect to these principles. Capable of applyingthese principles in the design of object oriented systems.

    Course Title: Design Patterns Course Code: 14SSE23Credits(L:T:P): 4:0:0 Core/Elective: Core Type of Course: LectureTotal Contact Hours:50

  • 32

    Demonstrate an understanding of a range of design patterns. Becapable of comprehending a design presented using thisvocabulary.

    Be able to select and apply suitable patterns in specificcontexts.

    TEXT BOOKS 1.Object-oriented analysis, design andimplementation, brahma dathan, sarnath rammath, universitiespress,2013 2.Design patterns, erich gamma, Richard helan, Ralphjohman , john vlissides ,PEARSON Publication,2013.

    REFERENCES: 1. Frank Bachmann, RegineMeunier, Hans RohnertPattern Oriented Software Architecture Volume 1, 1996. 2. William JBrown et al., "Anti-Patterns: Refactoring Software, Architecturesand Projects in Crisis", John Wiley, 1998.

  • 33

    Semester II Year: 2014-2015

    COURSE OBJECTIVES: To gain basic knowledge about metrics,measurement theory and related

    terminologies To learn measure the quality level of internal andexternal attributes of the software product To introduce the basicsof software reliability and to illustrate how to perform planning,executing and testing for

    software reliability To explore various metrics and models ofsoftware reliability To compare various models of softwarereliability based on its application



    What Is Software Quality: Quality: Popular Views, QualityProfessional Views, Software Quality, Total Quality Management andSummary. Fundamentals Of Measurement Theory: Definition,Operational Definition, And Measurement, Level Of Measurement, SomeBasic Measures, Reliability And Validity, Measurement Errors, BeCareful With Correlation, Criteria For Causality, Summary. SoftwareQuality Metrics Overview: Product Quality Metrics, In ProcessQuality Metrics, Metrics for Software Maintenance, Examples ForMetrics Programs, Collecting Software Engineering Data. 10hours


    Applying The Seven Basic Quality Tools In Software Development :Ishikawas Seven Basic Tools, Checklist, Pareo Diagram, Histogram,Run Charts , Scatter Diagram, Control Chart, Cause And EffectDiagram. The Rayleigh Model: Reliability Models, The Rayleigh ModelBasic Assumptions, Implementation, Reliability And PredictiveValidity. 10 hours


    Complexity Metrics And Models: Lines Of Code, Halsteads SoftwareScience , Cyclomatic Complexity Syntactic Metrics, An Example OfModule Design Metrics In Practice .Metric And Lessons Learned ForObject Oriented Projects: Object Oriented Concepts And Constructs,Design And Complexity Metrics, Productivity Metrics, Quality AndQuality Management Metrics, Lessons Learned For object orientedProjects. 10 hours


    Availability Metrics: Definition And Measurement Of SystemAvailability, Reliability Availability And Defect Rate, CollectingCustomer Outage Data For Quality Improvement, In Process MetricsFor Outage And Availability .Conducting Software Project Assessment:Audit Ad Assessment , Software Process Maturity Assessment AndSoftware Project Assessment , Software Process Assessment AProponed Software Project Assessment Method. 10 hours


    Course Title: Software Metrics and Quality Assurance CourseCode: 14SSE24 Credits(L:T:P): 4:0:0 Core/Elective: Core Type ofCourse: Lecture Total Contact Hours:50

  • 34

    Dos And Donts Of Software Process Improvement :Measuring ProcessMaturity, Measuring Process Capability, Staged Versus ContinuousDebating Religion, Measuring Levels Is Not Enough, Establishing TheAlignment Principle , Take Time Getting Faster, Keep it Simple OrFace Decomplexification, Measuring The Value Of Process Improvement, Measuring Process Compliance , Celebrate The Journey Not Just TheDestination. Using Function Point Metrics to Measure SoftwareProcess Improvement: Software Process Improvement Sequences,Process Improvement Economies, Measuring Process Improvement atActivity Levels.

    10 hours

    COURSE OUTCOMES: Upon completion of the course, students shallbe able to

    Identify and apply various software metrics, which determinesthe quality level of software Identify and evaluate the qualitylevel of internal and external attributes of the software productCompare and Pick out the right reliability model for evaluating thesoftware Evaluate the reliability of any given software productDesign new metrics and reliability models for evaluating thequality level of the software based on the requirement

    Text Book

    1. Stephen H Khan: Metrics and Models in Software QualityEngineering, Pearson 2nd edition 2013.

    REFERENCES: 1. Norman E-Fentor and Share Lawrence Pflieger.Software Metrics. International Thomson Computer Press, 1997. 2.S.A.Kelkar,Software quality and Testing, PHI Learing, Pvt, Ltd.,New Delhi 2012. 3. Watts S Humphrey, Managing the Software Process,Pearson Education Inc, 2008. 4. Mary Beth Chrissis, Mike Konrad andSandy Shrum, CMMI, Pearson Education(Singapore) Pte Ltd, 2003 5.Philip B Crosby, " Quality is Free: The Art of Making QualityCertain ", Mass Market, 1992.

  • 35

    Semester II Year: 2014-2015

    COURSE OBJECTIVES: To understand the fundamentals ofCryptography To acquire knowledge on standard algorithms used toprovide confidentiality, integrity and authenticity. To understandthe various key distribution and management schemes. To understandhow to deploy encryption techniques to secure data in transitacross data networks To design security applications in the fieldof Information technology


    Classical Encryption Techniques: Symmetric Cipher Model,Cryptography, Cryptanalysis and Brute-Force Attack, SubstitutionTechniques, Caesar Cipher, Mono alphabetic Cipher, Playfair Cipher,Hill Cipher, Polyalphabetic Cipher, One Time Pad. Block Ciphers andthe data encryption standard: Traditional block Cipher structure,stream Ciphers and block Ciphers, Motivation for the feistel Cipherstructure, the feistel Cipher, The data encryption standard, DESencryption , DES decryption , A DES example, results, the avalancheeffect, the strength of DES, the use of 56-Bit Keys, the nature ofthe DES algorithm, timing attacks, Block cipher design principles,number of rounds, design of function F, key schedule algorithm. 10hours


    Public-Key Cryptography and RSA: Principles of public-keycryptosystems. Public-key cryptosystems. Applications forpublic-key cryptosystems, requirements for public-keycryptosystems. public-key cryptanalysis. The RSA algorithm,description of the algorithm, computational aspects, the securityof RSA: Other Public-Key Cryptosystems: Diffie-hellman keyexchange, The algorithm, key exchange protocols, man in the middleattack, Elgamal Cryptographic systems, Elliptic curve arithmetic,abelian groups, elliptic curves over real numbers, elliptic curvesover Zp, elliptic curves over GF(2m), Elliptic curve cryptography,Analog of Diffie-hellman key exchange, Elliptic curve encryption/decryption, security of Elliptic curve cryptography, Pseudorandomnumber generation based on an asymmetric cipher, PRNG based on RSA.10 hours


    Key Management and Distribution: Symmetric key distributionusing Symmetric encryption, A key distribution scenario,Hierarchical key control, session key lifetime, a transparent keycontrol scheme, Decentralized key control, controlling key usage,Symmetric key distribution using asymmetric encryption, simplesecret key distribution, secret key distribution withconfidentiality and authentication, A hybrid scheme, distributionof public keys, public announcement of public keys, publiclyavailable directory, public key authority, public keyscertificates, X-509 certificates. Certificates, X-509 version 3,public key infrastructure .User Authentication: Remote userAuthentication principles, Mutual Authentication, one wayAuthentication, remote user Authentication using Symmetricencryption, Mutual Authentication, one way Authentication,Kerberos, Motivation , Kerberos version 4, Kerberos version 5,Remote user Authentication using Asymmetric encryption, MutualAuthentication, one way Authentication, federated identitymanagement, identity management, identity federation, personalidentity verification. 10 hours


    Wireless network security: Wireless security, Wireless networkthreats, Wireless network measures, mobile device security,security threats, mobile device security strategy, IEEE 802.11Wireless LAN overview, the Wi-Fi alliance, IEEE 802 protocolarchitecture. Security, IEEE 802.11i services, IEEE 802.11i phasesof operation, discovery phase,

    Course Title: Information And Network Security Course Code:14SSE251 Credits(L:T:P): 4:0:0 Core/Elective: Elective Type ofCourse: Lecture Total Contact Hours:50

  • 36

    Authentication phase, key management phase, protected datatransfer phase, the IEEE 802.11i pseudorandom function, ..WebSecurity Considerations: Web Security Threats, Web Traffic SecurityApproaches. Secure Sockets Layer: SSL Architecture, SSL RecordProtocol, Change Cipher Spec Protocol, Alert Protocol, handshakeProtocol, Cryptographic Computations. Transport Layer Security:Version Number, Message Authentication Code, PseudorandomFunctions, Alert Codes, Cipher Suites, Client Certificate Types,Certificate Verify And Finished Messages, CryptographicComputations, Padding. HTTPS Connection Initiation, ConnectionClosure. Secure Shell (SSH): Transport Layer Protocol, UserAuthentication Protocol, and Connection Protocol. 10 hours


    Electronic Mail Security: Pretty good privacy, notation,operational; description, S/MIME, RFC5322, Multipurpose internetmail extensions, S/MIME functionality, S/MIME messages, S/MIMEcertificate processing, enhanced security services, Domain keysidentified mail, internet mail architecture, E-Mail threats, DKIMstrategy, DKIM functional flow, .IP Security: IP Security overview,applications of IPsec, benefits of IPsec, Routing applications,IPsec documents, IPsec services, transport and tunnel modes, IPSecurity policy, Security associations, Security associationsdatabase, Security policy database, IP traffic processing,Encapsulating Security payload, ESP format, encryption andauthentication algorithms, Padding, Anti replay service, transportand tunnel modes, combining security associations, authenticationplus confidentiality, basic combinations of security associations,internet key exchange, key determinations protocol, header andpayload formats, cryptographic suits. 10 hours

    COURSE OUTCOMES: Upon Completion of the course, the studentswill be able to

    Implement basic security algorithms required by any computingsystem Analyze the vulnerabilities in any computing system andhence be able to design a security solution. Analyze the possiblesecurity attacks in complex real time systems and their effectivecounter measures Identify the security issues in the network andresolve it. Evaluate security mechanisms using rigorous approaches,including theoretical derivation, modeling, and simulationsFormulate research problems in the computer security field

    Text Book.

    1. William Stallings: Cryptography and Network Security, Pearson6th edition 2013.

    References 1. V k Pachghare: Cryptography and InformationSecurity ,2013.

  • 37

    Semester II Year: 2014-2015

    COURSE OBJECTIVES: To expose the students to the concepts ofData warehousing Architecture and Implementation To Understand Datamining principles and techniques and Introduce DM as a cutting edgebusiness intelligence To learn to use association rule mining forhandling large data To understand the concept of classification forthe retrieval purposes To know the clustering techniques in detailsfor better organization and retrieval of data


    Introduction: What is a Data Warehouse?, A Multidimensional DataModel, Data Warehouse Architecture, Data Warehouse Implementation,Data cube Technology, From Data warehousing to Data Mining, DataMining Functionalities, Data cleaning, Data Integration andTransformation, Data Reduction. 10 hours


    Data Mining Primitives, Languages And System Architectures: DataMining primitives, Presentation and Visualization of Discoveredpatterns, A Data Mining Query Language. MINING ASSOCIATION RULES INLARGE DATA BASES: Association Rule Mining Single DimensionalBoolean Association Rules From Transactional Databases, MiningMultilevel Association Rules from Transactional Databases.

    10 hours


    Classification And Prediction: Issues regarding Classificationand Prediction, classification by Decision tree induction, Bayesianclassification, Classification by back propagation, ClassificationBased on the concepts from association rule mining. Otherclassification methods, prediction. 10 hours


    Cluster Analysis: What is Cluster Analysis? Types of data incluster Analysis: a Categorization of Major Clustering Methods,Partitioning Methods, And Hierarchical methods, Density-BasedMethods, Model-Based Clustering Methods: Statistical Approach,Neural Network Approach Outliner Analysis.

    10 hours


    Applications And Trends In Data Mining: Data mining application,Data mining system Products research Prototypes, Additional Themeson Data Mining, Data Mining and Intelligent Query Answering, Tendsin Data Mining. 10 hours

    COURSE OUTCOMES: Upon completion of the course, students shallbe able to

    Store voluminous data for online processing Preprocess the datafor mining applications

    Course Title: Data Mining & Data Warehousing Course Code:14SSE252 Credits(L:T:P): 4:0:0 Core/Elective: Elective Type ofCourse: Lecture Total Contact Hours:50

  • 38

    Apply the association rules for mining the data Design anddeploy appropriate classification techniques Cluster the highdimensional data for better organization of the data Discover theknowledge imbibed in the high dimensional system

    Text Books: 1. Jiawei Michelin Kamber, "Data Mining Concepts andTechniques", Morgan Kauf Mann Publishers, Reprint 2014.

  • 39

    Semester II Year: 2014-2015

    COURSE OBJECTIVES: To understand the basics of InformationRetrieval with pertinence to modeling, query operations andindexing To get an understanding of machine learning techniques fortext classification and clustering To understand the variousapplications of Information Retrieval giving emphasis to MultimediaIR, Web Search To understand the concepts of queries specificationjudgment and search engines


    Introduction: Motivation, Basic concepts, Past, present, andfuture, The retrieval process. Modeling: Introduction, A taxonomyof information retrieval models, Retrieval: Adhoc and filtering, Aformal characterization of IR models, Classic informationretrieval, Alternative set theoretic models, Alternative algebraicmodels, Alternative probabilistic models, Structured text retrievalmodels, Models for browsing. 10 hours MODULE-II

    Retrieval Evaluation: Introduction, Retrieval performanceevaluation, Reference collections. Query Languages: Introduction,keyword-based querying, Pattern matching, Structural queries, Queryprotocols. Query Operations: Introduction, User relevance feedback,Automatic local analysis, Automatic global analysis. 10 hoursMODULE-III : Text and Multimedia Languages and Properties:Introduction, Metadata, Text, Markup languages, Multimedia. TextOperations: Introduction, Document preprocessing, Documentclustering, Text compression, Comparing text compressiontechniques. 10 hours

    MODULE-IV: Indexing and Searching: Introduction; Inverted Files;Other indices for text; Boolean queries; Sequential searching;Pattern matching; Structural queries; Compression. Parallel andDistributed IR: Introduction, Parallel IR, Distributed IR. 10hours


    User Interfaces and Visualization: Introduction, Human-Computerinteraction, The information access process, Starting pints, Queryspecification, Context, Using relevance judgments, Interfacesupport for the search process. Searching the Web: Introduction,Challenges, Characterizing the web, Search engines, Browsing, Metasearchers, Finding the needle in the haystack, Searching usinghyperlinks. 10 hours

    COURSE OUTCOMES: Upon completion of the course, the studentswill be able to

    Build an Information Retrieval system using the available toolsIdentify and design the various components of an InformationRetrieval system Apply machine learning techniques to textclassification and clustering which is used for efficientInformation Retrieval Analyze the Web content structure Design anefficient search engine


    1. Ricardo Baeza-Yates, Berthier Ribeiro-Neto: ModernInformation Retrieval, Pearson, 1999.


    1. David A. Grossman, Ophir Frieder: Information RetrievalAlgorithms and Heuristics, 2nd Edition, Springer, 2004.

    Course Title: Information Retrieval Course Code: 14SSE253Credits(L:T:P): 4:0:0 Core/Elective: Elective Type of Course:Lecture Total Contact Hours:50

  • 40

    Semester II Year: 2014-2015

    COURSE OBJECTIVES: To outline basic terminology and componentsin information storage and retrieval systems To compare andcontrast information retrieval models and internal mechanisms suchas Boolean, Probability, and

    Vector Space Models To describe current trends in informationretrieval such as information visualization. To understand Backupprocess and securing of management storage infrastructure



    Introduction to Information Storage: Information Storage,Evolution of Storage Architecture, Data center Infrastructure,Virtualization and cloud computing. Data Center Environment:Application, Database Management System(DBMS), Host(compute),Connectivity, Storage, Disk Drive Components, Disk DrivePerformance, Host Access to Data, Direct-Attached Storage, StorageDesign Based On Application, Disk Native Command Queuing,Introduction to Flash Drives, Concept in Practice: VMware ESXi.DataProtection: RAID:RAID Implementation Methods, RAID ArrayComponents, RAID Techniques, RAID Levels, RAID Impact on DiskPerformance, RAID Comparison, Hot Spares.

    10 hours


    Intelligent Storage Systems: Components of an IntelligentStorage System, Storage Provisioning, Types of intelligent StorageSystems, Concepts in Practice: EMC Symmetrix and VNX. Fibre ChannelStorage Area Networks: Fiber Channel: Overview, The SAN and ItsEvolution, Components of FC SAN, FC Connectivity, Switched FabricPorts, Fibre Channel Architecture, fabric Services, Switched fabricLogin Types, Zoning, FC SAN Topologies, Virtualization in SAN,Concepts in Practice: EMC Connectrix and EMC VPLEX.IP SAN and FcoE:iSCSI, FCIP, FcoE.

    10 hours


    Network-Attached Storage: General-purpose Servers versus NASDevices, benefits of NAS, File Systems and network File Sharing.Components of NAS, NAS I/O Operation, NAS Implementations, NASFile-Sharing Protocols, factors Affecting NAS Performance,File-Level Virtualization, Concepts in Practice: EMC Isilon and EMCVNX gateway. Object-Based and unified Storage: Object-Based StorageDevices, Content-Addressed Storage, CAS use Cases, unified Storage,Concepts in Practice: EMC atoms, EMC VNX, and EMC centera.Introduction to Business Continuity. Information Availability, BCTerminology, BC Planning life Cycle, failure Analysis, BusinessImpact Analysis, BC Technology solutions. 10 hours


    Backup and Archive : Backup Purpose, Backup Considerations,Backup Granularity, Recovery Considerations, Backup Methods, BackupArchitecture, Backup and Restore Operation, Backup Topologies,Backup in NAS Environments, Backup Targets, Data Dedupulication forBackup, Backup in Virtualized Environments, Data Archive

    Course Title: Information Storage Management Course Code:14SSE254 Credits(L:T:P): 4:0:0 Core/Elective: Elective Type ofCourse: Lecture Total Contact Hours:50

  • 41

    ,Archiving Solution Architecture, Concepts in Practice :EMCNetworker, EMC Avamar, and EMC Data domain. Local Replication:Replication Terminology, Uses of Local Replicas, ReplicaConsistency, Local Replication Technologies, Tracking Changes toSource and Replica, Restore and Restart Considerations, CreatingMultiple Replicas, Local Replication in Virtualized Environment,Concepts in Practice: EMC TimeFinder .Remote Replication: Modes ofRemote Replication, Remote Replication Technologies, Three-SiteReplication, Data Migration Solutions, Remote Replication andMigration in a Virtualized Environment, Concepts in Practice : EMCSRDF, EMC MirrorView, and EMC RecoverPoint. 10 hours

    MODULE-V Securing the Storage Infrastructure: InformationSecurity Framework, Risk Triad, Storage Security Domains, Securityimplementations in Storage Networking, Securing StorageInfrastructure in Virtualized and Cloud Environments, Concepts inpractice: RSA and VMware Security Products. Managing the StorageInfrastructure: Monitoring the Storage Infrastructure, StorageInfrastructure Management Activities, Storage InfrastructureManagement Challenges, Developing an Idea Solution, InformationLifecycle Management, Storage Tiering, Concepts in Practice: EMCInfrastructure. 10 hours

    COURSE OUTCOMES The student shall be able to Recognize the roleand use are technology in business systems and operations Identifyand describe organizational structure and business processes withinthese Implement information systems in industry. Choose backupmethod and replication method. Provide securing of managementstorage infrastructure.

    Text Book:

    1. EMC2 : Information Storage and Management, Willey India2013.

    REFERENCES: 1. EMC Corporation, Information Storage andManagement, Wiley, India. ISBN-13: 978-8126537501, August 2012. 2.Robert Spalding, Storage Networks: The Complete Reference, TataMcGraw Hill , Osborne, 2003. 3. Marc Farley, Building StorageNetworks, Tata McGraw Hill ,Osborne, 2001. 4. Additional resourcematerial on www.emc.com/resource-library/resource-library.esp

  • 42

    Semester II Year: 2014-2015

    OBJECTIVES: To understand the need of design pattern to solveproblems of different context. To understand the common designpatterns and to implement them. To explore the appropriate patternsfor design problems.


    Note: Use appropriate tools/language to implement the followingexperiment: 1. Design, develop and implement an intercepting FilterPattern which intercepts and intermediates the requestreceived.

    Implement an HTML to send a request to a server, where therequest is intercepted by the filter and the following details areextracted and displayed. Date, Content-Encoding, Content-Length,Content-Location ,Content-MD5

    2. Design, develop and implement a front controller pattern ,which forms the centralized control to handle multiple user requestfor effectively managing the activities of content retrieval, viewmanagement and security service invocation. Implement a javaServlet, which forms the controller and decision maker for theentire application .

    3. To implement a data access object pattern to separate thedata processing logic from data access logic. Implement the javaclass that decouples the persistence management from businesslogic.

    4. To implement an object pooling mechanism using N-TON designpattern. Implement a Java class which creates 10 connection objectsand forms a pool , and another java class to consume the connectionand to persist data into the EIS.

    5. Implement the session faade pattern to de-couple the businesslogic from accessing the third party application object in thedistributed environment using EJB.


    The student should be able to Design and implement codes withhigher performance and lower complexity Be aware of code qualitiesneeded to keep code flexible Experience core design principles andbe able to assess the quality of a design with respect to theseprinciples. Be able to select and apply suitable patterns inspecific contexts.

    Course Title: Design Patterns Laboratory Course Code: 14SSE26Credits(02)(L:T:P): 0:0:3 Core/Elective: Core Type of Course:Practical Total Contact Hours:42

  • 43

    Semester IV Year: 2014-2015

    Course Objectives To learn Basic Concepts of DSM, Hardware DSMTo understand File Sharing, DFS Implementation, Replication in DFS,To explore the concepts of Cryptography, Secure channels, Accesscontrol To understand real time Distributed Operating System andemerging trends in Distributed Computing


    Distributed System management: Introduction, Resourcemanagement, Task Assignment Approach, Load-Balancing Approach,Load-Sharing Approach, Process management in a DistributedEnvironment, Process Migration, Threads, Fault Tolerance. 10hours


    Distributed Shared Memory: Introduction, Basic Concepts of DSM,Hardware DSM, Design Issue in DSM Systems, Issue in ImplementingDSM Systems, Heterogeneous and Other DSM Systems, Case Studies. 10hours


    Distributed File System: Introduction to DFS, File Models,Distributed File System Design, Semantics of File Sharing, DFSImplementation, File Caching in DFS, Replication in DFS, Casestudies. Naming: Introduction, Desirable features of a good namingsystem, Basic concepts, System-oriented names, Object-locatingmechanisms, Issues in designing human-oriented names, Name caches,Naming and security, Case study: Domain name service. 10 hours


    Security in distributed systems: Introduction, Cryptography,Secure channels, Access control, Security Management, Case studies.10 hours


    Real-Time Distributed operating Systems: Introduction, Designissues in real-time distributed systems, Real-time communication,Real-time scheduling, Case study: Real-time communication in MARS.Emerging Trends in distributed Computing: Introduction to emergingtrends, Grid Computing, SOA, Cloud computing, The future ofemerging Trends. 10 hours

    Course Title: Distributed Computing Course Code: 14SSE41Credits(L:T:P): 3:0:1 Core/Elective: Core Type of Course: Lecture& Practical Total Contact Hours:50

  • 44

    LABORATORY WORK Use suitable language/OS/package to implementthe following:

    1. Implement client server application using RMI (Remote MethodInvocation) to invoke a service to calculate the income tax.

    2. Implement EJB (Entity Java Beans) session bean business logicto calculate income tax and invoke the service using stub, i.e.,client side proxy object.

    3. Implement an EJB entity bean to persist the client submitteddata into an enterprise information system. 4. Implement an officecommunication system using JMS (Java Message Service) to servicethe client request. 5. Implement the client code to call the Microsoft service like free service from UDDI (Universal Description

    Discovery Protocol). 6. Implement business logic and bind it asservice using SOAP (Simple Object Access Protocol), alsoimplement

    client to call service.

    COURSE OUTCOMES: The student shall be able

    To implement shared memory concept. To realize advantages ofDFS. To design

Top Articles
Latest Posts
Article information

Author: Dean Jakubowski Ret

Last Updated: 03/16/2023

Views: 6693

Rating: 5 / 5 (50 voted)

Reviews: 89% of readers found this page helpful

Author information

Name: Dean Jakubowski Ret

Birthday: 1996-05-10

Address: Apt. 425 4346 Santiago Islands, Shariside, AK 38830-1874

Phone: +96313309894162

Job: Legacy Sales Designer

Hobby: Baseball, Wood carving, Candle making, Jigsaw puzzles, Lacemaking, Parkour, Drawing

Introduction: My name is Dean Jakubowski Ret, I am a enthusiastic, friendly, homely, handsome, zealous, brainy, elegant person who loves writing and wants to share my knowledge and understanding with you.