MCA

MASTER OF COMPUTER APPLICATIONS

Department of Computer Science & IT

MCA

Semester – I

Subject Subject Name Teaching Scheme Credits Code (Hours)_

Theory Tutorial Practical

17MCA101 Digital Logic and Computer

Organization 4 -- -- 4

17MCA102

Advanced Data Structures And Algorithm Design

4 -- -- 4 17MCA103 Discrete Mathematics for Computer 4 1 -- 5

Science 17MCA104 Web Programming Applications 4 4 17MCA105 Quantitative Aptitude & Reasoning 2 2 4

Skills 17MCA106 Web programming Lab -- -- 4 4 17MCA107 Data Structures And Algorithms Lab -- -- 4 4

Total 18 4 8 30

Semester – II

Subject Subject Name Teaching Scheme Credi Code (Hours)_ Ts

Theor Tutori Practi y al cal

17MCA201 Information Security 4 1 -- 5 17MCA202 Python Programming

17MCA203 Advances in Databases

4 -- -- 4 17MCA204 Computer – Oriented Numerical Methods 4 1 -- 5

17MCA205 Embedded Systems And Internet Of Things

4 -- -- 4 17MCA206 Database Technology Lab -- -- 4 4 17MCA207 Python Programming in Java Lab 4 -- 4 4

Total 20 2 8 30

MCA

Semester – III

Subject Subject Name Teaching Scheme Credi Code (Hours)_ Ts

Theo Tutori Practic ry al al

17MCA301 Human Computer Interaction 4 2 -- 6 17MCA302 .Net Programming 4 -- -- 4 17MCA303 Network Security 4 -- -- 4 17MCA304 Operating System 4 -- -- 4

Elective – I * 4 -- -- 4 17MCA308 .Net Programming Lab -- -- 4 4 17MCA309 Programming in Unix & Linux Lab -- -- 4 4

Total 20 2 8 30

Semester – IV

Subject Subject Name Teaching Scheme Credit Code (Hours)_ S

Theor Tutori Practic y al al

17MCA401 MOBILE APPLICATION

DEVELOPMENT TECHNIQUES 4 -- -- 4 17MCA402 Principles of Software Engineering 4 -- -- 4 17MCA403 Operations Research 4 1 -- 5 17MCA404 Cloud Computing 4 1 -- 5 17MCA405 Wireless Networks 4 -- -- 4

Elective – II * 4 -- -- 4 17MCA409 Android Application Lab -- -- 4 4

Total 24 2 4 30

MCA

List of Electives – I *

Subject Code Elective - I

17MCA305 Data Warehousing & Data Mining

17MCA306 TCP / IP Principles and Architecture

17MCA307 Software Testing & Quality Management

List of Electives – II *

Subject Code Elective - II

17MCA406 Digital Image Processing with MATLAB

17MCA407 Big Data and its Applications

17MCA408 Artificial Intelligence & Expert Systems

MCA

17MCA101 DIGITAL LOGIC AND COMPUTER ORGANIZATION Objectives: To understand the fundamentals of Boolean logic and functions. To design and realize digital systems with basic gates and other components using combinational and sequential circuits. .UNIT I Digital Fundamentals Digital Systems – Binary Numbers – Octal – Hexadecimal Conversions – Signed Binary Numbers – Complements – Logic Gates – Boolean Algebra – K-Maps – Standard Forms – NAND – NOR Implementation.

UNIT II Combinational And Sequential Circuits Combinational circuits – Adder – Subtractor – ALU Design – Decoder – Encoder – Multiplexers – Introduction to Sequential Circuits – Flip-Flops – Registers – Counters.

UNIT III Computer Fundamentals Functional Units of a Digital Computer: Von Neumann Architecture – Operation and Operands of Computer Hardware Instruction – Instruction Set Architecture (ISA): Memory Location, Address and Operation – Instruction and Instruction Sequencing – Addressing Modes, Encoding of Machine Instruction – Interaction between Assembly and High Level Language (C language).

UNIT IV Processor Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control, Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.

UNIT V Memory And I/O Memory Concepts and Hierarchy – Memory Management – Cache Memories: Mapping and Replacement Techniques – Virtual Memory – DMA – I/O – Accessing I/O: Parallel And Serial Interface – Interrupt I/O – Interconnection Standards: USB, SATA. TEXT BOOKS 1.David A. Patterson, John L. Hennessy, “Computer Organization and Design, The Hardware/Software Interface”, Fifth Edition, Morgan Kaufmann/Elsevier, 2013. 2.M. Morris Mano, Michael D. Ciletti, “Digital Design”, Fifth Edition, Pearson Education, 2013. REFERENCE BOOKS 1.Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig Manjikian, “Computer Organization and Embedded Systems”, Sixth Edition, Tata McGraw-Hill, 2012. 2.William Stallings, “Computer Organization and Architecture – Designing for Performance”, Tenth Edition, Pearson Education, 2016. 3.M. Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 2008. E-BOOK 1. https://ict.iitk.ac.in/wp-content/uploads/CS422-Computer-Architecture-ComputerOrganizationAndDesign5thEdition2014.pdf

MCA

17MCA102 ADVANCED DATA STRUCTURES AND ALGORITHM DESIGN

OBJECTIVES:

• To learn the usage of hierarchical data structures. • To familiarize with various heap structures. • To understand the usage of graph algorithms. • To understand the techniques involved in analyzing the efficiency of computer

algorithms.

UNIT I Advanced Non-Linear Data Structures AVL Trees – Splay Trees: Splaying – Top Down Splay Trees – B-Trees – Red Black Trees: Bottom Up Insertion – Tries.

UNIT II Heap Structures Binary Heaps – Min Max Heaps – Leftist Heaps – Skew Heaps – Binomial Heaps – Fibonacci Heaps – Lazy Merging for Binomial Queues – Fibonacci Heap Operations – Amortized Analysis.

UNIT III Graph Algorithms Graphs: Representation of Graphs – Graph Traversals – Topological Sort – Shortest Path Algorithms: Dijkstra’s Algorithm – Graph with Negative Edge Costs – All Pairs Shortest Path Minimum Spanning Tree: Prim’s and Kruskal’s Algorithm.

UNIT IV Algorithms In Computing – Introductions to Algorithms – Iterative and Recursive Algorithms – Designing Algorithms – Analyzing Algorithms – Growth of Functions: Asymptotic Notations – Standard Notations and Common Functions – Recurrences: The Substitution Method – The Recursion – Tree Method – Master’s Method.

UNIT V Algorithm Design Techniques Greedy Algorithms: Huffman Codes – Divide and Conquer: Merge Sort – Dynamic Programming: Using a Table instead of Recursion – Ordering Matrix Multiplications – Introduction to NP Completeness – NP Complete Problems: Traveling Salesman Problem – Randomization Approach

TEXT BOOKS 1.Mark Allen Weiss, “Data Structures and Algorithm Analysis in Java”, Third Edition, Pearson Education, 2012. 2.Michael T. Goodrich, Roberto Tamassia, “Data Structures and Algorithms in Java”, Fourth Edition, Wiley, 2002. REFERENCE BOOKS 1.Robert Sedgewick, “Algorithms in Java”, Third Edition, Addison Wesley, 2002. 2.Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI Learning, 2002. 3.S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press, 2014. 4.Alferd V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, 1983. 5.Anany Levitin, “Introduction to Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012 E-BOOK 1.http://enos.itcollege.ee/~jpoial/algorithms/GT/Data%20Structures%20and%20Algorithms%20in%20Java%20Fourth%20Edition.pdf

MCA

MCA

17MCA103 DISCRETE MATHEMATICS FOR COMPUTER SCIENCE Objective: To introduce students to language and methods of the area of Discrete Mathematics. The focus of the module is on basic mathematical concepts in discrete mathematics and on applications of discrete mathematics in algortihms and data structures. To show students how discrete mathematics can be used in modern computer science (with the focus on algorithmic applications). UNIT I - Logic And Proofs Propositional logic – Propositional equivalences – Predicates and quantifiers – Nested quantifiers – Rules of inference – Introduction to proofs – Proof methods and strategy. UNIT II Matrices Matrices: addition and subtraction - scalar multiplication - matrix multiplication - properties of addition and multiplication of matrices - transpose of a matrix - determinant - identify matrix - inverse of a matrix - condition for a matrix to be singular - solution of simultaneous linear equations UNIT III Counting Counting: The Basics of Counting - Pigeonhole Principle - Permutations and Combinations - Binomial Coefficients - Recurrence Relations - Inclusion – Exclusion and its Applications. UNIT IV Graph Theory Basic concepts of graph theory – paths – reach ability and connectedness – matrix representation of graphs – storage representation and manipulation of graphs – binary trees – Shortest path algorithms. UNIT V Automaton Finite state automata – Deterministic and Non-deterministic finite automaton –transitions – Equivalence of these without proofs – regular expressions. Text book:

