COURSE STRUCTURE (M.TECH (CS.) Effective From 2014-15

SEMESTER I

SEMESTER II

SEMESTER III

SLNO. PAPER SUBJECT UNIVERSITY MARK

INTERNAL MARK

CREDITS

1 MCS11 Computer Architecture 40 10 04

2 MCS12 Data Structure & Algorithm 40 10 04

3 MCS13 Advance Database Management System 40 10 04

4 MCS14 Advance Operating System 40 10 04

5 MCS15 ADBMS & DS Lab 100 08

TOTAL 24

SLNO. PAPER SUBJECT UNIVERSITY MARK

INTERNAL MARK

CREDITS

1 MCS21 Advance Computer Network 40 10 04

2 MCS22 Software Engineering 40 10 04

3 MCS23 Object Oriented Analysis Design 40 10 04

4 MCS24 Compiler Design Tools & Technique 40 10 04

5 MCS25 CD & S E Lab. 100 08

TOTAL 24

SLNO. PAPER SUBJECT UNIVERSITY MARK

INTERNAL MARK

CREDITS

1 MCS31 Digital Image Processing 40 10 04

2 MCS32 Artificial Intelligence 40 10 04

3 MCS33 Elective-I 40 10 04

4 MCS34 Elective-II 40 10 04

5 MCS35 AI Lab. 100 08

TOTAL 24

SEMESTER IV

SLNO PAPER SUBJECT MARK CREDITS

1 MCS41 Major Thesis/Project & Viva 150 12

2 MCS42 Grand Viva-Voce 150 12

TOTAL 24

List of Elective

1. Mobile Computing. 2. Embedded & Real time system. 3. Web Technology. 4. Pattern Classification. 5. Wireless sensor network. 6. Software Development using UML. 7. System Performance & Evaluation. 8. Cloud Computing. 9. Social Networking. 10. Network Security. 11. Financial Management. 12. Bioinformatics. 13. Big Data Analysis. 14. Discrete Dynamical System. 15. Nano Technology.

Computer Architecture

MCS-11

4 Hours/Week

______________________________________________________________________________

Unit-1

Instruction set principles: Classification of instruction Set Architecture, Addressing modes, The MIPs architecture instruction level parallelism. Data hazards, Overcoming Data Hazards with dynamic scheduling; Dynamic scheduling algorithms.

Unit-11

Memory Hierarchy Design: Cache performance, Reducing Cache Miss penalty, Reducing Miss rate, Reducing Cache Miss penalty via Parallelism, Reducing Hit time, Memory technology, virtual Memory, protection and examples virtual memory, symmetric shared memory architecture, performance of symmetric shared memory multiprocessor, Distributed shared memory architecture performance, synchronization.

Unit-111

Storage system: Types of storage devices, buses-connecting I/O device CPU/ Memory Raid, Errors and failures in Real systems, I/O Performance asures, A little queuing theory, Benchmarks of storage performance, Asynchronous I/O and operating system.

Unit-1V

Interconnection Networks, clusters and pipelining: A simple network, or Connection network media, connecting more than two computers, Network logy, practical issues, examples, Inter Networking, Clusters, Designing a, pipeline Hazards, Implementation of Pipeline, A simple Implementation RISC instruction Set, The Classic Five-Stage pipeline for RISC processor, Basic line for MIPS.

Reference Books:

1. Computer Architecture: A quantitative approach: John L. Nnessy and David a. Patterson, Elsevier publication, 5th Edition.

2. Computer Architecture and Organization: John P. Hayes, C. Graw Hill international Edition- 6th Edition. 3. Computer Organization and Architecture: Designing for performance, stalling Pearson Education, 5th

Edition. 4. Computer System Architecture, M. Mano, Pearson Education, 5th Edition

Data Structure & Algorithm

MCS-12

4 Hours/Week

_______________________________________________________________________________

Unit-1 Linear Data Structures and Algorithm Analysis

Review of arrays, stacks, queues, linked lists, linked stacks and linked queues, efficiency of algorithms, asymptotic notations, time complexity of an algorithm using O notation, average-best and worst case complexities.

Unit-2 Non Linear Data Structures and Hash Tables

Introduction-definition and basic terminologies of trees and binary trees, representation of trees and binary trees, binary tree traversals, threaded binary tree, binary search tree, AVL tree, B-tree, Red Black tree, Splay tree, graphs-basic concepts, graph traversal, topological sorting, hashing.

Unit-3 Divide and Conquer & Greedy Method

General method, binary search, finding maximum and minimum, quick sort, merge sort, strassen’s matrix multiplication, greedy method-general method, minimum cost spanning trees, single source shortest path, knapsack problem.

Unit-4 Dynamic Programming and Backtracking

General method, matrix chain multiplication, Travelling salesperson, 0/1 knapsack, Backtracking-general method, 4-Queens problem, sum of subsets problem.

Text Books:

1. R. Kruse, C.L. Tondo, B. Leung, S. Mogalla, “Data Structures & Program Design in C”, Pearson Education 2. G.A.V Pai, “Data Structures and Algorithms-Concepts, Techniques and Applications”, Tata McGraw Hill 3. T.H. Cormen et al., “Introduction to Algorithms”, PHI 4. S.K. Basu, “Design Methods and Analysis of Algorithms”, PHI

Reference Books:

1. R.F. Gilberg, B.A. Forouzan, “Data Structures: A Pseudo Code Approach with C”, Thomson Publication 2. E. Horowitz, S. Sahni, S. Rajasekharan, “Fundamentals of Computer Algorithms”, University Press

Advanced Database Management System MCS-13

4 Hours/Week

UNIT I-Introduction to Databases and Transactions

Database system, purpose of database system, view of data, relational, databases, database architecture, transaction management, The importance of data models, Basic building blocks, Business rules, The evolution of data models, Degrees of data abstraction. Theoretical concepts, Relational model conformity and Integrity, Advanced SQL programming, PL/SQL – Introduction to PL/SQL – Declare, begin statements, Variables, Control Structure, PL/SQL Transactions ,Query optimization, Concurrency control and Transaction management, Database performance tuning, Distributed relational systems and Data Replication, Security considerations . Definition of Transaction and ACID properties. Transaction Processing.

UNIT II-Database Design, ER-Diagram and Relational Algebra and Calculus

Database design and ER Model: Overview, ER-Model, Constraints, ER-Diagrams, ERD, Issues, weak entity sets, Codd’s rules, Relational Schemas, Relational database model: Logical view of data, keys, integrity rules. Relational Database design: features of good relational database design, atomic domain and Normalization (1NF, 2NF, 3NF, BCNF). Relational algebra: introduction, Selection and projection, set operations, renaming, Joins, Division, syntax, semantics. Operators, grouping and ungrouping, relational comparison. Calculus: Tuple relational calculus, Domain relational Calculus, calculus vs algebra, computational capabilities.

UNIT III-Constraints, Views and SQL

Constraints, types of constrain, Integrity constraints, Views: Introduction to views, data independence, security, updates on views, comparison between tables and views SQL: DDL,DML,DCL, data definition, aggregate function, Null Values, nested sub queries, Joined relations. Triggers.

UNIT IV-Data warehousing, OLAP and data mining

Introduction to Data Warehousing – Concepts, Benefits and Problems, DW Architecture , DW tools and technologies – Extraction, cleansing and transformation tools, DW DBMS, admin and management tools, data marts – reasons and issues,. Data Warehousing Design On-line Analytical Processing – OLAP Benchmarks, applications, benefits, tools, categories, extensions to SQL, Data mining – introduction, techniques, predictive modeling, tools. Data mining algorithms, Database security - Security and integrity threats, Defense mechanisms. Emerging Database Management System Technologies.

Text Books:

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

2. Raghu Ramakrishnan, Johannes Gehrke, Database Management Systems, McGraw- Hill

3. Korth, Silberchatz, Sudarshan , Database System Concepts, McGraw-Hill.

4. Peter Rob and Coronel, Database Systems, Design, Implementation and Management, Thomson Learning.

5. C. J. Date & Longman, Introduction to Database Systems, Pearson Education

6. Bipin C Desai, An Introduction to Database System

Advanced Operating System

MCS-14

4 Hours/Week

Unit-1

Evolution and types of operating systems, Process Management, CPU scheduling algorithms, evaluation of scheduling algorithms, Inter process Communication & Synchronization, classic problems of synchronization.

Unit-2

Deadlocks: reusable and consumable resources, characterization of deadlock, prevention, avoidance, detection and recovery from deadlocks, Memory Management: Basic hardware, address binding, swapping, contiguous memory allocation, paging, segmentation, virtual memory management: demand paging, page replacement algorithms, Allocation of frames, Thrashing.

Unit-3

Device Management: The I/O system, direct I/O with Polling, Interrupt-driven I/O. Storage Management: File concepts, access methods, directory structure, file system implementation, directory implementation, disk space management, disk structure and disk scheduling algorithms.

Unit-4

Protection and security: authentication, authorization, Cryptography, Network security. Distributed systems: Distributed Primary Memory, Remote Procedure call, Distributed Process Management, Remote file systems.

Text Books

1. Gary Nutt, Nabendu Chaki, Sarmistha Neogy, Operating Systems: 3rd Edition, Pearson Education, 2005. 2. Avi Silberschatz, Peter Baer Galvin and Greg Gagne, "Operating System Concepts", 8th Edn, Addition

Wesley.

Reference Books

1. Milan Milenkovic, “Operating Systems: Concept and Design”, 3rd Edn, McGraw Hill INC.

2. Andrew S.Tanenbaum, “Modern Operating Systems", 3rd Edn , Prentice Hall Professional Technical Ref.

ADBMS MCS-15 [Lab]

2Hours/Week LABORATORY ASSIGNMENTS

1. Creating database tables and using data types. • Create table • Modify table • Drop table

2. Practical Based on Data Manipulation. • Adding data with Insert • Modify data with Update • Deleting records with Delete

3. Practical Based on Implementing the Constraints. • NULL and NOT NULL, • Primary Key Constraint • Foreign Key Constraint • Unique Constraint • Check Constraint • Default Constraint

4. Practical for Retrieving Data Using following clauses. • Simple select clause • Accessing specific data with Where • Ordered By • Distinct • Group By

5. Practical Based on Aggregate Functions. • AVG • COUNT • MAX • MIN, • SUM • CUBE

6. Practical Based on implementing all String functions. 7. Practical Based on implementing Date and Time functions. 8. Practical Based on implementing use of UNION, ITERSECTION, SET, DIFFERENCE. 9. Implement Nested Queries & all types of JOIN operation. 10. Practical Based on performing different operations on a view. 11. Practical Based on implementing use of Procedures. 12. Practical. Based on implementing use of Triggers 13. Make Database connectivity with front and tools like VB, VC++, and D2K.

Data Structure & Algorithm MCS-15 [Lab]

2Hours/Week

DATA STRUCTURES LABORATORY ASSIGNMENTS

Following is a list of experiments to be coded in C/C++.. Understanding the use of arrays. Programming insertion, deletion, merging in arrays. Realization of various linked lists.; Simulating a stack.; Using stack for various conversions of expression like prefix etc.; Realizing a queue.; Performing various operations on queue. Simulate a tree and perform various tree traversals. Programming various sorting algorithms. Understanding the use of hashing.

Assignments provided below are guidelines only.

Week – 1 Write a programs to implement the Stack ADT using an array, Queue ADT

Week – 2 Write a programs to implement the Stack ADT and Queue ADT using a singly linkedlist

Week – 3 Write a program to implement the deque (double ended queue) ADT using a doubly linked list

Week – 4

Write a program to perform the following operations:

a) Insert an element into a binary search tree.

