Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
DEPARTMENT OF COMPUTER APPLICATIONS 2014 REGULATION Curriculum for Master of Computer Applications from Semester I to VI SEMESTER I Course code Hours / week Course title THEORY COURSES Mathematical Foundations of Computer 140CA0101 Science 140CA0102 Problem Solving Techniques 140CA0103 Computer Organization 140CA0104 Programming in C 140CA0105 IT Essentials Max marks 100 L T P Credits 3 1 0 4 100 3 3 3 3 1 0 0 0 0 0 0 0 4 3 3 3 100 100 100 100 0 0 4 2 100 0 0 4 2 100 0 15 0 2 4 12 2 23 100 800 PRACTICAL COURSES 140CA0107 140CA0108 140CA0109 Problem Solving and Programming Laboratory using C Hardware & Trouble Shooting Laboratory Communication Skills Laboratory TOTAL SEMESTER II Course code Hours / week Course title THEORY COURSES 140CA0201 Resource Management Techniques 140CA0202 System Software 140CA0203 Object Oriented Programming 140CA0204 Human Values and Professional Ethics 140CA0205 Web Programming L T P Credits 3 3 3 3 3 1 0 1 0 0 0 0 0 0 0 4 3 4 3 3 Max marks 100 100 100 100 100 100 PRACTICAL COURSES 140CA0207 Object Oriented Programming Laboratory 0 0 4 2 100 140CA0208 System Software Laboratory 0 0 4 2 100 140CA0209 Web Programming Laboratory 0 0 4 2 100 15 2 12 23 800 TOTAL SEMESTER III Hours / week Course code Course title L T P Credits Max marks 100 THEORY COURSES 140CA0301 Operating Systems 3 0 0 3 100 140CA0302 Software Engineering 3 0 0 3 100 140CA0303 Java Programming 3 0 0 3 100 140CA0304 Data Structures & Algorithms 3 1 0 4 100 140CA0305 Database Management Systems 3 1 0 4 100 PRACTICAL COURSES 140CA0307 Java Programming Laboratory 0 0 4 2 100 140CA0308 Data Structures & Algorithms 0 0 4 2 100 140CA0309 DBMS Laboratory 0 0 4 2 100 15 2 12 23 800 TOTAL SEMESTER IV Hours / week Course code Course title L T P Credits Max marks 100 THEORY COURSES 140CA0401 Computer Networks 3 0 0 3 100 140CA0402 Mobile Programming 3 1 0 4 100 140CA0403 Web Application Development 3 1 0 4 100 140CA0404 Elective – I 3 0 0 3 100 140CA0405 Elective – II 3 0 0 3 100 PRACTICAL COURSES 140CA0407 Mobile Programming Laboratory 0 0 4 2 100 140CA0408 Web Application Development Laboratory 0 0 4 2 100 140CA0409 Mini Project 0 0 6 3 100 15 2 14 24 800 TOTAL SEMESTER V Hours / week Course code Course title L T P Credits Max marks 100 THEORY COURSES 140CA0501 Software Project Management 3 0 0 3 100 140CA0502 Cloud Computing 3 0 0 3 100 140CA0503 Big Data Analytics 3 1 0 4 100 140CA0504 Elective III 3 0 0 3 100 140CA0505 Elective IV 3 0 0 3 100 PRACTICAL COURSES 140CA0507 Software Testing Lab 0 0 4 2 100 140CA0508 Open Source Elective –IV Laboratory 0 0 4 2 100 15 2 8 20 700 TOTAL SEMESTER VI Course code Hours / week Course title L T Credits P Max marks 100 PRACTICAL COURSES 140CA0607 Project Work - - 24 12 400 SEMESTER – IV –LIST OF ELECTIVES Course code ELECTIVE I 140CA9111 140CA9112 140CA9113 140CA9114 140CA9115 140CA9116 ELECTIVE II 140CA9117 140CA9118 140CA9119 140CA9120 140CA9121 Hours / week Course title L T Credits P Max marks 100 Software Architecture Design Patterns Human Computer Interface Cyber Security Accounting & Financial Management Data Mining & Data Warehousing 3 3 3 3 3 3 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 100 100 100 100 100 100 Agile Software Development UNIX & Networking Programming Service Oriented Architecture Virtualization Techniques Health Care Management 3 3 3 3 3 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 100 100 100 100 100 SEMESTER – V –LIST OF ELECTIVES Course code Hours / week Course title L T Credits P Max marks 100 ELECTIVE III 140CA9122 140CA9123 140CA9124 140CA9125 140CA9126 140CA9127 * Software Quality Assurance Enterprise Application Integration Business Intelligence Social Network Analysis Database Architecture & Administration Research Methodology 3 3 3 3 0 0 0 0 0 0 0 0 3 3 3 3 100 100 100 100 3 0 0 3 100 3 0 0 3 100 ELECTIVE IV OPEN SOURCE ELECTIVE –IV LABORATORY * 140CA9128 Software Testing Laboratory 3 0 0 3 100 140CA9129 Groovy & Grails Laboratory 3 0 0 3 100 140CA9130 PHP & MYSQL Laboratory 3 0 0 3 100 140CA9131 Perl & Python Programming Laboratory 3 0 0 3 100 140CA9132 Interactive Web Programming Laboratory 3 0 0 3 100 140CA9133 Android Application Laboratory 3 0 0 3 100 *Elective IV Subject has their corresponding Laboratory + For Research Scholars only 140CA0101 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE Category: General Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: Acquire the knowledge of mathematical foundation concepts to solve the real time problems in the field of Computer Science. OBJECTIVES: Understand the basic concepts and operations of mathematics in the field of computer graphics. Understand and apply the functional theory concepts relating to input and output functions in computer science. Impart discrete knowledge through finite automata and Context free grammars in the design of a Compiler. UNIT I MATRIX ALGEBRA 9+3 Matrices, Rank of Matrix, Solving System of Equations - Eigen values and Eigen Vectors - Inverse of a Matrix - Cayley Hamilton Theorem. UNIT II BASIC SET THEORY 9+3 Basic Definitions- Venn Diagrams and set operations – Laws of set theory- Principles of inclusion and exclusion-Partitions-Permutation and Combination- Relations – Properties of relations –Matrices of relations –Closure operations on relations- Functions – injective, surjective and bijective functions. UNIT III MATHEMATICAL LOGIC 9+3 Propositions and logical operators - Truth table - Propositions generated by a set, Equivalence and implication - Basic laws - Functionally complete set of connectives - Normal forms - Proofs in Propositional calculus - Predicate calculus. UNIT IV DISCRETE PROBABILITY 9+3 Finite probability - Conditional probability - Independence – Bayes theorem-Mathematical expectationProbability Distribution (Binomial, Poisson, Geometric and their Properties). UNIT V FINITE AUTOMATA 9+3 Introduction to formal proof- Additional forms of proof- Inductive proofs- Finite Automata (FA)Deterministic Finite Automata(DFA)-Non-deterministic Finite Automata(NFA)- Finite Automata with Epsilon transitions. TEXT BOOKS: 1. Kenneth H. Rosen, Discrete Mathematics and its applications, Tata McGraw Hill, Fourth Edition, 2002. 2. Tremblay J P and Manohar, Discrete Mathematical Structures with Applications to Computer Science, TMH, 1997. REFERENCE BOOKS: 1. M K Venkataraman, Engineering Mathematics Volume II, National Publishing company, Second Edition, 1989 . 2. J E Hopcroft, R Motwani and J D Ullman, Introduction to Automata Theory, Languages and Computations, Second Edition, Pearson Educations, 2003 . 3. Ross S, A First course in Probability Sixth edition, TMH, Delhi, 2002. 140CA0102 PROBLEM SOLVING TECHNIQUES Category: General Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: Learn and apply the concepts of problem solving and make great decisions, and do a wide array of tasks in different kinds of problems. OBJECTIVES: Explore skills to identify a problem and design appropriate solutions. Develop the ability to solve factoring methods & related problems. Understand the concept of Array & its related problems with applications. Develop the ability to perform sorting & searching. Explore the process of text editing & pattern matching. UNIT I INTRODUCTION TO COMPUTER PROBLEM-SOLVING 9+3 Introduction – The Problem-solving Aspect - Top-down Design -implementation of AlgorithmsProgram Verification - The Efficiency of Algorithms. Fundamental Algorithms - Exchanging the values of Two Variables – Counting - Summation of a set of Numbers - Factorial Computation-Sine function computation - Generation of the Fibonacci sequence - Reversing the Digits of an Integer - Base Conversion- Character to Number Conversion. UNIT II FACTORING METHODS 9+3 Finding the square Root of a number - The Smallest Divisor of an Integer – The Greatest Common Divisor of Two Integers - Generating Prime Numbers – Computing the Prime Factors of an Integer Generation of Pseudo - random Numbers – Raising a Number to a Large Power - Computing the nth Fibonacci Number. UNIT III ARRAY TECHNIQUES 9+3 Array Order Reversal-Array Counting or Histogramming - Finding the Maximum Number in a Set Removal of Duplicates from an Ordered Array - Partitioning an Array - Finding the kth Smallest Element - Longest Monotone Subsequence. UNIT IV SORTING AND SEARCHING 9+3 Sorting – Internal Sorting – Bubble Sort, Insertion Sort, Quick Sort, Heap Sort,Radix Sort – External Sorting – Merge Sort, Multi - way Merge Sort, Polyphase Sorting. Searching Techniques :Binary Search – Hash Searching. UNIT V TEXT PROCESSING AND PATTERN SEARCHING 9+3 Text Line Length Adjustment - Left and Right Justification of Text – Keyword Searching in Text - Text Line editing - Linear Pattern Search - Sub linear Pattern Search. TEXT BOOK: 1. R.G.Dromey, How to Solve it by Computer, Second Edition ,Pearson Education, India, 2008. REFERENCE BOOKS: 1. Stephen G.Kochen, Programming in C: A Complete Introduction to the C Programming Language, Third Edition, Pearson Education, 2014. 2. Rajaram R, Chitra P, Problem Solving using C, Scitech Publication, 2001. 140CA0103 COMPUTER ORGANIZATION Category : Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours : 45 Credit :3 AIM: This course aims to impart knowledge on the various aspects of computer organization of modern digital computer systems to the students. OBJECTIVES: Illustrate the design principle of the various functional units of digital systems. Classify the memory and programmable logic Knowledge of Input–Output organization and Interrupts. Analyze instruction sets, addressing mode and instruction formats in digital computer. Fundamentals of multiple processors and multicore computers. UNIT I NUMBER SYSTEMS AND BOOLEAN ALGEBRA 9 Number Systems and conversions –– Complements - Binary Codes – Binary Logic – Basic theorems and properties of Boolean algebra – Boolean Functions – Canonical and Standard Forms – Gate level minimization. UNIT II COMBINATIONAL AND SEQUENTIAL LOGIC 9 Combinational Circuits: Design procedure – Binary Adder & Subtractor – Decoders – Encoders Multiplexers – Sequential Circuits – Latches - Flip Flops - Registers – Shift Registers – Ripple Counters. UNIT III MEMORY AND INPUT/OUTPUT ORGANIZATION 9 Random Access Memory – Memory Decoding – error Detection and correction – Read only memory – Programmable Logic Array – Programmable Array Logic. External Devices – Input/Output modules – Programmed I/O – Interrupt driven I/O - Direct Memory Access - Input/ Output Channels and Processors. UNIT IV CPU ORGANIZATION 9 Instruction Sets: Characteristics and Functions – Machine Instruction Characteristics – Types of Operands – Intel x86 and ARM Data types – Types of Operations – Addressing Modes and Formats: Addressing – x86and ARM Addressing Modes – Instruction Formats - x86and ARM Instruction Formats - Processor organization – Register Organization – Instruction cycle. UNIT V PARALLEL ORGANIZATION 9 Parallel Processing: Use of multiple processors – Symmetric multiprocessors – Cache Coherence and MESI protocol – Multithreading and Chip Multiprocessors – clusters. Multicore Computers: Hardware Performance Issues – software Performance issues – Multicore organization – Intel x86 multicore organization. TEXT BOOKS: 1. M.Morris Mano,Michael D.Ciletti, Digital Design,Fourth Edition,Pearson Education, 2011. (Unit I to III) 2. William Stallings, Computer Organization and Architecture, Eighth Edition, PHI, 2012.(Unit IV & V). REFERENCE BOOKS: 1. David A Patterson; John L Hennessy, Computer Organization And Design The Hardware Software Interface, Fourth Edition ,Morgan Kaufmann Publishers, 2009. 2. Nicholas Carter ,Computer Architecture,Tata Mcgraw Hill Publishing Company Limited,2007. 140CA0104 PROGRAMMING IN C Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: Learn the concepts of programming and develop real time applications. OBJECTIVES: On successful completion of this course, students will be able to, Understand the differences between array and structure. Create custom applications using pointers. Develop custom applications using structure and union with file concepts. Design and implement real time applications. . UNIT I BASICS OF C LANGUAGE 9 Overview of C Language - Constants, Variables and Data Types - Operators, Expressions and Assignment statements - Managing Input/Output Operations - Formatted I/O - Decision Making Branching - IF, Nested IF - Switch - goto - Looping- while, do, for statements. UNIT II ARRAYS AND FUNCTIONS 9 Arrays - dynamic and multi-dimensional arrays - Character arrays and Strings - String handling Functions - User defined Functions - Categories of Functions - Recursion. UNIT III STRUCTURES AND UNIONS 9 Basics of Structures-Declaring a Structure - Array of Structures- passing Structures elements to Functions - Passing entire Structure to Function - Structures within Structures - Union - Union of Structures - Enumerated Data Types - typedef Statement. UNIT IV POINTERS 9 Pointers - Declaration - Accessing a variable - Dynamic memory allocation - Pointers versus ArraysArray of pointers- Pointers to functions and structure Pointers. UNIT V FILE MANAGEMENT 9 File Management in C - Data hierarchy- Files and Streams - Sequential access file- Random access file – Preprocessors. TEXT BOOK: 1. Stephen G.Kochen, Programming in C: A Complete Introduction to the C Programming Language, Third Edition, Pearson Education, 2008. REFERENCE BOOKS: 1. Al Kelley, Ira Pohl, A Book on C: Programming in C, Fourth Edition, Addison-Wesley Professional, 2010. 2. Yashavant P. Kanetkar Understanding Pointers in C, BPB Publications, New Delhi, 2009. 3. Byron C Gottried, Programming with C, Schuams‘ Outline series, Second Edition, Tata McGraw Hill, 2006. 4. M.T. Somashekara, Programming in C, Prentice-Hall of India Pvt.Ltd, 2005. 5. Richard Johnsonbaugh, Applications Programming In ANSI C, Third edition, Pearson Education, 2003. 140CA0105 IT ESSENTIALS Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to impart the skills for assembling the systems with the help of hardware devices and software. OBJECTIVES: • Learning about the personal computers and internal components of a computer. • Enlightening the overview of techniques involved in assembling the computers. • Practical exposure of procedures needed for hardware and software installations, up gradation and troubleshooting systems UNIT I THE PERSONAL COMPUTER 9 Introduction- Cases and Power Supplies-Internal PC Components-ROM and RAM -External Ports and Cables -Input and Output Devices -Selecting PC Components- Specialized Computer SystemsLab Procedures and Tool Use- Safe Lab Procedures - Procedures to Protect Equipment and Data Procedures to Protect the Environment -Proper Use of Tools UNIT II COMPUTER ASSEMBLY 9 Open the Case and Install the Power Supply- Install the Motherboard - Install the Drives -Install the Adapter Cards - Install the Cables - POST and BIOS - BIOS Configuration - Motherboard and Related Components - Storage Devices - Input and Output Devices - Preventive Maintenance– Troubleshooting Process Steps. UNIT III OPERATING SYSTEMS & NETWORKS 9 Modern Operating Systems- Types of Operating Systems - Operating System Installation- Custom Installation Options -Boot Sequence and Registry Files- Multiboot- Directory Structure and File Attributes - Windows GUI and Control Panel -Client-Side Virtualization. Networks –Principles-Basic Networking Concepts and Technologies- Ports and Protocols-Physical Components- Cables and Connectors- Network Topologies- Ethernet Standards - OSI and TCP/IP Data Models-Wireless and Wired Router Configurations-OS Configurations- ISP UNIT IV LAPTOPS & MOBILE DEVICES 9 Introduction-Laptop Components -Internal Components- Laptop Power - Laptop Wireless Communication Technologies- Laptop Hardware and Component Installation and ConfigurationReplacing Hardware Devices Mobile Devices-Mobile Device Hardware Mobile Operating Systems- Android Touch Interface -iOS Touch Interface- Network Connectivity and Email-Mobile Device Synchronization -Securing Mobile Devices-Cloud-Enabled Services for Smart Devices UNIT V PRINTERS, SECURITY & TROUBLE SHOOTING 9 Introduction-Common Printer Features- Types of Printers- Installing and Configuring Printers Configuring Options and Default Settings- Optimizing Printer Performance -Sharing Printers-Print Servers. Security Threats-Security Procedures-Security Maintenance-Applying Troubleshooting Process To Security- Troubleshooting Process to Computer Components- Peripherals- Operating Systems-Networks- Laptops- Security. TEXT BOOK: 1. IT Essentials Course Booklet: PC Hardware and Software, Version 5.0, CISCO Press, 2013. REFERENCE BOOK: 1. IT Essentials: PC Hardware and Software Companion Guide, Fifth Edition, CISCO Press,2013. 140CA0107 PROBLEM SOLVING AND PROGRAMMING LABORATORY USING C Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: Ability to design and implement of real time applications using C Programming language. LIST OF EXPERIMENTS: 1. Program to create a switch case for numbers (0-9), convert numeric into string. The user can enter the sequence of numbers through command line argument. To read the input and convert into string and output is display in the following format. S.No. Given Digit Converted String 1 343 THREE FOUR THREE 2 6785 SIX SEVEN EIGHT FIVE (Concepts to be used: Switch Case, Functions and Command Line Arguments) 2. Program has to get the date from the user and to find the day for the given date. a. Give the pre date to find the corresponding day b. Give the post date to find the corresponding day (Concepts to be used: Conditional Statement, Looping Statement and Functions) 3. Write a C program for searchable dictionary. First, create the dictionary file (which contains character-string, word & definition). Second, the program reads character-string, word and definition from dictionary file. Then, the user can type a character-string or word, and the program will search the dictionary, and assuming the character-string or word is found, outputs the definition. The program proceeds until the user choices to quit. The following reports to be printed: a. Get the character-string, to display only matching words. b. Get the array of words and display the suitable definition. (Concepts to be used: Conditional Statement, Looping Statement, Array and Pointers) 4. Program to read the given file and generate a report. One of the common formats for interchange of formatted data is ‘tab delimited‘ where each line corresponds to a single record. The individual fields of the record are separated by tabs. For this problem, download the file POPULATION_AND_AREA_OF_CORPORATIONS_AND_MUNICIPALITIES.xls which is converted into POPULATION_AND_AREA_OF_CORPORATIONS_AND_ MUNICIPALITIES.txt. This contains the municipality wise population with area in Tamilnadu. The first row of the file contains the column headings. There are six self explanatory fields. Your task is to read the file using fscanf and generate the following reports. a. Type wise report (only consider Type, Name of the ULB(Urban Local Body) with Grade, Population (2001 Census), Population (based on houselisting) provisional & Area (in Sq.km)) b. ULB with Grade wise report in alphabetical order (only consider Name of the ULB with Grade, Population (2001 Census), Population (based on houselisting) provisional & Area (in Sq.km)) c. Sort by Population (2001 Census) d. Sort by Population (based on houselisting) provisional e. Sort by Area (in Sq.km) (Concepts to be used: Functions, Structure and Files)(Download:POPULATION_AND_AREA_OF_CORPORATIONS_AND_MUNICIPALITIE S.xls) 5. Develop the application for bus ticket booking system, in which allocation of seats randomly and check the neighbor should be same gender or relative if gender is different. a. Book the ticket b. Ticket cancellation c. Report generation (Concepts to be used: Switch Case, Functions and Files) 140CA0108 HARDWARE & TROUBLE SHOOTING LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: Impartation of real world experience in assembling the computer components and installation of operating systems. LIST OF EXPERIMENTS: 1. Identify the peripherals of a computer, components in a CPU and its functions. Draw the block diagram of the CPU along with the configuration of each peripheral. 2. The students have to be provided with a Personal Computer thereby they should be able to assemble and disassemble back the components inside the PC to the working condition with all the necessary tools and hardware components. 3. The students should identify, install the necessary Internal and External Cables thereby power is supplied to the Personal Computer for its proper functionality with the help of Switched Mode Power Supply (SMPS). 4. Identify the Operating system for the assembled Personal Computer and install them with predefined configurations. 5. Involve the students to identify the procedure for formatting a Hard Disk of 1 TB size and assign the partition in varying sizes making one as a Healthy Primary Partition Drive. 6. The students have to identify the problem in the PC which does not boot properly that might have occurred due to improper assembly or defective hardware problems. They have to identify and fix the problem to get back the computer to its working condition. 7. The students have to identify the problem in the PC which does not work properly due to software problems. They have to identify and fix the problem to get back the computer to its working condition. 8. The students must involve in connecting the Local Area Network and access the Internet, where they should able to configure the TCP/IP settings for accessing the websites and email. 9. Install the printer drivers in a network for Windows operating systems that have varying methods of printer connection. At the same time, the users must be provided to change the default printer driver settings to match their environment. . 140CA0109 COMMUNICATION SKILLS LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 WRITTEN COMMUNICATION 1. Remedial English Subject- verb agreement - concord - tense forms - auxiliary verbs – different ways of rewriting sentences. 2. Scientific Style Clarity - simplicity - exactness - brevity - unity - coherence- objectivity. 3. Formal and Informal Writing. ORAL COMMUNICATION 1. Stress and Intonation. 2. Delivery Techniques. The extemporaneous speech and the manuscript speech - The physical Aspects of speech – audience interaction. 3. The Use of Visual Aids Criteria of visual aids (visibility, clarity, simplicity, control) The tools of visual presentation*. (Chalk board, chart, and overhead projector and so on.) 4. Practice in Oral Communication (a) Short speech * (b) Group discussion – as a participant and as a moderator. * (c) Mock press conference (d) Seminar (e) Mock interview (f) Speech based on a situation * (g) Extemporaneous speech Practice will also be given in conducting a meeting - welcoming a gathering, presiding over a function and proposing vote of thanks. *Case Studies Applicable. SEMESTER – II 140CA0201 RESOURCE MANAGEMENT TECHNIQUES Category: General Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: Impart the knowledge of Operations Research Techniques for Analysis and Modeling in Computer Applications. OBJECTIVES: • Understand and apply the linear, integer programming to solve operational problems. • Finding the optimal solution in warehousing and travelling problems using transportation and assignment models. • Preparation of project scheduling using PERT and CPM. • Identify and analyze appropriate queuing model in queues related problems. • Application of optimization concepts in real world problems. UNIT I LINEAR PROGRAMMING SOLVING 9+3 Principal components of decision problem - Modeling phases - LP Formulation and graphical solution – Simplex method – Big M method. UNIT II TRANSPORTATION AND ASSIGNMENT MODELS 9+3 Mathematical formulation of transportation problem- Methods for finding initial basic feasible solutionOptimal solution- Degeneracy- Mathematical formulation of Assignment models- Hungarian algorithmVariables of the assignment problems. UNIT III INTEGER PROGRAMMING Cutting plan algorithm- Branch and bound methods, Multistage (Dynamic) Programming. 9+3 UNIT IV SCHEDULING BY PERT AND CPM 9+3 Network construction - Critical path method - Project Evaluation and Review Technique - Resource Analysis in Network scheduling. UNIT V QUEUEING THEORY 9+3 Markovian models- M/M/1, M/M/C, finite and infinite capacity- M/M/ queues- Finite source modelM/G/1 queue (steady state solutions only). TEXT BOOKS: 1. Taha H. A.,Operations Research- An Introduction, Seventh Edition, PearsonEducation,Delhi,2002 2. Winston, Operations Research. Thomson Learning, 2003. REFERENCE BOOK: 1. P K Gupta and D S Hira, Operations Research, S Chand & Co., 2003. 140CA0202 SYSTEM SOFTWARE Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to provide an understanding of the language translation peculiarities by designingthe phases of Compiler and Design different types of parsers. OBJECTIVES: • • • Analyze the relationship between system software and machine architecture and implementation of assemblers, linkers and loaders. Identify and evaluate the phases of compiler. Design, analyze the function and implementation of assemblers, linkers and loaders UNIT I BASICS OF SYSTEM SOFTWARE AND ASSEMBLER 9 Introduction – System software and SIC/XE machine architecture - Basic assembler functions – Assembler algorithms and data structures – Machine dependent assembler features- Instruction formats and addressing modes – Program relocation – Machine independent assembler features – Literals – Symbol-defining statements – Expressions – Program Blocks – Control Sections and Program Linking UNIT II COMPILER- LEXICAL ANALYSIS, SYNTAX ANALYSIS 9 Phases of compiler-Lexical Analysis- Role of a Lexical analyzer- input buffering-specification and recognition of tokens-Finite Automata- Designing a lexical analyzer generator- Pattern matching based on NFA’s. Syntax Analysis: Role of Parser- Top-down parsing- recursive descent and predictive parsers (LL)- Bottom-Up parsing- Operator precedence parsing- LR, SLR and LALR parsers. UNIT III COMPILER- CODE GENERATION 9 Intermediate languages: graphical representations- DAGs- Three address code- types of three address statements- syntax directed translation into three address code- implementation of three address statements. UNIT IV COMPILER OPTIMIZATION 9 Code Optimization- Machine dependent and machine independent code generation: Sources of optimization-Code Generation-Semantic stacks- evaluation of expressions-control structures and procedure calls UNIT V LOADERS AND LINKERS 9 Basic loader functions: Design of an Absolute Loader – A Simple Bootstrap Loader Machine dependent loader features Relocation – Program Linking – Algorithm and Data Structures for Linking Loader. Machine-independent loader features – Automatic Library Search – Loader Options Loader design options – Linkage Editors – Dynamic Linking – Bootstrap Loaders. TEXT BOOKS: 1. Leland Beck , System Software – An Introduction to Systems Programming, Third Edition, Pearson Education, Inc., 2008.(Unit I,IV,V) 2. A.V. Aho, R. Shethi and Ulman; Compilers - Principles, Techniques and Tools, Second Edition,Pearson Education, 2012.(Unit II,III,IV) REFERENCE BOOK: 1. D. M. Dhamdhere, Systems Programming and Operating Systems, Tata McGraw Hill Company,Second Edition, 2009. 140CA0203 OBJECT ORIENTED PROGRAMMING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: Learn implement reliable and maintainable object-oriented applications composed of several classes. OBJECTIVES: • Reuse software through a collection of C++ predefined classes. • Understand the differences between procedural and object-oriented paradigms. • Develop custom classes using encapsulation, polymorphism, and abstraction. • Design and implement OO programs. . UNIT I OOP PARADIGM 9+3 +3 Programming Paradigms-Evolution - Introduction to OOP-Structured Versus Object Oriented Development-Elements of Object Oriented Programming-Popular OOP Languages-Merits and Demerits of OO Methodology- Expressions and Statements UNIT II CLASSES AND OBJECTS 9+3 Overview of C++ – Classes and Objects – constructor and destructor – Friend Functions – Friend Class Inline Function – Static Members – Arrays – Pointers – References – Dynamic Allocation UNIT III OVERLOADING 9+3 Function Overloading–Overloading Constructor Functions–Copy Constructors–Default Argument– Operator Overloading–Member Operator Overloading–Overloading new and delete UNIT IV INHERITANCE AND TEMPLATES 9+3 Inheritance – Base Class – Access Control – Virtual Functions – Pure Virtual Functions– Templates – Generic Functions – Applying Generic Functions–Generic Classes UNIT V ERROR HANDLING AND FILES 9+3 Exception Handling -Restricting Exceptions – C++ I/O Streams-Predefined Streams –Formatted I/OManipulators Functions - File I/O-Reading and Writing text files-Unformatted and Binary I/O-Random Access Files-STL. TEXT BOOKS: 1. K.R.Venugopal, Rajkumar Buyya, T.Ravishankar ,Mastering in C++, Second Edition, Tata McGraw Hill,2013. (Unit I). 2. Herbert Schildt, C++ The Complete Reference, Fourth Edition ,Tata McGraw Hill, 2007. (Unit II to V). REFERENCE BOOKS: 1. Stephen Prata, C++ Primer Plus, Addison Wesley, Sixth Edition ,2012. 2. Bjarne Stroustrup , The C++ Programming Language, Addison-Wesley , Fourth Edition,2013. 140CA0204 HUMAN VALUES AND PROFESSIONALETHICS Category: General Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to create awareness on Engineering Ethics and Human Values OBJECTIVES: • Learning the moral and social values and loyalty. • Understand the concepts of computer ethics in work environment. • Identify threats in computing environment. • Analyze the intricacies of accessibility issues. UNIT I HUMAN VALUES & ENGINEERING ETHICS 9 Morals, Values and Ethics – Integrity – Work Ethics – Service Learning – Civic Virtue – Respect for others – Living Peacefully – Caring – Sharing – Honesty –Courage – Value time – Co-operation – Commitment – Empathy – Self-confidence – Spirituality- Character - Engineering Ethics: The History of Ethics-Purposes for Engineering Ethics-Engineering Ethics-Consensus and Controversy – Professional and Professionalism –Professional Roles to be played by an Engineer –Self Interest, Customs and Religion-Uses of Ethical Theories-Professional Ethics-Types of Inquiry – Engineering and Ethics-Kohlberg‟s Theory – Gilligan‟s Argument –Heinz‟s Dilemma. UNIT II COMPUTER HACKING 9 A General Introduction – Computer Ethics: An Overview – Computer Hacking – Introduction – Definition of Hacking – Destructive Programs – Hacker Ethics – Professional Constraints – BCS Code of Conduct – To Hack or Not To Hack – Ethical Positions on Hacking. UNIT III ASPECTS OF COMPUTER CRIME AND INTELLECTUAL PROPERTY RIGHTS 9 Aspects of Computer Crime Introduction – What is Computer Crime – Computer Security Measures – Professional Duties and Obligations – Intellectual Property Rights – The Nature of Intellectual Property– Intellectual Property – Patents, Trademarks, Trade Secrets, Software Issues, Copyright – The Extent and Nature of Software Piracy – Ethical and Professional Issues – Free Software and Open Source Code. UNIT IV REGULATING INTERNET CONTENT, TECHNOLOGY AND SAFETY 9 Introduction – In Defense of Freedom Expression – Censorship – Laws Upholding Free Speech – Free Speech and the Internet – Ethical and Professional Issues – Internet Technologies and Privacy – Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis – Reducing Risk. UNIT V COMPUTER TECHNOLOGIES ACCESSIBILITY ISSUES 9 Introduction – Principle of Equal Access – Obstacles to Access for Individuals – Professional Responsibility – Empowering Computers in the Workplace – Introduction – Computers and Employment – Computers and the Quality of Work – Computerized Monitoring in the Work Place – Telecommuting – Social, Legal and Professional Issues – Use of Software, Computers and Internet Based Tools – Liability for Software Errors – Documentation Authentication and Control – Software Engineering Code of Ethics and Practices – IEEECS – ACM Joint Task Force. TEXT BOOKS: 1. M.Govindarajan, S.Natarajan and V.S.SenthilKumar, Professional Ethics and Human Values, PHI Learning Pvt. Ltd,2013(unit I). 2. Penny Duquenoy, Simon Jones and Barry G Blundell, Ethical, legal and Professional Issues in Computing, Middlesex University Press, 2008.(unit II to V). REFERENCE BOOKS: 1. Mike Martin and Roland Schinzinger, Ethics in Engineering, McGraw-Hill, New York 1996. 2. George Reynolds, Ethics in Information Technology, Cengage Learning, 2011. 3. Caroline Whitback, Ethics in Engineering Practice and Research,Cambridge UniversityPress 2011 4. Sara Baase, A Gift of Fire: Social, Legal, and Ethical Issues for Computing and the Internet, Third Edition, Prentice Hall, 2008. 140CA0205 WEB PROGRAMMING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: Develop the designing skills of the students in the area of Web Programming to create real time web pages. OBJECTIVES: • Learning the concepts and architecture of the World Wide Web. • Understanding the usage and practice of mark-up languages. • Practicing the embedded dynamic scripting on client side Internet Programming. • Enlightening a knowledge to understand and practice web development techniques on client side UNIT I INTRODUCTION TO WWW 9 Internet Standards – Introduction to WWW – WWW Architecture – SMTP – POP3 – File Transfer Protocol - Overview of HTTP, HTTP request – response –– Generation of dynamic web pages. UNIT II UI DESIGN 9 Markup Language (HTML): Introduction to HTML - Formatting and Fonts–Commenting Code– Anchors – Backgrounds – Images – Hyperlinks – Lists – Tables – Frames - HTML Forms. Cascading Style Sheet (CSS): The need for CSS, Introduction to CSS–Basic syntax and structure Inline Styles – Embedding Style Sheets - Linking External Style Sheets – Backgrounds – Manipulating text - Margins and Padding - Positioning using CSS. UNIT III INTRODUCTION TO JAVASCRIPT 9 Introduction - Core features - Data types and Variables - Operators, Expressions, and Statements Functions - Objects - Array, Date and Math related Objects - Document Object Model - Event Handling- Controlling Windows & Frames and Documents - Form handling and validations. UNIT IV ADVANCED JAVASCRIPT 9 Browser Management and Media Management – Classes – Constructors – Object-Oriented Techniques in JavaScript – Object constructor and Prototyping - Sub classes and Super classes – JSON - AJAX. UNIT V DOCUMENT OBJECT MODEL 9 Introduction- Document Object Model—Methods-Document – Elements-DOM HTML-DOM CSS-DOM Events-Event Listener-Navigation- Nodes-Node list. TEXT BOOKS: 1.Harvey & Paul Deitel and Associates, Harvey Deitel and Abbey Deitel, Internet and World Wide Web - How to Program, Fifth Edition, Pearson Education, 2011. (Unit I & II). 2.Thomas A Powell, Fritz Schneider, JavaScript: The Complete Reference, Third Edition, Tata McGraw Hill, 2013.(Unit III to V). REFERENCE BOOKS: 1. Achyut S Godbole and AtulKahate, Web Technologies, Second Edition, Tata McGraw Hill, 2012. 2. David Flanagan, JavaScript: The Definitive Guide, Sixth Edition, O'Reilly Media, 2011. 140CA0207 OBJECT ORIENTED PROGRAMMING LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: Develop the programming skills of the students in implementation of Object Oriented Concepts through C++. LIST OF EXPERIMENTS: 1. Write a function called feet conversion that takes feet as argument and returns the equivalent feet in inches and meter. Create a program that exercises this function by repeatedly obtaining a feet values from the user and displaying the value of feet to inches, feet to meter using show method . (Class, object, Member function, function overloading) 2. A common place to buy candy is from a machine. The machine sells candies, chips, gum, and cookies. You have been asked to write a program for this candy machine. The program should do the following: i)Show the customer the different products sold by the candy machine. ii). Let the customer make the selection. iii). Show the customer the cost of the item selected. iv). Accept money from the customer. v). Release the item.(Constructor & Destructor) 3. Write necessary class and member function definitions for a cricket player object. The program should accept the details from user (maximum 10) .The details of the player are player code, name, runs, innings played and number of times not out. The program should contain following menu Enter details of players Display average runs of a single player Average runs of all players Display the list of players in sorted order as per runs.(Static member variables & Static Member function). 4. i)Create a class to add Two times provided in hour minute format. Use functions a)void input() to provide hour and minute. b) gettime (int ,int) to take hour and minute entered by user. c) sum(time,time ) to add minutes and hours. If minutes is >60 add 1 with hour. d) void display() to display the result. (Operator Overloading) ii) Two classes one is Civil_Time and Another is Railway_Time. Enter hours and minutes in Railway time (24 hour format) and display the time in Civil time (12 hour format with a.m. and p.m.) using one class type to another class type conversion.(Templates) 5.i) Write a class ACCOUNT that represents the bank account . The class should allow you to deposit money, withdraw money, calculate interest, send you a warning message if you go overdrawn etc. (Exception Handling) ii) Modify your ACCOUNT class to add constructors and destructors. They should use the constructs new and delete. iii) Further modify the class ACCOUNT to use overloaded constructors. One could set the account balance to zero and another could set it to a given value.(Constructor Overloading) 6. A University and a Company have jointly taken a project. Class University contains name of the university, department to which the project is assigned, person to whom the project is assigned. A function display is there to display the information. Class Company contains name of the company, Number of Engineers assigned, amount invested to do the project. A function display is there to display the information. Class Project is inherited from University and Company. It contains type of project, duration of project, amount granted to complete the project. A function display displays the related information. Write a program to implement this and display all information except amount invested by company from Project class.(Inheritance) 7.Design an application with Student as abstract class and create derive classes Engineering, Medicine and Science from base class Student. Create the objects of the derived classes and process them and access them using array of pointer of type base class Student.(Virtual & Pure Virtual Function) 8.Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file - one per line.(Files) 140CA0208 SYSTEM SOFTWARE LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: The aim of the system software laboratory is to give students a good understanding of basic concepts of computer software and the need of developing software applications using C,C++,Java. LIST OF EXPERIMENTS: 1. Implement a symbol table with functions to create, insert, modify, search, and display. 2. Implement pass one of a two pass assembler. 3. Implement pass two of a two pass assembler 4. Implement a single pass assembler. 5. Implement an absolute loader. 6. Implement a relocating loader. 7. Implement pass one of a direct-linking loader. 8. Implement pass two of a direct-linking loader. 9. Implement a simple text editor with features like insertion / deletion of a character, word, and sentence. 10. Implement a symbol table with suitable hashing . 140CA0209 WEB PROGRAMMING LABORATORY Category: Technical Mode of Delivery: Practical – 4 Hrs/Week; Total hours: 45 Credit: 2 AIM: Develop the designing skills of the students in the area of Web Programming to create real time web pages. LIST OF EXPERIMENTS: 1. Develop static pages using HTML for an online Book store a. The website should consist of the following pages b. Home page c. Registration and user login d. User profile page e. Books catalog f. Shopping cart g. Payment by credit card h. Order conformation ( HTML Concepts) 2. Develop a web page to design the City‘s Sunset with the help of Cascading Style Sheets.(Styles in CSS) 3. Develop an interactive web page for an advertisement showing the details about the Mobile Service in your location with the help of HTML and CSS.(CSS Inline Styles) 4. Develop and demonstrate a Recipe System which must use the menu based concept for serving the customers in a Hotel Restaurant System with the help of DHTML and CSS.(DHTML Concepts) 5. Develop an interactive web page that must have a link to option for including the Google Maps. (Embedding of Images) 6. Develop a web page that must contain a registration form with the validation event that must show the error messages in same page using JavaScript. (Validation Concepts) 7. Develop and demonstrate using JavaScript script, a XHTML document that collects the USN(the valid format is: A digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case characters followed by three digits; no embedded spaces allowed) of the user. Event handler must be included for the form element that collects this information to validate the input. Messages in the alert windows must be produced when errors are detected.(Form handling Concepts) 8. Develop a web page for Simple Quiz- Online Learning System using Java Script with the help of event handlers that must include CSS.( Event Handling) SEMESTER – III 140CA0301 OPERATING SYSTEMS Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: This course provides basic knowledge and skills in operating, managing and maintenance of various types of Operating Systems. OBJECTIVES: • • • • Creating awareness on process management, CPU scheduling, memory management and file system of an Operating system. Impart information on implementing the system components including system call synchronization primitives. Understanding the design of the Linux operating system. Familiarize with the various inter process communication. UNIT I INTRODUCTION 9 Evolution of OS - Operating Systems Structures: System Components – Operating System Services – Process Concepts – Process Scheduling –Operations on Processes – Cooperating Processes – Inter Process Communication – Threads. UNIT II SCHEDULING & DEADLOCK 9 CPU Scheduling– Scheduling Algorithms – Process Synchronization: Critical Section Problems – Synchronization Hardware– Semaphores. Deadlock - System Model – Deadlock Characterization – Methods for Handling Deadlocks - Deadlock Prevention – Deadlock Avoidance – Deadlock Detection – Recovery from Deadlocks. UNIT III MEMORY MANAGEMENT 9 Memory Management - Background – Swapping – Contiguous Memory Allocation – Paging – Segmentation – Segmentation with Paging – Virtual Memory: Demand Paging – Page Replacement – Thrashing. UNIT IV FILE MANAGEMENT 9 File Concept-Access Methods-Directory Structure-File System Structure-File System Implementation – Directory Implementation – Allocation Methods-Free Space Management- Disk Structure – Disk Scheduling-Disk Management-Swap–Space Management. UNIT V CASE STUDY 9 Linux History -Design Principles-Kernel Modules-Process Management-Scheduling-Memory management- File Systems –Input and Output-Interprocess Communication-Windows 7 TEXT BOOK: 1.AviSilberschatz, P.B.Galvin, G.Gagne, Operating System Concepts, Ninth Edition, John Wiley& Sons, 2012. REFERENCE BOOKS: 1. William Stallings, Operating Systems, Internals and Design Principles, SixthEdition,Pearson Education, 2009. 2. H M Deitel, P J Deitel and D R Choffnes, Operating Systems ,Third edition, Pearson Education,2011 140CA0302 SOFTWARE ENGINEERING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to impart the systematic approach to the design, development, testing and maintenance of a software system. OBJECTIVES: • • • • Provide an insight into the processes of software development. Understand and practice the various phases such as analysis, design, development, testing. Construct various UML models including use case diagrams, class diagrams, interaction diagrams, statechart diagrams and activity diagrams using the appropriate notation. Learn the Software testing strategies and techniques with software maintenance UNIT I INTRODUCTION 8 Introduction to Software Engineering – A Generic Process Model – Prescriptive Process Models:Waterfall, Incremental, Prototyping, and Spiral Model – The Unified Process – Agile Development:Agile Process – Extreme Programming (XP) – Adaptive Software Development – Scrum. UNIT II SOFTWARE REQUIREMENTS 10 Modeling Principles – Understanding Requirements – Requirements Modeling: Scenario–Based, Data, Class–Based, Flow–Oriented, Behavioral Modeling. UNIT III SOFTWARE DESIGN 9 Design Concepts – Design Models – Architectural Design: Software Architecture – Architectural Styles– Architectural Design – Component Level Design: Component – Designing Class Based and Traditional Components. UNIT IV UNIFIED MODELING LANGUAGE 9 Introduction – Development Process – Use case – Class diagram - Sequence Diagram -Package Diagram - State Machine Diagram - Activity Diagram - Collaboration Diagram – Interaction Diagram UNIT V TESTING AND MAINTENANCE 9 Testing Strategies- Strategic Approach- Issues- Test Strategy for Conventional Software- Validation Testing- System Testing- Testing fundamentals -White box testing – Basis path testing – Control structure testing – Black box testing-Model based testing- Software Configuration Management (SCM) – SCM Repository –SCM Process – Software Maintenance and Supportability. . TEXT BOOKS: 1. Roger Pressman S., Software Engineering: A Practitioner's Approach, Tata McGraw Hill, Seventh Edition, 2010.(Unit I,II,III,V). 2. Martin Fowler, UML Distilled, Pearson Education ,Third Edition,2003(Unit IV). REFERENCE BOOKS: 1. Ian Sommerville, Software Engineering, Pearson Education, Ninth Edition, 2010. 2.Pfleeger and Atlee, Software Engineering, Pearson Education, Fourth Edition, 2009 140CA0303 JAVA PROGRAMMING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: Learn the concepts of Java Programming and develop real time applications. OBJECTIVES: • • • • • Reuse software through a collection of predefined classes and own packages. Develop custom applications using Collections. Develop networking applications using RMI. Design and implement Servlet and JSP programs with database. Develop an application using JavaFX. UNIT I JAVA FUNDAMENTALS & CLASSES 9 Java Fundamentals: Features of Java- OOPs concepts- Java virtual machine- Reflection byte codesByte code interpretation- Data types, variable, arrays, expressions, operators, and control structuresObjects and classes.Java Classes: Abstract classes- Static classes- Inner classes- Packages Wrapper classes- Interfaces- this –super- Access control. UNIT II EXCEPTION HANDLING, IO PACKAGE AND MULTITHREADING 9 Exception handling: Exception as objects- Exception hierarchy- Try catch finally- Throw, throws. IO package: Input streams- Output streams- Object serialization- Deserialization- IO files -Filter and pipe streams.Multi threading: Thread Life cycle- Multi threading advantages and issues- Simple thread program- Thread synchronization. UNIT III JDBC & COLLECTIONS 9 Database Connectivity: JDBC architecture- Establishing connectivity and working with connectioninterface- Working with statements- Creating and executing SQL statements- Working with Result Set. Collections: Introduction - Collections Overview - Class Array - Interface Collection and Collections–Lists - Collections Algorithms – Sets - Maps. UNIT IV-SERVLET & JSP 9 Servlet: Servlet Overview and Architecture, Interface Servlet and the Servlet Life Cycle, Handling HTTP get Requests, Handling HTTP post Requests, Redirecting Requests to Other Resources, Session Tracking, Cookies, Session Tracking with HttpSession. Java Server Pages (JSP): Introduction, JavaServer Pages Overview, A First Java Server Page Example, Implicit Objects, Scripting, Standard Actions, Directives, Custom Tag Libraries. UNIT V JAVAFX 9 JavaFX: Overview - Understanding the JavaFX Architecture–Hello World, JavaFX Style–Creating aForm in JavaFX – Fancy Forms with JavaFX CSS – Using FXML to Create a User Interface – Animation and Visual Effects in JavaFX. TEXT BOOKS: 1. H. M.Deitel, P. J. Deitel, S. E. Santry, Advanced Java 2 Platform Howto program, Prentice Hall, 2007. (Unit I to Unit IV) 2. Jasper Potts, Nancy Hildebrandt, Joni Gordon, Cindy Castillo, JavaFX Getting Started with JavaFX, Release 8, Oracle, 2014. (Unit V) REFERENCE BOOKS: 1. Antonio Goncalves, Beginning Java EE 7, Apress publication, 2013. 2. Herbert Schildt,The Complete Reference JAVA2, Fifth edition, Tata McGraw-Hill, 2006. 3. H. M.Deitel, P. J. Deitel, Java How to Program, Ninth Edition, Prentice Hall, 2014. 140CA0304 DATA STRUCTURES & ALGORITHMS Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: Imparting knowledge on the design and applications of linear, tree and graph structures .To provide an understanding of various algorithm design and analysis techniques and to provide an in-depth knowledge in problem solving techniques and data structures. OBJECTIVES: • Facilitate the choice of data structures that effectively model the information in a problem • Impart the skills to analyze the efficiency of algorithms • Provide an understanding of appropriate structures for efficient searching and access of data. • Provide knowledge of the systematic way of solving problems and to improve the competency in solving specific problems UNIT I INTRODUCTION 9+3 ADT - Linked Lists (Singly, Doubly and Circular) Implementation – Array, Pointer- Stack: Definition and Examples, Representing Stacks - Queues: Queue and its Representation – Applications of Stack, Queue and list. UNIT II BASIC DATA STRUCTURES 9+3 Trees – General- Binary Tree - Binary Search trees- AVL Trees, B-Trees – Implementations – Tree Traversals. Hashing – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing. UNIT III SORT AND SEARCH STRUCTURES AND HEAPS 9+3 General Background: Insertion Sort- Shell Sort- Quick Sort - Radix Sort - Merge Sort - Basic Search Techniques – Linear, Binary Search. Heap –Binary Heap – Leftist Heaps – Binomial Heaps – Fibonacci Heaps – Skew Heaps. UNIT IV GRAPHS AND THEIR APPLICATIONS 9+3 Graphs – Representation – Topological Sort - Shortest Path Algorithm -Dijkstra‘s algorithm- Network Flow Problem – Minimum Spanning Tree – Prim‘s Algorithm - Kruskal‘s Algorithm – Graph Traversals – Applications of Depth–First Search. UNIT V ALGORITHM DESIGN TECHNIQUES 9+3 Design Techniques – Greedy Algorithm- - Divide and Conquer – Dynamic Programming – Randomized Algorithms – Backtracking Algorithms TEXT BOOK: 1. M. A. Weiss, Data Structures and Algorithm Analysis in C,Second Edition, Pearson Education Asia, 2011. REFERENCE BOOKS: 1. Data Structures using C, ISRD Group, Second Edition, McGraw Hill 2013. 2. T.H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, Third Edition, Prentice Hall of India Ltd, 2009. 3. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, Pearson Education, Reprint Edition 2006. 4. Tanenbaum A.S., Langram Y and Augestien M.J. Data Structures using C and C++,Second Edition, Prentice Hall of India, 2004. 140CA0305 DATABASE MANAGEMENT SYSTEMS Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: Develop an understanding in the students on the role of database concepts and to design and implement real information systems. OBJECTIVES: • Interpret the different data models and basic concepts of Database. • Impart knowledge on database creation, manipulation and complex SQL queries of relational databases. • Analyze the concepts of data storage, querying and query optimization. • Discover the implementation of the concepts of advanced and recent databases and its applications. UNIT I INTRODUCTION TO RELATIONAL DATABASES 9+3 Database System Applications – Purpose of Database systems – View of Data – Database Languages – Relational Databases – Database Design – Data Storage and Querying – Transaction Management – Database Architecture – Database Users and Administration - Structure of Relational Databases – Database Schema – Keys – Schema Diagrams – Relational Query Languages – Relational Operations. UNIT II SQL 9+3 Overview of the SQL Query Language – SQL Data Definition – Basic Structure of SQL Queries – Additional Basic Operations – Set Operations - Aggregate Functions – Nested Sub queries Modification of the Database - Join Expressions – Views – Transactions – Integrity Constraints – SQL data types and Schemas – Authorization – Accessing SQL from a programming language – Functions and Processing – Triggers – Relational Algebra – Tuple relational calculus – Domain relational calculus. UNIT III DATABASE DESIGN 9+3 Entity Relationship model – constraints – Entity Relationship Diagrams – Features of Good Relational Designs – Atomic Domains and First Normal Form – Decomposition using Functional Dependencies – Functional Dependency Theory – Algorithms for Decomposition – Decomposition using Mutivalued dependencies. UNIT IV DATA STORAGE AND QUERYING 9+3 RAID – Ordered Indices – B+ Tree Index Files – B+ Tree Extensions – Multiple Key Access – Static Hashing – Dynamic Hashing – Measures pf Query Cost – Selction Operations – Sorting – Join Operations – Overview of Query Optimization – Transformation of Relational Expressions – Estimating Statistics of Expression Results – Choice of Evaluation Plans. UNIT V CASE STUDY 9+3 Introduction to PostgreSQL - User Interfaces – SQL Variations and Extensions – Transaction Management – Storage and Indexing – Query Processing and Optimization – System Architecture. TEXT BOOK: 1. Abraham Silberschatz, Hentry F.Korth and S.Sudharssan, Database System Concepts, Sixth Edition, Tata McGraw Hill, 2011. REFERENCE BOOKS: 1. Raghu Ramakrishna & Johannes Gerhrke, Database Management System, McGrawHill,Third Edition, 2003. 2. C. J. Date, An Introduction to Database Systems, Eigth Edition, Addison-Wesley, 2003. 3. Ramez Elmasri and Shamkant B.Navathe, Fundamental Database Systems, Third Edition, Pearson Education, 2010. 140CA0307 JAVA PROGRAMMING LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: Develop the ability of the students to design and write programs for implementing real time applications using Java Programming. LIST OF EXPERIMENTS: 1. Develop a program for the following concepts: A manager thread and N worker threads Manager starts workers but wants them to hold before doing real work until it says go. ( Multithread and Exception Handling) 2. Develop a database program for Student Mark Statement (atleast five subjects) and generate the following reports: a. To display the overall report with total marks and CGPA. b. To display the subject-wise minimum and maximum marks. c. To display the student-wise ranking. (JDBC and Exception Handling) 3. To develop an application for small tables (files) with unique keys. To create a class for each of those small tables and load the data in to a java collection. This object will read the file and load the data in to another java collection. To fetch the data from this collection by the key values. 4. Create a servlet which does online shopping for books having following functions in it. a. Add Items to the shopping cart b. Delete Items from shopping cart c. Display selected Items. 5. Create JSP code to accept product details and store in database table. If the product is already inserted, display the appropriate message to insert another product. The following reports have to generate. a. To display overall product details. b. To display only given product details. 6. To create a sample applications using JavaFX. (Fancy Design with CSS, User Interface Design with FXML and Animated Shapes) Total :45 Periods 140CA0308 DATA STRUCTURES & ALGORITHMS LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: To develop programming skills of the students in the design and implementation of data structures to application oriented problem. LIST OF EXPERIMENTS: 1. Given the following string: D*RM**CE**TM*C*2018*ODD 2016** Write a method that creates a linked stack, pushes the letters in the above string onto the stack, pops them off as indicated by the *s and discards the number. A letter in the above expression indicates a push onto the stack, an asterisk indicates a pop operation and a number indicates no stack operation. Print out the letters as they are popped and show a screenshot of your program working. You shouldn‘t print out the * or the numbers.(Stack & Linked List) 2. Write a Program to implement 2 overlapping queues in an array of size N. There are facing in opposite direction to each other. Give IsEmpty(i), Insert(i), Delete(i) and IsFull(i) routines for ith queue(Queue) 3. Data about exam results are stored into a singly linked list. Each list element consists of: • student name(50+1 character) • student ID (int) • course code (int) • grade (int) The list is not sorted. Write the function that removes students with negative grades (those with grade) from the list. The function returns the number of removed list members. Write the corresponding struct. ( Singly Linked List , Sorting ) 4. Doubly linked list contains data about students, sorted in a descending order (from head) according to the average grades. Write the function that reverses the order of elements in the doubly linked list.(Doubly Linked List , Traversal) 5. Write a program that prompts the user for the beginning of a word and outputs all the possible words that can complete what the user typed in alphabetical order. For example, one possible user interaction would be: Loading Dictionary. Standby... Dictionary loaded! Start typing a word and hit enter (‘quit!‘ to end) algori Possible completions: algorithm algorithmic Perform the auto completion lookup by storing a dictionary of words. (Searching, File Processing ) Write a C program that reads in words from a file, discarding any strings that do not look like words. The words must be stored in alphabetical order in a linked list, with each node holding the word and a count of the number of occurrences of the word. The file name is supplied as a command line argument, and when the file has been read, the words and their occurrence counts are output. ( Linked List, Sorting, Searching ) 6. Sample Output: Cannot(1) Char(1) InputFile(2) MyString(1) ReadWordsFromFile(1) Usage(1) Word(3) WordCount(1) a(1) arguments(1) at(2) cerr(2) cout(9) else(5) end(1) error(1) file(1) for(1) if(8) ifstream(1) int(4) is(1) larger(1) linked(1) list(3) not(1) of(1) open(1) out(1) stopped(2) string(2) struct(1) to(1) typedef(1) void(2) while(3) word(1) wordcounter(1) 7.A network of cities is represented in the form of the graph whose details are provided below. The set V consists of all cities and the set E consists of the distances between the cities (in miles) for the respective links: a. Construct an undirected graph from the details given below. i. V = {Amherst, Boston, Hartford, Newhaven, Natick, Springfield} ii. E = { 1. Amherst--Boston = 90 2. Boston--Hartford = 100 3. Amherst--Natick = 80 4. Boston--Newhaven = 140 5. Hartford--Newhaven = 40 6. Newhaven--Natick = 120 7. Newhaven--Springfield = 70 8. Hartford--Springfield = 30 9. } b. Compute the shortest path from A to F using Dijkstra's shortest path algorithm. ( Graph & Traversal) 8. Suppose G is a directed graph with vertices labeled 1 through 8. Adjacent vertices for each vertex are listed as follows Vertex Adjacency 1 2, 4 2 3, 5 3 2, 4, 5 4 1, 3 5 2, 3, 6 6 5, 7, 8 7 6, 8 8 6, 7 (a) Construct an Adjacency matrix from the given adjacency list. (b) Order the vertices as they are visited in a depth-first traversal starting at vertex (c) Order the vertices as they are visited in a breadth-first traversal starting at vertex (Graph & Traversal) 9. Write a program that generates all integers between 1 and 100, then makes a hash that uses the number itself as the key and the number squared as the value. Ask the user to input a number between 1 and 100, and return the square of that number using the hash. Return an error message if the input number isn't an integer between 1 and 100.(Hashing) 10.Write the program for heap-sort and then illustrate how heap-sort processes the following array inplace: A = {33, 28, 23, 48, 32, 46, 40, 12, 21, 41, 14, 37, 38, 0, 25} In particular, show the content of the array at each main iteration of the algorithm.(Heap Sort) 140CA0309 DBMS LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: To impart knowledge on the implementation of the various DBMS features to the students using ORACLE, PostgreSQL and MySQL database. LIST OF EXPERIMENTS: Project 1: Web based Photos Sharing Portal(Functions) Develop a web-based database application system that provides service to its clients for storing, sharing, and searching their photos. The system, similar to flickr and PhotoShelter, can be used by its clients to 1. Upload and store photos; 2.Enter and update the descriptive information (time, place, persons, caption, series, owner, copyright) for photos; 3. Specify the access privileges for your friends and/or public to share your photos; and search for photos with given words and/or other specified conditions. Project 2: Web based Tour Planner(Exceptions) Design a tour planner agent that offers the end users with a list of best tour plans against user provided budget and tour options. The tour options may include the places of visit, the mode of journey, hotel booking etc., Project 3: Census Database(Cursors) The 2016 Census of India will start on February 7, 2016. The goal of this project is to build a database which can provide various information’s based on the census data. The parameters recorded in census can be found in this site. http://censusindia.gov.in/Metadata/Metada.htm The system may be interfaced with geographical maps like Google API. Project 4: Resume consultant portal(Packages) Design a resume consultant portal which has two different kinds of end users. Company: The companies may place their recruitment options like job description, candidate educational profile, experience etc. Job Seeker: The job seekers may submit their resume to the portal The consultant finds the resumes that best match the job requirements of the different companies and sends a notification to the company with a list of suitable applicants. Project 5: Indian Railways on Google Earth(Triggers) The goal of this project is to integrate any of the Map Web Services like Google Earth, Wikimapia, TerraServer with the Indian Railway Train Enquiry System at www.indianrailway.gov.in. Two type of queries should be supported: (i) Users may specify source and destination on Map Servers. The system should return a page in Indian railways displaying a list of trains between the nearest railway stations to source and destinations. (ii) Users may specify a train number or name, and the systems tracks the route of the train on the map server with schedule of arrival and departure at different stations. Recommended Databases: Oracle 11g ,PostgreSQL 6.3,MySQL 5.5 Front End : Java 8 / Visual C# 2013 140CA0401 SEMESTER – IV COMPUTER NETWORKS Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of the course is to introduce students to the foundations and principles of computer network with emphasis on networking technologies, architectures, standards, and protocols. OBJECTIVES: Understanding Computer Network concepts and communication models. Understanding the Computer Network architectures and components required for data communication. Analyzing the function and design strategy of physical, data link, network layer and transport layer. Acquiring knowledge of various application Computer Network protocol standards developed for internet. UNIT I DATA COMMUNICATIONS 9 Data Communications -Components –Data flow – Physical structures - Network types - Network Models ISO/OSI model–TCP/IP Model –Line Coding- Transmission Media UNIT II DATA LINK LAYER 9 Error - Detection and Correction – Data Link Control-Flow control-Simple Protocol-Stop and Wait Protocol – Ethernet- IEEE 802.3- 802.11 – Connecting Devices -VLAN. UNIT III NETWORK LAYER 9 Services -Switching concepts – Circuit switching – Packet switching –IP-Datagram-IPv4 Address– Subnetting- Network Address Translation (NAT)-IPv6–ICMP-Routing Algorithms - Distance-Vector Routing- Link-State Routing-BGP. UNIT IV TRANSPORT LAYER 9 Transport layer –services –Connection establishment – Flow control – Transmission control protocol – Congestion control and avoidance – User datagram protocol. -Transport for Real Time Applications (RTP). UNIT V APPLICATION LAYER Applications - DNS – SMTP – FTP –WWW - SNMP- Security –RSA- DES -Web security -SSL. 9 TEXT BOOK: 1. Behrouz A.Forouzan , Data Communications and Networking, Fifth Edition, McGraw Hill, 2013. REFERENCE BOOKS: 1. William Stallings, Data and Computer Communications, Ninth Edition, Prentice Hall, 2011. 2. Larry L. Peterson & Bruce S. Davie, Computer Networks – A systems Approach‖, Fourth Edition, Harcourt Asia / Morgan Kaufmann, 2008. 3. Andrew S.Tannenbaum David J. Wetherall, Computer Networks‖ Fifth Edition, Pearson Education 2011. 4. James F. Kurose, Keith W. Ross, Computer Networking: A Top-down Approach, Pearson Education, Limited, Sixth Edition,2012. 140CA0402 MOBILE PROGRAMMING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: The course aims in providing knowledge about the development of iOS 8 native applications for iPhone and iPad with Swift programming. OBJECTIVES: Describe the software features provided by the Swift Programming Language. Gain skills using the Swift classes. Develop Swift code for iPhone, iPad and Mac OS X. UNIT I INTRODUCTION TO SWIFT 9+3 + Introduction to Programming. -Building Blocks -Model View Controller-Storyboards-Diving into Swift. Creating Variables -Modifying Strings-Collections-Loops-Conditional Statements-Optional- Methods Return Values -Classes -Properties -Methods -Creating an Object -Accessing Properties - Calling Methods -Subclasses -Inheritance –Overriding-View Controllers. UNIT II USER INTERFACE DESIGN 9+3 Devices and Auto Layout -More User Interfaces-Rotation and Adaptive Layout-Multiview Applications UNIT III TAB BARS & TABLE VIEWS Tab Bars and Pickers-Introduction to Table Views-Navigation Controllers and Table Views UNIT IV VIEWS & CONTROLLERS Collection View -Using Split Views and Popovers-Application Settings and User Defaults 9+3 9+3 UNIT V APP STORE SUBMISSION 9+3 Maps and Location-Map Kit-UIImagePickerController-Running on a Device-Certificates-Submitting to the App Store-Managing and Marketing Your App. TEXT BOOKS: 1. Steve Derico ,Introducing Ios 8 Swift Programming From Idea To App Store, First Edition, O‘Reilly Media,2014.(Unit I & V). 2. David Mark , Jack Nutting, Kim Topley , Fredrik Olsson , Jeff LaMarche, Beginning iPhone Development with Swift Exploring the iOS SDK, 2014. (Unit II,III,IV). REFERENCE BOOKS: 1. Vandad Nahavandipoor, iOS 8 Swift Programming Cookbook, O‘Reilly Media,First Edition,2014. 2. Swift Programming Language, Apple Inc.2014. 140CA0403 WEB APPLICATION DEVELOPMENT Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Tutorial – 1 Hr/Week Total hours: 60 Credit: 4 AIM: The aim of this course is to introduce the concepts of web application development and the student can able to create and develop their own applications using J2EE and .NET. OBJECTIVES: • To acquire knowledge on the usage of recent platforms in developing web applications. • To understand architecture of Spring and Core technologies. • To create web applications using Hibernate. • To create and design own applications using C#.NET with Database. • To understand and design applications using Silverlight. UNIT 9+3 +3+3 I SPRING INTRODUCTION AND CORE TECHNOLOGIES Spring Introduction–Introduction –Inversion ofControl (IoC) Container – Aspect Oriented Programming (AOP) – The Middle Tier – The Web Tier – Everything else – Migrating to Spring 2.5. Core Technologies: The IoC Container – Introduction–Basics-containers and beans–Dependencies – Bean scopes – Customizing the nature of a bean – Bean definition inheritance – Container extension points – The Application Context – Annotation-based configuration. UNIT II ORM AND WEB MVC FRAMEWORK 9+3 Object Relational Mapping (ORM) data access:Introduction–Hibernate–JDO–Oracle Top Link–iBATIS SQL Maps – JPA – Transaction Management. Web MVC Framework:Introduction–The Dispatcher Servlet–Controllers–Handler mappings– Convention over configuration – Annotation-based controller configuration. UNIT III .NET OVERVIEW 8+3 Introduction - .Net revolution - .Net framework and its architecture – Common Language Runtime (CLR) – Common Type System (CTS) – Common Language Specification (CLS) – Microsoft Intermediate Language (MSIL) – Assembly – Namespaces – Class Libraries. UNIT IV C#.NET 9+3 + Overview to C# - C # Compilation and Execution Process – C# Fundamentals (Data types, Operators, Programming constructs) – Inheritance –Sealed Classes – Interface - Overloading – Overriding – Method Hiding – C# Property – Exception Handling. UNIT V ASP.NET AND SILVERLIGHT 10+3 ASP.Net- IIS - ASP.Net Page Life Cycle – ASP Vs ASP.Net - HTML Controls Vs Server side Controls – Validation Controls – Data binding in ASP.Net – Caching – Configuration in ASP.Net (web.config) – Session management – View State in ASP.Net – ASP.Net. Introduction - RIA – Silver light – XAML – App.Xaml – XAP – How Silver light application executes in a web browser. TEXT BOOKS: 1. Rod Johnson, Juergen Hoeller, Spring Java/J2EE Application Framework‖, The Spring Framework – Reference Documentation, Version 2.5.6,Copyright2004-2008 (Unit I,II) 2. Jeff Prosise, Programming Microsoft .NET, Microsoft Press, 2004. (Unit III) 3. Jesse Liberty , Programming C#, Fourth Edition, O'Reilly Media. (Unit IV) 4. Mario Szpuszta, Matthew MacDonald , Pro ASP.NET 4 in C# 2010: Includes Silverlight 2, Third Edition, Apress (Unit V) REFERENCE BOOKS: 1. David Winterfeldt, Spring by Example, Version 1.5, Copyright © 2008-2015. 2. Seth Ladd and Keith Donald, Expert Spring MVC and Web Flows, APress, Copyright © 2006. 3. Jason Beres, Bill Evjen, Devin Rader , Professional Silverlight 4 Print, December 2012 www.free- ebooks-library.com. 4. David S Plat, Introducing Microsoft .NET, Third Edition, Microsoft Press, 2003. 5. Chris Sells, Jon Flanders, Ian Griffiths, Mastering Visual Studio .Net, Shroff/O'Reilly, 2003. 6. Mike Snell, Lars Powers, Microsoft Visual Studio 2008 Unleashed, Pearson, 2007. 7. Glenn Johnson, Programming Microsoft ADO.NET 2.0 Applications: Advanced Topics, WP Publishers & Distributors Pvt. Ltd., 2005. 140CA0407 MOBILE PROGRAMMING LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: Creating full-featured apps that are visually appealing, highly interactive and user-friendly, giving the best opportunities to develop business apps. LIST OF EXPERIMENTS: 1. Design an application for Managing Home Appliances with HomeKit APP. 2. Design an Universal Calculator that works on both the iPad and iPhone . 3. Create an application that presents a list of popular Flickr photo spots and let users pick favorites. 4. Design an application for storing Contacts app. 5. Design an app for Scheduling tasks with iOS Calendar. 6. Design a Passport app displaying a pin in each country visited. 7. Creating a Simple Game with a Custom Picker. 140CA0408 WEB APPLICATION DEVELOPMENT LABORATORY Category: Technical Mode of Delivery: Practical –4 Hrs/Week; Total hours: 45 Credit: 2 AIM: To develop the ability of the students to design and write programs for implementing real time applications using Web Application Development. LIST OF EXPERIMENTS: 1. Create a simple Spring Application. 2. Create a simple Hibernate database operation. 3. Create a simple Spring Transactional JUnit 4 test of Hibernate transaction. 4. Creating a basic webapp that will handle UTF-8 characters from form input using JSP. 5. Develop a C#.NET application for Voting System. 6. Develop an ASP.NET application for online ticket booking system. 7. Develop a Mobile application using Silver light.. 140CA9111 ELECTIVES SOFTWARE ARCHITECTURE Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: Students will understand the concepts behind various software systems architectures, how to choose the appropriate architecture and access services provided by that architecture. OBJECTIVES: Understand the role of a software architecture in the development of an enterprise application system Examine and compare various architecture view types and styles Develop the ability to read and understand the models that are used to document a software architecture Explore various aspects of client-server architectures including web architectures. UNIT I INTRODUCTION 9 Architecture business cycle – architectural patterns – reference models – architectural structures, views – Basic Concepts of Software Architecture UNIT II SOFTWARE ARCHITECTURAL PATTERNS 9 Architectural Patterns – Introduction to Styles – Simple Styles - Distributed and Networked Architectures- Architecture for network based applications – Decentralized Architectures UNIT III DESIGNING FOR NON FUNCTIONAL PROPERTIES 9 Understanding Quality Attributes – Functionality and Architecture – Architecture and Quality Attributes – System Quality Attributes – Quality attribute Scenarios in Practice - Introducing Tactics – Availability Tactics – Modifiability Tactics – Performance Tactics - Security Tactics – Testability Tactics – Usability Tactics – Relationship of Tactics to Architectural Patterns – Architectural Patterns and Styles UNIT IV ARCHITECTURE DESCRIPTION DOCUMENTATION AND EVALUATION Early Architecture Description Languages – Domain and Style Specific ADLs – Extensible ADLs Documenting Software architecture - Architecture Evaluation – ATAM 9 UNIT V ARCHITECTURE ADAPTATION AND CASE STUDY 9 A Conceptual Framework for Architectural Adaptation – Techniques for supporting architecture centric change- The World Wide Web – A Case Study in Interoperability. L:45T:0Total:45 Periods TEXT BOOKS: 1. Richard N.Taylor, Nenad Medvidovic and Eric M.Dashofy, Software Architecture, Foundations, Theory and Practice, Wiley 2010 (Unit II, IV,V). 2. Len Bass, Paul Clements, Rick Kazman, Software Architecture in Practice, Third Edition, AddisonWesley, 2003 (Unit I,II,IV,V). REFERENCE BOOKS: 1. Mary shaw and David Garlan, Software Architecture – Perspectives on an emerging discipline, Pearson education, 2008. 2. Frank Buschmann, Regine Meunier, Hans Rohnert, Michael Stal, Pattern Oriented Software Architecture ,Volume 1, 1996. 140CA9112 DESIGN PATTERNS Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: To enable students to understand the challenges of advanced software design and the issues associated with large-scale software architectures and patterns. OBJECTIVES: Understanding the knowledge about patterns. Designing patterns that enable the reuse of software architectures. Investigate the development of good design patterns. UNIT I BACKGROUND ON DESIGN PATTERNS 9 Pattern concept - Pattern taxonomy - Design structures - Design principles- The singleton classifying patterns - Design patterns - The learning process - Studying design patterns - Object oriented approaches - The java foundation classes - Java design patterns – The development challenge UNIT II DESIGN PATTERN CATALOG 9 Creational patterns - Factory pattern - Abstract factory pattern - Builder pattern - Factory method – Prototype pattern – Singleton pattern - Summary of creational patterns. UNIT III THE JAVA FOUNDATION CLASSES 9 Installing and using the JFC - Ideas behind swing - The swing class hierarchy - Writing a simple JFC program - Buttons and toolbars -Menus and actions - The JList class - The JTable class - The JTree class. UNIT IV STRUCTURAL PATTERNS Structural Patterns Adapter - Bridge – Composite – Decorator – Façade – Flyweight – Proxy Comparison with structural patterns. 9 UNIT V BEHAVIORAL PATTERNS 9 Behavioral Patterns Chain of responsibility- Command - Interpreter – Iterator – Mediator – Memento – Observer – State – Strategy - Template method – Visitor - Discussion of behavioral patterns. TEXT BOOK: 1. James W. Cooper, The Design Patterns Java Companions, Addision Wesley Design Patterns Series, 2012 REFERENCE BOOKS: 1. Bruce Eckel, Thinking in Patterns with Java, MindViewInc, 2006. 2. Cay S. Horstmann , Object-Oriented Design and Patterns, John Wiley & Sons, 2005. 3. Dr. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides, Design Patterns: Elements of Reusable Object-Oriented Software, Pearson publications Ltd, 2004. 140CA9113 HUMAN COMPUTER INTERFACE Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to enlighten the comprehension on the foundations of Human Computer Interaction. OBJECTIVES: • Provide comprehension on the foundations of Human Computer Interaction • Present the design technologies for individuals and persons with disabilities and design effective dialog for HCI • Provide awareness of mobile HCI and design aspects on mobile • Suggest guidelines for Creating the user interface with intelligent agents. UNIT I FOUNDATIONS & DESIGN OF HCI 10 Interaction Models – Frameworks – Ergonomics – Styles – Elements – Interactivity – Paradigms. HCI in software process – Software life cycle – Usability engineering – Prototyping – Design Rationale – Design rules – Evaluation Techniques- Universal Design. UNIT-II MULTIMEDIA UI 9 Interactive Design basics – process – scenarios – navigation – screen design – Iteration and prototyping. Multimedia UI :Multimedia User Interface Design - Cognitive Background - Information Architecture - Media Selection and Combination - Interaction and Navigation. UNIT-III MOBILE HCI 9 Mobile Ecosystem: Platforms, Application frameworks- Types of Mobile Applications: WidgetsApplications- Games- Mobile Information Architecture- Mobile 2.0, Mobile Design: Elements of Mobile Design- Tools. UNIT-IV WEB INTERFACE DESIGN 8 Designing Web Interfaces – Drag & Drop, Direct Selection, Contextual Tools- Overlays- Inlays and Virtual Pages- Process Flow.Case Studies. UNIT-V INTELLIGENT AGENT 9 Agents and Multi-Agent Systems- Concepts for Building Agents- Architectural Design: Specifying the Agent Types –Interactions - Detailed Design: Capabilities, Plans and Events-Implementing Agent Systems. TEXT BOOKS: 1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, Human Computer Interaction‖, Third Edition, Pearson Education, 2004.(Unit I & II) 2. Brian Fling, Mobile Design and Development, O‘Reilly Media Inc., First Edition , 2009. (Unit III) 3. Bill Scott and Theresa Neil, Designing Web Interfaces, O‘Reilly, First Edition, 2009.(Unit IV) 4. Lin Padgham& Michael Winikoff, Developing Intelligent Agents –A practical Guide ,John Wiley & Sons Ltd,2004. (Unit V) REFERENCE BOOK: 1. Andrew Sears, Julie A. Jacko, The Human Computer Interaction Handbook, Second Edition, Lawrence Erlbaum Associates, New York, 2008. 140CA9114 CYBER SECURITY Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to introduce the concepts of cyber security and also understand the various levels of security mechanism. OBJECTIVES: Understand the basic concepts of computer security and policies. Analyze and implement the cryptography and cipher technique concepts. An exposure about how to manage their authentication and key management. Apply their concepts about intrusion detection, network security and system security in various applications. An exposure about how to create their own applications for user security and program security. UNIT I COMPUTER SECURITY AND NETWORK SECURITY POLICIES 9 Overview of Computer Security: Basic Components – threats-policy and mechanism-Assuranceoperational issues-human issues. Information and Network Security Policies: Security policiesconfidentiality policies-integrity policies-hybrid policies. UNIT II BASIC CRYPTOGRAPHY AND CIPHER TECHNIQUES 9 Basic Cryptography: Classical cryptosystems-public key cryptography-cryptographic checksums. Cipher Techniques: Problems-stream and block ciphers-networks and cryptography-Secure Electronic mail PEM-Security at the Network Layer IPsec. UNIT III AUTHENTICATION & KEY MANAGEMENT Authentication: Basics-passwords-Challenge Response-Biometrics. KEY Management: Exchange-cryptographic key infrastructures-storing and revoking keys-digital signatures. 9 Key UNIT IV INTRUSION DETECTION, NETWORK SECURITY & SYSTEM SECURITY 9 Intrusion Detection: Principles-basic intrusion detection-models-architecture-organization of intrusion detection system-intrusion response. Network Security: Introduction-policy development-network organization. System Security: Introduction-policy-networks-users-authentication-processes-filesretrospective. UNIT V USER SECURITY & PROGRAM SECURITY 9 User Security: Policy-access-files and devices-processes-electronic communications. Program Security: Introduction-Design-refinement and implementation-common security related programming problems-testing, maintenance and operation. TEXT BOOK: 1. Sathyanarayana S.Venkatramanayya, Introduction to Computer Security, Pearson Education, 2013. REFERENCE BOOKS: 1. William Stallings, Cryptography And Network Security: Principles And Practice, Fifth Edition, Pearson Education, 2013. 2. Bernard Menezes, Network Security and Cryptography, Cengage Learning, 2011. 140CA9115 ACCOUNTING AND FINANCIAL MANAGEMENT Category: General Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: Learn about principles of financial accounting along with the preparation of final accounts. OBJECTIVES: To understand the basic principles of Double entry system, preparation of final accounts and financial ratio analysis. To make financial decision through management accounting viz. budgets, requirements of working capital and analysis of capital structure To understand the process of estimating the cost of a particular product. To ascertain the time value of money and make prepare for investment decision. UNIT I FINANCIAL ACCOUNTING 9 Meaning and Scope of Accounting – Principles: Concepts – Conventions - Accounting Standards; Final Accounts: Trail Balance - Trading Account - Profit and Loss Account - Balance Sheet – Simple problems – Financial Ratio Analysis – Application of Accounting package software – Software solution to the Simple Problem. UNIT II MANAGEMENT ACCOUNTING 9 Financial Accounting Vs Management Accounting - Funds Flow Analysis - Cash Flow Analysis Budgets and Budgetary Control: Meaning – Types - Sales Budget - Production Budget - Cost of Production Budget - Flexible Budgeting - Cash Budget - Master Budget - Zero Base BudgetingComputerized Accounting. UNIT III COST ACCOUNTING 9 Cost Accounting Meaning – Objectives - Elements of Cost- Cost Sheet; Marginal Costing and Cost Volume Profit Analysis - Break Even Analysis – Applications – Limitations; Standard Costing and Variance Analysis: Material – Labour – Overhead – Sales - Profit Variances. UNIT IV INVESTMENT DECISION AND COST OF CAPITAL 9 Objectives and Functions of Financial Management - Risk-Return Relationship - Time Value of Money Concepts; Capital Budgeting: Methods of Appraisal - Cost of Capital Factors Affecting Cost of Capital Computation for Each Source of Finance and Weighted Average Cost of Capital UNIT V FINANCING DECISION AND WORKING CAPITAL MANAGEMENT 9 Capital Structure-Factors Affecting Capital Structure-Dividend Policy - Types of Dividend Policy Concepts of Working Capital - Working Capital Policies - Factors affecting Working Capital-Estimation of Working Capital Requirements TEXT BOOKS: 1. S.N.Maheswari, Financial and Management Accounting, Sultan Chand & Sons,FifthEdition,2010. 2. I.M.Pandey, Financial Management, Vikas Publishing House Pvt. Ltd., Ninth Edition, 2009. 3. M.Y.Khan and P.K.Jain, Financial Management, Text, Problems and Cases, Tata McGraw Hill,Fifth Edition, 2008. 4. AswatDamodaran, Corporate Finance Theory and Practice, JohnWiley& Sons, 2008. 5. I.M.Pandey, Management Accounting, Vikas Publishing House Pvt. Ltd., Third Edition, 2009. 6. Brigham, Ehrhardt, Financial Management Theory and Practice Eleventh Edition, Cengage Learning, 2008. 7. Srivatsava, Mishra, Financial Management‖, Oxford University. 140CA9116 DATA MINING AND DATA WAREHOUSING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim is to introduce the techniques and concepts of data mining and data warehousing to be implemented in real time systems. OBJECTIVES: Imparting the concepts and techniques of data mining. Developing skills in data mining tools for solving practical problems. Implementation of algorithms, models and systems for technological advancements in the area of Data Mining. Exposure of real world experience to undergo independent study and research UNIT I INTRODUCTION TO DATA WAREHOUSE 9 Data Warehousing and Business Analysis: - Data warehousing Components –Building a Data warehouse – Mapping the Data Warehouse to a Multiprocessor Architecture – DBMS Schemas for Decision Support – Data Extraction, Cleanup, and Transformation Tools –Metadata – reporting – Query tools and Applications – Online Analytical Processing (OLAP) – OLAP and Multidimensional Data Analysis. UNIT II DATA MINING & DATA PREPROCESSING 9 Data Mining: - Data Mining Functionalities – Data Preprocessing – Data Cleaning – Data Integration and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation. Association Rule Mining: Efficient and Scalable Frequent Item set Mining Methods – Mining Various Kinds of Association Rules – Association Mining to Correlation Analysis – Constraint-Based Association Mining. UNIT III CLASSIFICATION & PREDICTION 9 Classification and Prediction: - Issues Regarding Classification and Prediction – Classification by Decision Tree-Bayesian Classification – Rule Based Classification – Classification by Back propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a Classifier or Predictor – Ensemble Methods – Model Section. UNIT IV CLUSTERING 9 Cluster Analysis: - Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-Based Clustering Methods – Clustering High Dimensional Data – Constraint-Based Cluster Analysis – Outlier Analysis. UNIT V SPATIAL DATA ANALYSIS 9 Mining Object, Spatial, Multimedia, Text and Web Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects – Spatial Data Mining – Multimedia Data Mining – Text Mining – Mining the World Wide Web. TEXT BOOK: 1. Jiawei Han &Micheline Kamber, Data Mining: Concepts and Techniques, Third Edition, Morgan Kaufmann Publishers, 2011. REFERENCE BOOKS: 1. Alex Berson & Stephen J. Smith, Data Warehousing, Data Mining & OLAP, Tata McGrawHill,2008. 2. Usama M.Fayyad, Gregory Piatetsky ,Shapiro Padhrai Smyth & Ramasamy Uthurusamy, Advances In Knowledge Discovery and Data Mining, The M.I.T Press, 2012. 3. Ralph Kimball, The Data Warehouse Life Cycle Toolkit, John Wiley & Sons, Second Edition, 2008. 4. Sean Kelly, Data Warehousing in Action, John Wiley & Sons Inc., 2007. 5. Pang-Ning Tan, Michael Steinbach and Vipin Kumar Introduction to Data Mining, Pearson Education, 2007. 140CA9117 AGILE SOFTWARE DEVELOPMENT Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: To gain knowledge on Agile methods for software development and attain an in-depth knowledge of applying SCRUM for product development. OBJECTIVES: Overview of Agile Methods and extreme programming for software development Introduce the concepts SCRUM Technology To have an in-depth knowledge on applying SCRUM for agile-based software development including practices, individuals and team work UNIT I AGILE METHODOLOGY 8 Understanding Success-Beyond deadlines-importance of Organizational Success-Agile model classification of agile methods –Road to Mastery-Find a mentor UNIT II EXTREME PROGRAMMING(XP) 10 Method overview – lifecycle – XP Team-XP concepts –practicing XP –Thinking –collaboratingReleasing-Development .Mastering Agility :XP values and principles: commonalities – About values, principles and practices .Improve the process. UNIT III SCRUM PRACTICES AND INDIVIDUALS 10 Individual Roles – Scrum Master – Product Owner – Changed Roles: Analysts, Project Managers, Architects, Functional Managers, Programmers, DB Administrators, Testers, User Experience Designers - Technical Practices – Strive for Excellence - Test-driven development – Refactoring – Collective Ownership – Continuous Integration – Pair Programming –Design: Intentional yet Emergent Guiding the Design UNIT IV SCRUM TEAMWORK 8 Team Structures – Small Team Productivity – Feature Teams – Component Teams – Guidelines for Good Team Structure – Team Responsibility – Foster Team Learning – Self Organizing Team – Influencing Evolution: Selecting Environment, Defining Performance, Manage Meaning, Energizing the System. UNIT V SCRUM SPECIFICATION 9 Product Backlog – Documents to Discussions – Written Documentation Disadvantages – User Stories Progressively Refine Requirements – Emergent Requirements – Backlog Iceberg – Refining User Stories – Specify by Example. TEXTBOOKS: 1. James Shore and Shane Warden ,The Art of Agile Development, O'Reilly Media,2007. (Unit I & II). 2. Mike Cohn, Succeeding with Agile: Software Development Using Scrum, Addison-Wesley Professional, First Edition, 2009. (Unit III to V.) REFERENCE BOOKS: 1. Craig Larman, Agile and Iterative Development A Manager‘s Guide Pearson Education 2004. 2. Alistair Agile Software Development series Cockburn - 2007 3. Elisabeth Hendrickson, Agile Testing Quality Tree Software Inc 2008. 140CA9118 UNIX & NETWORKING PROGRAMMING Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: Impart the skills of introducing the techniques and concepts of Unix& Networking concepts in real time systems OBJECTIVES: Learn the environment of UNIX and to implement the concepts of networks. Impart the interprocess communication between files. Enlighten about the sockets programming. UNIT I INTRODUCTION TO UNIX AND FILE SYSTEM 9 Unix Architecture and Command Usage - General Purpose Utilities – File System – Handling Ordinary Files – Basic File Attributes – Essential Shell Programming – File I/O – Files and Directories – System Data Files and Information: Password File – Group File – Login Accounting. UNIT II PROCESSES 9 Process Environment – Process Control – Process Relationships: Terminal Logins – Network Login – Process Groups – Session – Job Control – Signals. UNIT III INTERPROCESS COMMUNICATION 9 Introduction – Message Passing (SVR4) – Pipes – FIFO – Message Queues – Semaphores – Shared Memory. UNIT IV SOCKETS Introduction – Transport Layer – Socket Introduction – Elementary TCP Sockets – UDP Sockets – Socket Options – Name and Address conversions. 9 UNIT V APPLICATIONS 9 Debugging Techniques – TCP Echo Client Server – UDP Echo Client Server – Ping – Trace Route – Client Server Applications like File Transfer and Chat. TEXT BOOKS: 1. W. Richard Stevens, -Advanced Programming in the UNIX Environment, Addison Wesley, New Delhi, 2008.( Unit I to III) 2. Unix Network Programming, Volume 1: The Sockets Networking API - Volume-1-TheSockets-Networking-API, Addison-Wesley Professiona1 2011.(Unit IV & V). REFERENCE BOOKS: 1. Maurice J. Bach, Design of the Unix Operating System‖, Prentice Hall, New Delhi,2007. 2. Meeta Gandhi,Tilak Shetty & Rajiv Shah , The C‗ Odyssey Unix –The OpenBoundless C, FirstEdition, BPB Publications,1992. 140CA9119 SERVICE ORIENTED ARCHITECTURE Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: The aim of this course is to provide basic knowledge about XML, Web Services and key technologies for web services. OBJECTIVES: Provide fundamental concepts of Service Oriented Architecture Understand XML structure, presentation and transformation technologies Gain knowledge about SOAP, UDDI and WSDL to create web services Impart information on various WS-* specification standards UNIT I SOA BASICS 9 Roots of SOA – Characteristics of SOA - Comparing SOA to client-server and distributed internet architectures – Anatomy of SOA- components in an SOA interrelate - Principles of service orientation – Service Layers. UNIT II XML AND WEB SERVICES XML structure – Elements – Creating Well-formed XML - Name Spaces – Schema Elements, Types, Attributes – XSL Transformations – Parser –Web Services Overview – Architecture. 9 UNIT III WEB SERVICES STANDARDS: 9 WS-Coordination overview -WS-Addressing language basics-WS-Reliable Messaging language basics-WS-Policy language basic-WS-Security language basics UNIT IV WSDL, SOAP and UDDI 9 WSDL - Overview Of SOAP – HTTP – XML-RPC – SOAP: Protocol – Message Structure – Intermediaries – Actors – Design Patterns And Faults – SOAP With Attachments – UDDI. UNIT V SOA in J2EE and .NET 9 SOA platform basics – SOA support in J2EE – Platform overview- Primitive SOA support- Support for service-orientation principles- Contemporary SOA support- SOA support in .NET- Platform overviewPrimitive SOA support- Support for service-orientation principles- Contemporary SOA support . TEXT BOOKS: 1. Thomas Erl, Service-Oriented Architecture: Concepts, Technology, and Design, Pearson Education, 2006. (Unit I, III, V). 2. Frank. P.Coyle, XML, Web Services and The Data Revolution, Pearson Education,2007(Unit II,IV) REFERENCE BOOKS: 1.Sandeep Chatterjee, James Webber, Developing Enterprise Web Services. An Architect‘s Guide, Pearson Education, 2005. 2.Newcomer, Lomow, Understanding SOA with Web Services, Pearson Education, 2005. 3.Dan woods and Thomas Mattern, Enterprise SOA designing IT for Business Innovation O‘Reilly, First Edition, 2006. 140CA9120 VIRTUALIZATION TECHNIQUES Category: Technical Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM Develop a focused technology view targeted at Virtualization with a focus on Computing and Networking virtualization OBJECTIVE Analyze the different computing Virtualization tools and techniques. Understand the layers of Network Virtualization. Evaluate the different storage mechanisms & their platforms. UNIT I OVERVIEW OF VIRTUALIZATION 10 Basics of Virtualization - Virtualization Types – Desktop Virtualization – Network Virtualization – Server and Machine Virtualization – Storage Virtualization – System-level or Operating Virtualization – Application Virtualization-Virtualization Advantages – Virtual Machine Basics – Taxonomy of Virtual machines - Process Virtual Machines – System Virtual Machines – Hypervisor - Key Concepts UNIT II SERVER CONSOLIDATION 8 Hardware Virtualization – Virtual Hardware Overview - Sever Virtualization – Physical and Logical Partitioning - Types of Server Virtualization – Business cases for Sever Virtualization – Uses of Virtual server Consolidation – Planning for Development – Selecting server Virtualization Platform UNIT III NETWORK VIRTUALIZATION 10 Design of Scalable Enterprise Networks - Virtualizing the Campus WAN Design – WAN Architecture WAN Virtualization - Virtual Enterprise Transport Virtualization–VLANs and Scalability - Theory Network Device Virtualization Layer 2 - VLANs Layer 3 VRF Instances Layer 2 - VFIs Virtual Firewall Contexts Network Device Virtualization - Data- Path Virtualization Layer 2: 802.1q - Trunking Generic Routing Encapsulation – Ipsec L2TPv3 Label Switched Paths - Control-Plane Virtualization–Routing Protocols- VRF - Aware Routing Multi-Topology Routing. UNIT IV VIRTUALIZING STORAGE 8 SCSI- Speaking SCSI- Using SCSI buses – Fiber Channel – Fiber Channel Cables – Fiber Channel Hardware Devices – iSCSI Architecture – Securing iSCSI – SAN backup and recovery techniques – RAID – SNIA Shared Storage Model – Classical Storage Model – SNIA Shared Storage Model – Host based Architecture – Storage based architecture – Network based Architecture – Fault tolerance to SAN – Performing Backups – Virtual tape libraries. UNIT V VIRTUAL MACHINES PRODUCTS 9 Xen Virtual machine monitors- Xen API – VMware – VMware products – Vmware Features – Microsoft Virtual Server – Features of Microsoft Virtual Server TEXT BOOKS: 1. William von Hagen, Professional Xen Virtualization, WroxPublications,January,2008.(Unit I & V) 2. Chris Wolf , Erick M. Halter, Virtualization: From the Desktop to the Enterprise,APress 2005.(Unit II) 3. Kumar Reddy, Victor Moreno, Network virtualization, Cisco Press, July, 2006.(Unit III) 4. James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes, Elsevier/Morgan Kaufmann, 2005.(Unit I) 5. David Marshall, Wade A. Reynolds, Advanced Server Virtualization:VMware and Microsoft Platform in the Virtual Data Center, Auerbach Publications, 2006.(Unit IV) REFERENCE BOOKS: 1. Dan Kusnetzky,Virtualization : A Managers Guide,Oreilly,First Edition,2011. 2. David Chisnall ,The Definitive Guide to the Xen Hypervisor Prentice Hall Open Source Software Development Series,2008. 140CA9121 HEALTH CARE MANAGEMENT Category: General Mode of Delivery: Lecture –3 Hrs/Week; Total hours: 45 Credit: 3 AIM: To know about creating and maintaining health care information systems OBJECTIVES: Understand the basic concepts of health care system. Ensure access of clinical information system on the fly Understand IT governance and assessment of health care information system UNIT I INTRODUCTION 9 Introduction to health care information – Health care data quality – Health care information regulations, laws and standards. UNIT II HEALTH CARE INFORMATION SYSTEMS 9 History and evolution of health care information systems – Current and emerging use of clinical information systems – system acquisition – System implementation and support. UNIT III INFORMATION TECHNOLOGY 9 Information architecture and technologies that support health care information systems – Health care information system standards – Security of health care information systems. UNIT IV MANAGEMENT OF IT CHALLENGES 9 Organizing information technology services – IT alignment and strategic planning – IT governance and management. UNIT V IT INITIATIVES 9 Management‘s role in major IT initiatives – Assessing and achieving value in health care information systems. Case study TEXT BOOK: 1.Karen A Wager, Frances Wickham Lee, John P Glaser, Managing Health Care Information Systems: A Practical Approach for Health Care Executives, Wiley publications, Third Edition, 2013. REFERENCE BOOKS: 1. Marion J. Ball, Charlotte Weaver, Joan Kiel ,Healthcare Information Management Systems: Cases, Strategies, and Solutions, Springer, Third Edition ,2010. 2. Rudi Van De Velde and Patrice Degoulet, Clinical Information Systems: A Component based approach, Springer 2005. 3. Kevin Beaver,Healthcare Information Systems, Second Edition Best Practices, CRC Press,2002. 4. Marion J. Ball Healthcare Information Management Systems: A Practical Guide Springer-Verlag GmbH, 1995.