1. J.P. Tremblay and R. Manohar, Discrete mathematical Structures with Applications To computer science, McGraw Hill Companies Limited, New York, 1997.

2. Ralph P. Grimaldi and B.V. Ramana, Discrete and Combinatorial Mathematics, Pearson Education, 5th Edition 2007.

Books for Reference: 1. Kenneth h Rosen, Discrete Mathematics and its Applications, Tata McGraw-hill, 6th

Edition 2007.Q 2. T. Veerarajan, Discrete Mathematics, Tata McGraw-Hill, Edition 2007. 3. Krishnamurthy. V, Combinatorics Theory and Applications, East-West Press T.

Veerarajan, Discrete Mathematics, Tata McGraw-Hill, Edition 2007. 4. Krishnamurthy. V, Combinatorics Theory and Applications, East-West Press.

MCA

17MCA104 WEB PROGRAMMING

OBJECTIVES: To understand the basics of web standards and scripting languages. To design rich web pages using advanced scripts.

UNIT I Basics of Web And Scripting Authoring tools – HTML5 Tags – HTML5 Forms – Cascading Style Sheets (CSS3) – Need for Scripting languages – JavaScript basics – Functions – Date Object – Events – Strings – Arrays – Regular Expressions

UNIT II Advanced Scripting Features JavaScript: HTML DOM, Web browser BOM, AJAX, JSON – Rich Internet Applications with XML and JSON – Dynamic Access of Web Pages – JQuery – Overview of AngularJS.

UNIT III Introduction To PHP Introduction to PHP – PHP Variables – Constants – Operators – Flow Control and Looping – Arrays – Strings – Functions – File Handling – Exceptional Handling – Regular Expression in PHP – XML with PHP – AJAX with PHP – Object Features in PHP

UNIT IV Server – Side Scripting HTML with PHP – Database Management – Introduction to MySQL – MySQL Commands – MySQL Database Creation – Connecting MySQL and PHP – Querying MySQL Database with PHP – Session and Cookies – Sending Emails – Uploading Files.

UNIT V Advanced Frameworks Model View Controller Architecture – PHP frameworks – Code Igniter on Newer Versions of PHP – Installing Twitter Bootstrap – Installing and using Sparks – Creating the Database – Creating the View – Creating the Model – Creating the Controller – Creating an Ecommerce Site.

REFERENCES: 1. Harvey Deitel, Abbey Deitel, “Internet and World Wide Web How to Program”, Fifth Edition, Pearson Publication, 2012. 2. Steven Holzner, “PHP: The Complete Reference”, Fifth Edition, McGraw Hill, 2017. 3. Rob Foster, “CodeIgniter Web application Blueprints”, Packt, 2015. 4. Robin Nixon, “Learning PHP, MySQL, JavaScript, CSS & HTML5: A Step-by-Step Guide to Creating Dynamic Websites”. O'Reilly Media, 2014. E BOOK 1.https://dl.acm.org/doi/book/10.5555/2663407

MCA

17MCA105 QUANTITATIVE APTITUDE & REASONING SKILLS Objectives: The main objective of this subject to train the students on a variety of question types used by the companies and improve their language skill. This module would train the students on the quick ways to solve quantitative aptitude problems and questions applying logical reasoning, within a short time span given during the placement drives. Unit – I Time and Distance Time and Distance - Height and Distance – Numbers - Problems on Ages & Trains - Pipes , Cistern Boats and Streams Probability Unit – II Sequence And Series A sequence in which every term is created by adding or subtracting a definite number to the preceding number is an arithmetic sequence. A sequence in which every term is obtained by multiplying or dividing a definite number with the preceding number is known as a geometric sequence. A series of numbers is said to be in harmonic sequence if the reciprocals of all the elements of the sequence form an arithmetic sequence. Unit – III Letter and Symbol series Letter and Symbol series - Number series - Analyzing arguments - Making judgments Unit – IV Permutation and Combination Partnership - Simple Interest - Compound Interest - Profit and Loss - Problems on Clock - Calendar - Cubes - Permutation and Combination Unit – V Analytical Reasoning Ratio – Time and Work – Direction Sense Test – Analytical Reasoning REFERENCES 1.Quantitative Aptitude by Dinesh Khattar – Pearsons Publicaitons 2. Quantitative Aptitude and Reasoning by RV Praveen – EEE Publications 3.Quantitative Aptitude by Abijith Guha – TATA Mc GRAW Hill Publications 4. General English for Competitive Examination by A.P. Bharadwaj – Pearson Educaiton 5.English for Competitive Examination by Showick Thorpe - Pearson Educaiton

6. IBPS PO - CWE Success Master by Arihant - Arihant Publications(I) Pvt.Ltd - Meerut 7.Verbal Ability for CAT by Sujith Kumar - Pearson India

8. Verbal Ability & Reading Comprehension by Arun Sharma - Tata McGraw – Hill Education

MCA

17MCA106 WEB PROGRAMMING LAB 1. Write CSS rule that specifies the presentation of elements on a

website to control its appearance.

2. Traverse, edit and modify elements in a HTML5 document using DOM.

3. Create a website with dynamic features using JavaScript event handling.

4. Create enhanced web pages using JQuery and AngularJS.

5. Write PHP programs to demonstrate the uses of array, string

manipulation, file and exception handling.

6. Write PHP programs to connect to MySQL database and provide CRUD

operations.

7. Develop simple PHP based web application for session handling.

8. Create an XML document; load the XML document into your

web browser. Write an XML Schema document specifying the

structure of the XML document created. Write an XSL style

sheet for your solution that displays the content in an HTML5

table.

9. Develop PHP based internet rich application with AJAX features.

10. Develop PHP programs to demonstrate object features.

11. Create PHP based web application to attach files and send emails.

12. Create PHP application using Code Igniter framework to

demonstrate MVC architecture.

MCA

17MCA107 DATA STRUCTURES AND ALGORITHMS LAB

1. Implementation of AVL tree and its operations.

2. Implementation of Splay tree and its operations.

3. Implementation of red-black tree and its operations.

4. Implementation of basic heap and leftist heap operations.

5. Implementation of Fibonacci heap operations.

6. Implementation of representation of graphs and topological sort.

7. Implementation of a spanning tree for a given graph using Prim’s algorithm.

8. Implementation of shortest path algorithms such as Dijkstra’s and

Floyd Warshall’s algorithm.

9. Implementation of iterative and recursive algorithms with its complexity

analysis.

10. Implementation of merge sort algorithm analysis using divide and conquer

approach.

11. Implementation of matrix chain multiplication using dynamic programming

approach.

12. Implementation of Huffman coding using greedy approach.

MCA

Semester - II 17MCA201 INFORMATION SECURITY OBJECTIVES: To introduce the concepts and models of security. To understand the risk assessment and security standard. To plan for business continuity and incident response plan.

UNIT I Introduction to Security & Security Models Security Trends – OSI Security Architecture – Security Attacks – Security Services– Security Mechanisms– Security System Development Life Cycle – Security Models – Bell – LaPadula Model – Biba Integrity Model – Chinese Wall Model – Malicious Logic – Viruses, Worms, Logic Bombs Legal, Ethical And Professional Issues UNIT II Security Analysis And Logical Design Risk Management – Identifying and Assessing Risk – Assessing and Controlling Risk – Blueprint for Security – Information Security Policy – Standards and Practices – ISO 17799/BS 7799 – NIST Models – VISA International Security Model – Design of Security Architecture – Depth of Defense – Security Perimeter.

UNIT III Planning For Continunity Continuity Strategy – Business Impact Analysis – Incident Response Planning – Incident Reaction – Incident Recovery – Automated Response – Disaster Recovery Planning – Business Continuity Planning – Model for a Consolidated Contingency Plan – Law Enforcement Involved – Physical Design of the SecSDLC