b) Delete an element from a binary search tree.

c) Search for a key element in a binary search tree.

Week – 5 Write a program that use recursive functions to traverse the the given binary tree in

a)preorder b)inorder c)post order.

Week – 6 Write a program that use non recursive functions to traverse the the given binary tree in a) preorder b)inorder c)post order.

Week – 7 Write programs for the implementation of BFS & DFS for a given graph

Week –8 Merge sort & Heap Sort

Week – 9 Insertion and deletion in B-Tree

Week – 10 Write a program to perform the following operations on AVL-trees:

a) Insertion.

Week – 11 Write a program to implement all the functions of a Dictionary ADT using Hashing.

Week - 12 Write a program to implement Knuth Morris Pattern Matching Algorithm.

Essential Reading:

1. S. Sahni, “Data structures, Algorithms, and Applications in C++ ”, University Press (India) Pvt. Ltd. , 2nd edition,

2. Michael T. Goodrich et al., “Data Structures and Algorithms in C++ ”, Wiley student edition, John Wiley and Sons.

Advance Computer Networks

MCS-21

4 Hours/Week

1. Introduction: Computer network design requirements, Network architecture, Implementing network software, Performance.

2. Direct Link Networks: Hardware building blocks, Encoding, Framing, Error detection, Reliable transmission, Ethernet (802.3), Token Rings (802.5, FDDI), Wireless (802.11).

