Scheme and Syllabus
III – VI Semester Master of Computer Applications (MCA) 2015-2018
P.E.S. COLLEGE OF ENGINEERING
Mandya - 571401. Karnataka (An Autonomous Institution under VTU Belagavi) Grant-in-aid Institution Accredited by NBA, New Delhi Approved by AICTE, New Delhi.
Ph: 08232 - 220043 Fax: 08232 - 222075
Web: www.pescemandya.org
P.E.S COLLEGE OF ENGINEERING, MANDYA – 571 401 (An Autonomous Institution Under VTU Belgaum)
MASTER OF COMPUTER APPLICATIONS (MCA) SCHEME OF TEACHING AND EXAMINATION 2015-18
III SEMESTER
Examination Sl. Hrs/Week Course Code Course Title Credits Marks No L :T : P : H CIE SEE Total 1 P15MCA31 Computer Networks 4 : 0 : 0 : 4 4 50 50 100 2 P15MCA32 Programming with Java 3 : 2 : 0 : 5 4 50 50 100 3 P15MCA33 Software Engineering 4 : 0 : 0 : 4 4 50 50 100 4 P15MCA34 Computer Graphics 3 : 2 : 0 : 5 4 50 50 100 5 P15MCA35X Elective - I 4 : 0 : 0 : 4 4 50 50 100 6 P15MCA36 Network Lab 0 : 0 : 2 : 2 1 50 50 100 7 P15MCA37 Java Programming Lab 0 : 0 : 3 : 3 1.5 50 50 100 8 P15MCA38 Computer Graphics Lab 0 : 0 : 3 : 3 1.5 50 50 100 Aptitude and Reasoning 9 P15MHU301 Development-BEGINNER 2 : 0 : 0 : 2 1 50 50 100 (ARDB)* Total 32 25 450 450 900 L: Lecture, T: Tutorial, P: Practical, H: Total Hours; CIE: Continuous Internal Evaluation; SEE: Semester End Examinations * Taught by Humanities Science and Management Department
ELECTIVES
Sl. Course code Elective Group - I No. 1 P15MCA351 Accountancy and Financial Management 2 P15MCA352 System Software 3 P15MCA353 Basics of MIS & E-Commerce 4 P15MCA354 Graph Theory and Combinatorics 5 P15MCA355 Business Data Processing Using COBOL
SYLLABUS 2015 – 2018 Page 1
P.E.S COLLEGE OF ENGINEERING, MANDYA – 571 401 (An Autonomous Institution Under VTU Belgaum)
MASTER OF COMPUTER APPLICATIONS (MCA) SCHEME OF TEACHING AND EXAMINATION 2015-18
IV SEMESTER
Examination Hrs/Week Sl. Course Code Course Title Credits Marks No. L : T : P :H CIE SEE Total Design & Analysis of 1 P15MCA41 3 : 2 : 0 : 5 4 50 50 100 Algorithms 2 P15MCA42 Advanced Java Programming 3 : 2 : 0 : 5 4 50 50 100 Object-Oriented Modelling 3 P15MCA43 4 : 0 : 0 : 4 4 50 50 100 and Design Patterns 4 P15MCA44X Elective - II 4 : 0 : 0 : 4 4 50 50 100 5 P15MCA45X Elective - III 4 : 0 : 0 : 4 4 50 50 100 Design & Analysis of 6 P15MCA46 0 : 0 : 3 : 3 1.5 50 50 100 Algorithms Lab Advanced Java Programming 7 P15MCA47 0 : 0 : 3 : 3 1.5 50 50 100 Lab Object-Oriented Modelling 8 P15MCA48 0 : 0 : 3 :3 1.5 50 50 100 and Design Patterns Lab 9 P15MCA49 Technical Seminar 0 : 0 : 3 :3 1.5 100 -- 100 Aptitude and Reasoning 10 P15MHU401 Development ADVANCED 2 : 0 : 0 : 2 1 50 50 100 (ARDA)* Total 36 27 550 450 1000 L: Lecture, T: Tutorial, P: Practical, H: Total Hours; CIE: Continuous Internal Evaluation; SEE: Semester End Examinations * Taught by Humanities Science and Management Department
ELECTIVES
Sl. Course code Elective Group - II Sl. Course code Elective Group - III No. No. 1 P15MCA441 Cloud Computing 1 P15MCA451 Cryptography & Network Security 2 P15MCA442 Unix System Programming 2 P15MCA452 Network Management 3 P15MCA443 Composing Mobile 3 P15MCA453 Data Warehousing & Data Applications Mining 4 P15MCA444 Advanced Database 4 P15MCA454 Distributed Computing Management Systems 5 P15MCA445 Principles of User Interface 5 P15MCA455 Enterprise Resource Design Planning (ERP)
SYLLABUS 2015 – 2018 Page 2
P.E.S COLLEGE OF ENGINEERING, MANDYA – 571 401 (An Autonomous Institution Under VTU Belgaum)
MASTER OF COMPUTER APPLICATIONS (MCA) SCHEME OF TEACHING AND EXAMINATION 2015-18
V SEMESTER
Examination Sl. Hrs/Week Course Code Course Title Credits Marks No L : T : P: H CIE SEE Total Software Testing and 1 P15MCA51 4 : 0 : 0 : 4 4 50 50 100 Practices Programming using C# 2 P15MCA52 3 : 2 : 0 : 5 4 50 50 100 and .NET System Simulation and 3 P15MCA53 4 : 0 : 0 : 4 4 50 50 100 Modeling 4 P15MCA54X Elective - IV 4 : 0 : 0 : 4 4 50 50 100 5 P15MCA55X Elective - V 4 : 0 : 0 : 4 4 50 50 100 6 P15MCA56 .NET Lab 0 : 0 : 2 : 2 1 50 50 100 7 P15MCA57 Mini Project 0 : 0 : 6 : 6 3 50 50 100 Total 29 24 350 350 700 # L: Lecture, T: Tutorial, P: Practical, H: Total Hours; CIE: Continuous Internal Evaluation; SEE: Semester End Examinations
ELECTIVES
Sl. Sl. No. Course code Elective Group – IV No Course code Elective Group - V . 1 P15MCA541 Parallel Computing 1 P15MCA551 Information Retrieval & Search Engines 2 P15MCA542 Advanced Web 2 P15MCA552 Business Intelligence - Data Programming Warehousing and Analytics 3 P15MCA543 Big Data and Analytics 3 P15MCA553 Storage Area Network 4 P15MCA544 Digital Image Processing 4 P15MCA554 Software Project Management 5 P15MCA545 E-Commerce and M- 5 P15MCA555 Computer Vision Commerce
SYLLABUS 2015 – 2018 Page 3
P.E.S COLLEGE OF ENGINEERING, MANDYA – 571 401 (An Autonomous Institution Under VTU Belgaum)
MASTER OF COMPUTER APPLICATIONS (MCA) SCHEME OF PROJECT WORK AND EXAMINATION 2015-18
VI SEMESTER
Examination Sl. Course Hrs/Week Course Title Credits Marks No Code L : T : P:H CIE SEE Total 1 P15MCA61 Project Phase-1 ------3 50 ------50 2 P15MCA62 Project Phase-2 ------3 50 ------50 P15MCA63 Project Dissertation 3 ------9 ----- 100 100 Evaluation 4 P15MCA64 Project Viva - Voce ------9 ----- 100 100
TOTAL ------24 100 200 300
# L: Lecture, T: Tutorial, P: Practical, C: Credits ; CIE: Continuous Internal Evaluation;
SEE: Semester End Examinations
Evaluation Scheme Scheme Weightage Marks Event Break UP Test I Test II Quiz I Quiz II Assignment CIE 50% 50 35 35 5 5 10 SEE 50% 100 Questions to Set : 10 Questions to Answer:5
Scheme of SEE Question Paper(100 Marks) Duration:3hrs Marks:100 Weightage:50% Each of the two questions set shall be so comprehensive as to cover the entire contents of the unit. There will be direct choice between two questions within each unit. Total questions to be set are 10. All questions carry equal marks of 20. The number of subdivisions in each main question shall be limited to maximum of four only. Number of question to be answered by students is 5.
SYLLABUS 2015 – 2018 Page 4
Course Code: P15MCA31 Semester : III L-T-P: 4 – 0 - 0 Course Title : Computer Networks Creditss:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the fundamental concepts of computer networking. Understand data transformation and data transmission. Discuss various inter networking devices and transmission of data in inter-networks using routing algorithms Apply various error detection and correction techniques in transmission of data. Distinguish various LANs
Course Contents
UNIT – I Computer Networks and the Internet 10 Hours What Is the Internet? The Network Edge, The Network Core, Delay, Loss, and THrsoughput in Packet- Switched Networks, Protocol Layers and Their Service Models, Networks Under Attack, History of Computer Networking and the Internet
UNIT – II Application Layer 10 Hours Principles of Network Applications, The Web and HTTP, File Transfer: FTP, Electronic Mail in the Internet, DNS—The Internet‘s Directory Service, Peer-to-Peer Applications.
UNIT – III Transport Layer 10 Hours Introduction and Transport-Layer Services, Multiplexing and Demultiplexing, Connectionless Transport: UDP, Principles of Reliable Data Transfer, Connection-Oriented Transport: TCP, Principles of Congestion Control, TCP Congestion Control
UNIT – IV The Network Layer 10 Hours Introduction, Virtual Circuit and Datagram Networks, What‘s Inside a Router? The Internet Protocol (IP): Forwarding and Addressing in the Internet, Routing Algorithms, Broadcast and Multicast Routing
UNIT – V The Link Layer : Links, Access, Networks and LANs 12 Hours Introduction and Services, Error-Detection and -Correction Techniques, Multiple Access Protocols, Link- Layer Addressing, Ethernet, Switched Local Area Networks, Link Virtualization: A Network as a Link Layer Wireless and Mobile Networks Introduction, Wireless Links and Network Characteristics, Wi-Fi: 802.11 Wireless LANs.
Text Book: 1. James F. Kurose, Keith W. Ross: Computer Networking: A Top-Down Approach, 5thEdition, Addison-Wesley, 2012. Chapters: 1, 2.1 - 2.6, 3, 4.1- 4.5, 4.7, 5.1-5.5, 6.1-6.3
SYLLABUS 2015 – 2018 Page 5
Reference Books: 1. Behrouz A. Forouzan: Data Communications and Networking, 4thEdition, Tata McGraw-Hill, 2006. 2. William Stallings: Data and Computer Communication, 8thEdition, Pearson Education, 2007. 3. Larry L. Peterson and Bruce S. David: Computer Networks – A Systems Approach, 4thEdition, Elsevier, 2007.
Course outcomes On completion of this course, the students should be able to
Describe basic terminologies used for computer networking and data communication model with its components. Classify various categories of networks and types of inter-networking devices with their functions Explain the roles and functions of each layer of TCP/IP. Analyse the routing table for a given subnet using various routing algorithm. Identify how error free transmission held between two end nodes.
SYLLABUS 2015 – 2018 Page 6
Course Code: P15MCA32 Semester : III L-T-P: 3 – 2 - 0 Course Title : Programming with Java Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand Java program syntax construct Understand and Apply class, member, method and String class and Array concepts for real time applications Choose appropriate fundamental concepts interface, exception handling and overriding for real time application Understand and apply multithreading programming and develop generics for given problem Describe applet, swing, networking and collection frame work
Course Contents
UNIT-I Java Programming Fundamentals 10 Hours The Java Language, The Key Attributes of Object-Oriented Programming, The Java development Kit, A First Simple Program, Handling Syntax Errors, The Java Keywords, Identifies in Java, The Java Class Libraries. Java‘s Primitive Types, Literals, A Closer Look at Variables, The Scope and Lifetime of Variables, operators, Shorthand Assignments, Type conversion in Assignments, Using Cast, Operator Precedence, Expressions. Input characters from the Keyword, if statement, Nested ifs, if-else-if Ladder, Switch Statement, Nested switch statements, for Loop, Enhanced for Loop, While Loop, do-while Loop, Use break, Use continue, Nested Loop
UNIT-II Class, Arrays, String Handling, A Closer Look at Methods and classes 10 Hours Class :Class Fundamentals, Objects Creation, Reference Variables and Assignment, Methods, Returning from a Method, Returning Value, Using Parameters, Constructors, Parameterized Constructors, The new operator Revisited, Garbage Collection and Finalizers, this Keyword. Arrays: Arrays, Multidimensional Arrays, Alternative Array Declaration Syntax, Assigning Array References, Using the Length Member, The For-Each Style for Loop, Strings, The Bitwise operators. String Handling: String Fundamentals, The String Constructors, Three String-Related Language Features, The Length () Method, Obtaining the characters within a string, String comparison, using indexOf() and lastIndexOf(), Changing the case of characters within a String, StringBuffer and StringBuilder. A Closer Look at Methods and Classes: Controlling Access to Class Members, Pass Objects to Methods, How Arguments are passed? Returning Objects, Method Overloading, Overloading Constructors, Recursion, Understanding Static, Introducing Nested and Inner Classes, Varargs: Variable- Length Arguments.
UNIT-III Inheritance , Interfaces , Packages and Exception Handling 10 Hours Inheritance:Basics, Member Access and Inheritance, Constructors and Inheritance, Using super to Call Superclass constructors, Using super to Access Superclass Members, Creating a Multilevel Hierarchy, When are Constructors Executed, Superclass References and Subclass Objects, Method Overriding,
SYLLABUS 2015 – 2018 Page 7
Overridden Methods support polymorphism, Why Overridden Methods? Using Abstract Classes, Using final, The Object Class. Interface :Fundamentals, Creating an Interface, Implementing an Interface, Using Interface References, Implementing Multiple Interfaces, Constants in Interfaces, Interfaces can be extended, Nested Interfaces, Final Thoughts on Interfaces. Package :Fundamentals, Packages and Member Access, Importing Packages, Static Import. Exception Handling: Fundamentals, The Exception Hierarchy The Consequences of an Uncaught Exception, Exceptions Enable you to handle errors gracefully, using Multiple catch clauses, Catching subclass Exceptions, try blocks can be nested, Throwing an Exception, A Closer look at Throwable, using finally, using throws, Java‘s Built-in Exceptions, New Exception features added by JDK 7, Creating Exception Subclasses.
UNIT-IV Multithreaded Programming, Enumerations, Auto boxing, annotations and Generics 12 Hours Multithreading Programming: fundamentals, The Thread Class and Runnable Interface, Creating Thread, Creating Multiple Threads, Determining When a Thread Ends, Thread Priorities, Synchronization, using Synchronization Methods, The Synchronized Statement, Thread Communication using notify(), wait() and notify All(), suspending, Resuming and stopping Threads. Enumerations: Java Enumeration are class types, The Values ( ) and Valueof( ) Methods, constructors, methods, instance variables and enumerations, Auto boxing, Annotations metadata. Generics: Fundamentals Bounded Types, Generic Methods, Generic Constructors, Some Generic Restrictions. UNIT-V Applets, Swing Fundamentals, Networking with Java.net and exploring Swing Controls and collection Frame work 10 Hours Applet: basics, A complete Applet Skeleton, Applet Initialization and Termination, A key Aspect of an Applet Architecture, Requesting Repainting, using the status window, Passing parameters to Applets. Swing: The origin and Design philosophy of swing, Components and containers, Layout managers, A first simple swing Example, Event Handling, JLabel and ImageIcon, The Swing Buttons, Trees. Networking: fundamentals, The Networking classes and Interfaces, The InetAddress class, The Socket Class, The URL class, The URLConnection Class, The HttpURL Connection Class. Collections Overview:The Collection Interfaces, The collection Classes. The Arrays Class.
Text Books: 1. Java Fundamentals, A comprehensive Introduction by Herbert Schildt, Dale Skrien. Tata McGraw Hill Edition 2013. (Chapters: 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,17,18,22,23,24,25,26) 2. Herbert Schildt ― The complete reference Java ― Seventh Edition, TMH
Reference Book: 1. Programming with Java by T.V.Suresh Kumar, B.Eshwara Reddy and P.Raghavan, Sangwine Technical Publishers, 2011.
Course outcomes On completion of this course, the students should be able to
Demonstrate the basic constructs of Java programming Demonstrate the Inheritance, Method Overriding. Create Packages, Interfaces, Exceptions for real time application Demonstrate Enumerations, Wrappers, Autoboxing, Generics Implement the concepts of event handling, Collection framework and Networking concepts
SYLLABUS 2015 – 2018 Page 8
Course Code: P15MCA33 Semester : III L-T-P: 4 – 0 - 0 Course Title : Software Engineering Credits:4 Contact Period : 52 Hr, Exam: 3Hr Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand different types of process models used in Software Engineering, the Agile method and Extreme programming of Software Engineering. Explain different types of software requirements and dependability issues. Apply system models, Architectural Design, ,System organization and object oriented design using UML. Understand the concept of Component-based , Distributed Software engineering and Risk management, Managing people, Teamwork Explain the concept of Project scheduling, Estimation Techniques and Software Testing in Project management.
Course Contents
UNIT-I Overview, Software Process and Agile Software Development 10 Hours Introduction: Professional Software Development, Attributes of good software, software engineering diversity, IEEE/ ACM code of software engineering ethics, case studies. Software Process models: waterfall, incremental development, reuses oriented, Process Activities, The rational Unified process. Agile Software Development: Agile methods, Plan-driven and agile Development, Extreme Programming, Agile project management, Scaling agile methods.
UNIT-II Requirements Engineering, Dependability and security 10 Hour Requirements Engineering: Functional and non-functional requirements, The software requirements document, Requirements specification, Requirements engineering processes, Requirement elicitation and analysis, Requirements validation, Requirements management. Dependability and security: Dependability properties, availability and reliability, safety and security.
UNIT-III System Modeling, Architectural Design, Design and implementation 10 Hours System Modeling: Context models, Interaction models, Structural models, Behavioral models, Model- driven Engineering. Architectural Design: Architectural Design decision, architectural patterns, architectural views. Design and implementation: object oriented design using UML, design patterns, implementation issues.
UNIT-IV Component-based, Distributed software engineering and project management 12 Hours Component-based software engineering: Components and component model, CBSE process, Component composition. Distributed Software engineering: Distributed system issues, Client-server computing, Architectural patterns for distributed systems. Project Management: Risk Management, managing people, Team work.
SYLLABUS 2015 – 2018 Page 9
UNIT-V Project Planning and software Testing 10 Hours Project Planning: software pricing, plan driven development, Project scheduling, Estimation Techniques, project duration and staffing. Software Testing: Unit testing, component testing, system testing, user testing.
Text Book: 1. Ian Sommerville : Software Engineering, 9th edition, Person Education Ltd, 2011. (Chapters-: 1, 2, 3, 4, 5, 6,7,8,11,17, 18,22, 23)
Reference Books: 1. Pankaj Jalote, Software Engineering Wiley India Pvt. Ltd. (2010) 2. Roger S Pressman: Software Engineering-A Practitioners approach, 6th edition, McGraw-Hill, 2010. 3. Hans Van Vliet: Software Engineering Principles and Practices, 3rd Edition, Wiley-India, 2010
Note : At the end of the course students should come out with case study which covers software development life cycle phases. It carries a Weightage of 20% of CIE.
Course outcomes On completion of this course, the students should be able to
Identify various types of software process and significance of software process activities. Able to Distinguish between different types of software requirements. Analyze different system models and architectural models. Describe concept of Component-based , Distributed Software engineering and team work Apply the concept of Project scheduling, Estimation Techniques and Software Testing
SYLLABUS 2015 – 2018 Page 10
Course Code: P15MCA34 Semester : III L-T-P: 3 – 2 - 0 Course Title : Computer Graphics Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the basics of Application Programming Interface (API) implementation in OpenGL. Understand the mathematical and theoretical principles of computer graphics Discuss the device-level algorithms for implementing OpenGL primitives. Describe 2D and 3D Geometric transformations of an Object. Demonstrate the Design of 2D and 3D Viewing transformation using different algorithms of an object. Outline of the basic Sequence and techniques of Computer animation. Describe mathematical specification of Bezier Spline Cueves.
Course Contents
UNIT-I Graphics Output Primitives and Attributes 10 Hours Introduction to open GL, Coordinate reference frames, Specifying two dimensional world coordinate reference frame in Open GL, Open GL point functions, Open GL line functions, Line drawing algorithms, Circle generation algorithms, Ellipse generation algorithms, Fill area primitives, Polygon fill areas, OpenGL polygon fill area functions, General scan line polygon fill algorithm, Fill methods for areas with irregular boundaries, Open GL fill area attribute functions.
UNIT-II Two – Dimensional and Three - Dimensional Geometric Transformations 12 Hours Basic two dimensional geometric transformations, Matrix representations and homogeneous coordinates, Inverse transformations, Two dimensional composite transformations, Other two dimensional transformations. Three dimensional Translation, Rotation, Scaling, Other three dimensional transformations, Affine transformations, Open GL geometric transformation functions.
UNIT-III Two Dimensional Viewing 10 Hours The two dimensional viewing, Clipping window, Normalization and viewport transformations, Clipping algorithms, Two dimensional point clipping, Two dimensional line clipping algorithms, Polygon fill area clipping, Curve clipping, Text clipping.
UNIT-IV Three Dimensional Viewing 10 Hours The three dimensional viewing concepts, Three dimensional viewing pipeline, Three dimensional viewing coordinate parameters, Transformation from world to viewing coordinates, Projection transformations, Orthogonal projections, Oblique parallel projections, Perspective projections, The viewport transformation and three dimensional screen coordinates.
UNIT-V Curves and Computer Animation 10 Hours Bezier spline curves, Raster methods for computer animation, Design of animation sequences, Traditional animation techniques, General computer animation functions.
SYLLABUS 2015 – 2018 Page 11
Text book: 1. Donald Hearn, M.Pauline Baker, Computer Graphics with Open GL, Pearson (Indian Edition), Fourth Edition. Chapters and topics [2.9, 3.1-3.5, 3.9, 3.10, 3.14-3.16, 4.10, 4.13, 4.14, 5.1-5.5, 5.10-5.15, 5.17, 6.1-6.3, 6.5-6.10, 7.1-7.9, 8.10, 13.1-13.4]
Reference Books: 1. Edward Angel, ‗Interactive Computer Graphics‘ – A top down approach using Open GL, Pearson, Fifth Edition 2. Peter Shirley, Steve Marschner, 'Computer Graphics, Cengage Learning (Indian edition), 2009.
Course outcomes On completion of this course, the students should be able to:
Explain the basic concepts of Computer graphics interfaces in OpenGL to draw simple objects. Analyze line drawing, clipping algorithms and rasterization techniques and interaction with input devices. Develop mathematical transformations and vector techniques in the production of computer graphics. Identify and apply different types of viewing. shading and projections to create 2D or 3D images in OpenGL. Construct a scene and generate views of the scene by applying suitable viewing transformation algorithms. Explain the sequence and teachniques of computer animation. Design a curve using Bezier Spline Curves specification in mathematically.
SYLLABUS 2015 – 2018 Page 12
Elective Group-I
Course Code: P15MCA351 Semester : III L-T-P: 4 – 0 - 0 Course Title : Accountancy and Financial Management Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the basic accounting concepts and the process of preparation of Trial Balance. Apply the knowledge of Ratio Analysis, Liquidity Ratios, Leverage Ratios. Explain fundamentals of Funds Flow and Cash Flow Statements and nature of cost accounting. Understand the various Classification of Budgets, Fixed and Flexible Budgets. Identify and Apply importance of working capital management and make them learn to estimate the working capital needs and capital budgeting process of firms.
Course content
UNIT-I Financial Accounting and Final Accounts 12 Hours Financial Accounting : An Overview - Accounting Concepts. Principles & Standards, Journals, Ledger Posting, Trial Balance Final Accounts: Trading Account, Profit and Loss Account, Balance sheet(Simple Problems)
UNIT-II Financial Statement Analysis 10 Hours Financial statements - Introduction, Uses of Financial Analysis, Nature of Ratio Analysis, Liquidity Ratios, Leverage Ratios, Activity Ratios, Profitability Ratios, Du Point Analysis
UNIT-III Funds Flow, Cash Flow statements and Fundamentals of Cost Accounting 10 Hours Funds Flow, Cash Flow statements: Meaning, uses, and limitations of Funds Flow and Cash Flow Statements, Preparation of Funds Flow and Cash Flow Statements (Simple problems). Fundamentals of Cost Accounting: Nature of Cost Accounting, Objectives, Advantages of Cost Accounting, Methods of Costing, Types of costing, Elements of Cost, Fixed, Variable and Mixed cost, Cost Sheet or Cost Statement.
UNIT-IV Variable (Marginal)Costing and Profit Planning, Budgetary Control 10 Hours Costing, Marginal Costing, Differences between Absorption Costing and Marginal Costing, CVP Analysis, Break-even analysis, Break-even Chart, Utility of CVP Analysis, Budgetary control - Meaning, Budgetary control as a management tool, Limitations, Classification of Budgets, Fixed and Flexible Budgets.
UNIT-V Working Capital Management and Capital Budgeting 10 Hours Concept of Working Capital, Determinants of Working Capital, Estimating Working Capital Needs, Financing Current Assets. Capital Budgeting: Nature of Investment Decisions, Investment Evaluation Criteria Capital Budgeting Process, PBP, ARR, NPV, PI, IPR, NPV VS. IRR.
SYLLABUS 2015 – 2018 Page 13
Text Books: 1. Accounting for Management, Jawahar Lal, 4th Edition, Himalaya Publishing, 2006. Chapters: 1,2,3,4,5,6,7,10,11,12,13,24,25,27 2. Financial Management, I M Pandey, 9th Edition, Vikas Publishing, 2005. Chapters: 8, 25, 27
Reference Books: 1. Financial and Management Accounting, S N Maheshwari, SultaChand & Sons, 2005. 2. Accounting for Management, Richard M Lynch, and Robert' W Williamson, 3rd Edition, Tata McGraw Hill, 2006. 3. Accountancy, Sukhla Grewal, 1 st Edition, Sultan Chand & Sons, 2007. 4. Advanced Accounting, R Gupta and Radha Swamy, 10th Edition, Sultan Chand & Sons, 2001.
Course outcomes On completion of this course, the students should be able to: : Understand to Prepare books of accounts for a given set of business transaction and prepare the Financial Statement of sole trading concerns and companies. Understand to analyse ratio analysis, liquidity ratio. Understand to Prepare Fund Flow Statement, Cash Flow Statement and calculate various ratios for analysis of financial statements and interpret the financial reports of sole trading concern and companies. Demonstrate the understanding of fundamentals of cost and variable costing Identify and understand the working capital requirements.
SYLLABUS 2015 – 2018 Page 14
Course Code: P15MCA352 Semester : III L-T-P: 4 – 0 - 0 Course Title : System Software Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the need of system software and application software and the object code generation in SIC and SIC/XE machines. Learn the data structures, dependent and independent assembler features and also various types of assemblers. Explain the different types loaders and loader design options. Understand the functions of macro processor, data structures used and also independent features and design options of macro processor. Analyze the LEX regular expressions, Yacc grammars and design the programs.
Course Content
UNIT-I 10 Hours Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples. Editors And Debugging Systems: Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts of The System, User-Interface Criteria.
UNIT-II 12 Hours Assemblers: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation.Machine Independent Assembler Features – Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking, Assembler Design Options - One-Pass Assembler, Multi-Pass Assembler, Implementation Examples - MASM Assembler.
UNIT-III 10 Hours Loaders and Linkers: Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders, Implementation Examples - MS-DOS Linker.
SYLLABUS 2015 – 2018 Page 15
UNIT-IV 10 Hours Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General- Purpose Macro Processors, Macro Processing Within Language Translators, Implementation Examples - MASM Macro Processor. UNIT-V
10 Hours Lex and Yacc: Lex and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables, Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The Rules Section, Running LEX and YACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word Counting Program, Parsing a Command Line.Using YACC – Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.
Text Books: 1. Leland.L.Beck, System Software, 3rd Edition, Pearson Education, 1997. (Chapters 1.1 to 1.3, 2 (except 2.5.2 and 2.5.3), 3 (except 3.5.2 and 3.5.3), 4 (except 4.4.3)) 2. John.R.Levine, Tony Mason and Doug Brown, Lex and Yacc, O'Reilly, SPD, 1998. (Chapters 1, 2 (Page 2-42), 3 (Page 51-65))
Reference Book: 1. D.M.Dhamdhere, System Programming and Operating Systems, 2nd Edition, Tata McGraw - Hill, 1999.
Course outcomes On completion of this course, the students should be able to:
Describe the SIC and SIC/XE architectures and design the programs. Generate the object program by applying assembler algorithms. Explain the working of different types of loaders Analyze the concepts of macro processor and its functions Design the programs using LEX and Yacc.
SYLLABUS 2015 – 2018 Page 16
Course Code: P15MCA353 Semester : III L-T-P: 4 – 0 - 0 Course Title : Basics of MIS & E-Commerce Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand students with basic concepts of information, systems and system development model Discuss the differentiate between data, information and knowledge Understand system development life cycle (SDLC) Identify and describe internet, intranet and extranet and discuss how organizations are using them Discuss various information system solutions like ERP, CRM, HRM and the issues in successful implementation of these technology solutions in any organization Understand the fundamentals, scope and trends of E-commerce
Course Contents
UNIT-I Systems Engineering and Technology of Information System 10 Hours System concepts, system control, types of systems, handling system complexity, Classes of systems, General model of MIS, Need for system analysis, System analysis for existing system & new requirement, system development model, MIS & system analysis. Introduction: Data processing, Transaction processing, Application processing, Information system processing, TQM of information systems, Human factors & user interface, Strategic nature of IT decision, MIS choice of information technology.
UNIT-II Information, Knowledge and Introduction of MIS 10 Hours Information concepts, classification of information, methods of data and information collection, value of information, information: A quality product, General model of a human as information processor, Knowledge. MIS: Concept, Definition, Role of the MIS, Impact of MIS, MIS and the user, Management as a control system, MIS support to the management, Management effectiveness and MIS, Organization as system. MIS: organization effectiveness.
UNIT-III Developing Business/IT Strategies/IT Solutions, Decision Making and DSS 10 Hours Planning fundamentals (real world cases), Organizational planning, planning for competitive advantage (SWOT Analysis), Business models and planning. Business/IT planning, identifying business/IT strategies, Implementation Challenges, Change management. Developing business systems (real world case), SDLC, prototyping, System development process, implementing business system . Decision making concepts: decision making process, decision-making by analytical modeling, Behavioral concepts in decision making, organizational decision-making. DSS: Decision structure, DSS components, Management reporting alternatives.
SYLLABUS 2015 – 2018 Page 17
UNIT- IV Client Server Architecture, E-business Technology and Electronic business system 12 Hours Client server architecture, implementation strategies.Introduction to E-business, model of E-business, internet and World Wide Web, Intranet/Extranet, Electronic, Impact of Web on Strategic management, Web enabled business management, MIS in Web environment. Enterprise business system – Introduction, cross-functional enterprise applications, real world case, Functional business system, - Introduction, marketing systems, sales force automation, CIM, HRM, online accounting system. Customer relationship management, ERP, Supply chain management (real world cases for the above)
UNIT-V E-commerce system 10 Hours E-commerce fundamentals: introduction E-commerce, scope of E-commerce, Essential E-commerce processes, Electronic payment processes. E-commerce applications and issues: E-commerce applications trends, Business to customer E- commerce, web store requirements, Business to Business E-commerce, E-commerce market places, clicks and bricks in E-commerce.
Text Books: 1. Waman S Jawadekar, Management Information System, 3rd Edition, Tata McGraw Hill. (Chapters: 1, 6, 7,8,16,18,20) 2. James A O‘Brien and George M Marakas, Management Information System, 7th Edition, Tata McGraw Hill, 2006.(Chapters: 7,8,9,10, 11, 12)
Reference Books: 1. Ralph M Stair and George W Reynolds, Principles of Information Systems, 7th Edition, Cengage Learning, 2010 . 2. Steven Alter, Information Systems - The Foundation of E-Business, 4th Edition, Pearson Education, 2001 3. Mahadeo Jaiswal and Monika Mital, Management Information System, , Oxford University Press. 4. Effy Oz, Management Information Systems, 5th Edition, Cengage Learning, 2006.
Course outcomes On completion of this course, the students should be able to:
Understand concepts of systems, information, data and knowledge Implement SDLC life cycle for real time problems Know about the internet, intranet and extranet Select the particular information system solutions like ERP, CRM, HRM Understand the importance of E-commerce
SYLLABUS 2015 – 2018 Page 18
Course Code: P15MCA354 Semester : III L-T-P: 4 – 0 - 0 Course Title : Graph Theory and Combinatorics Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Develop the ability to identify different types of graphs, and simple applications of graphs Understand planar, dual graphs and their importance with chromatic number and chromatic polynomial of a given graph. Learn different types of trees,Apply Dijkstra‘s algorithm to find the shortest path from single source to all other vertices. Prim‘s and the Kruskal‘s algorithm to construct the minimal spanning trees. Apply the principles of inclusion and exclusion theorem, generalization principle for the given problem with generating functions. Learn methods to solve simple recurrence relations of second and third order.
Course contents
UNIT-I 10 Hours Introduction to Graph Theory : Definitions and examples, finite and infinite graphs ,sub graphs, Operations on graphs, complements, and Graph isomorphism, Vertex degree, Euler Trails and circuits ,complements, , Hamilton paths and cycles. Application of Graphs-Konigsberg Bridge problem, Travelling salesmen problem ,Utility problem, Seating arrangement problem.
UNIT–II 11 Hours Planar graphs, Kuratowski‘s two graphs, different representations of a planar graphs, Eulers formula, Detection of planarity.Geometric dual ,Geometric dual . Cutsets, some properties of a cut-set Graph colouring, chromatic number, chromatic partitioning and chromatic polynomials.
UNIT–III 11 Hours Trees: Definitions, properties, and examples, rooted trees, trees and sorting, Weighted trees and prefix codes. Optimization: Dijkstra's shortest path algorithm, minimal spanning trees - The algorithms of Kruskal and Prim, Transport networks - Maxflow,Min-cut theorem
UNIT–IV 10 Hours The principle of inclusion and exclusion: The principle of inclusion and exclusion, Generalizations of the principle, derangements, Nothing is in its right place, Rook polynomials. Generating functions: Introductory examples, Definition and examples– calculational techniques, partitions of integers, The exponential generating function,The summation operator.
SYLLABUS 2015 – 2018 Page 19
UNIT–V 10 Hours Recurrence relations: First order linear recurrence relation, the second order linear homogeneous recurrence relation with constant coefficients, Third and higher –order Homogeous Recurennce relations,The non homogeneous recurrence relation, The method of generating functions for second order recurrence relations.
Text Books : 1. Discrete and Combinatorial Mathematics, Ralph P.Grimaldi &B.V.Ramana ,5th Edition, PHI/Pearson education. 2. Graph Theory with Applications to Engineering and Computer Science - Narsing Deo.
Reference Books : 1. Graph Theory and Combinatorics , Dr. D.S. Chandrasekharaiah, Prism, 2005. 2. Introduction to Graph Theory, Chartrand Zhang, TMH, 2006.
Course outcomes On completion of this course, the students should be able to:
Identify different parameters of graphs and its applications. Understand planar graphs and its properties of a given properties to detect planarity of a given graph. Apply optimization techniques to construct a minimal spanning tree of a graph, prefix code for a given message. Apply and understand the principle of Inclusion and Exclusion, generating functions to solve the given problem. Solve simple recurrence relation of second and third order.
SYLLABUS 2015 – 2018 Page 20
Course Code: P15MCA355 Semester : III L-T-P: 4 – 0 - 0 Course Title : Business Data Processing Using COBOL Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the structure, syntax and semantics of COBOL programs and also understand the purpose of all divisions Select the most common COBOL verbs in their various forms for different problem statements Use all types of conditions and perform statements Discuss basic file concept, different types of file processing and Report writer Implement basic problems statement and file handling in the COBOL program
Course Contents
UNIT-I Introduction, Identification, Environment and Data Division 10 Hours Coding Format for COBOL Programs, Structure of a COBOL Program, Character Set, COBOL words, Data Names and Identifiers, Literal, Figurative Constants, Continuation of lines and notations. General Formats, Configuration Section, Input-Output Section, Level Structure, Data Description entries, Picture Clause, Value Clause, File Section, Working–storage Section, Editing characters of different data and examples, Special–names Paragraph, Classes and Categories of Data
UNIT-II Procedure Division and Basic Verbs, Different Types of Clauses and other Verbs 11 Hours Structure of the Procedure Division, Data Movement Verb and other options of Move Statements, Arithmetic Verbs, Sequence Control Verbs, Input and Output Verbs, Conditional Verb: simple IF, categories of COBOL statements. Usage Clause, Synchronized Clause, Justified Clause, Redefines Clause and Renames Clause, Qualification of Data Names, Sign Clause, Elementary and Group Moves, Corresponding Option: Move Corresponding, Add Corresponding and Subtract Corresponding, Rounded Option, On Size Error Option, Compute Verb
UNIT-III Computation and Decision Making , Array Processing and Table Handling 11 Hours Interactive Processing using Screen Sections, Intrinsic Functions, Conditions: Relational Condition, Class Condition, Condition Name Condition, Negated Simple Condition, Compound Condition, Sign Condition, If Statements, Alter Statement, Perform Statements, Exit Statement. Occurs Clause and Subscripting, assigning values to table elements, Multi Dimensional Tables, Perform and Table Handling, Indexed Tables and Indexing, Set Verb, Search Verb, Occurs Depending Clause, Index data item
UNIT-IV Sequential File Processing, Sorting and Merging of Files 10 Hours File Characteristics, File Control Entries, File Description, Statements for Sequential Files, Sequential File with Variable Length Records, I-O Control Paragraph, Simple Sort Verb, File updation, Variation of updation, simple Merge Verb, Input and Output Procedure in Sort Statement, Merge Verb with Output Procedure
SYLLABUS 2015 – 2018 Page 21
UNIT-V Indexed and Relative File Processing, Report Writer, and Subroutines 10 Hours File Control Paragraph for Relative Files, Procedure Division Statements for Relative Files, Indexed Sequential Files, General Format of a Report, File Section, Report Clause, Outline of Report Section, Report Section - Report Description Entry, Report Group Description, Procedure Division Statements, Sample Program, Structure of a COBOL Subroutine, Calling of a Subroutine, State of Subroutine and Cancel Statement, Advantages and Disadvantages of COBOL Subroutines
Text Books: 1. M K Roy and D Ghosh Dastidar, COBOL Programming Including MS COBOL and COBOL-85, 2nd Edition, Tata McGraw Hill, 2001. (Chapters: 3.1 to 3.10,4.1, 4.2, 5.1 to 5.7, 6.1 to 6.7, 8.1 to 8.7, 9.1 to 9.5, 10.1 to 10.6, 11.1 to 11.10, 13.1 to 13.4, 13.6, 14.1 to 14.7, 16.1, 16.2, 18.1 to 18.7, 19.1 to 19.6) 2. Nancy Stern and Robert A Stern, Structured COBOL Programming, 11th Edition, Willey Publications, 2006. (Chapters: 1, 6, and 7)
Reference Books: 1. Shelly Cashman Foreman, Structural COBOL Programming, 2nd Edition, Thomson Course Technology. 2. David M. Collopy, Introduction to COBOL, A Guide to Modular Structured Programming, Pearson Education, 2000.
Course outcomes On completion of this course, the students should be able to:
Understand the basic concepts of COBOL programs Implement COBOL verbs for specific problem statement Identifies suitable condition and implement perform statements for the given problems Implement COBOL programs based on the file concept Compiles, executes and debug a COBOL program
SYLLABUS 2015 – 2018 Page 22
Course Code: P15MCA36 Semester : III L-T-P: 0 – 0 - 2 Course Title : Computer Networks Lab Credit:1 Contact Period :26 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objective (CLO): The objectives of the course are to :
Understand the fundamental concepts of computer networking. Understand data transformation and data transmission. Discuss various inter networking devices and transmission of data in inter-networks using routing algorithms Distinguish various LANs
List of Programs
1.Write a TCL script to simulate the network described below
Consiser a small network with five nodes n0, n1, n2, n3, n4 forming a star topology. The node n4 is at the center. Node n0 is a TCP source, which transmits packets to node n3 (a TCP sink) through the node n4. Node n1 is another traffic source and sends UDP packets to node n2 through n4. The duration of the simulation time is 10 seconds.
Write a TCL script to simulate the scenario.
2. Write a TCL script to simulate a file transfer with ns2
Consider a client and a server. The server is running a FTP application (over TCP). The client sends a request to download a file of size 10 MB from the server. Write a script to simulate this scenario. Let node #0 be the server and node #1 be the client. TCP packet size is 1500 B. Assume typical values for other parameters.
Note: This simulation require transfer of fixed size file. Therefore, time required for the transfer would be constant for a given bandwidth of a link. To verify this, determine the time that would roughly be required for the transfer. Then look at the bottom of the trace file and verify whether there is any transmission beyond the time calculated. To verify that the client has downloaded the entire file, plot the ―Bytes Received‖ curve for node #1. The y-axis is in Kbits. Convert it to MB and verify whether it approximates the specified file size. TCP headers would effectively increase the count of received bytes at node #1.
3. Setting up a local area network with ns2
In this excercise you will be simulating a CSMA/CD based LAN with ns2. Consider the LAN with seven nodes to be an isolated one i.e. not connected to the Internet. Node # 0 in the LAN act as a UDP traffic source, and node #6 is the destination node. Assume CBR traffic to be flowing between the nodes. The simulation lasts for 25 seconds. In the Ethernet a packet is broadcasted in the shared medium, and only the destination node accepts the packet. Other nodes simply drop it. What should be the number of hops a packet from node # 0 to node # 6 travel?.
SYLLABUS 2015 – 2018 Page 23
4. Simulating link errors.
Here node # 2 act as a router. Any traffic to or from the LAN passes through it. Consider node #1 running a FTP server, and node #5 is downloading a file of size 4 MB. However, the link between node #2 and #3 is fault. It drops packets with a fixed probability of 0.2. Implement a link error model to reflect this.
It may be noted here that the file download time will be more than we had in exercise #2 of experiment #1. Try different values of the simulation time to ensure that the file has been entirely transferred. Is the plot of bytes received a linear curve or non-linear? Why?
Presence of link errors cause one or more packets to be retransmitted. Verify this from the ―Packet Retransmissions‖ plot.
5. Measuring Network Performances
Bottleneck in the network
Consider a dumbbell topology with eight nodes as shown in the following figure. Consider nodes #2 and 3 to be two routers connecting two different networks. When the bandwidth of the link 2-3 is much lower than the sum of bandwidths of the other links in the network, it act as a bottleneck.
SYLLABUS 2015 – 2018 Page 24
Assume node#0 running FTP application (over TCP) and sending data to node #6. Node #1 is sending CBR data to node #7. Assume all the links except 2-3 has a bandwidth of 1Mb, propagation delay of 10ms and queue type as DropTail. (All are duplex links)
Tasks:
• The link 2-3 has a propagation delay of 10ms. Vary it‘s bandwidth from 0.5Mb tp 2.5Mb in steps of 0.25Mb.
• Compute the throughput for node#3 in each case.
• Plot the throughput vs bandwidth data in the ―custom plot‖ section below
Based on the above plots, suggest what should be the recommended bandwidth of the link 2-3. Now plot the end-to-end delay between nodes 0 and 6 for the above chosen values of link 2-3 bandwidth. Revisit your previous answer (i.e. optimum bandwidth of link 2-3) based on these graphs.
6. Measuring Network Performances
Bandwidth Sharing between TCP and UDP
Consider the dumbbell topology from our previous excercise:
Node #0 is a TCP source, and the corresponding sink is at node #6. Node #1 is a UDP source(CBR traffic) with a null agent attached to node #7. Those two traffic flows the common link 2-3. The aim of this exercise is to examine how TCP and UDP share the bandwidth between themselves when the rate of CBR traffic is changed.
Set the TCP packet size to 1460 B. The UDP and CBR packet sizes are 1500 B. All the links in the network have same bandwidths (say, 4 Mb), delay and queue types.
Part I:
• Set the initial rate of CBR traffic to 0.5 Mb. Run the simulation, and plot the "Bytes Received" by node # 4 and 5 (sinks for TCP and UDP traffic)
SYLLABUS 2015 – 2018 Page 25
• Now, increment the rate up to 4 Mb, the link bandwidth, in steps of 0.5 Mb. Run the simulation and plot the graphs again.
How does the graphs change after each run? In particular, What's the nature of the graphs when the rate of CBR traffic is 50% of the bandwidth?
Part 2: Behaviour of UDP
Reduce the bandwidth of the link 2-3 to say, 2 Mb. Repeat the above steps and observe the graphs in this case. From the graphs plotted observe how UDP occupies a larger portion of the bandwidth. How does the behaviour change for other variations of TCP (Newreno) ?
Course outcomes On completion of this course, the students should be able to:
Describe basic terminologies used for computer networking. Implement the network topologies using NS2 simulator Demonstrate various protocols like FTP, UDP. Demonstrate the working of Wired and Wireless LANs.
SYLLABUS 2015 – 2018 Page 26
Course Code: P15MCA37 Semester : III L-T-P: 0 – 0 - 3 Course Title : Java Programming Lab Credits:1.5 Contact Period : 39 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand and apply Constructor Overloading and Overriding for a given problem statement Identify Standard String class and Array Class methods Choose appropriate fundamental concepts interface, exception handling and overriding for real time application Understand and apply multithreading programming for given problem Identify the front end GUI tools applet, swing and develop networking programs
List of Programs 1 Write a JAVA Program to demonstrate Constructor overloading and Method Overloading. 2 Write a JAVA Program to implement Inner class and demonstrate its Access protection. 3 Write a program in Java for String handling which performs the following: i) Checks the capacity of StringBuffer objects. ii) Reverses the contents of a string given on console and converts the resultant string in upper case. iii) Reads a string from console and appends it to the resultant string of ii. 4 Write a JAVA Program to demonstrate Inheritance. 5 Simple Program on Java for the implementation of Multiple inheritance using interfaces to calculate the area of a rectangle and triangle. 6 Write a JAVA program which has i. A Class called Account that creates account with 500Rs minimum balance, a deposit() method to deposit amount, a withdraw() method to withdraw amount and also throws LessBalanceException if an account holder tries to withdraw money which makes the balance become less than 500Rs. ii. A Class called LessBalanceException which returns the statement that says withdraw amount ( Rs) is not valid. iii.A Class which creates 2 accounts, both account deposit money and one account tries to withdraw more money which generates a LessBalanceException take appropriate action for the same. 7 Write a JAVA program using Synchronized Threads, which demonstrates Producer Consumer concept. 8 Write a JAVA program to implement a Queue using user defined Exception Handling (also make use of throw, throws.). 9 Complete the following: 1. Create a package named shape. 2. Create some classes in the package representing some common shapes like Square, Triangle, and Circle. 3. Import and compile these classes in other program. 10 Write a JAVA Program Create an enumeration Day of Week with seven values SUNDAY through SATURDAY. Add a method is Workday( ) to the DayofWeek class that returns true if the value on which it is called is MONDAY through FRIDAY.
SYLLABUS 2015 – 2018 Page 27
For example, the call DayOfWeek.SUNDAY.isWorkDay ( ) returns false. 11 Write a JAVA program which has
A Interface class for Stack Operations A Class that implements the Stack Interface and creates a fixed length Stack. A Class that implements the Stack Interface and creates a Dynamic length Stack. A Class that uses both the above Stacks through Interface reference and does the Stack operations that demonstrates the runtime binding. 12 Write a JAVA program to print a chessboard pattern. 13 Write JAVA programs which demonstrates utilities of LinkedList Class. 14 Write a JAVA program which uses Datagram Socket for Client Server Communication. 15 Write a JAVA applet program, which handles keyboard event
Students have to solve the above programs, also they have to develop small application using java in a team and have to submit a report along with a code. Small application carries a weightage of 50% of CIE.
Course outcomes On completion of this course, the students should be able to:
Illustrate the concepts of Inheritance, Method Overriding Demonstrate the access protection in Java Programming Implement Packages and Multithreading for real time application Develop Enumerations, Wrappers, Autoboxing, Generics for given problem Statement Implement event handling, Collection framework and Networking for real world scenarios
SYLLABUS 2015 – 2018 Page 28
Course Code: P15MCA38 Semester : III L-T-P: 0 – 0 - 3 Course Title : Computer Graphics Lab Credits:1.5 Contact Period :39 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand fundamental concepts of the modern computer graphics pipeline. Understand OpenGL primitives to draw geometric objects. Describe 2-D and 3D geometric transformation. Describe transformation viewing based on projection mode in both 2D and 3D. Demonstrate curve using Spline algorithm.
List of Programs
1. Write a C++ OpenGL program to draw a line using Line DDA algorithm. 2. Write a C++ OpenGL program to draw a line using Bresnham's Line algorithm. 3. Write a C++ OpenGL program to draw a circle using Midpoint Circle algorithm. 4. Write a C++ OpenGL Program to draw ellipse using Ellipse Mid-point algorithm. 5. Write a C++ OpenGL Program to create a house like figure and rotate about a given fixed point using OpenGL 2D transformation functions. 6. Write a C++ OpenGL Program using OpenGL functions to draw a simple shaded scene consisting of a teapot on a table. Define suitably the positions and properties of the light source along with the properties of the surfaces of the solid object used in the scene. 7. Write a C++ OpenGL Program to implement Liang-Barsky line clipping algorithm. 8. Write a C++ OpenGL program Cohen-Sutherland Line Clipping Algorithm with Window to viewport Mapping using OpenGL API. 9. Write a C++ OpenGL Program to draw a color cube and allow the user to move the camera to experiment with perspective viewing .Use OpenGL functions. 10. Write a C++ OpenGL program to draw a curve using B-Spline curve algorithm.
Course outcomes On completion of this course, the students should be able to:
Implement the Graphics concepts using OpenGL to draw geometric objects like line, polygon etc. Apply graphics programming techniques to implement computer graphics scenes. Identify algorithm and Design geometric transformation in both 2D and 3D. Implement 2D and 3D viewing models using projection transformation. Design Bezier curve using Spline algorithm. Create interactive graphics applications in C++ with OpenGL tool.
SYLLABUS 2015 – 2018 Page 29
Course Code: P15MHU301 Semester : III L-T-P: 2 – 0 - 0 Course Title : Aptitude and Reasoning Development-BEGINNER(ARDB)*
Credit:1 Contact Period : 32 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Solve the mathematical calculations easily and quickly using the methods of vedic mathematics. Illustrate different examples to learn about percentages effectively. Compare the different types of series. Explain the logic behind solving problems under series such as A.P.,G.P.,H.P. Explain divisibility rules, properties of different types of numbers. Explain methods to find the number of factors and sum of factors. Analyse the concept of power cycle, and find last digit and last two digits. Solve problems involving simple equations and inequalities. Explain Componendo, Dividendo, Invertendo, Alternendo and other terms related to ratio and proportion. Explain the concepts behind the logical reasoning modules such as arrangement, blood relations and Directions.
Course Content
UNIT – I Sharpen your axe!! 8 Hours Vedic mathematics: Viniculum and de- viniculum, subtractions using viniculum . Nikhilum multiplication: For numbers close to base values, multiplication of any two digit numbers or three digits number using criss cross method. Finding the square, square root, cubes, cube root of two digit and three digit numbers quickly. Approximation in multiplication and division. Checking the answer using digital sum method Percentage calculations and ratio comparison Percentage calculations : Percentage rule for calculating , percentage values through additions, percentage– fraction table, approximation in calculating percentages. Application based problems Ratio comparison: calculations method for ratio compressions: 1. the cross multiplication method, 2. percentage value compression method 3. numerator and denominator percentage change method. Method for calculating the value of percentage change in the ratio. Application based problems.
UNIT – II Analytical Reasoning 1: series 6 Hours Number series: Standard patterns of number series, pure series: perfect square, square cube, prime, combination of this series. Difference series, ratio series, mixed series, geometric series, two-tier arithmetic series, three-tier arithmetic series, change in the order for difference series, change in the order for ratio series, sample company questions. Letter series :Alphabet and Alphanumeric series, finding the missing term based on logic learnt in number series module, continuous pattern series, correspondence series. sample company questions. Picture series : image analysis, addition deletion rotation or modification of lines or shapes. Understanding the symmetry of the image. Mirror image analysis. sample company questions.
SYLLABUS 2015 – 2018 Page 30
UNIT – III Number system: 6 Hours Introduction, Integers: Remainder zero concept, Odd and Even Integers, Negative and positive integers, power number ax, properties of a perfect square number. Prime number: General method to identify the prime number, properties of prime numbers. Euler‘s number. Factorial number: Wilson‘s theorem, important results on factorial. Divisor: number of divisors, sum of divisors, number expressed as the product of two factors. Divisibility rules: divisibility of a whole number by a whole number, divisibility of an expression by an expression. Modulus concept: divisibility rules in modulus, rules of operations in modulus. Finding one remainder: One divisor, remainder of (an– bn), remainder for more than one divisor. Unit digit: Concept of power cycle, finding last two digits. Number of trailing zeroes.
UNIT – IV Simple equations, Ratio Proportions and Variations: 6 Hours Simple equations: Linear equations-Linear equations in one variable, linear equation in two variables, Different methods of solving linear equations in two variables– Method of elimination, Method of substitution, Method of cross multiplication. Format of equations that can be converted to linear equations, Linear equations of three variables, Inequalities and its properties. Advanced problems on Simple equations. Age problems. Ratio Proportions and Variations: Understanding the meaning and difference between ratio, proportion and variation. Properties of ratio, Comparison of more than two quantities, Proportion, Properties of proportion - Componendo, Dividendo, Invertendo, Alternendo. Continued proportion, Mean proportion. Variation - Direct variation, Indirect variation, Joint variation, Short cut methods to solve problems on variation.
UNIT – V Building the fundamentals of logical reasoning: 6 Hours Arrangement: Approach to tackle questions, Different types of arrangement– Linear arrangement, Circular arrangement. Selection, Double line map. Possible ways of arrangement– Words or numbers, left side only, right side only, left right alternate, increasing or decreasing order, interchange vs push, Strategy for solutions– some tips for quick answers, general strategy. Directions: Basics. Pythagorean theorem, Pythagorean triplets, Solving problems for practice. Blood relations : Some typical relations that we come across, family tree, Structuring the given problem step by step. Suggested methods– Backtracking, drawing family tree. Problems on blood relations and professions.
Reference Books: 1. The Trachtenberg speed system of basic mathematics, published by Rupa publications. 2. CAT Mathematics by Abhijith Guha. published by PHI learning private limited. 3. Quantitative aptitude by Dr. R. S Agarwal, published by S.Chand private limited. 4. Verbal reasoning by Dr. R. S Agarwal , published by S. Chand private limited. 5. Quantitative aptitude for CAT by Arun Sharma, published by McGraw Hill publication. 6. Analytical reasoning by M.K Pandey BSC PUBLISHING.CO.PVT.LTD
SYLLABUS 2015 – 2018 Page 31
Course outcomes On completion of this course, the students should be able to:
Solve mathematical calculations in less duration compared to the conventional method. L2 Give examples for AP, GP and HP and differentiate between them. L1 Apply divisibility rules , power cycle method and evaluate the significance of the number system module. L2 Point out the errors in the problems concerning inequalities and solve simple equations and problems based on ratio, proportion and variation. L5 Solve the problems based on blood relations, directions and arrangement. L4
SYLLABUS 2015 – 2018 Page 32
Course Code: P15MCA41 Semester : IV L-T-P: 3 – 2 - 0 Course Title : Design & Analysis of Algorithms
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Analyze the asymptotic performance of algorithms. Write rigorous correctness proofs for algorithm. Apply important algorithmic design paradigms and methods of analysis (Brute-Force, Divide- and-conquer, greedy, dynamic etc.) Explain the importance of designing efficient algorithms by comparing different complexity classes. Synthesize efficient algorithm in fundamental areas in computer science and engineering.
Course Content UNIT-I Introduction and the fundamentals of the Analysis of Algorithm Efficiency 12 Hours Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Fundamental data Structures. Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis of Recursive and Non-recursive algorithms.
UNIT-II Brute Force 10 Hours Selection Sort and Bubble Sort, Sequential Search and String Matching, Divide and Conquer Merge-sort, Quick-sort, Binary Search, Binary tree Traversals and related properties.
UNIT-III Decrease-and-Conquer 10 Hours Insertion Sort, Depth First search and Breadth First Search, Topological sorting, Algorithms for Generating Combinatorial Objects. Transform-and-Conquer Presorting, Balanced Search Trees, Heaps and Heap sort.
UNIT-IV Space and Time Tradeoffs 10 Hours Sorting by Counting, Input Enhancement in String Matching, Dynamic Programming Computing a binomial coefficient, Warshall‘s and Floyd‘s Algorithms, The Knapsack Problem and Memory Functions
UNIT-V Greedy Technique 10 Hours Prim‘s Algorithm, Kruskal‘s Algorithm, Dijkstra‘s Algorithm, Huffman Trees Limitations of Algorithm Power and coping with the limitations of algorithmic power Lower Bound Arguments, Decision Trees, P, NP and NP-Complete Problems, Backtracking, Branch- and-Bound.
SYLLABUS 2015 – 2018 Page 33
Text Book: 1. Anany Levitin: Introduction to the Design and Analysis of Algorithms, 2nd edition, Pearson Education, 2003. Reference Books: 1. Coremen T.H., Leiserson C.E., and Rivest R.L.: Introduction to Algorithms, PHI, 1998 2. Horowitz E., Sahani S., Rajasekharan S.: Computer Algorithms, Galgotia Publications, 2001.
Course outcomes On completion of this course, the students should be able to:
Argue the correctness of algorithms. Analyze worst-case, best-case and average-case running times of algorithms. Analyze and compare complexity for different types of algorithm for different types of problems. Design efficient algorithm using standard algorithmic design techniques. .
SYLLABUS 2015 – 2018 Page 34
Course Code: P15MCA42 Semester : IV L-T-P: 3 – 2 - 0 Course Title : Advanced Java Programming
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand and Apply Server Side Programming using Servlet Technology Understand and Apply Server Side Programming using JSP technology Create Package, Describe JDBC process, object for backend applications. Understand Java Beans concepts Describe Enterprise Java Beans. Develop various Java Beans for online applications Understand Server Side Component model as Enterprise Java Bean for variety of applications . Course Content
UNIT-I Servlets 10 Hours Servlet Structure, Servlet packaging, HTMLbuilding utilities, Lifecycle, Single Thread model interface, Handling Client Request : Form Data, Handling Client Request: HTTP Request Headers. Generating server Response: HTTP Status codes, Generating server Response: HTTP Response Headers, Handling Cookies, Session Tracking.
UNIT-II JSP 12 Hours Overview of JSP Technology, Need of JSP, Benefits of JSP, Advantages of JSP, Basic syntax, Invoking java code with JSP scripting elements, creating Template Text, Invoking java code from JSP, Limiting java code in JSP, using jsp expressions, comparing servlets and jsp, writing scriptlets. For example Using Scriptlets to make parts of jsp conditional, using declarations, declaration example. Controlling the Structure of generated servlets: the JSP page directive, import attribute, session attribute, isElignore attribute, buffer and auto flush attributes, info attribute, errorPage and is errorPage attributes, is Thread safe Attribute, extends attribute, language attribute, Including files and applets in jsp Pages, using java beans components in JSP documents.
UNIT-III JDBC, Annotations and Java Beans 12 Hours Talking to Database: Immediate Solutions, Essential JDBC program, using prepared Statement Object, Interactive SQL tool. JDBC in Action Result sets, Batch updates, Mapping, Basic JDBC data types, Advanced JDBC data types, immediate solutions. Packages : Creating Packages, Interfaces, JAR files and Annotations. The core java API package, New java. Lang Sub package, Built-in Annotations. Java Beans: Working with Java Beans. Introspection, Customizers, creating java bean, manifest file, Bean Jar file, new bean, adding controls, Bean properties, Simple properties, Design Pattern events, creating bound properties, Bean Methods, Bean an Icon, Bean info class, Persistence ,Java Beans API.
UNIT-IV Introduction to EJB 10 Hours The Problem domain, Breakup responsibilities, CodeSmart not hard, the Enterprise java bean specification. Components Types. Server Side Component Types, Session Beans, Message Driven Beans, Entity Beans, The Java Persistence Model. Container services. Dependency
SYLLABUS 2015 – 2018 Page 35
Injection, Concurrency, Instance pooling n caching, Transactions, security, Timers, Naming and object stores, Interoperability, Life Cycle Callbacks, Interceptors, platform integration. Developing your first EJB. preparation, Definitions, naming conventions, convention for the Examples, coding the EJB, the contract, the bean Implementation class, out of Container Testing, Integration Testing.
UNIT-V Server Side Component Models 08 Hours The Stateless Session Bean, the Stateful Session Bean, the Singleton Session Bean, Message- Driven Beans. EJB and PERSISTENCE. Persistence Entity manager Mapping Persistence objects, Entity Relationships.
Text Books: 1. Marty Hall, Larry Brown. Core Servlets and Java Server Pages. Volume 1: Core technologies. Second Edition. (Chapter 3,4,5,6,7,8,9,10,11,12,13,14). 2. Ivor Horton‘s Beginning Java 2 JDK 5th edition 3. Herbert Schildt ―The complete reference Java ―Seventh Edition, TMH (Chapter 28,29) 4. Andrew LeeRubinger, Bill Burke. Developing Enterprise Java Components. Enterprise JavaBeans 3.1.O‘reilly. (Chapter 1,2,3,4,5,6,7,8,9,10,11).
Reference Book: 1.Michael Sikora, EJB 3 Developer Guide, A practical guide for developers and architects to the Enterprise Java Beans Standard, Shroff Publishers & Distributors PVT LTD. July 2008.
Course outcomes On completion of this course, the students should be able to:
Develop Web applications using Servlet Technology Develop Web applications using JSP technologies Create Packages, Develop Backend Program using JDBC statements and Java bean for real time applications. Discuss Enterprise Java Beans Concepts Develop Enterprise Java Beans based on Server side component models using Session Bean, Message-Driven Beans
SYLLABUS 2015 – 2018 Page 36
Course Code: P15MCA43 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Object-Oriented Modelling and Design Patterns
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objective (CLO) The objectives of this course are to:
Understand the basic of object oriented concepts Identify various relationship like association, aggregation, composition and generalization Based on Rumbaugh approach construct various UML models including use case diagrams, sequence diagrams, class diagrams, state diagrams and activity diagrams Discuss properties and functions of system design and class design for the ATM as a case study Understand properties, function and standard categories of patterns along with case studies
Course Content
UNIT-I Introduction, Modeling Concepts, Class Modeling and Advanced Class Modeling 10 Hours What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO development; OO modeling history. Modeling as Design Technique: Modeling; abstraction; The three models. Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models; Practical tips. Advanced object and class concepts; Association ends; N-array associations; Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages; Practical tips.
UNIT-II State Modeling and Advanced State Modeling 10 Hours State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Practical tips. Advanced State Modeling: Nested state diagrams; Nested states; Signal generalization; Concurrency; A sample state model; Relation of class and state models; Practical tips.
UNIT-III Interaction Modeling, Advanced Interaction Modeling, Process Overview, System Conception and Domain and Application analysis 10 Hours 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. 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.
UNIT-IV System Design and Class Design 10 Hours Overview of system design; Estimating performance; Making a reuse plan; Breaking a system into sub- systems; Identifying concurrency; Allocation of sub-systems; Management of data storage; Handling global resources; Choosing a software control strategy; Handling boundary conditions; Setting the trade- off priorities; Common architectural styles; Architecture of the ATM system as the example.
SYLLABUS 2015 – 2018 Page 37
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.
UNIT-V Patterns and Design Patterns 12 Hours What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern description.Introduction, structural decomposition, Organization of work, Model View Controller; Communication Patterns: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-Subscriber; Management Patterns: Command processor; Whole Part, Master Slave, View Handler;
Text Books: 1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML, 2nd Edition, Pearson Education / PHI, 2005. (Chapters 1 to 15) 2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal: Pattern-Oriented Software Architecture, A System of Patterns, Volume 1, John Wiley and Sons, 2006. (Chapters 1, 3)
Reference Book: 1. Rumbaugh, Blaha, Premerhani, Eddy, Lorensen; Object Oriented Modeling and Design, PHI Latest Edition
Course outcomes On completion of this course, the students should be able to:
Explain the fundamentals of object oriented concepts Understand the importance of object oriented modelling and object oriented system is developed based on unified modelling language(UML) Design class diagram, state diagram and interaction diagram for the real time problems Implement the properties and functions of system design and class design Apply standard suitable patterns for the particular problems
SYLLABUS 2015 – 2018 Page 38
ELECTIVE GROUP-II
Course Code: P15MCA441 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Cloud Computing Credits:4 Contact Period : 52 Hr, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the basic concepts of cloud computing Identify the challenges of cloud Computing Classify various service models of cloud Understand virtualization in various levels of cloud computing Identify the resource management policies, its mechanism, various storage systems and security issues
Course Content
UNIT – I Introduction 10 Hours Network centric computing and network centric content, Peer-to-peer systems, Cloud Computing: an old idea, whose time has come, Cloud Computing delivery models & Services, Ethical issues, Cloud vulnerabilities, Challenges, Cloud Infrastructure Amazon, Google, Azure & online services, open source private clouds. Storage diversity and vendor lock-in, intercloud, Energy use & ecological impact of data centers, service level and compliance level agreement, Responsibility sharing, user experience, Software licensing.
UNIT – II Cloud Computing 10 Hours Applications & Paradigms, Challenges, existing and new application opportunities, Architectural styles of cloud applications, Workflows coordination of multiple activities, Coordination based on a state machine model -the Zoo Keeper, The Map Reduce programming model, Apache Hadoop, High performance computing on a cloud.
UNIT – III Cloud Resource Virtualization 10 Hours Virtualization, Layering and virtualization, Virtual machine monitors, Virtual machines Performance and security isolation, Full virtualization and par virtualization, Hardware support for virtualization A performance comparison of virtual machines, Virtual machine security, The darker side of virtualization, Software fault isolation.
UNIT – IV Cloud Resource Management and Scheduling 10 Hours Policies and mechanisms for resource management, Applications 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, Resource bundling, combinatorial auctions for cloud resources, Scheduling algorithms for computing clouds, fair queuing, Start time fair queuing.
SYLLABUS 2015 – 2018 Page 39
UNIT – V Networking Support 12 Hours Storage Area Networks, Content Delivery Networks. Storage systems Storage models, file systems, databases, DFS, General parallel File system, GFS, Apache Hadoop, Locks & Chubby, TPS & NOSQL databases, Bigdata, Mega store. Cloud security Risks, Security, privacy and privacy impacts assessments, Trust.
Text Book: 1. Cloud Computing: Theory and Practice, Dan Marinescu, 1st edition, MK Publishers, 2013.
Reference Books: 1. Distributed and Cloud Computing, From Parallel Processing to the Internet of Things, Kai Hwang, Jack Dongarra, Geoffrey Fox. MK Publishers, 2012. 2. Cloud Computing: A Practical Approach, Anthony T. Velte, Toby J. Velte, Robert Elsenpeter, McGrawFill, 2010. 3. Cloud Computing-A Hands-on Approach, ArshdeepBahga, Vijay Madisetti, Universities Press, 2014.
Course outcomes On completion of this course, the students should be able to:
Define basic concepts and terminologies of cloud computing Explain various challenges and service models of cloud Illustrate need of virtualization for cloud computing Describe resource management policies and its implementation in cloud Discuss various storage systems and security issues with case studies
SYLLABUS 2015 – 2018 Page 40
Course Code: P15MCA442 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Unix System Programming Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Discuss the functions defined by the various POSIX standards Explore the creation, manipulation and usage of various file types in UNIX and POSIX systems Describe the phases (fork, exec, wait) of process creation mechanism Explain the fundamentals of signal handling and system daemons Familiarity with inter process communication using pipes, shared memory, semaphores and messages.
Course Content
UNIT – I Introduction 9 Hours UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standards. UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics. UNIX Files File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V,
UNIT - II 10 Hours Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links. UNIX File APIs General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing Program.
UNIT – III UNIX Processes 11 Hours The Environment of a UNIX Process: Introduction, main function, Process Termination, Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes. Process Control Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times, I/O Redirection.
UNIT – IV 10 Hours Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups.
SYLLABUS 2015 – 2018 Page 41
Signals and Daemon Processes Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Client-Server Model.
UNIT – V Interprocess Communication - 1 12 Hours Overview of IPC Methods, Pipes, popen, pclose Functions, Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores. Interprocess Communication - 2 Shared Memory, Client-Server Properties, Stream Pipes, Passing File Descriptors, An Open Server- Version 1, Client-Server Connection Functions.
Text Books: 1. Terrence Chan: Unix System Programming Using C++, Prentice Hall India, 1999. (Chapters 1, 5, 6, 7, 8, 9, 10) 2. W.Richard Stevens: Advanced Programming in the UNIX Environment, Addison- Wesley/PHI, 1992. (Chapters 7, 8, 9, 13, 14, 15)
Reference Books: 1. Marc J. Rochkind: Advanced Unix Programming, 2nd Edition, Pearson Education, 2005. 2. Maurice.J.Bach: The Design of the UNIX Operating System, Pearson Education / Prentice Hall of India, 1987. 3. Uresh Vahalia: Unix Internals, Pearson Education, ASIA, 2001.
Course outcomes On completion of this course, the students should be able to:
Use API‘s to create their own library or C++ classes Create and manipulate files in a system Write POSIX applications using API socket and signals Experiment with client-server interactions Develop advanced systems programs that manipulate system objects
SYLLABUS 2015 – 2018 Page 42
Course Code: P15MCA443 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Composing Mobile Applications
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLO): The Objectives of the course are to :
Understand the basic concepts of Android. Describe the user interfaces for Android users Determine suitable database form for Mobile Apps. Discuss various applications of Mobile Apps. Understand the multimedia applications of mobile
UNIT – I 10 Hours Hello, Android: A Little Background, What Android Isn‘t, Android: An Open Platform for Mobile Development, Native Android Applications, Android SDK Features, Introducing the Open Handset Alliance, What Does Android Run On?, Why Develop for Mobile?, Why Develop for Android?, Introducing the Development Framework, Getting Started: Developing for Android, Developing for Mobile and Embedded Devices, Android Development Tools
UNIT – II 10 Hours Creating Applications And Activities: What Makes an Android Application?, Using the Manifest Editor, Externalizing Resources, The Android Application Lifecycle, Understanding an Application‘s Priority and Its Process‘ States, Introducing the Android Application Class, A Closer Look at Android Activities, Building User Interfaces:Fundamental Android UI Design, Android User Interface Fundamentals, Introducing Layouts, Introducing Fragments, The Android Widget Toolbox, Creating New Views, Introducing Adapters
UNIT – III 10 Hours Databases And Content Providers: Introducing Android Databases, Introducing SQLite, Content Values and Cursors, Working with SQLite Databases, Creating Content Providers, Using Content Providers, Adding Search to Your Application, Creating a Searchable Earthquake Content Provider, Native Android Content Providers, Working In The Background: Introducing Services, Using Background Threads, Using Alarms
UNIT – IV 10 Hours Advanced User Experience: Designing for Every Screen Size and Density, Ensuring Accessibility, Introducing Android Text-to-Speech, Using Speech Recognition, Controlling Device Vibration, Working with Animations, Enhancing Your Views, Advanced Drawable Resources, Copy, Paste, and the Clipboard, Hardware Sensors: Using Sensors and the Sensor Manager, Monitoring a Device‘s Movement and Orientation, Introducing the Environmental Sensors
UNIT – V 12 Hours Maps, Geocoding, And Location-Based Services: Using Location-Based Services, Using the Emulator with Location-Based Services, Selecting a Location Provider, Finding Your Current Location, Best Practice for Location Updates, Using Proximity Alerts, Using the Geocoder, Creating Map-Based Activities, Audio, Video, And Using The Camera: Playing Audio and Video, Manipulating Raw Audio, Creating a Sound
SYLLABUS 2015 – 2018 Page 43
Pool, Using Audio Effects, Using the Camera for Taking Pictures, Recording Video, Using Media Effects, Adding Media to the Media Store
Text Books: 1. Reto Meier: Professional Android 4 Application Development. Wiley India Edition, 2012. Chapters: 1, 2, 3, 4, 8, 9, 11, 12, 13, 15 Reference Books: 1. Jerome (J.F.) DiMarzio: Android A Programmer‘s Guide, Tata McGraw-Hill, 2010. 2. B.M. Harwani: Android Programming, Pearson, 2013. 3. Jason Ostrander: Android UI Fundamentals Develop and Design, Pears
Course Outcomes: On successful completion of this course, the student will able to:
Describe the Fundamentals of Mobile Application Development. Identify the necessary tools to develop the mobile applications when given a real time project. Familiarize with Mobile apps development aspects. Design and develop mobile apps, using Android as development platform, with key focus on user experience design, native data handling and background tasks and notifications. Determine native hardware play, location awareness, graphics, and multimedia.
SYLLABUS 2015 – 2018 Page 44
Course Code: P15MCA444 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Advanced Database Management Systems
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Demonstrate how data is stored in both primary and secondary storage on disks. Explain the basics, usage and applications of Object Oriented database Understand the knowledge on parallel and distributed databases and its applications. Describe the advanced topics in data warehousing and . Discuss the emerging and advanced data models and its Applications
Course Content
UNIT-I Overview of Storage and Indexing, Disks and Files 12 Hours 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, Page formats and record formats. Tree Structured Indexing: Intuition for tree indexes, Indexed sequential access method, B+ trees, Search, Insert, Delete, Duplicates, B+ trees in practice.
UNIT-II Object and Object-Relational Databases 10 Hours Overview of Object-Oriented Concepts – Objects, Encapsulation, Type and class hierarchies, complex objects; Object model of ODMG, Object definition Language ODL; Object Query Language OQL; Overview of C++ language binding; Conceptual design of Object database. Overview of object relational features of SQL; Object-relational features of Oracle; Implementation and related issues for extended type systems; The nested relational model.
UNIT-III Parallel and Distributed Databases 10 Hours Architectures for parallel databases; Parallel query evaluation; Parallelizing individual operations; Parallel query optimizations; Introduction to distributed databases; Distributed DBMS architectures; Storing data in a Distributed DBMS; Distributed catalog management; Distributed Query processing; Updating distributed data; Distributed transactions; Distributed Concurrency control and Recovery.
UNIT-IV Data Warehousing, Decision Support and Data Mining 10 hours Introduction to decision support; OLAP, multidimensional model; Window queries in SQL; Finding answers quickly; Implementation techniques for OLAP; Data Warehousing; Views and Decision support; View materialization; Maintaining materialized views. Introduction to Data Mining; Counting co-occurrences; Mining for rules; Tree- structured rules; Clustering; Similarity search over sequences; Incremental mining and data streams; Additional data mining tasks.
UNIT-V Enhanced Data Models for Some Advanced Applications 10 hours Active database concepts and triggers; Temporal, Spatial, and Deductive Databases – Basic concepts. More Recent Applications: Mobile databases; Multimedia databases; Geographical Information Systems; Genome data management.
SYLLABUS 2015 – 2018 Page 45
Text Books: 1. Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition,Pearson Education, 2013.Chapters[20,21,22,24,30] 2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3rd Edition, McGraw- Hill, 2013.Chapters[8,9,10,22,25,26]
Reference Book: 1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan: Database System Concepts, 6th Edition,McGraw Hill, 2010.
Course outcomes On completion of this course, the students should be able to
Describe the Database storage access and different kinds of memory. Design the model and represent it using object oriented database Select the appropriate high performance database like parallel and distributed database Embed the rule set in the database to implement Data warehousing and Data mining Choose and design database for recent applications for better interoperability
SYLLABUS 2015 – 2018 Page 46
Course Code: P15MCA445 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Principles of User Interface Design
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Provide fundamental knowledge on Usability of Interactive system Understand the Guidelines, Principles, and Theories on designing effective user interface. Learn techniques involved in designing real-time Interface Discuss Mobile User Interface and its Display technology Understand mobile user interface control, Lateral Access, Labels and Indicators. Identify different user interface and design.
Course Content
UNIT-I 10 Hours Introduction, Usability Goals and Measures, Usability Motivations, Universal Usability, Goal for our Profession, Guidelines, Principles, Theories.
UNIT-II 10 Hours Introduction, Organizational Design to Support Usability, The four Pillars of Design, Development Methodologies, Ethnographic Observation, Participatory Design, Scenario Development, Legal Issues, Expert Reviews, Usability Testing and Laboratories, Surveys Instruments Acceptance Tests, Evaluation during active use
UNIT-III 12 Hours Introduction, Example of Direct-Manipulation, 3D Interfaces, Tele operation, Virtual and Augmented Reality, Task-Related Menu Organization, Single Menus, Combinations of Multiple Menus, Content Organization, Fast Movement through Menus, Data Entry with Menus: Form Fillin, Dialog Boxes and Alternatives, Audio Menus and Menus for small Display.
UNIT-IV 10 Hours Introduction, Error Messages, Display Design, Web Page Design, Window Design, Types of visual Information, Classifying Information, Organizing with Information Architecture, Information Design and Ordering Data, Patterns for Displaying Information.
UNIT-V 10 Hours Understanding Our Users, Control and Confirmation, Patterns for Control and Confirmation, Lateral access and Mobile space, Follow the principles of way finding and Norman‘s Interaction Model, Patterns for Lateral access, Understanding Our Users, Label and Indicators in the Mobile Space, Patterns for Labels and Indicators
Text Books: 1. Shneiderman Plaisant Cohen Jacobs: Designing the User Interface, 5th Edition, Pearson Education, 2010 2. Steven Hoober, Eric Berkman: Designing Mobile Interfaces-Shroff/O‘Reilly First Indian Reprint, 2011.
SYLLABUS 2015 – 2018 Page 47
Reference Books: 1. Alan J Dix et al.: Human-Computer Interaction, 2nd Edition, Prentice-Hall India, 1998. 2. Wilber O Galitz: The Essential guide to User Interface Design- An Introduction to GUI Design, Principles and Techniques, Wiley-Dreamtech India PVT. Ltd, 1998.
Course outcomes On completion of this course, the students should be able to:
Describe User interface Guidelines, Principles and Theories. Evaluate Standard User interface design Design Direct Manipulation, Balancing Function and Fashion in UI Design Mobile User Interface and its Display of Information Illustrate Mobile UI Control Confirmation, Labels and Indicators Analyze and Explain different Techniques in Real-Time interface design
SYLLABUS 2015 – 2018 Page 48
ELECTIVE GROUP-III
Course Code: P15MCA451 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Cryptography & Network Security
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand various security attacks and security services Analyze data encryption standard and its policies Identify various authentication functions and its applications Determine security architecture and management of Internet Protocol Comprehend relevant protocol like SSL, TLS etc.,
Course Content
UNIT – I Introduction 10 Hours OSI Security Architecture, Security Attacks, Security Services, Security Mechanism, Model for Network Security. Classical Encryption Technique - Symmetric Cipher Model, Substitution Techniques, Transposition Techniques.
UNIT – II Block Ciphers, Data Encryption Standard and Advanced Encryption Standard 12 Hours Block Cipher Principles, The Data Encryption Standard, Block Cipher Design Principles and Modes of operation, Evaluation Criteria for AES, AES Cipher-Encryption and Decryption, Data Structure, Encryption Round. Public Key Cryptography and Key Management Principles of Public Key Cryptosystem, RSA algorithm, Key management, Diffie Hellman Key exchange
UNIT – III Message Authentication and Hash Function 10 Hours Authentication Requirement, Authentication Functions, Message Authentication Code, Hash Functions, Digital Signatures, Digital Signature Standard Authentication Applications Kerberos, X.509 Authentication Service.
UNIT – IV Electronic Mail Security 10 Hours Pretty Good Privacy (PGP), S/MIME. IP Security IP Security Overview; IP Security Architecture; Authentication Header; Encapsulating Security Payload; Combining Security Associations; Key Management.
UNIT – V Web Security 10 Hours Web security Considerations; Secure Socket layer (SSL) and Transport layer Security (TLS); Secure Electronic Transaction (SET).
SYLLABUS 2015 – 2018 Page 49
System Security Intruders, Intrusion Detection, Firewall Design Principles- Characteristics, Types of Firewall and Firewall Configuration.
Text Book: 1. William Stallings, ―Cryptography and Network Security – Principles and Practices‖, 4th Edition, Pearson Education, 2009. (Chapters: 1, 2.1-2.3, 3.1, 3.2, 3.5, 5.1,5.2, 6.2, 9.1,9.2, 10.1,10.2, 11.1- 11.4, 13.1, 13.3, 14.1, 4.2, 15.1, 15.2, 16.1-16.6, 17.1-17.3, 18.1, 18.2, 20.1; Exclude the topic not mentioned in the syllabus)
Reference Books: 1.Behrouz A. Forouzan and Debdeep Mukhopadhyay: ―Cryptography and Network Security‖, 2nd Edition, Tata McGraw-Hill, 2010. 2.Atul Kahate, ―Cryptography and Network Security‖ 2nd Edition TMH.
Course outcomes On completion of this course, the students should be able to:
Define security services for a given network model Describe various data encryption schemes and apply on a network model Discuss various authentication functions and its applications Describe a security management of a given IP network model Identify characteristics of firewall , and configure a firewall
SYLLABUS 2015 – 2018 Page 50
Course Code: P15MCA452 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Network Management Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLO) The Objectives of this course are to :
Understand the basic requirements to manage a network. Discuss various provisioning issues of network management. Illustrate architecture of network management with its considerations. Determine various MPLs applications and its management. Define the functions of network management functions for optical networks.
Course Content
UNIT-I Requirements for the Management of Networked Systems 11 Hours Management Scenarios, Management functions, Organizational aspects of Management, Time aspects of Management IP Network Management Choosing to manage the network, Choosing a configuration method, Management information Base, Simple Network Management Protocol, Extensible markup Language, Common Object Request Broker Architecture.
UNIT-II IP-Based Service Implementation and Network Management 10 Hours Simple Network Management Protocol, Ip- Based Service Implementation-OSS, Provisioning Issues, Network Management Issues, OSS Architecture.
UNIT-III Network Management Architecture 10 Hours Background, Defining Network Management, Network Management Mechanisms, Architectural Considerations. SLA and Network Monitoring Passive and Active Network Monitoring , Passive Network Monitoring , Active Network Monitoring.
UNIT-IV MPLS Network Management: An Introduction 10 Hours A brief Introduction to MPLS , MPLS Applications, Key Aspects of MPLS Network Management, Management Information Base Modules for MPLS. MPLS Management Interfaces The basics of Management Interfaces, Command line interface, CORBA, XML, Bulk File Transfer, Simple Network Management Protocol. UNIT-V Optical Networks: Control and Management 11 Hours Network Management functions, Optical Layer Services and Interfacing, Layers within the Optical Layer, Multivendor Interoperability, Performance and Fault Management, Configuration Web-Based Management NMS with Web Interface and Web- Based Management Web Interface to SNMP Management, Embedded Web- Based Management, Desktop management interface, Web- Based Enterprise Management, WBEM: Windows Management Instrumentation, Java management Extensions, Management of a Storage Area Network: Future Directions.
SYLLABUS 2015 – 2018 Page 51
Text Books: 1. Network Management- Know it all by Adrian Farrel, Elsevier publications. Chapter 1-8 2. Network Management- Principles and Practice, Mani Subramaniam, Pearson Education.Chapter 14
Reference Books: 1. Network Management, Morris, Pearson Education 2. Practical Guide to SNMPv3 and Network Management, David Zeltserman, PHI.
Course outcomes On completion of this course, the students should be able to:
Define basic concepts and terminologies of Network management Explain simple network management protocol with its characteristics. Illustrate need of network management mechanisms with architecture. Describe key aspects of MPLS network management. Identify and analyze various web-based management.
SYLLABUS 2015 – 2018 Page 52
Course Code: P15MCA453 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Data Warehousing & Data Mining
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the concepts of Data warehousing Architecture and Implemenation. Describe the Conceptual, Logical, and Physical design of Data Warehouses OLAP applications and OLAP deployment Understand Data mining principles and techniques and Introduce DM as a cutting edge business intelligence Discuss the use association rule mining for handling large data to extract patterns Illustrate the concept of classification for the retrieval purposes. Describe Clustering algorithms and Outlier Analysis.
UNIT-I Data Warehousing and OLAP 12 Hours Introduction, Operational Data Stores (ODS), Extraction Transformation Loading (ETL), Data Warehouses, Data Warehouse Design, and Guidelines for Data Warehouse Implementation, Data Warehouse Metadata. OLAP : Introduction, Characteristics of OLAP systems, Multidimensional view and Data Cube, Data Cube Implementations, Data Cube Operations, Guidelines for OLAP Implementation, and Overview on OLAP Software.
UNIT-II Data Mining 08 Hours Introduction, Challenges, Data Mining Tasks, Types of Data, Data Preprocessing, Measures of Similarity and Dissimilarity, Data Mining Applications.
UNIT-III Association Analysis: Basic Concepts and Algorithms 12 Hours Frequent Item set Generation, Rule Generation, Compact Representation of Frequent Item sets, Alternative methods for Generating Frequent Item sets, FP-Growth Algorithm, Evaluation of Association Patterns.
UNIT-IV Classification 08 Hours Basics, General Approach to Solve Classification Problem, Decision Tree Induction, Rule Based Classifier, Nearest-Neighbor Classifiers, and Bayesian Classifiers.
UNIT-V Clustering Techniques and Outlier Analysis 12 Hours 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 Methods. Outlier Analysis: Outlier Detection Methods, Statistical Approaches, Clustering based Approaches, Classification based Approaches. Text Books: 1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Introduction to Data Mining, Pearson 2005. 2. G. K. Gupta, Introduction to Data Mining with Case Studies, 2nd Edition, PHI, New Delhi, 2012.
SYLLABUS 2015 – 2018 Page 53
Reference Book: 1. Jiawei Han and Micheline Kamber, Data Mining - Concepts and Techniques, 3rd Edition, Morgan Kaufmann Publisher.
Course Outcomes: On completion of this course, the students should be able to: : Explain the basic concepts of Data Warehousing and OLAP Implementation. Explain the basic concepts, techniques and applications of data mining. Illustrate the association rules to extract appropriate pattern in massive data. Design and deploy appropriate classification techniques Illustrate the clustering techniques and outlier analysis in detail for better organization and retrieval of data
SYLLABUS 2015 – 2018 Page 54
Course Code: P15MCA454 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Distributed Computing
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the Current concept in distributed systems. Apply the concepts related to distributed computing systems. Understand the performance and flexibility issues related to systems design decisions. Explain the concept of abstraction and details of file systems. To identify industrial programming environment and to know CORBA concept.
Course content
UNIT-I Characterization of Distributed Systems and Interprocess Communication 11 Hours Characterization of Distributed Systems:Introduction-Examples-Resource Sharing and the Web- Challenges. System Models-Architectural-Fundamental. Interprocess Communication:Introduction-API for Internet protocols-External data representation and marshalling-Client-server communication-Group communication- Case study: Interprocess Communication in UNIX.
UNIT-II Distributed Objects and Remote Invocation 11 Hours Distributed Objects and Remote Invocation-Introduction-Communication between distributed objects-Remote procedure calls-Events and notifications-Case study: Java RMI. Operating System Support-Introduction-OS layer-Protection-Processes and threads- Communication and invocation OS architecture.
UNIT-III Distributed File Systems and Name Services 10 Hours Distributed File Systems: Introduction-File service architecture-Case Study: Sun Network File System-Enhancements and further developments. Name Services:Introduction-Name Services and the Domain Name System-Directory Services-Case Study: Global Name Service.
UNIT-IV Time and Global States 10 Hours Time and Global States: Introduction-Clocks, events and process states-Synchronizing physical clocks-Logical time and logical clocks-Global states-Distributed debugging. Coordination and Agreement-Introduction-Distributed mutual exclusion-Elections- Multicast communication- Consensus and related problems.
UNIT-V Distributed Shared Memory and CORBA 10 Hours Distributed Shared Memory:Introduction-Design and implementation issues-Sequential consistency and Ivy case study Release consistency and Munin case study-Other consistency models. CORBA Case Study- Introduction- CORBA RMI-CORBA services.
SYLLABUS 2015 – 2018 Page 55
Text Book: 1. George Coulouris, Jean Dollimore, Tim Kindberg, , "Distributed Systems: Concepts and Design", 4th Edition, Pearson Education, 2005.
Reference Books: 1. A.S. Tanenbaum and M. V. Steen, "Distributed Systems: Principles and Paradigms", Second Edition, Prentice Hall, 2006. 2. M.L.Liu, ―Distributed Computing Principles and Applications‖, Pearson Addison Wesley, 2004. 3. Mukesh Singhal, ―Advanced Concepts In Operating Systems‖, McGrawHill Series in Computer Science, 1994. 4. Nancy A. Lynch, "Distributed Algorithms", The Morgan Kaufmann Series in Data Management System, Morgan Kaufmann Publishers, 2000.
Course outcomes On completion of this course, the students should be able to:
Understand the characterization of Distributed Systems and Study system models & IPC. Analyze Distributed Objects and Remote Invocation and the support of Operating System. Identify Distributed File Systems and naming services. Understand the concept of Time and Global States. Understand design, implementation issues related to Distributed Shared Memory and CORBA concept
SYLLABUS 2015 – 2018 Page 56
Course Code: P15MCA455 Semester : IV L-T-P: 4 – 0 - 0 Course Title : Enterprise Resource Planning (ERP)
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to: Understand the role of ERP in the context of the Business Strategy Understand the concepts and role of Business process Re-engineering (BRP) in ERP Implementation Understand the core Business Processes of an organization Understand and demonstrate an appreciation of the core interactions and dependencies that Exist between the key functions of a business Understand the success rates, challenges of ERP implementation and ways to handle them Get an overview of the SAP software for implementing the key functions of the Business
Course content
UNIT-I Introduction to ERP 09 Hours Overview, Benefits of ERP, ERP and Related Technologies, Business Process Reengineering, Data Warehousing, Data Mining, On–line Analytical Processing, Supply Chain Management.
UNIT-II ERP Implementation 12 Hours Implementation Life Cycle, Implementation Methodology ,Hidden Costs, Organizing Implementation ,Vendors, Consultants and Users ,Contracts , Project Management and Monitoring.
UNIT-III Business Modules 10 Hours Business Modules in an ERP Package, Finance, Manufacturing, Human Resource, Plant Maintenance, Materials Management, Quality Management, Sales and Distribution.
UNIT-IV ERP Market 10 Hours ERP Market Place, SAP AG, PeopleSoft ,Baan Company , JD Edwards World Solutions Company, Oracle Corporation ,QAD , System Software Associates.
UNIT-V ERP – Present And Future 11 Hours Turbo Charge the ERP System , EIA, ERP and E–Commerce , ERP and Internet, Future Directions in ERP.
Text Books: 1. Alexis Leon, ―ERP Demystified‖, Tata McGraw Hill, 1999. 2. Joseph A. Brady, Ellen F. Monk, Bret J. Wangner, ―Concepts in Enterprise Resource Planning‖, Thomson Learning, 2001.
SYLLABUS 2015 – 2018 Page 57
Reference Books: 1.Vinod Kumar Garg and N.K. Venkata Krishnan, ―Enterprise Resource Planning concepts and Planning‖, Prentice Hall, 1998. 2. Jose Antonio Fernandz, ― The SAP R /3 Hand book‖, Tata McGraw Hill.
Course outcomes On completion of this course, the students should be able to:
Identify ERP role and apply Business Strategy for given case study Explain the ERP Implementation methodology Discuss the business models with given case study Demonstrate the ERP market Discuss the present and future of ERP
SYLLABUS 2015 – 2018 Page 58
Course Code: P15MCA46 Semester : IV L-T-P: 0 – 0 - 3 Course Title : Design & Analysis of Algorithms Lab Credits:1.5 Contact Period :39Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Identify the problem given and design the algorithm using various algorithm design techniques. Implement various algorithms in a high level language. Analyze the performance of various algorithms. Compare the performance of different algorithms for same problem.
List of Programs
Implement the following using C/C++ Language. 1 Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n. 2 a. Sort a given set of elements using Selection sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. b. Implement Pattern-Matching using Brute Force technique. 3 Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 4 Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 5 Obtain the Topological ordering of vertices in a given digraph. 6 a. Print all the nodes reachable from a given starting node in a digraph using BFS method. b. Check whether a given graph is connected or not using DFS method. 7 Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 8 a. Implement Horspool algorithm for String Matching. b. Compute the transitive closure of a given directed graph using Warshall's algorithm. 9 a. Implement Floyd‘s algorithm for the All-Pairs- Shortest-Paths Problem. b. Implement 0/1 Knapsack problem using dynamic programming. 10 Find Minimum Cost Spanning Tree of a given undirected graph using Prim‘s algorithm. 11 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm. 12 From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm. 13 Implement N Queen's problem using Back Tracking.
SYLLABUS 2015 – 2018 Page 59
Note: In the examination questions must be given based on above lots. Course outcomes On completion of this course, the students should be able to:
Develop searching and sorting using the algorithm techniques such as decrease and conquer, divide and conquer, transform and conquer technique. Implement solutions to the graph based problems using the algorithm techniques such as decrease and conquer, dynamic programming, and greedy technique. Identify and Apply algorithm Techniques to solve a given contextual problems. Design and implement algorithms for the realistic problems
SYLLABUS 2015 – 2018 Page 60
Course Code: P15MCA47 Semester : IV L-T-P: 0 – 0 - 3 Course Title : Advanced Java Programming Lab
Credits:1.5 Contact Period : 39Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand Two popular Server side development Technology Servlet and JSP Apply and practice real time applications using Servlet and JSP Technologies Choose different methods and techniques for Web development Understand and design JDBC backend process to retrieve the data from database Understand Java Bean and Enterprise Java Bean for developing different types of bean for online applications List of Programs
1 Write a JAVA Servlet Program to implement a dynamic HTML using Servlet (user name and Password should be accepted using HTML and displayed using a Servlet). 2 Write a JAVA Servlet Program to Auto Web Page Refresh (Consider a webpage which is displaying Date and time or stock market status. For all such type of pages, you would need to refresh your web page regularly; Java Servlet makes this job easy by providing refresh automatically after a given interval). 3 Write a JAVA Servlet Program to implement and demonstrate get() and Post methods(Using HTTP Servlet Class). 4 Write a JAVA Servlet Program to implement and demonstrate post() methods(Using HTTP Servlet Class) 5 Write a JAVA Servlet Program using cookies to remember user preferences. 6 Write a JAVA JSP Program to implement verification of a particular user login and display a Welcome page. 7 Write a JAVA JSP Program which uses jsp:include and jsp:forward action to display a Webpage 8 Write a JAVA JSP Program which uses
SYLLABUS 2015 – 2018 Page 61
Course outcomes On completion of this course, the students should be able to:
Develop Web application using Server Side Technologies Servlet and JSP Develop Web application based on Session Tracking and Action elements Implement the program to retrieve data from different database Create a Customize objects using Java Bean for front end web application Implement the various bean in Enterprise Java Beans with respective to business logic
Course Code: P15MCA48 Semester : IV L-T-P: 0 – 0 - 3 Course Title : Object-Oriented Modelling and Design Patterns Lab
SYLLABUS 2015 – 2018 Page 62
Credits:`1.5 Contact Period :39 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the usecase diagram and activity diagram Understand class diagram and state diagram Understand pattern and different types of patterns Understand rules related to design pattern Understand various design pattern for different problem statement
List of Programs
1. Write a java program for the following using rational rose software: a) To find factorial of a number b) To perform arithmetic operations 2. Use rational rose software to design UML diagrams for single level inheritance convert UML diagram to java, add necessary attributes and methods 3. Use rational rose software to design UML diagrams for hierarchical inheritance convert UML diagram to java, add necessary attributes and methods 4. Use rational rose software to design UML diagrams and demonstrate the Controller design patterns and implement using java programs 5. Use rational rose software to design UML diagrams and demonstrate the Publisher-subscriber design patterns and implement using java programs 6. Use rational rose software to design UML diagrams and demonstrate the Client-Dispatcher design patterns and implement using java programs 7. Use rational rose software to design UML diagrams and demonstrate the Façade design patterns and implement using java programs 8. Use rational rose software to design UML diagrams and demonstrate the polymorphism design patterns and implement using java programs 9. Use rational rose software to design UML diagrams and demonstrate the Command design patterns and implement using java programs 10. Use rational rose software to design UML diagrams and demonstrate the Forward receiver design patterns and implement using java programs
Students have to solve the above programs, also they have to develop small application using OOMD in a team and have to submit a report along with a code. Small application carries a weightage of 50% of CIE
Course outcomes On completion of this course, the students should be able to: Identify the usecase, activity, class state diagrams
SYLLABUS 2015 – 2018 Page 63
Identify roles of different types of patterns Design UML diagrams for different problem statement Design standard patterns using UML diagrams Implement standard design patterns for real time problems
SYLLABUS 2015 – 2018 Page 64
Course Code: P15MCA49 Semester : IV L-T-P: 0 – 0 - 3 Course Title : Technical Seminar Credits:1.5 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:100%
Seminar Guideline: Each student must present a unique topic on Computer(Software) related new Emerging Technologies for a period of 30 minutes with presentation slides not less than 30 with a wide coverage of selected topic.
SYLLABUS 2015 – 2018 Page 65
Course Code: P15MHU401 Semester : IV L-T-P: 2 – 0 - 0 Course Title : Aptitude and Reasoning Development-ADVANCED(ARDA)*
Credit:1 Contact Period : 32 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to
Explain different types of functions, representation of different functions on the graphs. Describe the properties of quadratic equations and application of quadratic equations. Demonstrates the principle of counting. Differentiates between permutation and combination and solve problems conceptually. Predict the probabilities in different scenarios and its application in our day-to-day life. Evaluate the cause and effect of the statements logically. Recognize different ways in which a statement can be strengthened or weakened. Explain the criticality of data sufficiency chapter., universal methodology to solve any problem. Analyse the data in a bar graph , pie chart and tabular column and line graph and the combination of these graphs. Compare the data in different format and understand the difference between them
Course Content
UNIT – I Functions and Quadratic equations: 6 Hours Functions: Basic methods of representing functions– Analytical representation, tabular representation, graphical representation of functions. Even and odd functions, Inverse of a function, Shifting of graph. Representation of standard set of equations. Methodology to tackle inverse functions. Graphical process for solving inequalities, graphical view of logarithmic function. Quadratic equations: Theory, properties of quadratic equations and their roots, the sign of quadratic equation, Equations in more than one variable. Simultaneous equations, number of solutions of the simultaneous equations.
UNIT – II 8 Hours Permutation and Combination: Understanding the difference between the permutation and combination, Rules of Counting-rule of addition, rule of multiplication, factorial function, Concept of step arrangement, Permutation of things when some of them are identical, Concept of 2n, Arrangement in a circle. Probability: Single event probability, multi event probability, independent events and dependent events, mutually exclusive events, non-mutually exclusive events, combination method for finding the outcomes.
UNIT – III 6 Hours Analytical reasoning 3: Punchline: Introduction, format of the problem, An analysis, Does a suggested statement qualify as a punchline?. If a given statement fits as a punchline, what is its idea or wavelength?, The complete method of solving a punchline problem, Solved examples, conclusion, Sample company questions. Strengthening and Weakening arguments: Format of the problem, An analysis, Suggested methods, solved examples, conclusion, sample company questions.
SYLLABUS 2015 – 2018 Page 66
Cause and Effect : Cause and Effect—A theoretical discussion, Immediate cause, Principal cause, A quick check– Cause always antecedent. The strategy for solution.
UNIT-IV 6 hours Data Sufficiency: Introduction, answer choices in data sufficiency, tips to solve data sufficiency problems, directions of questions, classification of sections in data sufficiency– Number system, Algebra, series and sequence, logical, geometry and mensuration, arithmetic.
UNIT-V 6 hours Data Interpretation: Approach to interpretation - simple arithmetic, rules for comparing fractions, Calculating (approximation) fractions, short cut ways to find the percentages, Classification of data– Tables, Bar graph, line graph, Cumulative bar graph, Pie graph, Combination of graphs. Combination of table and graphs
Reference Books: 1. ―The Trachtenberg speed system of basic mathematics, published by Rupa publications. 2. CAT Mathematics by Abhijith Guha. published by PHI learning private limited. 3. Quantitative aptitude by Dr. R. S Agarwal, published by S.Chand private limited. 4. Verbal reasoning by Dr. R. S Agarwal , published by S. Chand private limited. 5. Quantitative aptitude for CAT by Arun Sharma, published by McGraw Hill publication. 6. Analytical reasoning by M.K Pandey BSC PUBLISHING.CO.PVT.LTD
Course outcomes On completion of this course, the students should be able to:
Graphically represent the functions and analyze it. L5 Infer the conclusions based on the roots obtained by solving quadratic equations and establish relationship between them. L6 Effective solve the problems of permutation and combination. L4 Predict different possibilities by the principle of probability. L3 Interpret the data given in the graphical format and infer the results. L5Analyze the statement critically and solve the questions from verbal logic section. L5
SYLLABUS 2015 – 2018 Page 67
V SEMESTER
Course Code: P15MCA51 Semester : V L-T-P: 4 – 0 - 0 Course Title : Software Testing and Practices Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the basic definitions, test case, defect management, execution history, fault taxonomies and levels of testing . Discuss the scenario and select the proper testing technique like Boundary Value Testing, Equivalence Class Testing and Decision Table-Based testing Analyze Alternative life - cycle models, recognize Basic concepts for requirements specification using threads Analyze approaches for Test Execution: from test case specifications to test cases, Scaffolding, Generic versus specific scaffolding Understand test strategies to test design specifications document.
Course Content
UNIT-I Basics of Software Testing 10 Hours Humans, Errors and Testing, Software Quality; Requirements, Behavior and Correctness, Correctness Vs Reliability; Testing and Debugging; Test Metrics; Software and Hardware Testing; Testing and verification; Defect Management; Execution History; Test Generation Strategies; Static Testing; Test Generation from Predicates. UNIT-II A Perspective on Testing, Examples, Boundary Value, Equivalence Class, Decision Table-Based Testing 11Hours Basic definitions, Test cases, Insights from a Venn diagram, Identifying test cases, Error and fault taxonomies, Levels of testing. Examples: Generalized pseudo code, The triangle problem, The Next Date function, The commission problem, The SATM (Simple Automatic Teller Machine) problem, The currency converter, Saturn windshield wiper. Boundary value analysis, Robustness testing, Worst-case testing, Special value testing, Examples, Random testing. Equivalence classes, Equivalence test cases for the triangle problem, Next Date function, and the commission problem, Guidelines and observations. Decision tables, Test cases for the triangle problem
UNIT-III Path Testing, Data Flow Testing, Levels of Testing, Integration Testing 10Hours DD paths, Test coverage metrics, Basis path testing, guidelines and observations. Definition-Use testing, Slice-based testing, Guidelines and observations. Traditional view of testing levels, Alternative life-cycle models, The SATM system, Separating integration and system testing.
UNIT-IV Basic principles, Fault-Based Testing 11 Hours Sensitivity, redundancy, restriction, partition, visibility, Feedback. Assumptions in fault-based testing, Mutation analysis, Fault-based adequacy criteria, Variations on mutation analysis.
SYLLABUS 2015 – 2018 Page 68
From test case specifications to test cases, Scaffolding, Generic versus specific scaffolding, Test oracles, Self-checks as oracles, Capture and replay. UNIT-V Test Case Selection and Adequacy, Planning and Monitoring the Process, Documenting Analysis and Test 10 Hours Test Specification and cases, Adequacy Criteria, Comparing Criteria. Quality and process, Test and analysis strategies and plans, Risk planning, Monitoring the process, Improving the process, The quality team. Organizing documents, Test strategy document, Analysis and test plan, Test design specifications documents, Test and analysis reports.
Text Books: 1. Aditya P Mathur, Foundations of Software Testing, Pearson, 2008 2. Paul C. Jorgensen, Software Testing, A Craftsman‘s Approach, 3rd Edition, Auerbach Publications, 2008. 3.Mauro Pezze, Michal Young, Software Testing and Analysis – Process, Principles and Techniques, Wiley India, 2008.
Reference Book: 1. Srinivasan Desikan, Gopalaswamy Ramesh, Software testing Principles and Practices, 2ndEdition, Pearson, 2007.
Course outcomes On completion of this course, the students should be able to:
Identify Test cases, Error and fault taxonomies, Levels of testing. Classify different types of testing (Boundary Value Testing, Equivalence Class Testing and Decision Table-Based Testing). Recognize Alternative life - cycle models, recognize Basic concepts for requirements specification, assess context of interaction. Recognize approaches for Test Execution: from test case specifications to test cases, Scaffolding, Generic versus specific scaffolding. Identify and plan strategies to test design specifications document.
SYLLABUS 2015 – 2018 Page 69
Course Code: P15MCA52 Semester : V L-T-P: 3 – 2 - 0 Course Title : Programming using C# and .NET Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Discuss the .NET framework with its necessary components to develop and run .NET based applications on system Explain basic knowledge of C# programming language State and use the C# class libraries Describe the object-oriented programming techniques that can be applied to application development skills Illustration of events, delegates and exception handling concepts in C# Design windows forms, using menus, user controls, event procedures etc. Demonstrate the use of ADO.NET to communicate with the various kinds of data and data access services Illustration of data driven web application using ASP.NET
Course Content
UNIT-I Getting started with .NET Framework 4.5 04 Hours Benefits of .NET Framework, Architecture of .NET Framework 4.5, Components of .NET Framework 4.5: CLR, CTS, Metadata and Assemblies, .NET Framework Class Library, BCL, Windows Forms, ASP .NET and AJAX, ADO .NET, Windows workflow Foundation, Windows Presentation Foundation, Windows Communication Foundation, Widows Card Space and LINQ. Introducing C# 06 Hours Need of C#, C# Pre-processor Directives, Creating a Simple C# Console Application, Identifiers and Keywords. Data Types, Variables and Constants: Value Types, Reference Types, Type Conversions, Boxing and unboxing, Variables and Constants. Expression and Operators: Operator Precedence, Using the ?? (Null Coalescing) Operator, Using the :: (Scope Resolution) Operator and Using the is and as Operators. Control Flow statements: Selection Statements, Iteration Statements and Jump Statements.
UNIT-II Namespaces, Classes, Objects and Structures 09 Hours Namespaces, The System namespace, Classes and Objects: Creating a Class, Creating an Object, Using this Keyword, Creating an Array of Objects, Using the Nested Classes, Defining Partial Classes and Method, Using methods as class members, Passing an object as an argument to a method, Returning a Value from a Method and Describing Access Modifiers. Constructors and destructors: using parameterized constructor in a class, calling a destructor of a class. Static Classes and Static Class Members. Properties: Read-only Property, Static Property, Accessibility of accessors and Anonymous types. Indexers, Structs: Syntax of a struct and Access Modifiers for structs.
UNIT-III Object- Oriented Programming 05 Hours Encapsulation: Encapsulation using accessors and mutators, Encapsulation using Properties. Inheritance: Inheritance and Const ructors , Sealed Classes and Sealed Methods , Extension methods. Polymorphism:
SYLLABUS 2015 – 2018 Page 70
Compile time Polymorphism/ Overloading, Runtime Polymorphism/ Overriding. Abstraction: Abstract classes, Abstract methods. Interfaces: Syntax of Interfaces, Implementation of Interfaces and Inheritance.
Delegates and Events and Exception Handling 05 Hours Delegates: Creating and using Delegates, Muticasting with Delegates. Events: Event Sources, Event Handlers, Events and Delegates, Multiple Event Handlers. Exception Handling: The try/catch/finally statement, throw statement, Checked and Unchecked Statements.
UNIT-IV Graphical User Interface with Windows Forms 10 Hours Introduction, Windows Forms, Event Handling: A Simple Event- Driven GUI, Visual Studio Generated GUI Code, Delegates and Event- Handling Mechanism, Another Way to Create Event Handlers, Locating Event Information. Control Properties and Layout, Labels, TextBoxes and Buttons, GroupBoxes and Panels, CheckBoxes and RadioButtons, ToolTips, Mouse-Event Handling, Keyboard- Event Handling. Menus, MonthhCalendar Control, Date TimePicker Control, LinkLabel Control, ListBox Control, CheckedListBox Control, ComboBox Control, TreeView Control, ListView Control, TabControl Control and Multiple Document Interface (MDI) Windows.
UNIT-V Data Access with ADO.NET 08 Hours Understanding ADO.NET: Architecture of ADO.NET, typed Vs. Untyped dataset, Data reader: ADO.NET Entity Framework. Creating Connection Strings: Syntax for Connection Strings. Creating a Connection to a Database: SQL Server Database, OLEDB Database, ODBC Data Source. Creating a Command Object. Working with DataAdapters: Creating DataSet from DataAdapter, Paging with DataAdapters, Updating with DataAdapters, Adding Multiple Tables to a DataSet, Creating Data View. Using DataReader to Work with Databases.
Web App Development with ASP.NET 05 Hours Introduction, Web Basics, Multitier Application Architecture, Your First Web Application: Building WebTime Application, Examining WebTime.aspx‘s Code-Behind File, Standard Web Controls: Designing a Form, Validation Controls, Session Tracking: Cookies, Session Tracking with http Session State, optaions.aspx Selecting a Programming Language & Recommenations.aspx: Displaying Recommendations based on Session Values. Case study: Database-Driven ASP.NET Guestbook, Building a Web Form that Displays Data from a Database, Modifying the Code-Behind File for the Guestbook Application
Text Books: 1. .NET 4.5 Programming (6-in-1), Black Book, Kogent Learning Solutions Inc., Dreamtech Press. (Chapters: 1,3, 4, 5, 6, 7, 12) 2. Paul Deitel and Harvey Deitel: C# 2010 for Programmers, 4th Edition, Pearson Education. (Chapters: 14,15,19)
References Books: 1. Andrew Trolsen: Pro C# 5.0 and the .NET 4.5 Framework, 6th Edition, Wiely-Appress. 2. Bart De Smet: C# 4.0 Unleashed, Pearson Education- SAMS Series. 3. Hebert Shildt: Programming in C# 4.0, Tata McGraw Hill.
SYLLABUS 2015 – 2018 Page 71
Course outcomes On completion of this course, the students should be able to:
Effectively use visual studio .NET and get working knowledge of the C# programming language Apply the object-oriented concepts of C# for applications development Select relevant exception handling types to handle errors in applications Implement windows forms and process events in response to user interaction with GUI controls Create database driven ASP.NET web application and web services
SYLLABUS 2015 – 2018 Page 72
Course Code: P15MCA53 Semester : V L-T-P: 4 – 0 - 0 Course Title : System Simulation and Modeling Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLO): The objectives of this course are to :
Understand whether the simulation is a useful tool for analysis of behaviour of the system. Ability to understand different types of systems. Determine the capabilities and limitations of a system that undergoes simulation study. Discuss generators for random number generation for simulation study of a system. Analyse the system behaviour based on Input and Output modelling. Describe the verification and validation of the system.
Course Content
UNIT – I Introduction 10 Hours 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 and continuous systems; Model of a system; Types of Models; Discrete-Event System Simulation; Steps in a Simulation Study.
UNIT – II Random-Number Generation 12 Hours Properties of random numbers; Generation of pseudo-random numbers; Techniques for generating random numbers; Tests for Random Numbers. Random-Variate Generation Inverse transform technique; Acceptance-Rejection technique.
UNIT – III Queuing Models 10 Hour Characteristics of queuing systems; Queuing notation Simulation Examples: Queuing, Inventory System
UNIT – IV General Principles 10 Hours Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance Algorithm, World Views, Manual simulation Using Event Scheduling; Input Modeling Data Collection; Identifying the distribution with data; Parameter estimation; Goodness of Fit Tests; Chi-Square test, K-S Test.
UNIT – V Verification and Validation 10 Hours Model building, verification and validation; Verification of simulation models; Calibration and validation of models. Output analysis Types of simulations with respect to output analysis; Stochastic nature of output data; Measures of performance and their estimation; Output analysis for terminating simulations.
Text Book: 1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System Simulation, 4th Edition (Listed topics only from Chapters1 to 12)
SYLLABUS 2015 – 2018 Page 73
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. 3. Simulation 5ed Ross Elsevier 4. Theory of modeling and simulation, Zeiglar, Elsevier
Course outcomes On completion of this course, the students should be able to:
Define the basic concepts in simulation and modelling with respect to real time system. Identify various simulation models for a given system. Understand the manual simulation using simulation algorithm. Illustrate various random number generators. Analyse the input and output modelling for a given system. Illustrate verification and validation of a given simulation model.
SYLLABUS 2015 – 2018 Page 74
ELECTIVE GROUP-IV
Course Code: P15MCA541 Semester : V L-T-P: 4 – 0 - 0 Course Title : Parallel Computing Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand Parallel Computing and related hardware and software Understand distributed memory programming using MPI Choose appropriate shared memory programming with pthreads for real time application Understand and Apply shared memory programming with OpenMP Understand and Apply Parallel Program Development and Parallel Algorithms
Course Content
UNIT-I Introduction to Parallel Computing 12 Hours Need of Performance, Building Parallel Systems, Why to Write Parallel Programs? How to Write Parallel Programs? Approach : Concurrent, Parallel, Distributed. Parallel Hardware and Parallel Software Background, Modifications to the von Neumann Model, Parallel Hardware, Parallel Software, Input and Output, Performance, Parallel Program Design and Writing and Running Parallel Programs.
UNIT-II Distributed Memory Programming with MPI 10 Hours Getting Started, The Trapezoidal Rule in MPI, Dealing with I/O, Collective Communication, MPI derived Data types, A Parallel Sorting Algorithm.
UNIT-III Shared Memory Programming with Pthreads 12 Hours Processes, Threads and Pthreads, Hello, World program ,Matrix-Vector Multiplication, Critical Sections Busy-Waiting, Mutexes, Producer-Consumer Synchronization and Semaphores, Barriers and Condition Variables, Read-Write Locks, Caches, Cache-Coherence, and False Sharing and Thread-Safety.
UNIT-IV Shared Memory Programming with OpenMP 12 Hours Introduction to OpenMP, The Trapezoidal Rulem Scope of Variables, The Reduction Clause, The Parallel For Directive, More About Loops in OpenMP: Sorting, Scheduling Loops, Producers and Consumers, Caches, Cache-Coherence, and False Sharing and Thread-Safety.
UNIT-V Parallel Program Development and Parallel Algorithms 06 Hours Two N-Body Solvers, Tree Search and Case Studies
Text Book: 1. An introduction to parallel programming by peter s. Pacheco. 2011. I Edition, organ kaufmann publishers.
SYLLABUS 2015 – 2018 Page 75
Reference Books : 1. Using OpenMP: Portable Shared Memory Parallel Programming ,Gabriele Jost and Ruud van der Pas The MIT Press (October 12, 2007).
2. Using MPI - 2nd Edition: Portable Parallel Programming with the Message Passing Interface,William Gropp and Ewing Lusk, 1999, 2nd edition, MIT Press. 3. Pthreads Programming: A Posix Standard for Better Multiprocessing,Dick Buttlar, Jacqueline Farrell & Bradford Nichols .1996, I Edition , Oreilly.
Course outcomes On completion of this course, the students should be able to:
Demonstrate the basic concepts of Parallel Computing and required hardware and software Develop distributed memory programming using MPI Develop shared memory programming with pthreads Demonstrate shared memory programming with OpenMP Identify parallel algorithms to Design Parallel Programming
SYLLABUS 2015 – 2018 Page 76
Course Code: P15MCA542 Semester : V L-T-P: 4 – 0 - 0 Course Title : Advanced Web Programming Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand Perl Programming syntax construct and CGI Scripting syntax Understand and Develop web applications with Perl and PHP Choose appropriate Session tracking, Cookies concepts of PHP and Develop Web Applications for real time application Understand and apply Ruby programming syntax construct and objects of Rail Understand Web 2.0 and Web Services Course Content
UNIT-I Programming in Perl and CGI Scripting 12 Hours Programming in Perl : Origins and uses of Perl, Scalars and their operations, Assignment statements and simple input and output, Control statements, Fundamentals of arrays, Hashes, References, Functions, Pattern matching, File input and output; Examples. CGI Scripting : What is CGI? Developing CGI Applications, Processing CGI, Introduction to CGI.pm, CGI.pm methods, Creating HTML Pages Dynamically, Using CGI. pm – An Example adding Robustness, Carp, Cookies.
UNIT-II Building Web Applications with Perl and Introduction to PHP 10 Hours Building Web Applications with Perl :Uploading files, Tracking users with Hidden Data, Using Relational Databases, using libwww. Introduction to PHP : Origins and uses of PHP, Overview of PHP. General syntactic characteristics, Primitives, operations and expressions, Output, Control statements, Arrays, Functions, Pattern matching, Form handling, Files.
UNIT-III Building Web applications with PHP 08 Hours Tracking users, cookies, sessions, Using Databases, Handling XML.
UNIT-IV Introduction to Ruby and Rail 10 Hours Introduction to Ruby : Origins and uses of Ruby, Scalar types and their operations, Simple input and output, Control statements, Arrays, Hashes, Methods, Classes, Code blocks and iterators, Pattern matching. Rail: Overview of Rails, Document requests, processing forms, Rails applications with Databases, Layouts.
UNIT-V Introduction to Web 2.0 and Web Services 12 Hours Introduction to Web 2.0 : 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.
SYLLABUS 2015 – 2018 Page 77
Web Services : Web Services: SOAP, RPC Style SOAP, Document style SOAP, WSDL, REST services, JSON format, What is JSON?, Array literals, Object literals, Mixing literals, JSON 0053yntax, JSON Encoding and Decoding, JSON versus XML.
Text Books: 1. Robert W. Sebesta: Programming the World Wide Web, 4th Edition, Pearson Education, 2008. (Chapters 8,11,13, 14, 15) 2. Chris Bates: Web Programming Building Internet Applications, 3rd Edn, Wiley India, 2006 (Chapter 10,11,13) 3. Francis Shanahan: Mashups, Wiley India 2007(Chapters 1, 6)
Reference Book: 1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to H program, 3rdEdition, Pearson Education / PHI, 2004.
Course outcomes On completion of this course, the students should be able to:
Demonstrate the basic constructs of Perl and CGI Script Develop Web Applications using Perl and PHP Implement Session Tracking Cookies in PHP for online applications Apply Ruby and Rail concepts solving given problem statement Identify Web Services for online applications
SYLLABUS 2015 – 2018 Page 78
Course Code: P15MCA543 Semester : V L-T-P: 4 – 0 - 0 Course Title : Big Data and Analytics
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand structured, semi-structured and unstructured data Understand the significance, characteristics and challenges of big data Explain the importance of big data analytics and understand the role of data scientist and the various terminologies used in the big data environment. Discuss the significance of NoSQL, need for NewSQL and Hadoop platform. Comprehend MapReduce Framework and Hadoop Ecosystem[HDFS, HBase, Hive, Pig etc.] Explain the use of MongoDB and Cassandra. Understand Hive architecture and basic concepts of Pig Design JasperReports using Jaspersoft studio
Course Contents
UNIT-I 12 Hours Types of Digital Data: What‘s in Store?, Classification of Digital Data, Structured Data, Semi- Structured, Unstructured Data. Introduction to Big Data: What‘s in Store?, Characteristics of Data, Evolution of Big Data, Definition of Big Data, Challenges of Big Data, What is Big Data?, Other Characteristics of Data Which are Not Definitional Traits of Big Data, Why Big Data?, Are We Just an Information Consumer or Do We Also Produce Information?, Traditional Business Intelligence (BI) versus Big Data, A Typical Data Warehouse Environment, A Typical Hadoop Environment, What is Changing in the Realms of Big Data?, What is New Today?.
UNIT-II 10 Hours Introduction to Big Data Analytics: What‘s in Store?, Where do we Begin?, What is Big Data Analytics?, What Big Data Analytics isn‘t?, Why this Sudden Hype Around Big Data Analytics?, Classification of Analytics, Greatest Challenges that Prevent Businesses from Capitalizing on Big Data, Top Challenges Facing Big Data, Why is Big Data Analytics Important?, What Kind of Technologies are we Looking Toward to Help Meet the Challenges Posed by Big Data?, Data Science, Data Scientist … Your New Best Friend!!!, Terminologies Used in Big Data Environment, Basically Available Soft State Eventual Consistency (BASE), Few Top Analytics Tools. The big data technology landscape: What‘s in Store?, NoSQL, Hadoop
UNIT-III 10 Hours Introduction to Hadoop: What‘s in Store?, Introducing Hadoop, Why Hadoop?, Why not RDBMS?, RDBMS versus Hadoop, Distributed Computing Challenges, A Brief History of Hadoop, Hadoop Overview, Business Value of Hadoop, Hadoop Distributors, Hadoop Distributed File System, Processing Data with Hadoop, Managing Resources and Application with Hadoop YARN, Hadoop Ecosystem.
SYLLABUS 2015 – 2018 Page 79
Introduction to MongoDB: What‘s in Store?, What is MongoDB?, Why MongoDB?, Terms used in RDBMS and MongoDB, Data Types in MongoDB, CRUD (Create, Read, Update and Delete).
UNIT-IV 10 Hours Introduction to Cassandra: What‘s in Store?, Apache Cassandra – An Introduction, Features of Cassandra, CQL Data Types, CQLSH , Keyspaces, CRUD , Collections, Using a Counter, Time To Live (TTL), Alter , Import and Export, System Tables, Practice Examples. Introduction to Hive: What‘s in Store?, What is Hive?, Hive Architecture, Hive Data Types, Hive File Format, Hive Query Language, RCFILE Implementation, SERDE, UDF.
UNIT-V 10 Hours Introduction to Pig: What‘s in Store?, What is Pig?, The Anatomy of Pig, Pig on Hadoop, Pig Philosophy, Use Case for Pig: ETL Processing, Pig Latin Overview, Data Types in Pig, Running Pig, Execution Modes of Pig, HDFS Commands, Relational Operators, Eval Function, Complex Data Type, Piggy Bank, UDF (User Defined Function), Parameter Substitution, Diagnostic Operator, Word Count Example, When to use Pig?, When NOT to use Pig?, Pig at Yahoo, Pig versus Hive , Hive Vs Pig. Jasper Report using Jasper Soft: What‘s in Store?, Introduction to JasperReports, Jaspersoft Studio, Connecting to MongoDB NoSQL database , Connecting to Cassandra NoSQL Databases.
Text Book: 1.Big Data and Analytics – Seema Acharya and Subhashini C – Wiley India.
Reference Books: 1.Big data for dummies - Judith Hurwitz, Alan Nugent,Fern Halper, Marcia Kaufman - Wiley India. 2.Hadoop- The Definitive Guide by Tom White – 3rd Edition, O‘reilley 3.Hadoop in action – Chuck Lam-1st Edition, Manning Publications. 4.Hadoop for dummies - Dirk Deroos, Paul C. Zikopoulos, Roman B. Melnyk,Bruce Brown- Wiley India.
Course outcomes On completion of this course, the students should be able to:
Differentiate between structured, semi-structured and unstructured data Describe the significance and importance of Big Data and Analytics Compare SQL, NoSQL, NewSQL, RDBMS and Hadoop Perform HDFS operations Perform CRUD operations using MongoDB and Cassandra Successfully import/export from/to CSV using MongoDB and Cassandra Distinguish between collection types such as SET, LIST and Map Create databases, tables and execute data manipulation language statements on it Differentiate between Pig and Hive Create JasperReports using Jaspersoft studio using data from NoSQL databases
SYLLABUS 2015 – 2018 Page 80
Course Code: P15MCA544 Semester : V L-T-P: 4 – 0 - 0 Course Title : Digital Image Processing
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand steps in digital image processing Learn different filters to smooth the images Discuss morphological operations on images Identify colour transformation techniques Understand Fourier transform and its applications
Course Content
UNIT-I 10 Hours Introduction, digital Image processing, fundamental steps in digital image processing, components of digital image processing system. Elements of visual perception, image sensing and acquisition, image sampling and quantization, some basic relationships between pixels. Intensity transformation and spatial filtering, Background, some basic intensity transformation function
UNIT-II 10 Hours Histogram processing, fundamentals of spatial filtering, smoothing spatial filters sharpening of spatial filters, filtering in the frequency domain background, preliminary concepts, sampling and the Fourier transform of sampled functions.
UNIT-III 10 Hours Image restoration and reconstruction, noise models, restoration in the presence of noise only spatial filtering, estimating the degradation, inverse filtering.
UNIT-IV 10 Hours Color Image Processing, color fundamentals, color models, pseudo color image processing, basics of full color image processing color transformations, formulation and color complements, smoothing and sharpening
UNIT-V 12 Hours Morphological image processing, preliminaries, erosion and dilation, opening and closing, hit-or-miss transformation. Image Segmentation, fundamentals, point line and edge detection.
Text Book: 1. Rafael C. Gonzaliz and Richard E.Woods,‖ Digital Image Processing‖, V edition, Prentice-Hall India
Reference Books: 1. S. Jayaraman, S. Esakkirajan, T. Veerakumar, ‖Digital Image Processing‖, Tata McGraw, Hill 2. W.K. Pratt, ‖Digital Image Processing‖, McGraw, Hill, New Delhi
SYLLABUS 2015 – 2018 Page 81
Course outcomes On completion of this course, the students should be able to: Describe elements of image processing Explain relationship between pixels and its connectivity Apply Fourier transformation on images Analyze the image transform in the spatial and frequency domains Examine the different colour models and its transformations
SYLLABUS 2015 – 2018 Page 82
Course Code: P15MCA545 Semester : V L-T-P: 4 – 0 - 0 Course Title : E-Commerce and M-Commerce Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Provide fundamental knowledge on e-Marketing Discuss e-Supply Chain Management and e-Strategy Understand Mobile Commerce and its Payment Method and Banking Understand mobile user interface control, Lateral Access, Label and Indicators Discuss Information System for Mobile Commerce Identify e-Customer relationship and e-Payment system
Course Content
UNIT-I 10 Hours Introduction Types of E-commerce, Advantages and Disadvantages of E-commerce, Supply chain management in E-commerce. Google, Traditional Marketing, Identifying Web presence Goal, The Browsing Behaviour Model, Online Marketing, E-advertising, Internet Marketing Trends, Target Market, E-branding, Marketing Strategies.
UNIT-II 12 Hours American Express Credit Card Authorization, Main concerns in Internet Banking, History‘s Lesson about Payments: People Drive Change, Digital Payment Requirements, Digital Token-based e-payment systems, Classification of New Payment Systems, Properties of Electronic Cash (e-Cash), Cheque payment Systems on the Internet, Risk and e-Payment System, Designing e-payment System, Digital Signature, Online Financial Services in India, Online Stock Trading: The High Speed Alternative.
UNIT-III 10 Hours Feex, Customer Relationship Management, Typical Business Touch-points, Orbitz, Naurik.com, Indianrail.gov.in.e-Supply chain at CISCO, Supply chain, Supply chain Management at Marico Industries Limited, Supply chain at Mahindra & Mahindra Limited.
UNIT-IV 10 Hours Knowledge Management at Tata Steel, Knowledge as a key Business Asset, Changes in the Global Business Economy, Changes in Technology, Defining Knowledge Management, Importance of Knowledge Management. Introduction E-publishing of Multimedia, Digitizing and storing of Books, Digitizing and storing Audio, Digitizing and storing Video, Distribution of e-books, Distribution of Audio, Video on Demand, Intellectual Property Issues.
UNIT-V 10 Hours Introduction Layered Architecture for M-commerce, Mobile Communication Infrastructure, Wireless Application Protocol, WAP Gateway, Wireless Markup Language, Secure Wireless Connectivity. Mobile Payment Methods Mobile Banking, Different Generations in Wireless Communication. Wireless Applications, Cellular Network, Wireless spectrum, Success stories of Mobile Commerce, Technologies for Mobile Commerce.
SYLLABUS 2015 – 2018 Page 83
Text Book: 1. P.T. Joseph, S.J: E-Commerce An Indian Perspective, PHI,2012
Reference Books: 1. AWAD, ELIAS M.: Electronic Commerce From Vision to Fulfilment, III-Eition: PHI-2012. 2. Henry Chan, Raymond Lce, Tharam Dillon: E-Commerce Fundamentals and Applications, Wiley,2012
Course outcomes On completion of this course, the students should be able to:
Explain Electronic Commerce and its Traditional Marketing Describe e-Supply Chain Management and e-Strategy Describe Mobile Commerce and Information Systems for Mobile Commerce Create/E-commerce application. Analysis Intellectual Property issues
SYLLABUS 2015 – 2018 Page 84
ELECTIVE GROUP-V
Course Code: P15MCA551 Semester : V L-T-P: 4 – 0 - 0 Course Title : Information Retrieval & Search Engines
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Describe Information Retrieval and Architecture of a search engine Analyse common algorithms and techniques for information retrieval (document, indexing and retrieval, query processing etc.) Design and implement retrieval systems for text and other media Describe probabilistic retrieval methods and ranking principles Explain different retrieval models such as Boolean model, vector space model and probabilistic model Evaluate information retrieval algorithms and analyse difficulties of evaluation
UNIT-I Introduction and Architecture of a Search Engine 06 Hours Information Retrieval, Search Engines, Search Engineers. Architecture, Basic Building Blocks, Text Acquisition, Text Transformation Index Creation, User Interaction, Ranking and Evaluation.
UNIT-II Crawls, Feeds and Processing Text 13 Hours Deciding what to search, Crawling the Web, Directory Crawling, Document Feeds, Conversion Problem, Storing the Documents, Detecting Duplicates, removes noise. Text Statistics, Document Parsing, Document Structure and Markup, Link Analysis, Information Extraction, Internationalization.
UNIT-III Ranking With Indexes 10 Hours Abstract Model of Ranking, Inverted indexes, Compression, Entropy and Ambiguity, Delta Encoding, Bitaligned codes, Auxiliary Structures, Index Construction, Query Processing.
UNIT-IV Queries and Interfaces , Evaluating Search Engines 13 Hours Information Needs and Queries ,Query Transformation and Refinement , Showing the Results Cross Language Search. The Evaluation Corpus, Logging, Effectiveness Metrics, Recall and Precision Averaging and Interpolation, Efficiency Metrics, Training, Testing, and Statistics.
SYLLABUS 2015 – 2018 Page 85
UNIT-V Retrieval Models 10 Hours Overview of Retrieval Models , Boolean Retrieval , The Vector Space Model, Probabilistic Models, Information Retrieval as Classification, BM25 Ranking Algorithm, Complex Queries and Combining Evidence, Web Search, Machine Learning and Information Retrieval.
Text Book 1. Search Engines: Information Retrieval in Practice: Trevor Stroh man, Bruce Croft Donald Metzler, Kindle Edition
Reference Book: 1. Information Retrieval: Stefan, Charles L.A, Clarke, Gordon, V. Cormack
Course outcomes On completion of this course, the students should be able to:
Apply Information Retrieval (IR) principles to locate and retrieve relevant information in large collection of data Design the infrastructure of a search engine or any text retrieval systems Apply different IR techniques in various application areas Define a different retrieval models and explain the difference between them Develop web applications with retrieval capabilities.
SYLLABUS 2015 – 2018 Page 86
Course Code: P15MCA552 Semester : V L-T-P: 4 – 0 - 0 Course Title : Business Intelligence - Data Warehousing and Analytics Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Explain business enterprise organization, its functions, core business process and purpose of using IT in business Discuss the role of OLAP and OLTP tools in the Business Intelligence (BI) architecture with different data models Understand definition of BI, BI terminologies and framework, basics of data integration [ETL] in context of data warehousing and multidimensional data modeling Demonstrate the terminologies associate with measurement Illustrate enterprise reports using Microsoft tools
Course Content
UNIT-I 10 Hours Introduction to Business Intelligence: Business enterprise organization, Its functions, and core business processes, Key purpose of using IT in business, The connected world: Characteristics of Internet-Ready IT Applications, Enterprise Applications, Introduction to digital data and its types – structured, semi- structured and unstructured. Introduction to OLTP and OLAP: On-Line Transaction Processing (OLTP) and On-Line Analytical Processing (OLAP): Different, OLAP architectures, OLTP and OLAP, Data models for OLTP and OLAP.
UNIT-II 10 Hours Role of OLAP tools in the BI architecture, OLAP performance directly on operational databases, A peek into the OLAP operations on multidimensional data, Leveraging ERP data using analytics. Getting started with business intelligence: Using analytical information for decision support, Information sources before dawn of BI, Business intelligence (BI) defined, Evolution of BI and role of DSS, EIS, MIS and digital dashboards, Need for BI at virtually all levels, BI for past, present and future, The BI value chain, Introduction to business analytics.
UNIT-III 12 Hours BI Definitions and concepts: BI Component framework, Need of BI, BI Users, Business Intelligence applications, BI Roles and responsibilities, Best practices in BI/DW, The complete BI professional, Popular BI tools. Basis of data integration: Need for data warehouse, Definition of data warehouse, data mart, OSS, Raiph Kimball‘s approach vs. W.H.Inmon‘s approach, Goals of a data warehouse, constituents of a data warehouse, Extract, transform, load, data Integration, Data integration technologies, Data quality, Data profiling.
UNIT-IV 10 Hours Multidimensional data modeling: Introduction, Data modeling basis, Types of data model, Data modeling techniques, Fact table, Dimension table, typical dimensional models, Dimensional modeling
SYLLABUS 2015 – 2018 Page 87
life-cycle, designing the dimensional model, Step-by-step lab guide to analyze data using MS Excel 2010. Measures, metrics, KPIs, and Performance management: Understanding measures and performance, Measurement system terminology, Navigating a business enterprise, role of metrics, and metrics supply chain, ―Fact-Based Decision Making‖ and KPIs
UNIT-V 10 Hours KPI Usage in companies, business metrics and KPIs, Connecting the dots: Measures to business decisions and beyond. Basics of enterprise reporting: Reporting perspectives common to all levels enterprise, Report standardization and presentation practices, Enterprise reporting characteristics in OLAP world, Balanced scorecard, Dash boards and its creation, Scorecards vs. Dashboards, The buzz behind analysis, Step-by- step lab guide to create enterprise reports using MS Access.
Text Book: 1. ― Fundamentals of Business Analytics‖ – By R N Prasad and Seema Acharya, Publishers: Wiley India.
Reference Books: 1. Larissa T Moss and Shaku Atre – Business Intelligence Roadmap : The Complete Project Lifecycle for Decision Support Applications, Addison Wesley Information Technology Series 2. David Loshin - Business Intelligence: The Savvy Manager's Guide, Publisher: Morgan Kaufmann 3. Brian Larson - Delivering Business Intelligence with Microsoft SQL Server 2005, Mc Graw Hill.
Course outcomes On completion of this course, the students should be able to:
Identify key components of BI tool sets Differentiate between OLTP and OLAP systems Choose to leverage analytics to make better business decisions Demonstrate process associated with BI framework and apply best practices in BI/Data warehousing Identify the metrics, KPIs and make recommendation to achieve the business goal in a given business scenario Generate enterprise reports and design enterprise dashboard
SYLLABUS 2015 – 2018 Page 88
Course Code: P15MCA553 Semester : V L-T-P: 4 – 0 - 0 Course Title : Storage Area Network
Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand the elements, requirements and challenges associated with data center infrastructure. Explain physical and logical components of a storage infrastructure including storage subsystems, RAID and intelligent storage systems. Describe the concept of RAID and different RAID levels and their suitability for different application environments. Learn Fibre Channel protocols and how SAN components use them to communicate with each other. Describe files sharing operations on NAS and IP-SAN of the different network. Understand the forms, challenges and types of storage virtualization. Understand and articulate business continuity solutions –backup and replications, along with archive for managing fixed content. Describe information security requirements and solutions, and identify parameters for managing and monitoring storage infrastructure.
Course Content
UNIT-I 10 Hours Introduction to Information Storage and Management: Information Storage, Evolution of Storage Technology and Architecture, Data Center Infrastructure, Information Lifecycle management. Storage System Environment: Components of a Storage System Environment, Disk Drive Components, Disk Drive Performance, Logical Components of the Host. Data Protection(RAID): Implementation of RAID, RAID array components, RAID Levels : Stripping, Mirroring, Parity, RAID 0, RAID 1, Nested RAID, RAID 3, RAID 4, RAID 5, RAID 6.
UNIT-II 10 Hours Intelligent Storage System:Components of an Intelligent Storage System : Front End, Cache, Back End, Physical Disk. Intelligent Storage Array, Concepts in practice. Direct – Attached Storage and Introduction to SCSI: Types of DAS, Internal DAS, External DAS, DAS Benefits and Limitations. Disk drive Interfaces, Introduction to Parallel SCSI, SCSI Command model. Storage Area Networks: Fibre Channel: Overview, The SAN and its Evolution, Components of SAN, FC Connectivity, Fibre channel ports, Fibre channel Architecture, Zoning, FC topologies : Core – Edge Fabric, Mesh Topology, Concept in Pracice: EMC Connectrix Summary.
UNIT- III 12 Hours Network – Attached Storage: General-purpose servers vs NAS Devices, Benefits of NAS. NAS File I/O, Components of NAS, NAS Implementations, NAS File-sharing protocols, NAS I/O Operations, Factors affecting NAS performance. Concepts in practice: EMC Celera.
SYLLABUS 2015 – 2018 Page 89
IP SAN: iSCSI : Components of iSCSI, iSCSI Host Connectivity, Topologies for iSCSI Connectivity, iSCSI protocol stack , iSCSI discovery, names , session, PDU, ordering and numbering . FCIP : FCIP topology, FCIP topology. Content-Addressed Storage: Fixed content and archives, Features and Benefits of CAS, CAS Architecture, Object-storage and retrieval in CAS, CAS examples. Concepts in practice: EMC Centera.
UNIT-IV 10 Hours Introduction to Business Continuity: Information availability, BC Terminology, BC Planning Lifecycle, Failure analysis. Backup and Recovery: Backup purpose, Backup Considerations, Backup Granularity, Backup methods, Backup topologies, Backup Technologies: Backup to Tape, Backup to Disk. Local Replication: Local Replication Technologies, Restore and Restart Considerations, Creating multiple Replicas. UNIT-V 10 Hours Remote Replication: Modes of Remote Replication, Remote Replication Technologies, Network infrastructure. Securing and Storage Infrastructure: Storage security frame work, Risk Triad, Storage Security Domain Manging the Storage Infrastructure: Managing the Storage Infrastructure, storage management activities, storage infrastructure management challenges.
Text Book: 1. G. Somasundaram, Alok Shrivastava, EMC Education Services, ―Information Storage and Management―, Wiley Publishing, Inc.
Reference Books: 1. Richard Barker and Paul Massiglia, Storage Area Network Essentials A complete Guide to understanding and implementing SAN‘s, John Wiley India, 2002. 2. Robert Spalding, "Storage Networks-The Complete Reference", TMH 2003.
Course outcomes On completion of this course, the students should be able to:
Explain the elements, requirements and challenges associated with data center infrastructure. Discuss different types of logical and physical components of a storage infrastructure. Describe the different types of RAID implementations and their benefits. Understand the importance of Fibre Channel protocols and how to communicate with each other. Describe the benefits of the different network storage options for different application environments. Identify single points of failure in a storage infrastructure and list solutions. Describe the different role in providing disaster recovery and business continuity capabilities. Identify and analyzes the common threats in each domain.
SYLLABUS 2015 – 2018 Page 90
Course Code: P15MCA554 Semester : V L-T-P: 4 – 0 - 0 Course Title : Software Project Management Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Describe the activities of Software project management and the technologies used for Software Engineering and project planning. Understand different types of project evaluation techniques. Explain the concept of project schedule and Risk Management Understand the technique of cost Monitoring and change control. Understand how to manage people and organizational and behavioural technique .
UNIT-I Introduction to Software Project Management 08 Hours Project Definition – Contract Management – Activities Covered By Software Project Management- Overview of Project Planning – Stepwise Project Planning.
UNIT-II Project Evaluation 08 Hours Strategic Assessment-Technical Assessment-Cost Benefit Analysis –Cash Flow Forecasting-Cost Benefit Evaluation Techniques-Risk Evaluation.
UNIT-III Activity Planning 12 Hours Objectives – Project Schedule – Sequencing and Scheduling Activities –Network Planning Models- Forward Pass – Backward Pass – Activity Float – Shortening Project Duration – Activity on Arrow Networks – Risk Management – Nature Of Risk – Types Of Risk – Managing Risk – Hazard Identification – Hazard Analysis – Risk Planning And Control.
UNIT-IV Monitoring and Control 12 Hours Creating Framework – Collecting The Data – Visualizing Progress – Cost Monitoring – Earned Value- Prioritizing Monitoring – Getting Project Back To Target – Change Control – Managing Contracts- Introduction – Types Of Contract – Stages In Contract Placement – Typical Terms Of A Contract- Contract Management – Acceptance.
UNIT-V Managing People And Organizing Teams 12 Hours Introduction – Understanding Behavior – Organizational Behavior: A Background – Selecting The Right Person For The Job – Instruction In The Best Methods – Motivation – The Oldman – Hackman Job Characteristics Model – Working In Groups – Becoming A Team –Decision Making – Leadership – organizational Structures – Stress –Health And Safety – Case Studies.
Text Book: 1. ―Software Project Management‖, Bob Hughes, Mikecotterell, Third Edition, Tata McGraw Hill, 2004.
Reference Books: 1. Software Engineering Project management, Wiley Edition Second Edition edited by Richard H Thayer Foreword by Edward Yourdon. 2. ―Information Technology Project Management‖, Jack T. Marchewka, 3rd edition, Wiley India, 2009.
SYLLABUS 2015 – 2018 Page 91
Course outcomes On completion of this course, the students should be able to:
Identify the significance of activities of Software Project management and project planning Able to Distinguish different types of cost benefit evaluation techniques. Understand the concept of Risk Management and organizing team. Analyze monitoring and control techniques for software project management. Apply organizational and behavioural technique in project management.
SYLLABUS 2015 – 2018 Page 92
Course Code: P15MCA555 Semester : V L-T-P: 4 – 0 - 0 Course Title : Computer Vision Credits:4 Contact Period : 52 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Understand computer vision Learn Image representation and Image analysis Discuss different filters Identify the image enhancement techniques Learn different compression techniques
Course Content
Unit-I Introduction to Computer Vision and Image Processing 10 Hours Overview: Computer Imaging, Computer Vision, Image Processing, Computer Imaging Systems, Human Visual Perception: The Human Visual System, Spatial Frequency Resolution, Brightness Adaptation, Temporal Resolution. Image Representation: Binary Images, Gray-Scale Images, Color Images, Multispectral Images. Digital Image File Formats.
Unit-II Image Analysis 12Hours Introduction: overview, System Model. Preprocessing: Region-of-Interest Image Geometry, Image Algebra, Spatial Filters. Edge/Line. Detection: Roberts Operator, Sobel Operator, Prewitt Operator, Laplacian Operators, Hough Transform. Segmentation: Overview, Region Growing and SHrsinking, Clustering Techniques, Boundary Detection, Morphological Filtering. Discrete Transforms: Fourier Transform, Cosine Transform, Wavelet Transform. Feature Extraction and Analysis: Feature Vector and Feature Spaces, Binary Object Features.
Unit-III Image Restoration 10 Hours Introduction: System Model, Noise, Noise Removal Using Spatial Filters: Order Filters, Mean Filters, Adaptive Filters-Minimum Mean-Square Error Filter. Frequency Domain Filters: Inverse Filter, Wiener Filter, Constrained Least-Squares Filter, Geometric Mean Filters, Notch Filter. Geometric Transforms: Spatial Transforms.
Unit-IV Image Enhancement 10 Hours Introduction, Gray-Scale Modification: Histogram Modification, Adaptive Contrast Enhancement, Color. Image Sharpening: Highpass Filtering, High-Frequency Emphasis, Homomorphic Filtering, Unsharp Masking. Image Smoothing: Mean and Median Filtering, Lowpass Filtering.
Unit-V Image Compression 10 Hours Introduction: Fidelity Criteria, Compression System Model. Lossless Compression Methods: Huffman Coding, Run-Length Coding, Lempel-Ziv Welch Coding, Arithmetic Coding. Lossy Compression Method: Gray-Level Run-Length Coding, Block Truncation Coding, Vector Quantization, Differential Predictive Coding, Transform Coding, Hybrid Methods.
SYLLABUS 2015 – 2018 Page 93
Text Book: 1. Scott E Umbaugh,‖Computer vision and Image processing‖, International Edition
Reference Books: 1. Robert Haralick and Linda Shapiro,‖Computer and Robot Vision‖, Vol I,II,AddisonWesley, 1993. 2. Milan Sonka, Vaclav Hlavac, Roger Boyle, ―Image Processing, Analysis, and Machine Vision: Thomson Learning.
Course outcomes On completion of this course, the students should be able to: Describe human visual perception and computer vision Explain region growing and shrinking methods Apply different edge and line detection operators Identify different lossless and lossy compression methods Analyse image smoothing filters
SYLLABUS 2015 – 2018 Page 94
Course Code: P15MCA56 Semester : V L-T-P: 0 – 0 - 2 Course Title : .NET LAB Credits:1 Contact Period : 26 Hrs, Exam: 3Hrs Weightage :CIE:50% SEE:50%
Course Learning Objectives (CLOs) The objectives of this course are to:
Use the Visual Studio IDE to create and debug Console applications, Windows Forms Application and ASP.NET Web applications. Write C# code to demonstrate the concepts Command Line Arguments, Operator Overloading, Object Oriented Techniques, Interfaces, Delegates and Exception handling Demonstrate to implement windows applications using C#.NET Illustrate a data driven web applications using ADO.NET and ASP.NET
PART A
1. Write a Program in C# to demonstrate Command line arguments processing. 2. Write a Program in C# to demonstrate boxing and Unboxing. 3. Write a program to demonstrate the static members. 4. Find the sum of all the elements present in a jagged array of 3 inner arrays. 5. Using Try, Catch and Finally blocks write a program in C# to demonstrate error handling. 6. Demonstrate use of virtual and override key words in C# with a simple program. 7. Write a program to demonstrate delegates. 8. Write a program to demonstrate abstract class and abstract methods in C#. 9. Write a program to illustrate the use of different properties in C#. 10. Write a Program in C# to build a class which implements an interface.
PART – B
1. Consider the Database STUDENT consisting of following tables: tbl_Course (CourseID: int, CourseName: string) tbl_Student (USN: string, StudName: string, Address: string, CourseID: int, YrOfAdmsn: int) Develop suitable windows application using C#.NET having following options: 1. Entering new course details. 2. Entering new student details. 3. Display the details of students (in a Grid) who belong to a particular course. 4. Display the details the students who have taken admission in a particular year.
2. Consider the Database BLOODBANK consisting of following tables: tbl_BloodGroup (BloodID: int, BloodGroup: string) tbl_Donor (DonorID: int, DonorName: stirng, Address:string, ContactNo: int, DOB: date, Gender: string, Weight: int, BloodID: int) Develop suitable windows application using C#.NET having following options: 1. Entering Blood group details. 2. Entering new donor details. 3. Display the details of donors (in a Grid) having particular blood group. 4. Display the details of donors (in a Grid) based on gender. 5. Display the details of donors (in a Grid) based on age (above 18), weight (above 45KG) and Gender(user‘s choice).
SYLLABUS 2015 – 2018 Page 95
3. Consider the Database STUDENT consisting of following tables: tbl_Course (CourseID:int, CourseName: string) tbl_Book (BookID :int, BookTitle: string, Author: string,CourseID: int) tbl_Student (USN: string, StudName: string, CourseID: int) tbl_BookIssue(USN: string, BookID: int, IssueDate: Date) Develop suitable windows application using C#.NET having following options: 1. New Course Entry. 2. New Book Entry 3. New Student Entry 4. Issue of books to a student. 5. Generate report (display in a grid) showing all the books belonging to particular course. 6. Generate report (display in a grid) showing all the books issued on a particular date. 7. Generate report (display in a grid) showing all the books issued to a particular student.
4. Develop a Web Application using C#.NET and ASP.NET for an educational institution. The master page should consist of Institution Name, Logo and Address. Also, it should provide hyperlinks to Departments, Facilities Available and Feedback. Each department page and facilities page should be designed as static pages. The hyperlinks should navigate to these static pages in the form of Content Pages associated with Master Page designed. The Feedback page should have fields to enter Name, Email and Message with Submit and Cancel Buttons. Database should be created to store these three data.
5. Develop a Web Application using C#.NET and ASP.NET for a Bank. The BANK Database should consist of following tables: tbl_Bank (BankID: int, BankName: string) tbl_Branch (BranchID: int, BankID: int, BranchName: string) tbl_Account (AccountNo: int, BankID: int, BranchID: int, CustomerName: string, Address: string, ContactNo: int, Balance: real) (Note: AccountNo and BankID together is a composite primary key). The master page of this web application should contain hyperlinks to New Bank Entry, New Branch Entry (of selected Bank), New Customer Entry (based on branch and bank) and Report Generation. The hyperlinks should navigate to respective content pages. These content pages provide the fields for respective data entry. The reports should be generated (display in grid) as below: 1. Display all records of particular bank. 2. Display all records of a branch of particular bank. 3. The balance should be displayed for the entered account number (Bank and Branch are input through ComboBox controls and Account number is input through TextBox).
Course outcomes On completion of this course, the students should be able to:
Implement small C# applications using basic concepts and Object Oriented techniques Use Exception handling classes while implementing C# applications. Develop user interactive windows applications Implement , debug and deploy ASP.NET Web applications Design and establish frontend and backend connectivity using ODBC
Note: 1. Students are required to execute one question from Part A and one from Part B
SYLLABUS 2015 – 2018 Page 96
Course Code: P15MCA57 Semester : V L-T-P: 0 – 0 - 6 Course Title : Mini Project Credits:3 Contact Period : 52 Hr, Exam: 3Hr Weightage :CIE:50% SEE:50%
Mini Project Guidelines:
A team of TWO students must develop the mini project. However, during the examination, each student must demonstrate the project individually. The team may implement a mini project of their choice. The team must submit a Brief Project Report (25 to 30 Pages) that must include the following: Introduction Requirements Software Development Process Model Adopted Analysis and Design Models Implementation Testing SEE: The Report must be valued for 10 marks, 30 marks for Demonstration and 10 marks for Viva-Voce.
SYLLABUS 2015 – 2018 Page 97
VI Semester Project Work
Guidelines
1. Students are required to take up individual project in companies or in the college other than the mini project standards already taken up during previous semesters. 2. Project should be real time work, for total of 5 months duration. 3. Project work may be application oriented or research oriented. Therefore the project reports will vary depending on whether it is application oriented project or research based project. 4. Regular project work weekly dairy should be maintained by the students, signed by the external guide and internal guide in order to verify the regularity of the student.(Enclosing the Format) 5. Seminars / Presentation should be given for Synopsis, SRS, Design and project completion levels. 6. Project work is monitored at various levels (Phases) by the internal guide. 7. If project report is not as per the format external guides has right to reject the project 8. Students should present their project demo along with power point slide during their viva-voce exams.
SYLLABUS 2015 – 2018 Page 98