UNIT IV SECURITY ANALYSIS Security Technology – Intruders, Malicious software, Firewalls, Scanning and Analysis tools, Content filters – Vulnerability Analysis – Flaw Hypothesis Methodology, NRL taxonomy and Aslam‘s model – Auditing – Anatomy of an Auditing System – Design of Auditing Systems – Posteriori Design – Auditing mechanisms.

UNIT V SECURITY PRACTICES Secure Coding – OWASP/SANS Top Vulnerabilities – Buffer Overflows – XSS – Anti Cross Site Scripting Libraries – Database security – SQL Injection – Cyber Crime and security, Security tools – Digital Forensic – OS fingerprinting – TCP/IPstack Masking – Social Engineering

REFERENCES: 1. Michael E Whitman, Herbert J Mattord, “Principles of Information Security”, Fourth Edition, Cengage Learning, 2011. 2. Matt Bishop, “Computer Security: Art and Science”, Pearson Education, 2003. 3. Charles P. Pfleeger, Shari Lawrence Pfleeger, Jonathan Margulies, “Security in Computing”, Fifth Edition, Prentice Hall, 2015. https://www.cengage.com/search/productOverview.do;jsessionid=E136F67A28D57A39B9D643A80C78F875?N=%2B16&Ns=P_CopyRight_Year%7C1&Ntk=all%7CP_Isbn13&Ntt=Principles+of+Information+Security%7C9781111138219&Ntx=mode%2Bmatchallpartial

MCA

17MCA202 PYTHON PROGRAMMING Learning Objectives: Computer programming skills are now becoming part of basic education as these skills are increasingly of vital importance for future job and career prospects. The Python programming language which is one of the most popular programming languages worldwide Unit I Introduction to Python Programming Language. Strengths and Weaknesses, IDLE, Dynamic Types, Naming Conventions, String Values, String Operations, String Slices, String Operators, Numeric Data Types, Conversions, Built In Functions Unit II Data Collections and Language Component Introduction, Control Flow and Syntax, Indenting, The if Statement, Relational Operators, Logical, Operators, True or False, Bit Wise Operators, The while Loop, break and continue, The for Loop, Lists, Tuples, Sets, Dictionaries, Sorting Dictionaries, Copying Collections Unit III Object and Classes Classes in Python, Principles of Object Orientation, Creating Classes, Instance Methods, File Organization, Special Methods , Class Variables, Inheritance ,Polymorphism , Type Identification, Custom Exception Classes Unit IV Functions and Modules Introduction , Defining Your Own Functions , Parameters, Function Documentation ,Keyword and Optional Parameters, Passing Collections to a Function , Variable Number of Arguments , Scope , Functions - "First Class Citizens" , Passing Functions to a Function , Mapping Functions in a Dictionary , Lambda , Modules ,Standard Modules – sys ,Standard Modules – math , Standard Modules – time, The dir Function Unit I V I/O and Error Handling In Python Introduction, Data Streams , Creating Your Own Data Streams , Access Modes , Writing Data to a File , Reading Data From a File., Additional File Methods , Using Pipes as Data Streams ,Handling IO Exceptions , Working with Directories, Metadata , Errors , Run Time Errors, The Exception Model , Exception Hierarchy , Handling Multiple Exceptions Reference Book: 1. Dive into Python, Mike 2. Learning Python, 4th Edition by Mark Lutz 2. Programming Python, 4th Edition by Mark Lutz E-Book 1.http://index-of.es/Python/OReilly.Programming.Python.4.Edition.Dec.2010.pdf

MCA

17MCA203 ADVANCES IN DATABASES OBJECTIVES: • To learn the fundamentals of data modeling and design in advanced databases. • To study the working principles of distributed databases. • To have an introductory knowledge about the query processing in object-based databases and its usage.

UNIT I Distributed Databases Distributed Systems – Introduction – Architecture – Distributed Database Concepts – Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing UNIT II NoSQL Databases NoSQL – CAP Theorem – Sharding - Document based – MongoDB Operation: Insert, Update, Delete, Query, Indexing, Application, Replication, Sharding, Deployment – Using MongoDB with PHP / JAVA – Advanced MongoDB Features – Cassandra: Data Model, Key Space, Table Operations, CURD Operations, CQL Types – HIVE: Data types, Database Operations, Partitioning – HiveQL – OrientDB Graph database – OrientDB Features

UNIT III Advanced Database Systems Spatial Databases: Spatial Data Types, Spatial Relationships, Spatial Data Structures, Spatial Access Methods – Temporal Databases: Overview – Active Databases – Deductive Databases – Recursive Queries in SQL – Mobile Databases: Location and Handoff Management, Mobile Transaction Models, Concurrency – Transaction Commit Protocols – Multimedia Databases

UNIT IV XML And Datawarehouse XML Database: XML – XML Schema – XML DOM and SAX Parsers – XSL – XSLT – XPath and XQuery – Data Warehouse: Introduction – Multidimensional Data Modeling – Star and Snowflake Schema – Architecture – OLAP Operations and Queries.

UNIT V Information Retrieval And Web Search IR concepts – Retrieval Models – Queries in IR system – Text Preprocessing – Inverted Indexing – Evaluation Measures – Web Search and Analytics – Current trends.

REFERENCES: 1. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Sixth Edition, McGraw Hill, 2011. 2. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Seventh Edition, Pearson Education/Addison Wesley, 2017. 3. C. J. Date, A. Kannan, S. Swamynathan, “An Introduction to Database Systems”, Eighth Edition, Pearson Education, 2006. 4. Jiawei Han, Micheline Kamber , Jian Pei, “Data Mining: Concepts

MCA

and Techniques”, Third Edition, Morgan Kaufmann, 2012. 5. Brad Dayley, “Teach Yourself NoSQL with MongoDB in 24 Hours”, Sams Publishing, 2014. 6. Shashank Tiwari, “Professional NoSQL”, O’Reilly Media, 2011. 7. Vijay Kumar, “Mobile Database Systems”, John Wiley & Sons, 2006. E-Book 1.http://site.iugaza.edu.ps/ilubbad/files/2016/09/3-Database-System-Concepts-6th-edition-_-Henry-F-Korth-Abraham-Silberschatz-S-Sudharshan.pdf

MCA

17MCA204 COMPUTER ORIENTED NUMERICAL METHODS Objectives:

1. To expose the students to various tools in solving numerical problems. 2. To enable the students to apply these methods in a computers environment.

UNIT I Bisection method and Elimination method Bisection method, False Position method, Newton Raphson method, Successive Approximation method Gauss-Elimination method – Pivoting – Gauss-Jordan Elimination method – Gauss-Seidal Iteration method. UNIT II Bisection method Bisection method – Newton’s method – Interpolation - Newton’s divided difference formula – Lagrange’s interpolation – Newton’s forward and backward difference formula. UNIT III Statistical Computation Statistical Computation: Frequency chart, Curve fitting by method of least squares, fitting of straight lines, polynomials, exponential curves etc, Data fitting with Cubic splines, Regression Analysis, Linear and Non linear Regression, Multiple regression, Statistical Quality Control methods. UNIT IV Numerical differentiation Numerical differentiation – Numerical Integration – Newton Cotes method – Trapezoidal rule – Simpson’s rule. UNIT V Initial value problem Initial value problem – Euler’s method – Runge-Kutta method – Boundary value problem. TEXT BOOK:

1. James M.Ortega and Andrew S.Grimshaw., “An Introduction to C++ and Numerical Methods”, Oxford University Press, New York, 1999. 2. T Veerarajan, T Ramachandran, "Numerical Methods with Programs in C", 2nd Edition, Tata McGraw Hill Publication.

REFERENCES: 1. Balagurusamy E., Object Oriented Programming with C++, Tata McGraw Hill Publishing Company Ltd, New Delhi, 1996. 2. Froberg C E., Introduction to NumericalAnalysis,

MCA