3. Packet Switching: Switching and Forwarding, Bridges and LAN switches, Cell switching (ATM), Implementation and performance.

4. Internetworking: Simple internetworking (IP), Routing, Global Internet, Multicast, Multiprotocol Label Switching (MPLS).

5. End-to-End Protocols: Simple Demultiplexer (UDP), Reliable Byte Stream (TCP). 6. Congestion Control and Resource Allocation: Issues in resource allocation, Queuing disciplines, TCP

congestion control, Congestion-avoidance mechanisms, Quality of Service. 7. Applications: Name Service (DNS), Electronic Mail, World Wide Web, Real-time Transport Protocol,

Session control and call control, Overlay networks. 8. Network Management: Network monitoring and control, SNMP –V1, V2 & V3, RMON and RMONV2.

Text Books

1. Larry L. Peterson & Bruce S. Davie, Computer Networks – A Systems Approach, Morgan Kaufmann Publishers ,3rd Edition, 2003.

2. William Stallings, SNMP, SNMPV2, SNMPV3, RMON1 and 2, Addison Wesley, 3rd Edition, 1999. References

3. Mani Subramanian, Network Management: Principles and Practice, Addison Wesley, 2000. 4. James F. Kurose and Keith W. Ross, Computer Networking – A Top-down approach featuring the Internet,

Addison Wesley, 3rd Edition, 2004. 5. S. Keshav, An Engineering approach to Computer Networks, Addison Wesley, 1997. 6. R. Perlman, Interconnections – Bridges, Routers, Switches, and Internetworking Protocols, 2nd Edition,

Addison Wesley, 2000.

SOFTWARE ENGINEERING

MCS-22

4 Hours/Week

Unit-1

Phases and Models: Phases in S.E, life cycle model, Selection criteria of Models

Software Requirement: Feasibility study, Requirement Analysis, Specification, Validation, Management

and tools.

Software Design: Data design, Architectural design, component level design, user interface design,

notations, Reviews, documentation.

Unit-1I

Software Coding: Features, guidelines, Methodology, coding verification tools, techniques

Software tasting: Test plan, Test case design, levels of testing, testing techniques, tools object oriented

testing, Debugging.

Software Maintenance: Types, lifecycle, models, techniques, tools, change management. Unit-1II

Software Metrics:

Designing of Metrics, classification, process, product and project metrics, object oriented Metrics and

Issues in metrics.

Planning and scheduling: Project planning, project scheduling, project staffing, Risk Management.

Software Cost Estimation: Process, models, decomposition techniques, estimation of object oriented

projects.

Unit-iv

Software quality: Evaluation of quality, quality assurance, CMM, TQM, software reliability.

Configuration Management: Process and tools.

Software reengineering: Approaches, phases, model, BPR.

Clean room SE, CBSE, Web Engineering, CASE tools and classification.

TEXT BOOKS:

1. Software Engineering; Sommerville, Addison Wesley publication 7th Edition.

2. Integrated Approach to Software Engineering: P. Jalote : NAROSA publication.

Reference

1. Software Engineering principles and practice, Jawadekar, JMH

2. Software Engineering a practitimers Approach, R.S.Pressman, Mc GrawHill international 8th

Edition.

Object Oriented Analysis & Design MCS-23

4 Hours/Week

1. Introduction to Object Orientation: Real-world Domains, Object oriented approach and technology, Objects Instances and Concepts. Objects and Classes of Objects Generalized Object-Oriented Software Development Cycle, Object oriented Programming language. Object-Oriented Analysis of a Real-World Domain Object Model. The Notion of Encapsulation and Information Hiding, Object Identity: Entity and Attributes, Data and Knowledge: The Notion of Inheritance, Relationships between Objects: Association, Generalization / Specialization, Aggregation , Objects and States. Dynamic Behavior of Objects.

2. Object oriented Analysis: OO Analysis an introduction, Techniques for information Gathering for RA, Use case - Driven OO Analysis, OO concepts and principles. Identifying the elements of an Object model. Management of OO software projects. Object oriented analysis, domain analysis, generic components of OO analysis model, object behavior model

3. Object-Oriented System Design: OO Design Introduction, System Design Concepts and the Object-Oriented Approach Conventional Vs OO approaches, Design issues, the generic components of the 00 design model, the system design process, the object design process, OOD landscape, Useful design Patterns, OO Design Process, Design patterns. UML and the System Design Introduction to the Unified Modeling Language (UML), The unified Approach, Unified Modeling Language, Static Class diagram, Use case Diagram, Behavior Diagram Relationships, Identifying Attributes and Methods

4. Object oriented testing: Testing OOA and OOD models, Object oriented testing strategies, Test case design for OO software, testing methods applicable at the class level, Interclass test case design.

5. Technical metrics for object oriented systems: The intent of OO metrics, the distinguishing characteristics, metrics for the OO design model, class oriented metrics, operation oriented metrics, metrics for object oriented testing, metrics for object oriented projects.

6. Object-Oriented Programming Paradigm: Object-Oriented Support of Software Qualities Data Abstraction and Encapsulation. Data Type and Abstract Data Type Object-Oriented Program Structure More about Inheritance Reusability and Support for Reuse Class Design Guidelines Morphism and Polymorphism. Binding, Overloading, Overriding Object-Life Cycle. Persistent Objects Introduction to Object-Oriented Databases Object-Oriented Programming Environments. Comparison between C++, Java and C#.

Text Books

1. J. Rumbauch, M. Blaha, W. Premeriani, F. Eddy, W. Lorensen, "Object-Oriented Modeling and Design", Prentice-Hall, 1991.

2. Jacobson, M. Christerson, P. Jousson, G. Overgaard: " Object-Oriented Software Engineering ". A Use Case Driven Approach, Addison-Wesley, 1992.

Reference Books

3. Roger S Pressman, "Software Engineering - A Practitioner's Approach", The McGraw Hill Publications V Edition

4. Waman S Jawadekar, "Software Engineering Principles and Practice", TMH, 2004.

Compiler Design - Tools & Techniques

MCS-24

4 Hours/Week

1. Introduction to Compilers, Overview of Compilers

Why Compilers? A Brief History, Program Related to Compilers, The Translation Process, Major data structures in a Compiler, Other issues in compiler structure, Bootstraping & Porting, Compiler Construction Tools

[ 1.1 to 1.6 of Text Book 1, 1.6 of Text Book 2]

2. Lexical Analysis