17MCA205 PYTHON PROGRAMMING LAB 1. Demonstrate the working of ‘id’ and ‘type’ functions. 2. Write a Python program to find all prime numbers within a given range 3. Write a Python program to print ‘n terms of Fibonacci series using iteration 4. Write a Python program demonstrate use of slicing in string 5.Write a Python program a) To add 'ing' at the end of a given string (length should be at least 3). If the given string already ends with 'ing' then add 'ly' instead. If the string length of the given string 5. is less than 3, leave it unchanged. Sample String : 'abc' Expected Result : 'abcing' Sample String : 'string' C 220.2 Expected Result : 'stringly' b) To get a string from a given string where all occurrences of its first char have been changed to '$', except the first char itself. 6.Write a Python program to a) Compute the frequency of the words from the input. The output should output after sorting the key alphanumerically. b) program that accepts a comma separated sequence of words as input and prints the words in a comma-separated sequence after sorting them alphabetically. 7.Write a Python program that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically 8.Write a Python program to demonstrate use of list & related functions 9. Write a Python program to demonstrate use tuple, set & related functions 10. Write a Python program to implement stack using list. 11. Write a Python program to implement queue using list. 12. Write a Python program to read and write from a file. 13 Write a Python program copy a file. 14. Write a Python program to demonstrate working of classes and objects. 15. Write a Python program to demonstrate class method & static method. 16. Write a Python program to demonstrate constructors 17. Write a Python program to demonstrate inheritance. Write a Python program to demonstrate aggregation/compositions 18.Write a Python program to create a small GUI application for insert, update and delete in a table using Oracle as backend and front end for creating form

MCA

17MCA206 DATABASE TECHNOLOGY LAB

1. Data Definition Language (DDL) commands in RDBMS

2. Data Manipulation Language (DML) and Data Control Language (DCL)

3. High level language extensions with cursors

4. High level language extension with Triggers

5. Procedures and Functions

6. Embedded SQL

7. Database design using E-R model and Normalization

8. Design and implementation of payroll processing system

9. Design and implementation of Banking system

10. Design and implementation of Library Information System

11. Design and implementation of Student Information System

12. Automatic Backup of Files and Recovery of Files

MCA

17MCA207 EMBEDDED SYSTEMS AND INTERNET OF THINGS

OBJECTIVES: To learn the internal architecture and programming of an embedded processor. To introduce interfacing I/O devices to the processor and to run, debug programs in an IDE.

UNIT I 8-Bit Embedded Processor 8- bit Microcontroller: Architecture, Instruction Set and Programming. Programming Parallel Ports, Timers and Serial Port – Interrupt Handling. UNIT II Embedded C Programming Memory and I/O Devices Interfacing – Programming Embedded Systems in C – Need for RTOS –Multiple Tasks and Processes – Context Switching – Priority Based Scheduling PoliciesPlatforms.

UNIT III Fundamentals of IOT Introduction and Characteristics – Physical and Logical Design – IoT Protocols: Link Layer Protocols, Network Layer Protocols, Transport Layer and Application Layer Protocols – IoT Levels – IoT versus M2M – Sensors and Actuators – Power Sources. UNIT IV Building IOT 9 Open Hardware Platforms: Interfaces, Programming, APIs and Hacks – Web Services – Integration of Sensors and Actuators with Arduino/ Raspberry Pi/ Other Light Weight Boards.

UNIT V Applications Complete Design of Embedded Systems – Smart Cities: Smart Parking, Smart Traffic Control, Surveillance – Home Automation: Smart Appliances, Intrusion Detection, Smoke/Gas Detectors – Cloud Storage and Communication APIs: WAMP, Xively, Django – Data and Analytics for IoT.

REFERENCES: 1. Wayne Wolf, “Computers as Components: Principles of Embedded Computer System Design”, Elsevier, 2006. 2. Muhammed Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay, “The 8051 Microcontroller and Embedded Systems”, Pearson Education, Second Edition, 2007. 3. Arshdeep Bahga, Vijay Madisetti, “Internet of Things: A Hands-on-Approach”, VPT 2014. 4. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton, Jerome Henry, “IoT Fundamentals, Networking Technologies, Protocols, and Use cases for the Internet of Thing”, Cisco Press, 2017. E-Book 1.https://easyengineering.net/the-8051-microcontroller-and-embedded-systems-using-assembly-and-c-by-muhammad-ali-mazidi/ 2. https://almedia.press/adc-98627/0996025510

MCA

Semester – III 17MCA301 HUMAN COMPUTER INTERACTION OBJECTIVES: To learn the principles and fundamentals of HCI. To understand components of interfaces and screens, including windows, menus and controls. To understand user interface design principles and apply them to designing an interface. To learn user interface designs through usability inspection and user models. To understand the rationale and guidelines for an effective interface design methodology.

UNIT I Design Process Humans – Information Process – Computer – Information Process – Differences and Similarities between them – Need for Interaction – Framework and HCI – Models – Ergonomics – Style – Context – Paradigms – Designing of Interactive Systems – Design Rules: Golden Rules and Heuristics – Usability – Paradigm Shift – Interaction Design Basics – Design Process – Scenarios – Users Need – Complexity of Design – Design Alternatives and Selection. UNIT II Design and Evaluation of Interactive Systems Software Process – Usability Engineering – Issue Based Information Systems – Iterative Design Practices – Design Rules – Maximum Usability – Principles – Standards and Guidelines – Design Patterns – Programming Tools – Windowing Systems – Interaction Tool Kit – Interaction Devices – Layouts – Fragments – Widgets – Views – Adapters – Interaction Styles – Direct Manipulation and Virtual Environments – Menu Selection – Form Fill-In – Dialog Boxes – Command and Natural Languages – User Interface Management System – Prototype Development – Evaluation Techniques – Evaluation Design – Evaluating Implementations – Observational Methods – Evaluation Strategies.

UNIT III Communication Models Universal Design Principles – Multimodal Systems – User Support – Presentation and Implementation Issues – Types – Requirements – Approaches – Task Models – Task Analysis and Design – Face to Face Communication – Conversation – Text Based Communication – Group Working.

UNIT IV Experimental Design and Statistical Analysis of HCI Basic Design Structure – Single Independent Variable – Multiple Independent Variable – Factorial Design – Split – Plot Design – Random Errors – Experimental Procedure – Statistical Analysis – T Tests – Analysis of Variance Test – Regression – Chi-Square Test – Survey – Probabilistic Sampling – Non-Probabilistic Sampling – Developing Survey Questions. UNIT V Dialogue and Current Trends Dialogue Notations and Design – Dialogue Need – Dialogue Design Notations – Graphical – Textual – Representing Dialogue – Formal Descriptions – Dialogue Analysis – System Models – Interaction Models – Relationship with Dialogue –

MCA

Formalisms – Formal Notations Interstitial Behavior – Virtual Reality – Devices for Virtual Reality and 3D Interaction – Modeling Rich Interaction – Status Event Analysis – Properties – Rich Contexts – Sensor – Based Systems – Groupware – Applications – Ubiquitous Computing – Applications – HCI for Smart Environment – HCI for Scientific Applications, Medical Applications – HCI for Assistive Technology.

REFERENCES: 1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, Third Edition, Prentice Hall, 2004. 2. Preece, J., Sharp, H., Rogers, Y., “Interaction Design: Beyond Human-Computer Interaction”, Fourth Edition, Wiley, 2015. 3. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, “Research Methods in Human-Computer Interaction”, Wiley, 2010. 4. Ben Shneiderman, Catherine Plaisant, “Designing the User Interface: Strategies for Effective Human-Computer Interaction”, Fifth Edition, Addison Wesley, 2009. 5. Jeff Johnson, “Designing with the Mind in Mind: Simple Guide to Understanding User Interface Design Rules”, Second Edition, Morgan Kaufmann, 2014. E-BOOKS: 1. https://faculty.psau.edu.sa/filedownload/doc-10-pdf-f5a6556225bb4e85ce5be5dda9d05b8a-original.pdf

MCA

17MCA302 .NET PROGRAMMING Objectives: The student will use Visual Basic.Net to build Windows applications using structured and object-based programming techniques. Students will be exposed to the following concepts and/or skills at an Introductory concepts level: • Analyze program requirements • Design/develop programs with GUI interfaces • Code programs and develop interface using Visual Basic .Net • Perform tests, resolve defects and revise existing code UNIT – I Developing .NET Applications – Visual Studio: Creating Websites- Designing a Webpage- The anatomy of a Web Form – Writing Code – Visual Studio Debugging. Web Form Fundamentals: The anatomy of an ASP.NET Application – Introducing Server Controls – Improving the Currency Converter – A Deeper Look at HTML Control Classes – The Page Class – Application Events – ASP.NET Configuration. Web Controls: Stepping Up to Web Controls – Web Control Classes – List Controls – Table Controls – Web Control Events and AutoPostBack – A Simple Webpage. UNIT – II State Management: The problem of State – View State – Transferring Information between Pages – Cookies – Session State – Session State Configuration – Application State – An Overview of State- Management Choices. Deploying ASP.NET Applications: ASP.Net Applications and the Web Server – Internet Information Services (IIS) – Managing Websites with IIS Manager – Deploying a Simple Site – Deploying with Visual Studio UNIT – III Building Better WebForms with Validations: Understanding Validation – The Validation Controls Rich Controls: The Calendar – The AdRotator – Pages with Multiple Views. User Controls and Graphics: User Controls – Dynamic Graphics. Styles, Themes, and Master Pages: Styles – Themes – Master Page Basics – Advanced Master Pages. UNIT – IV Website Navigation: Site Maps – The SiteMapPath Control – The Tree View Control – The Menu Control. Working With Data & ADO.NET Fundamentals: Understanding Data Management – Configuring Your Database – SQL Basics – ADO.NET Basics – Direct Data Access – Disconnected Data Access UNIT – V The Data Controls : The GridView – Formatting the GridView – Selecting a GridView Row – Editing with the GridView – Sorting and Paging the GridView – Using GridView Templates – The DetailsView and FormView TEXT BOOK 1. Matthew MacDonald, “Beginning ASP.NET 3.5 in VB 2008”, A press, Berkeley, CA, USA, Second Edition. ISBN: 978-81-8128-868-4

MCA

REFERENCE BOOKS 1. Matt J.Crouch, “ASP.NET & VB.NET Web Programming”, Pearson Education Inc., 2002 2. Keith Franklin, “VB.NET for Developers”, Sams, 2002. E-BOOKS: http://warden.unifree.ru/files/00x77/ebook/Visual%20Basic.net.pdf

MCA

17MCA303 NETWORK SECURITY Objectives: Students are expected to demonstrate the ability to: Identify computer and network security threats, classify the threats and develop asecurity model to prevent, detect and recover from the attacks. UNIT I INTRODUCTION TO NETWORK SECURITY Networking Devices(Layer1,2,3)- Different types of network layer attacks– Firewall (ACL, Packet Filtering, DMZ, Alerts and Audit Trials) – IDS,IPS and its types (Signature based, Anomaly based, Policy based, Honey pot based). UNIT II - VIRTUAL PRIVATE NETWORKS VPN and its types –Tunneling Protocols – Tunnel and Transport Mode – Authentication Header-Encapsulation Security Payload (ESP)- IPSEC Protocol Suite – IKE PHASE 1, II – Generic Routing Encapsulation(GRE). UNIT III - MPLS AND MPLS VPN WAN Topologies- Standard IP based Switching – CEF based Multi-Layer switching-MPLS Characteristics- Frame Mode MPLS Operation – MPLS VPN. UNIT IV -E-MAIL SECURITY Security Services for E-mail-attacks possible through E-mail – establishing keysprivacy-authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME. UNIT V -WEB SECURITY SSL/TLS Basic Protocol-computing the keys- client authentication-PKI as deployed by SSL Attacks fixed in v3- Exportability-Encoding-Secure Electronic Transaction (SET), Kerberos PRACTICAL (30 hours) REFERENCES

1. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security”, Prentice Hall,2 nd edition , ISBN-10: 0130460192, ISBN-13: 978- 0130460196, 2002.

2. Charles Pfleeger, ”Security in Computing”, Prentice Hall, 4th Edition, ISBN- 10: 0132390779, ISBN-13: 978-01323907744, 2006.

3. Ulysess Black, “Internet Security Protocols: Protecting IP Traffic”, Prentice Hall PTR; 1st edition, ISBN-10: 0130142492, ISBN-13: 978-0130142498, 2000.

E-BOOKS https://www.amazon.com/Network-Security-Private-Communication-Public/dp/0130460192

MCA

17MCA304 OPERATING SYSTEM Objective: A modern computer brings together a diverse range of hardware components into a single complex machine. Managing all of these components is a challenging task handled by the operating system. UNIT I INTRODUCTION Introduction -Types of operating systems-operating systems structures-Systems components operating systems services-System calls-Systems programs-Processes-process concept-process scheduling-operation on processes-co-operating processes-Inter process communications-CPU Scheduling-Scheduling criteria-Scheduling algorithms-Multiple-processor Scheduling UNIT II PROCESS SYNCHRONIZATION Process Synchronization –Critical Section problem – Semaphores-Classical problems of synchronization-critical regions-Monitors-Deadlock Characterization-Deadlock handling-Deadlock Prevention-Deadlock avoidance-Deadlock Detection-Deadlock Recovery – Threads-Multithreading Models. UNIT III MEMORY MANAGEMENT Memory Management-Swapping-Contiguous Memory allocation-Paging-Segmentation- Virtual Memory-Demand paging-Page Replacement-Thrashing UNIT IV DISK SCHEDULING AND DISTRIBUTED SYSTEMS Disk Structures-Disk Scheduling-File Systems Interface-File concepts-Access methods-Directory Structures-File System Implementation-File Systems structures-Directory Implementation-Allocation Methods-Free Space management-Distributed File systems-Naming and Transparency-Remote File Accesses- Stateful Versus Stateless Service-File replication UNIT V CASE STUDIES Linux System-design Principles- process management-File Systems-Windows Vista-Systems Structures-Process management-memory management-Android OS-Virtual machine OS REFERENCES: 1. Abraham Silberschalz Peter B Galvin, G.Gagne, ”Operating Systems Concepts”, Seventh Edition, AddisionWesley Publishing Co.,2010 2. Andrew S.Tanenbaum, “Modern operating Systems”, Third Edition, PHI Learning Pvt.Ltd., 2008 3. William Stallings, “Operating Systems: Internals and Design Principles”,Seventh Edition, Prentice Hall, 2011. E-BOOKS

MCA

1.http://stst.elia.pub.ro/news/SO/Modern%20Operating%20System%20-%20Tanenbaum.pdf

MCA

17MCA308 .NET PROGRAMMING LAB 1. Create a simple web site using VB.Net 2. Implement Cookies in VB.NET 3. Create a website to transfer the information between pages using VB.Net 4. Implement session state using ASP.Net 5. Implement Application State using ASP.Net 6. Create a program using Validation controls using VB.Net 7. Create a calendar using Rich-Controls using VB.Net 8. Create a Ad-Rotator using Rich-Controls using VB.Net 9. Create a program to insert and display data in to data based using ADO using VB.Net 10. Create a program to update data in database using ADO using VB.Net 11. Display the data from database using Grid view using VB.Net MCA Academic Council 2017-2018

MCA

17MCA309 Programming in UNIX & Linux Lab

1. Basic Linux Skills:

a) Directory Commands, File Commands, Path. Hidden File and folder Creation.

b) Copy, Move, Remove Files and Folders

c) File Listing , Find command

d) Editors

e) Compressing, Soft Link and hard link Process management, Help Commands

2. OS Installation and Boot Process and run levels.

3. File Permissions

4. Packet Management

5. Users and Groups Administration

6. File System Administration

7. CRON tab

8. System Administration and writing

9. Network Administration

10. File Sharing

11. Web Services

12. FTP Services Essential Reading: RHCSA/RHCE Red Hat Linux Certification Study Guide, Sixth Edition. Michael Jang. Publisher Name: TMH Publications. https://www.amazon.in/RHCSA-Linux-Certification-Study-Guide/dp/0071765654

MCA

Semester – IV

17MCA401 MOBILE APPLICATION DEVELOPMENT TECHNIQUES OBJECTIVES: To understand the need and characteristics of mobile applications. To design the right user interface for mobile application. To understand the design issues in the development of mobile applications. To understand the development procedure for mobile application. To develop mobile applications using various tools and platforms.

UNIT I Introduction Mobile Applications – Characteristics and Benefits – Application Model – Infrastructure and Managing Resources – Mobile Device Profiles – Frameworks and Tools UNIT II User Interface Generic UI Development – Designing the Right UI – Multimodal and Multichannel UI – Gesture Based UI – Screen Elements and Layouts – Voice XML.

UNIT III Application Design Memory Management – Design Patterns for Limited Memory – Work Flow for Application development – Java API – Dynamic Linking – Plugins and rule of thumb for using DLLs – Concurrency and Resource Management.