The role of the Lexical analyzer, The scanning process, Regular expressions, finite Automata, From Regular expressions to DFA’s , Design of a Lexical Analyzer generator, Use of Lex to generate a Scanner Automatically [2.1 to 2.4, 2.6 of Text Book 1]

3. Syntax Analysis

The role of the parser, The parsing process, Context- free grammars, Parse Tree & Abstract Syntax Trees, Ambiguity, External Notations, EBNF & Syntax diagrams, Formal properties of Context-freeLanguages, The Parser Generator [3.1 to 3.6 of Text Book 1]

4. Top- Down Parsing

Top –Down parsing by Recursive – Descent, LL(1) parsing, First & Follow sets, Error – Recovery in Top-Down Parsers [4.1 to 4.3, 4.5 of Text Book 1]

5. Bottom – Up Parsing

Overview of Bottom – Up parsing, Finite Automata of LR(0) Items & LR(0) Parsing, SLR(1) Parsing, General LR(1) and LALR(1) Parsing, YACC: An LALR(1) Parser Generator, Error

Recovery in Bottom-Up Parser [5.1 to 5.5, 5.7 of Text Book 1]

6. Semantic Analysis

Attributes and Attribute Grammars, Algorithms for Attribute Computation, The Symbol Table, Data Types checking [6.1 to 6.4 of Text Book 1]

7. Intermediate Code Generation

Intermediate Languages, Intermediate Code & Data Structures for code generation, Basic code generation techniques, code generation of data structure references, code generation of control statements & logical expressions, code generation of procedures & function calls [ 8.1 to 8.5 of Text Book 1]

8. Run Time Environment

Memory organization During Program Execution, Fully Static Run Time Environments, Stack-Based Runtime Environments, Dynamic memory, Parameter Passing Mechanisms[7.1 to 7.5 of Text Book 1]

9. Code Optimization

Introduction, The Principal sources of optimization, Optimization of basic blocks, code improving Transformations [10.1 to 10.3, 10.4, 10.5 of Text Book 2]

Text Books

1. Compiler Construction Principles & Practice By Kenneth C. Louden, International Student Edition, 2003, Vikas Publishing.

2. Compilers Principles Techniques & Tools By A. V. Aho, Ravi Sethi & J. D. Ullman Addison Wesley 4th Edition, 2000

Reference Books

1. Engineering a compiler by Keith, D. Cooper & Linda Torezon, Margan Kafmann publishers, first Indian reprint 2004.

2. The essence of compilers by Robin Hunter, Pearson education, First Indian reprint 2004.

Compiler Design

MCS-25 [Lab]

2Hours/Week

COMPLIER DESIGN LABORATORY ASSIGNMENTS.