UNIT IV Application Development Mobile OS: Android, iOS – Android Application Architecture – Android basic components – Intents and Services – Storing and Retrieving data – Packaging and Deployment – Security and Hacking.

UNIT V Application Development Communication via the Web – Notification and Alarms – Graphics and Multimedia: Layer Animation, Event handling and Graphics services – Telephony – Location based services.

REFERENCES: 1.Reto Meier, “Professional Android 4 Application Development”, Wiley, 2012. 2.Zigurd Mednieks, Laird Dornin, G. Blake Meike, Masumi Nakamura, “Programming Android”, O’Reilly, 2012. 3. Alasdair Allan, “iPhone Programming”, O’Reilly, 2010 E-BOOK 1.https://www.gocit.vn/files/Wrox.Professional.Android.4.Application.Development-www.gocit.vn.pdf

MCA

17MCA402 SOFTWARE ENGINEERING PRINCIPLES Objective: Define and develop a software project from requirement gathering to implementation. The course focuses on the fundamentals of modeling a software project using the Unified Modeling Language. Unit – I INTRODUCTION Historical Background - Economic Advantages - Problem Solving Approach - Design Characteristics - Software Life-Cycle Models Unit - II SOFTWARE ENGINEERING CONCEPTS & DEVELOPMENT ACTIVITIES Participants and Roles - Systems and Models - Work Products - Activities, Tasks and Resources - Functional and Nonfunctional Requirements - Notations, Methods, and Methodologies. Developmental Activities - Requirements Elicitation – Analysis - System Design - Object Design – Implementation – Testing Unit - III MODELING WITH UML Modeling Concepts and Diagrams - Use Case Diagrams - Class Diagrams - Interaction Diagrams – State chart Diagrams - Activity Diagrams - Package DiagramsbComponent Diagrams - Deployment Diagrams - Diagram Organization - Diagram Extensions Unit - IV SOFTWARE DOCUMENTATION DEVELOPMENT Requirements Analysis Document - System Design Document - Object Design Document - Test Manual - Administrator’s Manual - User’s Manual Unit – V MANAGEMENT METHODOLOGIES & SOFTWARE DESIGN PATTERNS Rationale Management - Configuration Management - Project Management - Project Management Concepts - Project Management Activities. Software Design Patterns - Factory Design Pattern - Adapter Design Pattern - Bridge Design Pattern – Command - Design Pattern - Composite Design Pattern - Façade Design Pattern - Observer Design Pattern - Proxy Design Pattern - Strategy Design Pattern

MCA

TEXT BOOKS

1. Bruegge, Bernd and Allen H. Dutoit. “Object-Oriented Software Engineering: UsingUML, Patterns and Java”, Pearson: Prentice Hall Publishers 2004.

2. Braude, E. J. “Software Engineering: An Object-Oriented Perspective”. Wiley,

2001

3. Schmuller, Joseph. “SAMS Teach Yourself UML in 24 Hours”. Sams Publishing. 1999.

REFERENCE BOOKS 1. Sommerville, Ian. “Software Engineering”. Addison-Wesley, 2004. E BOOK http://www.philadelphia.edu.jo/academics/shanna/uploads/Bruegge.pdf

MCA

17MCA403 OPERATIONS RESEARCH Objectives To give detailed knowledge about Linear Programming. To teach algorithms and Queuing Theory and project scheduling. To impart the skills of effective decision making UNIT-I Linear Programming: Formulations and Graphical solution to L.P. Problem - Simplex method - Degeneracy, unbounded and infeasible solution -Method of penalty - Two Phase Method. UNIT- II Linear Programming (contd): Duality-Primal and Dual Computations -Dual Simplex Method - Transportation problem and its solution - Assignment problem and its solution by Hungarian method. UNIT- III Decision Making under Certainty – Decision under Risk – Decision under Uncertainty – Game Theory – Two Person Zero-Sum Games – Mixed Strategy Games. UNIT- IV Project scheduling by PERT - CPM : Phases of project scheduling Arrow Diagram - Critical Path Method - Probability and Cost Considerations in Project Scheduling - Crashing of Networks. UNIT-V Queueing Theory : Queueing System - Characteristics of Queueing system-classification of queues - Poisson Queues - M/M/1 and M/M/C Queueing Models. Text Books 1.Kanti Swarup, Gupta, Man Mohan, Operations Research, 2010, Sultan Chand Publication. Books for Reference

1. Hamdy A. Taha, “Operations Research-An Introduction”, Macmillan Publishing Co, 5th Edition, 1987.

2. P.K.Gupta, Man Mohan, “Operations Research and Quantitative Analysis”, Sultan Chand & Sons, New Delhi First Edition, 1987.

MCA

3. Taha H.A., Operations Research: An Introduction,7th Edition, 2004, Pearson Education.

MCA

17MCA404 CLOUD COMPUTING Objective:This course gives an introduction to cloud computing and its techniques, issues, and its services that will lead to design and development of a simple cloud service. UNIT I - CLOUD INTRODUCTION Cloud Computing Fundamentals: Cloud Computing definition, Types of cloud, Cloud services: Benefits and challenges of cloud computing, Evolution of Cloud Computing usage scenarios and Applications , Business models around Cloud – Major Players in Cloud Computing - Issues in Cloud - Eucalyptus - Nimbus - Open Nebula, Cloud Sim. UNIT II - CLOUD SERVICES AND FILE SYSTEM Types of Cloud services: Software as a Service - Platform as a Service – Infrastructure as a Service - Database as a Service - Monitoring as a Service – Communication as services. Service providers- Google App Engine, Amazon EC2, Microsoft Azure, Sales force. Introduction to MapReduce, GFS, HDFS, Hadoop Framework. UNIT III - COLLABORATING WITH CLOUD Collaborating on Calendars, Schedules and Task Management – Collaborating on Event Management, Contact Management, Project Management – Collaborating on Word Processing ,Databases – Storing and Sharing Files- Collaborating via Web-Based Communication Tools – Evaluating Web Mail Services – Collaborating via Social Networks UNIT IV - VIRTUALIZATION FOR CLOUD Need for Virtualization – Pros and cons of Virtualization – Types of Virtualization – System Vm, Process VM, Virtual Machine monitor – Virtual machine properties - Interpretation and binary translation, HLL VM - Hypervisors – Xen, KVM , VMWare, Virtual Box, Hyper-V. UNIT V - SECURITY, STANDARDS, AND APPLICATIONS Security in Clouds: Cloud security challenges – Software as a Service Security, Common Standards: The Open Cloud Consortium – The Distributed management Task Force – Standards for application Developers – Standards for Messaging – Standards for Security, End user access to cloud computing, Mobile Internet devices and the cloud. TEXT BOOKS 2. Bloor R., Kanfman M., Halper F. Judith Hurwitz “Cloud Computing for Dummies” (Wiley India Edition),2010 (UNIT-I) 2. John Rittinghouse & James Ransome, “Cloud Computing Implementation Management and Strategy”, CRC Press, 2010.(UNIT-II) 3. Antohy T Velte ,Cloud Computing : “A Practical Approach”, McGraw Hill,2009(UNIT-II- 3 ,11) 4. Michael Miller, Cloud Computing: “Web-Based Applications That Change the Way You Work and Collaborate Online”, Que Publishing, August 2008.(UNITIII)

MCA

5. James E Smith, Ravi Nair, “Virtual Machines”, Morgan Kaufmann Publishers, 2006.(UNIT-IV) 6. http://cloud-standards.org/wiki/index.php?title=Main_Page(UNIT - V) REFERENCES

1. Haley Beard, “Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing”, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited, July 2008

MCA

15MCA405 WIRELESS NETWORKS Objective:

1. To learn the basics of wireless communication and how communication takes place in wireless networks.

2. To study about cellular communication.

3. To learn GSM and CDMA technologies

4. To understand the emerging wireless technologies.

UNIT I - INTRODUCTION TO WIRELESS NETWORKS Elements of a wireless communication system – signal and noise - the radio – frequency spectrum –Analog modulation schemes -Amplitude modulation – frequency and phase modulation – sampling – pulse code modulation – delta modulation – data compression. 187 UNIT II - DIGITAL MODULATION AND RADIO PROPAGATION Digital communication- sampling –pulse code modulation – delta modulation - Frequency shift keying – Phase shift keying – Multiplexing and Multiple access – spread spectrum systems - radio propagation. UNIT III - PRINCIPLES OF CELLULAR COMMUNICATION AND MULTIPLE ACCESS TECHNIQUES Cellular terminology - Cell structure and Cluster – Frequency reuse concept – Cluster size and system capacity – method of locating co channel cells – frequency reuse distance – frequency division multiple access – time division multiple access – space division multiple access – code division multiple access. UNIT IV - GSM AND CDMA DIGITAL CELLULAR STANDARDS GSM network architecture –GSM signaling protocol architecture – Identifiers in GSM – GSM channels –GSM handoff procedures – Edge technology – wireless local loop – DECT system – GPRS UNIT V - EMERGING WIRELESS TECHNOLOGIES IEEE 802.11 system architecture – mobile ad hoc networks – Mobile IP and mobility management – Mobile TCP - wireless sensor networks – RFID technology – Blue

MCA

tooth – Wi –Fi standards – Wimax standards. – Femtocell network – Push -to –talk technology for SMS. TEXT BOOKS

1. Roy Blake, “Wireless communication technology” CENGAGE Learning , sixth Indian reprint 2010. ( Chapter 1,2,3,4,7,14)

2. Singal T.L. , “Wireless communication” Tata Mc Graw Hill Education private limited , 2011.( chapter 4,8,11,13,14)

3. Dharma Prakash Agrawal , Qing –An Zeng , “ Introduction to wireless and mobile systems” CENGAGE Learning, first edition 2012.( chapter 16)

REFERENCES

1. Upena Dalal, “Wireless communication” Oxford University press, first edition 2009.

2. Kaveh Pahlavan & Prashant Krishnamurthy, “Wireless Networks” PHI Learning

MCA

15MCA409 Android Programming Lab 1. Develop an application that uses GUI components, Font and Colors.

2. Develop an application that uses Layout Managers and event listeners.

3. Develop a native calculator application.

4. Write an application that draws basic graphical primitives on the screen.

5. Develop an application that makes use of database.

6. Develop an application that makes use of RSS Feed.

7. Implement an application that implements Multi threading.

8. Develop a native application that uses GPS location information.

9. Implement an application that writes data to the SD card.

10. Implement an application that creates an alert upon receiving a message.

11. Write a mobile application that creates alarm clock.

MCA

List of Electives – I *

17MCA305 Data Warehousing and Data Mining Objectives: 1. To impart knowledge about Data Mining 2. To know about various techniques used in Data Mining 3. To design data warehouses for the companies 4. To enable the learner for aiming careers in Data Warehouse Management UNIT I - Data Warehousing Concepts & Architecture Introduction – Goals- Process Architecture- Load Manager-Warehouse Manager Query Manager - DWH Objects - Fact table & Dimension table – DWH Users - Data Warehouse Schemas: Star schemas-Snowflake Schemas. UNIT II - Data Warehouse Partitioning & Aggregation Horizontal Partitioning-Vertical Partitioning-Hardware Partitioning-Software partitioning Methods-Aggregation-Designing Summary tables-Designing Summary tables UNIT III – Data Marts Meta Data, Backup & Recovery Data Marts: Introduction-Estimating Design – Cost-Meta Data-Backup: Types of backup-Backup the data warehouse – SureWest Online Backup-Recovery: Strategies-various Testing Strategies-Various Recovery models, Disaster Recovery procedure UNIT IV - Data Mining Concepts & Architecture Introduction – Data Mining Definitions, Tools, Applications - Data Mining - Learning: Definition, Anatomy of Data Mining. Types of Knowledge – Knowledge Discovery Process- introduction, Evaluation, Stages, Operations and Architecture of Data Mining. UNIT V - Data Mining Techniques Visualization Techniques – Likelihood & distance-Neural Networks-Decision Tree technique-Constructing decision trees-ID3 algorithm-Genetic algorithms: Crossover & mutation -Clustering: Distance function-K-means algorithm - Hierarchical Clustering - Association rules: Apriori algorithm – Real Time Applications and Future Scope.

MCA

TEXT BOOKS: 1. Prabhu S, Venkatesan N (2006), Data Mining & Warehousing – New Age International – First Edition, New Delhi (For Units 1 & 2). 2. Sam Anahory, Dennis Murray (2004), Data warehousing in real world – Pearson Education, New Delhi (For Units 3, 4 & 5). REFERENCES 1. Pieter Adriaans, Dolf Zantinge (2005), Data Mining – Pearson education, New Delhi. 2. Alex Berson, Stephen J Smith (2004), Data Warehousing, Data mining & OLAP – Tata McGraw Hill Publications, New Delhi. https://www.amazon.in/Data-Mining-Warehousing-S-Prabhu/dp/8122419720 http://164.100.133.129:81/econtent/Uploads/DATA_WAREHOUSING.pdf

MCA

17MCA306 TCP / IP Principles & Architecture Objectives To Understand Network Layer and Applications To learn UDP and TCP applications To learn Transport Layer Reliability To understand the basic concepts of TCP/IP Architecture Unit – I INTRODUCTION Intermediate communication entities- Layering network addresses-DNS-Client server model-Port numbers Standardization process-RFC’s-Standard simple services-Application programming interfaces-Ethernet &IEEE 802 – encapsulation-SLIP-PPP-loop back interface-MTU-path MTU-ARP cache – Packet format – proxy ARP & Gratitions ARP –ARP command – RARP- Structure TCP/IP s/w in operating Unit – II NETWORK LAYER AND APPLICATION Introduction- IP header- IP routing - Subnet addressing- Subnet mask- Special case IP addresses – Examples- Ifconfig – Netstat- routing principles - ICMP host and Network unreachable errors - ICMP redirect errors – ICMP router discovery messages- Dynamic routing - UNIX routing daemons- routing information protocol (RIP)-OSPF-CIDR – Case study: Voice over IP for two way Communication. Unit – III UDP AND APPLICATIONS Introduction- UDP header- UDP checksum- examples-IP fragmentation - ICMP unreachable errors – Path MTU discovery- Interaction between UDP and ARP-UDP datagram size- ICMP source quench error Broad casting and Multi casting - IGMP- NFS- -TFTP-BOOTP Unit – IV TCP Introduction- TCP services- TCP header – Connection establishment and termination – Maximum size – TCP half close – TCP state transition diagram – Reset segments- Simultaneous open and close – TCP options – Interactive input – Delayed acknowledgement – Nagle algorithm – Window size advertisement Normal data

MCA

flow – Sliding window – Window size - PUSH flag – Slow start– Bulk data throughput – Urgent mode Unit – V TRANSPORT LAYER RELIABILITY AND APPLICATION TCP/IP time out – Retransmission – Roundtrip time measurement – Congestion avoidance algorithms – Fast retransmit and fast recover algorithm – Re packetization - ICMP errors-TCP persistent – TCP features and performance – Telnet and rlogin - SMTP – TCP dump TEXT BOOKS 1 .W. Richard Stevens, “TCP/IP Illustrated,The Protocol-Volume I” , Addison-Wesley Pub Co,1st Edition,1994 2 Dougles E.Comer, “Internetworking with TCP/IP–Principles, Protocols & Architecture”, Pearson education, 4th Edition,2000 REFERENCE BOOKS 1. Behrouz A. Forouzam, “TCP/IP Protocol Suite”, Tata McGraw Hill, 2000 2. Michael Santifaller, “TCP/IP – ONC/NFS, Internetworking in UNIX Environment”, Addison Wesley Professional, 2nd Edition, 1994. 3. Richard Stevens, “ TCP/IP Illustrated”, Vol 1,2,3 Pearson education India, 1996 https://www.amazon.com/Protocol-Suite-Mcgraw-hill-Forouzan-Networking/dp/0073376043

MCA