Details of each experiment are to be provided by the subject teacher. Programming with different compiler writing tools like lex and yacc, or Flex and Bison for object and non object oriented language. Understanding to the file structure, the tokens in which data is to be parsed, the tree in which parsed data is to be stored with lex and yacc. Compiling & running simple programs for specific problems (thermostat controller, finding the header files required for specific function used by programmers in program, designing a desk calculator, Implement an alternative grammars for infix expressions, Write a grammar for complete s-expressions; Programs relating to code generation, and register allocation: program to generate code for a specific assembler, program to identify specific control structures, inserting comments, identifying specific blocks for code partitioning. Build a lexical analyzer and a syntactic analyzer for EBNF( Students are encouraged to use something different like ANTLR and JAVACC); writing a simple HTML-to-TXT translator that reads from standard input text file and writes to standard output and write program that involves embellishing the parser so that it enforces some simple grammatical rules; Introduction to an Object Oriented version of YACC, Concepts to learn multiple instances of same parser which can be used concurrently or in parallel. Designing an XMLParser,Converting Lexacy Data to XML using a Lexer/Parser Generator, Using a Lexer/Parser Generator as a Multipurpose XML Tool Builder.

Assignments provided below are guidelines only.

Week – 1 Write a program converts regular expression to NFA.

Week – 2 Write a program to find first in context free grammar.

Week – 3 Write a program to find whether given string is keyword or not.

Week – 4 Write a program to find whether given string is identifier or not.

Week – 5 Write a program to find whether given string is constant or not.

Week – 6 Write a program to count blank space and count the no. of lines.

Week – 7 Write a program to generate tokens for the given grammar.

Week – 8 Write a program algo to convert NFA to DFA.

Week – 9 Write a program minimization the number of states of a DFA.

Week – 10 Write a program to check if string is in grammar or not.

Week - 11 Write a program to calculate leading of all the non terminals in given grammar.

Week - 12 Write a program to calculate trailing of all the non terminals in given grammar.

Essential Reading:

1. John E. Hopcraft & Jeffery D. Ullman, “Introduction to Automata Theory, Languages and

Computation”, Narosa Publishing House, New Delhi.

2. Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman, “Compilers - Principles, Techniques and Tools”,

Addison Wesley.

Software Engineering MCS-25 [Lab]

2Hours/Week LAB ASSIGNMENT FOR SOFTWARE ENGINEERING

Lab Assignment-1 Study Various phases of Software Engineering & types of Models used. Lab Assignment-2 Clarify the aspects Requirement Engineering with its types & concepts.

Lab Assignment-3 Make a points on Elicitation Techniques & Traceability table. Lab Assignment-4 Prepare SRS for Banking or On line book store domain problem (Case Study 1)* Lab Assignment-5 Describe the different software engineering standards (CMMI, ISO, SPICE

etc) Lab Assignment-6 Study UML diagrams using Rational rose software. (Case Study 2on Rational

Rose)*

Lab Assignment-7 Detail the characteristics of UML Diagram Approaches for you project

(Include all Diagrams of UML-11 for your Projects) Lab Assignment-8 Evaluate the Design process & concepts with its types & also visualize the

design metrics.

Lab Assignment-9 Analyze the multiple Architectural Views & Styles available for design

methodologies. Lab Assignment-10 Write about some Software Quality Attributes & methodologies. Lab Assignment-11 Accesses the difference between Measurement and Metrics. Lab Assignment-12 Identify the use of testing methodologies according to various testing

strategies. Lab Assignment-13 Design of the test cases for your Project. 2 Lab Assignment-14 Analyze the Risk related to the project and prepare RMMM plan Lab Assignment-15 Conclude the Software Engineering as a Practical Approach.

Digital Image Processing

MCS-31

4 Hours/Week ___________________________________________________________________________

Unit I:

Digital image processing: problems and applications, image representation, fundamental steps in image processing,

components of an image processing system, A simple image model, sampling and quantization, basic relationships

between pixels.

Unit II:

Image enhancement in spatial domain: Basic gray level transformations, Histogram Processing, Enhancement using

arithmetic/logic operations, Spatial filtering, colour image processing: Color fundamentals, Color models,

Pseudocolor Image processing, Color transformations.

Unit III:

Image Restoration: Image degradation/ restoration process model, Noise models, algebraic approach to restoration,

image compression, image compression models, elements of information theory, error free compression, Lossy

compression.

Unit IV:

Morphological Image processing: preliminaries, Dilation and erosion, Opening and Closing, Hit-or-Miss

transformation, Basic morphological algorithms, Image segmentation: detection of discontinuities, Edge linking and

boundary detection, thresholding.

TEXT BOOKS:

1. Rafael C Gonzalez and Richard E. Woods, Digital Image Processing Addison -Wesley Pub. Company Inc, 1993.

2. Anil K. Jain, Fundamentals of Digital Image Processing, Prentice Hall of India Prt. Ltd, New Delhi, 1997

Artificial Intelligence

MCS-32

4 Hours/Week __________________________________________________________________________________________

Unit I: Concepts in AI, problem solving in AI, Defining an AI Problem as state space search, production

systems, AI problem characteristics.

Heuristic Search Techniques: generate-and-test, hill climbing, best first search, problem reduction,

simulated annealing.

Unit II: Knowledge Representation in AI, approaches & issues in knowledge representation, Knowledge

Representation using predicate logic, forward and backward reasoning, semantic nets, frames, scripts &

conceptual Dependency.

Unit III: Expert systems: Architecture, the knowledge base, inference engine, Knowledge acquisition

Expert system development process MYCIN as an example.

Natural language processing: Syntactic processing, Semantic analysis, Disclosure & pragmatic

processing.

Unit IV: Introduction to pattern recognition and classification process, learning Classification patterns,

Visual image understanding, image transformation, Preliminary concepts of parallel and distributed AI,

Artificial Neural networks, LMS learning rule, general Delta Rule, Back Propagation.

Text Books: 1. E. Rich and Knight, “Artificial Intelligence”, 2nd Edition, TMH.

2. S. J. Russel and P. Norvig, “Artificial Intelligence: A Modern Approaches”, Prentice Hall, 2010. Reference Books:

3. D.W.Patterson, “Introduction to AI and Expert Systems”, PHI. 2. D. W. Rolston, “Principles of AI and Expert Systems Development”, Mc Graw Hill.

3. P. H. Winston, “Artificial Intelligence”, Addison Wesley.

ARTIFICIAL INTELLIGENCE

MCS-35 [Lab]

2Hours/Week

ARTIFICIAL INTELLIGENCE LABORATORY ASSIGNMENTS (MCS-35) .

Assignments provided below are guidelines only.

Essential Reading:

1. Artificial Intelligence, Ritch & Knight, TMH

2. Artificial Intelligence A Modern Approach, Stuart Russel Peter Norvig Pearson

3. Introduction to Artificial Intelligence & Expert Systems, Patterson, PHI

4. Poole, Computational Intelligence, OUP

5. Logic & Prolog Programming, Saroj Kaushik, New Age International

6. Expert Systems, Giarranto, VIKAS

7. Artificial Intelligence, Russel, Pearson

Week – 1 Write a program to implementation of DFS.

Week – 2 Write a program to implement BFS.

Week – 3 Write a program to implement Traveling Salesman Problem.

Week – 4 Write a program to implement 8 puzzle problems.

Week – 5 Write a program to implement Tower of Hanoi problem.

Week – 6 Write a program to implement A* Algorithm.

Week – 7 Write a Program To Show the Tic Tac Toe Game for 0 and X.

Week –8 Write a program to implement Hill Climbing Algorithm.

Week – 9 Write a program to implement Simulated Annealing Algorithm.

Week – 10 Write A Program For Expert System By Using Forward Chaining.

Mobile Computing

MCS-E-1

___________________________________________________________________________________

Unit I: Applications, history of mobile communication, introduction to GSM system, GSM background, GSM operational and technical requirements. cell layout and frequency planning, mobile station, base station systems, switching sub systems, home locations, register, Visiting Location Register (VLR), equipment identity register, echo canceller. GSM network structure, Recent Advances and application Standards in Mobile OS.

Unit II: Time and Frequency Domains representations, structure of TDMA slot with frame; Time organization of signaling channels, frequency hopping.TDMA standards and Applications, Time Organization of signaling Channels. Unit III: Mobility Management, Signaling protocols, steps in formation of a call, location updates, MS-PSTN call, PSTN-MS call, MS-MS call, call handover. Functioning and types of PSTN networks. Security issues in mobile computing, Authentication, encryption, Characteristics of SIM, equipment identification. Security Application development for Mobile OS. Unit IV: Multiplexing issues in time and frequency domains, FDMA, TDMA, CDMA, Physical layer, data link layer, MAP Protocols, MTP3, SCCP, TCAP protocol, message formation, MAP protocol-MAP protocol for MM, MAP protocol for basic service support. Application layers RR-layer, MM-layer, CC-Layer, API’s for mobile application development. Text Books:

1. Asha Mehrotra, GSM System Engg., Artech House 2. William C.Y. Lee, Mobile Communication Design Fundamentals, Wily Series In Telecommunication Reference Books:

1. Jerry D. Gibson, The Mobile Communication Handbook, IEEE Press 2. Jochen Schiller, Mobile Communication, Pearson Education Asia 3. V. Garg and E.Joseph, Wilkes―Wireless and personal Communica ons Systems, Prentice Hall

4. Lauren Darcey and Shane Conder, Android: Wireless Application Development Developer’s Library, 2nd Edition, Addison Wesley.

Embedded & Real Time Systems

MCS-E-2

1. Introduction An Embedded System; Characteristics of Embedded Systems; Software embedded into a system; Real Time Definitions, Events and Determinism, Synchronous & Asynchronous Events, Determinism, Time-Loading, Real-Time Design Issues, Example Real Time Systems.

2. Embedded Microcontroller Cores and Architecture 8051 micro controller; Architecture; Instruction sets; Assembly language programming; I/O port programming; Timer / counter programming;,Serial Communication; Interrupts programming.

3. Real Time specifications and design technique: Mathemetical specifications, flow charts, structure charts, Finite state automata, data flow diagrams, Petri Nets, Warnier Orr Notation, State charts.

4. Processor And Memory Organization Structural Units in a Processor; Memory Devices, Memory selection for an embedded system; Direct Memory Access, DMA controllers; Interfacing Processor, Memory and I/O Devices; Interrupt servicing (handling) mechanism; Context and the periods for context-switching; Deadline and interrupt latency.

5. Language Features: Parameter passing, Recursion, Dynamic allocation, Typing, exception handling, abstract data typing.

6. Real Time Kernels: Real Time and Embedded Operating Systems; Interrupt Routines in RTOS environment; co routines, Interrupt driven systems, Foreground/background systems, Full-featured Real Time Operating Systems.

7. Inter-Process Communication and Synchronisation Of Processes Multiple processes in an application; Problem of sharing data by multiple tasks and routines; Inter Process Communication, Mailboxes, Critical Regions, Semaphores, Deadlock.

8. Programming Languages and Tools Desired language characteristics; Data typing; Control Structures; Packages; Exception Handling; Overloading; Multitasking; Task Scheduling; Timing specification; Programming environments; Runtime support.

9. System Performance Analysis and Optimisation: Response time calculations, Interrupt latency, Time-loading and its Measurement, Reducing response times and time loading, I/O performance

10. Fault Tolerance and Reliability Reliability definitions, Testing: unit and system level; Fault tolerance-N-version programming, built in test software, CPU and Memory testing.

Text Books

1. Rajkamal; “Embedded Systems Architecture; Programming and Design”; Tata McGraw Hill Publications.

2. Phillip A. Laplante .;: “ Real –Time Systems Design and Analysis” –-3rd Edition, Apr 2004. Wiley-IEEE Press References

1. C.M. Krishna; Kang G.Shin; “Real Time Systems”; McGraw-Hill; 1997. 2. Mohammed Ali Mazidi; Janice Gillispie Mazidi “The 8051 Microcontroller and Embedded Systems”;

Pearson Education Asia 2002. 3. David E Simon; An Embedded software primer; Addison Wesley; 2000. 4. Raymond J.A. Buhr; Donald L. Bailey; “An Introduction To Real Time Systems”; Prentice Hall International;

1999. 5. Rajkamal, “Microcontrollers: Architecture, Programming, Interfacing and System Design”, Pearson

Education.

WEB TECHNOLOGIES

MCS-E-3

Unit-1

Web Essentials: clients, server and communication, basic internet protocols, the world wide web, http request message, response message, HTML: planning for designing web pages, model and structure for a website, developing websites, basic html using image links, lists, tables and forms, frames for designing a good interactive website

Unit-2

Style sheets: CSS-Introduction to cascading style sheets, features, core syntax, Style Sheets and HTML Style Rle Cascading and Inheritance, Text Properties, Box Model Normal Flow Box Layout, Beyond the Normal Flow. Client- Side Programming: The JavaScript Language, History and Versions Introduction JavaScript in Perspective, Syntax, Variables and Data Types, Statements, Operators, Literals, Functions, Objects, Arrays, Built-in Objects, JavaScript Debuggers.

Unit-3

Host Objects: Browsers and the DOM-Introduction to the Document Object Model DOM History and Levels, Intrinsic Event Handling, Modifying Element Style, The Document Tree, DOM Event Handling-Accommodating Noncompliant Browsers Properties of window. Server-Side Programming: Java Servlets, Architecture, Overview, A Servelet-Generating Dynamic Content, Life Cycle, Parameter Data, Sessions, Cookies, URL Rewriting, Other Capabilities, Data Storage servelets

Unit-4

Introduction to CGI, testing and debugging perl CGI script using scalar variables and operators in perl.

Text Books:

1. Don Gosselin et al., “Web warrior guide to web design technologies”, Cenage Learning. 2. Jeffrey C.Jackson, "Web Technologies--A Computer Science Perspective", Pearson Education

Reference Books:

1. Robert. W. Sebesta, "Programming the World Wide Web", Pearson Education 2. N.P. Gopalan, J. Akilandeswari, “ Web Technology: A Developer’s Perspective”, PHI

Pattern Classification MCS-E-4

4 Hours/Week

Introduction:

Machine Perception, Pattern Recognition Systems, the Design Cycle, Learning and Adaptation.

Bayesian Decision Theory:

Bayesian Decision Theory-Continuous Feature, Minimum – Error – Rate Classification, Classifiers, Discriminant Functions, and Decision Surfaces, The Normal Density, Discriminate Functions for the Normal Density, Error Probabilities and Integrals, Error Bounds for Normal Densities, Bayes Decision Theory – Discrete Features,

Maximum- likelihood and Bayesian Parameter Estimation:

Maximum- Likelihood Estimation, Bayesian Estimation, Bayesian parameter estimation, Gaussian Case, General Theory, Sufficient Statistics, Problems of Dimensionality, Component Analysis and Descriminats,

Non Parametric Techniques:

Density Estimation, Parzen Windows, Kn-Nearest- neighbor Estimation, the nearest neighbor Rule, Metrics and Nearest Neighbor Classification, Fuzzy Classification,

Linear Discriminant Functions:

Linear Discriminant Functions and Decision Surface, Generalized Linear Discriminant Functions, The Two Category Linearly Sufferable Case,

Unsupervised Learning and Clustering:

Mixture Densities and Identifiability, Maximum Likelihood Estimates, Applications to Normal Mixtures, Unsupervised Bayesian Learning, Data Discrimination and Clustering, Criterion Functions for Clustering, Iterative Optimization, Hierarchical Clustering, The Problem of Validity, Online Clustering, Graph Theoretic Methods, Component Analysis, Low Dimensional Representation and Multi-Dimensional Scaling.

Multilayer Neural Networks:

Feed Forward Operation and Classification, Back Propagation Algorithm, Error Surfaces, Back Propagation as Feature Mapping, Bayes Theory and Probability, Related Statistical Techniques, Practical Techniques for Improving Back Propagation, Second Order Methods, Additional Networks and Training Methods, Regularization, Complexity Adjustment and Pruning.

Introduction to Biometric Recognition:

Biometric Methodologies: Finger Prints, Hand Geometry, Facial Recognition, Iris Scanning, Retina Scanning. Identification Verification - The Distinction, Performance Criteria.

Text Books

1. Richard O. Duda, Peter E. Hart, David G. Stork; "Pattern Classification", A Wiley-Interscience Publication, John Wiley & Sons, Inc, 2000 Second Addition.

2. K. Jain, R. Bolle, S. Pankanti (Eds.), "Biometrics: Personal Identification in Networked Society", Kluwer Academic Publishers, 1999.

Wireless Sensor Networks

MCS-E-5

4 Hours/Week

___________________________________________________________________________________

Unit I: Routing Cellular and Ad hoc wireless networks; Issues of MAC layer and outing; Proactive, Reactive and Hybrid Routing protocols; Multicast Routing; Tree based and Mesh based protocols; Multicast with Quality of Service Provision Quality of Service: Real-time traffic support; Issues and challenges in providing QoS; Classification of QoS Solutions; MAC layer classifications; QoS Aware Routing Protocols; Ticket based and Predictive location based Qos Routing Protocols.

Unit II: Energy Management Ad Hoc Networks: Need for Energy Management; Classification of Energy Management Schemes; Battery Management and Transmission Power Management Schemes; Network Layer and Data Link Layer Solutions; System power Management schemes Unit III: Mesh Networks: Necessity for Mesh Networks; MAC enhancements; IEEE 802.11s Architecture; Opportunistic Routing; Self Configuration and Auto Configuration; Capacity Models; Fairness; Heterogeneous Mesh Networks; Vehicular Mesh Networks Unit IV: Sensor Networks: Introduction to Sensor Network architecture; Data Dissemination; Data Gathering; MAC Protocols for sensor Networks; Location discovery; Quality of Sensor Networks; Evolving Standards. TEXT BOOK:

1. Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks – Architectures and Protocols, C., Pearson Education, 2004.

Reference Books:

1. Feng Zhao and Leonidas Guibas, Wireless Sensor Networks, Morgan Kaufman Publishers, 2004. 2. C.K.Toh , Adhoc Mobile Wireless Networks, Pearson Education, 2002. 3. Thomas Krag and Sebastin Buettrich , Wireless Mesh Networking , O’Reilly Publishers, 2007

SOFTWARE DEVELOPMENT USING UML

MCS-E-6

Unit-1

Importance of modeling, overview of UML, Building blocks of UML, object oriented design, classes, relationship,

class diagram.

Unit-II

Advance classes, Advance relationships, interfaces, types, roles, packages, Instances, object diagrams.

Interactions, use Cases, Use Care diagram, Interaction diagrams.

Unit-III

Activity diagrams, process and threads, Time and space, state chart diagram, components, components diagram,

Deployment and Deployment diagrams, collaboration and collaboration diagrams.

Unit-iv

Case studies (at least 06) using all UML diagrams.

Text Books:

1. Grady Broch, J. Rambaugh, Jacobson: The Unified modeling Languages Usere guides- Pearson

Education, 3rd Edition.

2. M.R. Blaha, J. Rambaugh: object oriented Modeling and Design using UML, Pearson Education, 3rd

Edition.

Reference Books:

1. Craing Larman: Applying UML and patterns: An introduction to object oriented Analysis and

Design and Interactive development, Pearson Education 3rd Edition.

System Performance & Evaluation

MCS-7

Performance evaluation methods, Analytical versus simulation modelling, Perfomance measurement and

Benchmarking. Workload modelling, Random variables. Commonly used distributions. Stochastic processes,

Markov chain models of computer systems, Steady-state and Transient analyses, Queuing models.

Single server and multi-server queues, Open and closed queuing networks. Discrete event simulation, Simulation

Languages.

Random number generation and testing, model verification and validation, Analysis of simulation results,

Confidence interval Variance reduction techniques.

Case studies of analytical and simulation studies of computer systems.

Text Books

1. Raj Jain, " The Art of Computer Systems Performance Analysis ", John Wiley and Sons, New York, USA, 1991

2. Trivedi, KS, Probability and Statistics with Reliability, Queueing and computer science Applications Prentice

Hall of India Reprinted in 1990

3. Law, A M, and Kelton, W.D, " Simulation Modeling and Analysis ", McGraw Hill, New York, USA, 1991

Cloud Computing

MCS-E-8

___________________________________________________________________________________

Unit I: Cloud Computing Fundamental: Cloud Computing definition, private, public and hybrid cloud.

Cloud types; IaaS, PaaS, SaaS. Benefits and challenges of cloud computing, public vs private clouds, role

of virtualization in enabling the cloud; Business Agility: Benefits and challenges to Cloud architecture.

Application availability, performance, security and disaster recovery; next generation Cloud Applications.

Cloud Applications: Technologies and the processes required when deploying web services; Deploying a

web service from inside and outside a cloud architecture, advantages and disadvantages.

Unit II: Cloud Services Management: Reliability, availability and security of services deployed from the

cloud. Performance and scalability of services, tools and technologies used to manage cloud services

deployment; Cloud Economics: Cloud Computing infrastructures available for implementing cloud based

services. Economics of choosing a Cloud platform for an organization, based on application

requirements, economic constraints and business needs (e.g Amazon, Microsoft and Google,

Salesforce.com, Ubuntu and Redhat) .

Unit III: Application Development: Service creation environments to develop cloud based applications.

Development environments for service development; Amazon, Azure, Google App.

Unit IV: Best Practice Cloud IT Model : Analysis of Case Studies when deciding to adopt cloud

computing architecture. How to decide if the cloud is right for your requirements. Cloud based service,

applications and development platform deployment so as to improve the total cost of ownership (TCO)

Text Books: 1. Gautam Shroff, Enterprise Cloud Computing Technology Architecture Applications [ISBN: 978-

0521137355] 2. Toby Velte, Anthony Velte, Robert Elsenpeter, Cloud Computing, A Practical Approach [ISBN:

0071626948] 3. Dimitris N. Chorafas, Cloud Computing Strategies [ISBN: 1439834539]

SOCIAL NETWORK

MCS-E-9

___________________________________________________________________________________

Unit I: Introduction:Introduction and terminology, market views, applications, the business of social networking,

Examples of social media- multimedia, entertainment, news/opinion, communication, major social networks ,

social networking websites. Basic properties of networks and actors, connections embedding, Centrality and

power, Cliques and sub-groups, Network positions and social roles: The analysis of equivalence, Similar and

Structural equivalence, Automorphic equivalence, Regular equivalence, Multiplex network, Two mode networks

Unit II: Current Situation In Selected Areas Of Social Networks: Social Graphs ,Social graph expansion, Facebook

open graph, Microblogging ,Identity Algorithms And Apis ,OAuth,opened, Social Media Search And Management

In Large Scale,Social media search ,Content management in large scale, Human powered and community question

answering, Mobility And Geolocation ,Social Rankings And Vertical Social Networks, Business And Social

Networking ,Social Businesses ,Social Analytic tools ,Social Television , Social Gaming, Social Networks - Research

Challenges ,

Unit III: Social network data: Social network data, statistical tools, Populations, samples, and boundaries,

Modality and levels of analysis , Sampling ties ,Formal methods, Full network methods, Snowball methods, Ego-

centric networks (with alter connections), Ego-centric networks (ego only) ,Multiple relations , Scales of

measurement , Binary measures of relations, Multiple-category nominal measures of relations, Grouped ordinal

measures of relations, Full-rank ordinal measures of relations, Interval measures of relations, statistics and social

network data.

Unit IV: Using graphs and matrix to represent social relations: Graphs and Sociograms, Kinds of Graphs, Levels of

Measurement: Binary, Signed, and Valued Graphs, Directed or "Bonded" Ties in the Graph, Simplex or Multiplex

Relations in the Graph, working with Netdraw to visualize graphs, Matrices to Represent Social Relations, the

"Adjacency" Matrix, Matrix Permutation, Blocks, and Images, Mathematical Operations on Matrices, working with

network data.

Text Books:

1. Wasserman, Stanley; Faust, Katherine (1994). "Social Network Analysis in the Social and Behavioral

Sciences". Social Network Analysis: Methods and Applications. Cambridge University Press. pp. 1–

27.ISBN 9780521387071.

2. Kilduff, M., Tsai, W. (2003). Social networks and organisations. Sage Publications.

3. Wellman, Barry; Berkowitz, S.D. (1988). Social Structures: A Network Approach. Structural Analysis in the Social

Sciences. Cambridge University Press

4. Borgatti, Stephen P.; Mehra, Ajay; Brass, Daniel J.; Labianca, Giuseppe (2009). "Network Analysis in the

Social Sciences". Science 323 (5916): 892–895.

Reference Books:

1. Scott, John P. (2000). Social Network Analysis: A Handbook (2nd edition). Thousand Oaks, CA: Sage

Publications.

2. Nooy, Wouter (2012). "Graph Theoretical Approaches to Social Network Analysis." in Computational

Complexity: Theory, Techniques, and Applications (Robert A. Meyers, ed.). Springer. pp. 2864–2877.

3. Kadushin, C. (2012). Understanding social networks: Theories, concepts, and findings. Oxford: Oxford

University Press.

Bioinformatics

MCS-E-12

___________________________________________________________________________________

Unit I : Introduction, Algorithms and Complexity: Biological Algorithms versus Computer Algorithms, Notations, Algorithm Design Techniques, Tractable versus Intractable Problems. Molecular Biology Primer: Genes, Molecules, Structure of DNA, Proteins, Analysis. Exhaustive Search: Restriction Mapping, Impractical Restriction Mapping Algorithms, A Practical Restriction Mapping Algorithm, Regulatory Motifs in DNA Sequences, Profiles, The Motif Finding Problem, Search Trees, Finding Motifs, Finding a Median String.

Unit II: Greedy Algorithms: Genome Rearrangements, Sorting by Reversals, Approximation Algorithms, Breakpoints: A Different Face of Greed, A Greedy Approach to Motif Finding. Dynamic Programming Algorithms: The Power of DNA Sequence Comparison, the Change Problem Revisited, the Manhattan Tourist Problem, Edit Distance and Alignments, Longest Common Subsequences. Unit III: Sequence Alignment: Global sequence alignment, the Needleman and Wunsch algorithm, Scoring Alignments, Local Sequence Alignment, the smith-waterman algorithm. Alignment with Gap Penalties, Multiple Alignment, Gene Prediction, Statistical Approaches to Gene Prediction, Similarity-Based Approaches to Gene Prediction, Spliced Alignment. Divide and Conquer Approach to Sorting, Space Efficient Sequence Alignment, Block Alignment. Unit IV: Graph Algorithms: Graphs and Genetics, DNA Sequencing, Shortest Superstring ,Problem, DNA Arrays as an Alternative Sequencing Technique, Sequencing by Hybridization, Fragment Assembly in DNA Sequencing, Protein Sequencing and Identification, The Peptide Sequencing Problem, Spectrum Graphs, Protein Identification via Database Search, Spectral Convolution, Spectral Alignment. Combinatorial Pattern Matching: Repeat Finding, Hash Tables, Exact Pattern Matching, Keyword Trees, Suffix Trees, Heuristic Similarity Search Algorithms, Approximate Pattern Matching, BLAST: Comparing a Sequence against a Database. Text Books:

1. Neil C. Jones and Pavel A. Pevzner, An Introduction to Bioinformatics Algorithms, MIT Press, 2004. 2. Ion Mandoiu and Alexander Zelikovsky, Bioinformatics Algorithms, Techniques & Applications, Wiley Inter-

Science, 2008 3. Wing-Kin Sung, Algorithms in Bioinformatics: A Practical Introduction, CRC Press (Taylor & Francis Group),

2009. Reference Books:

1. T.K. Attwood and Phukan Smith, Introduction to Bioinformatics, Pearson Education. 2. B. Bergeron, Bio-informatics Computing, Pearson Education.

J.M Claverie and C.N. Notredame, Bioinformatics- A beginners Guide, Wiley Pub.

Big Data Analysis

MCS-E-13

___________________________________________________________________________________

UNIT I: Introduction to Big Data Analytics, Overview of SQL and intro to R

UNIT II: Using R for Initial Analysis of the Data

UNIT III: Advanced Analytics and Statistical Modeling for Big Data – Theory and Methods, Technology and Tools

UNIT IV: Concluding and Operationalizing an Analytics Project, Big Data Analytics Lifecycle

Text Book:

1. Michael Minelli, Michele Chambers, and Ambiga Dhiraj, Big Data, Big Analytics: Emerging Business

Intelligence and Analytic Trends for Today's Businesses, Wiley, 2013

Discrete Dynamical System

MCS-E-14

___________________________________________________________________________________

Unit I: Linear Maps and Linearization, Contractions in Euclidean Space, Interval Maps, Limit Cycles, Quadratic

maps , Metric Spaces, Fractals., Linear Maps, Circle Rotations, Distribution of Values, Linear Toral Flows, Linear

ODEs and Lissajous.

Unit II: Interval Flows and Billiards, Invertible Circle Maps, comments on n-tori, Volume Preservation, Poincare

Recurrence, Poincare Recurrence, Newton’s Equation, Billiards, Billiard Examples, Convex Billiards.

Unit III: Growth of Periodic Orbits, Hyperbolic Toral Maps, Hyperbolic Toral Maps, Inverse Limits, Topological

Transitivity, Topological Mixing and Chaos, Topological Mixing and Chaos,

Unit IV: Compact Space Dimension, Topological Entropy, Topological Entropy, Quadratic Maps and Chaos

Text Book: 1. B. Hasselblat and A. Katok, A First Course in Dynamics, 1st edition, Cambridge University Press (2003), ISBN 0

521 58750 6 (paperback).