17MCA307 Software Testing & Quality Management Objectives To learn software quality factors (Define QA plans & Apply QA tools) About common software testing strategies About project process control and software Metrics About standards and certifications UNIT-I The Software Quality Challenge - Software Quality Factors - Components of the Software Quality Assurance System. Pre-Project Software Quality Components - Contract Review - Development and Quality Plans UNIT-II Integrating Quality Activities in the Project Life Cycle – Reviews - Software Testing – Strategies - Software Testing – Implementation - Assuring the Quality of Software Maintenance - Assuring The Quality of External Participants' Parts UNIT –III Procedures and Work Instructions - Supporting Quality Devices - Staff Training, Instructing and Certification - Preventive and Corrective Actions - Configuration Management - Documentation and Quality Records Controls. UNIT- IV Project Progress Control - Software Quality Metrics - Software Quality Costs UNIT V SQA Standards - ISO 9001 Certification - Software Process Assessment. Organizing for Quality Assurance - Management and its Role in Quality Assurance - The Software Quality Assurance Unit - SQA Trustees and Committees Text Books: 1. Daniel Galin, “Software Quality Assurance: From Theory to Implementation”, AddisonWesley, 2003

MCA

Reference Books 1. Alcon Gillies “Software quality: Theory and management”, International Thomson, Computer press 1997 2. Stephen H.Kan, “Metrics and models in software quality Engineering”, Addison – Wesley1955 3. Roger S. Pressman, “Software Engineering-A Practitioner’s Approach”, McGraw Hill pub.2001 4. Humphrey Watts, “Managing the Software process” Addison Wesley, 1986. https://memberfiles.freewebs.com/43/78/77257843/documents/Pearson-Software-Quality-Assurance-From-Theory-to-Implementation.pdf

MCA

17MCA406 Digital Image Processing with MATLAB Aim The objective of this course is to impart knowledge on various Digital Image Processing Techniques and their Applications. UNIT I – DIGITAL IMAGE FUNDAMENTALS Introduction – Origin – Steps in Digital Image Processing – Components – Elements of Visual Perception – Image Sensing and Acquisition – Image Sampling and Quantization – Relationships between pixels UNIT II – IMAGE ENHANCEMENT Spatial Domain: Gray level transformations – Histogram processing – Basics of Spatial Filtering–Smoothing and Sharpening Spatial Filtering – Frequency Domain: Introduction to Fourier Transform – Smoothing and Sharpening frequency domain filters – Ideal, Butterworth and Gaussian filters UNIT III – IMAGE RESTORATION Noise models – Mean Filters – Order Statistics – Adaptive filters – Band reject Filters – Band pass Filters – Notch Filters – Optimum Notch Filtering – Inverse Filtering – Wiener filtering UNIT IV – IMAGE COMPRESSION AND SEGMENTATION Compression: Fundamentals – Image Compression models – Error Free Compression – Variable Length Coding – Bit-Plane Coding – Lossless Predictive Coding – Lossy Compression – Lossy Predictive Coding – Wavelet Coding – Compression Standards – JPEG2000 Segmentation: Detection of Discontinuities–Edge Linking and Boundary detection – Region based segmentation UNIT V – CASE STUDIES USING MATLAB Introduction to Image Processing Toolbox – Practice of Image Processing Toolbox– Case studies–Various Image Processing Techniques

MCA

TEXT BOOK 1. Rafael C. Gonzales, Richard E. Woods, “Digital Image Processing”, Pearson Education, Third Edition, 2010. REFERENCES 1. Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing Using MATLAB”, Tata McGraw Hill Pvt. Ltd., Third Edition, 2011. 2. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011. 3. Jayaraman S., Esaki Rajan S., T.Veera Kumar, “Digital Image Processing”, Tata McGraw Hill Pvt. Ltd., Second Reprint, 2010. 4. Bhabatosh Chanda, Dwejesh Dutta Majumder, “Digital Image Processing and analysis”, PHI Learning Pvt. Ltd., Second Edition, 2011. 5. Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, PHI Learning Pvt. Ltd., First Edition, 2011. 6. Annadurai S., Shanmugalakshmi R., “Fundamentals of Digital Image Processing”, Pearson Education, First Edition, 2007. 7. http://eeweb.poly.edu/~onur/lectures/lectures.html 8. http://www.caen.uiowa.edu/~dip/LECTURE/lecture.html 9. https://www.amazon.com/Digital-Image-Processing-Rafael-Gonzalez/dp/013168728X

MCA

17MCA407 BIG Data and its Applications Objectives:

1. To understand the nature of data & carry out intelligent data analytics.

2. To know various modern data analysis tools & trends in data analysis.

3. To gain knowledge in Hadoop Distributed File Systems and Applications of Big Data using Pig and Hive services.

UNIT I - Introduction to Big Data Introduction to BigData Platform – Challenges of Conventional Systems - Intelligent data analysis Nature of Data - Analytic Processes and Tools - Analysis vs Reporting - Modern Data Analytic Tools - Statistical Concepts: Sampling Distributions - Re-Sampling - Statistical Inference - Prediction Error. UNIT II - Mining Data Streams Introduction To Streams Concepts – Stream Data Model and Architecture - Stream Computing - Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream – Estimating Moments – Counting Oneness in a Window – Decaying Window - Real time Analytics Platform(RTAP) Applications - Case Studies - Real Time Sentiment Analysis, Stock Market Predictions. UNIT III - Hadoop History of Hadoop- The Hadoop Distributed File System – Components of HadoopAnalyzing the Data with Hadoop- Scaling Out- Hadoop Streaming- Design of HDFSJava interfaces to HDFS- Basics-Developing a Map Reduce Application-How Map Reduce Works-Anatomy of

a Map Reduce Job run-Failures-Job Scheduling-Shuffle and Sort – Task execution - Map Reduce Types and Formats- Map Reduce Features

UNIT IV - Hadoop Environment Setting up a Hadoop Cluster - Cluster specification - Cluster Setup and Installation - Hadoop Configuration-Security in Hadoop - Administering Hadoop – HDFS - Monitoring-Maintenance-Hadoop benchmarks- Hadoop in the cloud UNIT V - Frameworks Applications on Big Data Using Pig and Hive – Data processing operators in Pig – Hive services – HiveQL – Querying Data in Hive - fundamentals of HBase and ZooKeeper - IBM InfoSphere BigInsights and Streams. Visualizations - Visual data analysis techniques, interaction techniques; Systems and applications.

MCA

TEXT BOOKS: 1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007(units 1, 2 & 3). 2. Tom White “ Hadoop: The Definitive Guide” Third Edition, O’reilly Media, 2012 (Units 4 & 5). REFERENCE

1. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge University Press, 2012

E-BOOKS 1.https://www.springer.com/gp/book/9783662039694

2. http://grut-computing.com/HadoopBook.pdf

MCA

17MCA408 Artificial Intelligence & Expert Systems Objectives

• To study the concepts of Artificial Intelligence

• Methods of solving problems using Artificial Intelligence Introduce the concepts of Expert Systems and machine learning UNIT I - INTRODUCTION TO Al AND PRODUCTION SYSTEMS Introduction to AI-Problem formulation, Problem Definition -Production systems, Control strategies, Search strategies. Problem characteristics, Production system characteristics - Specialized production system- Problem solving methods - Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing-Depth first and Breath first, Constraints satisfaction - Related algorithms, Measure of performance and analysis of search algorithms. UNIT II-REPRESENTATION OF KNOWLEDGE Game playing - Knowledge representation, Knowledge representation using Predicate logic, Introduction to predicate calculus, Resolution, Use of predicate calculus, Knowledge representation using other logic-Structured representation of knowledge. UNIT III-KNOWLEDGE INFERENCE Knowledge representation -Production based system, Frame based system. Inference - Backward chaining, Forward chaining, Rule value approach, Fuzzy reasoning - Certainty factors, Bayesian Theory-Bayesian Network-Dempster - Shafer theory. UNIT IV-PLANNING AND MACHINE LEARNING Basic plan generation systems - Strips -Advanced plan generation systems - K strips - Strategic explanations -Why, Why not and how explanations. LearningMachine learning, adaptive Learning. UNIT V-EXPERT SYSTEMS Expert systems - Architecture of expert systems, Roles of expert systems - Knowledge Acquisition –Meta knowledge, Heuristics. Typical expert systems - MYCIN, DART, XOON, Expert systems shells. TEXT BOOKS

MCA

1. Kevin Night, Elaine Rich, Nair B., “Artificial Intelligence (SIE)”,McGraw Hill- 2008. (Unit-1,2,4,5)

2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007. (Unit-III)

REFERENCES 1. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson Education, 2007.

2. Stuart Russel, Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson Education 2007 E BOOKS 1,https://www.abebooks.com/9780201876864/Introduction-Expert-Systems-3rd-Edition-0201876868/plp

MCA