SEMESTER I

14MX11 PROBABILITY AND STATISTICS 4 0 0 4

INTRODUCTION: Graphical presentation of data – scatter plots – frequency distribution – histograms – box plots – measures of
central tendency – measures of dispersion – grouped data. (7)

PROBABILITY: Review of sets – experiments and sample spaces – events – probability definition – finite sample spaces and
enumeration – conditional probability – partitions, total probability – Baye’s theorem. (7)

RANDOM VARIABLES : Distribution function – discrete, continuous random variables – equivalent events – functions of discrete
and continuous random variables – expectation – moment generating functions. (7)

JOINT PROBABILITY DISTRIBUTIONS: Joint distribution for two dimensional random variables - marginal distributions –
conditional distributions – conditional expectation – regression of the mean – Independence of random variables - covariance and
correlation - distribution function for two dimensional random variables. (6)

DISCRETE AND CONTINUOUS DISTRIBUTIONS: Bernoulli trials and Bernoulli distribution – Binomial distribution – Poisson
distribution – Applications Normal distribution – central limit theorem - Normal approximation to the Binomial distribution –
Applications. (8)

TESTS OF HYPOTHESES: Statistical hypotheses – Type I and Type II errors – one sided and two sided hypotheses- Tests of
hypotheses on a single sample – Tests of hypotheses on two samples – Testing for goodness of fit. (10)

LINEAR REGRESSION AND CORRELATION: Simple linear regression – prediction of new observations – Correlation (5)

STATISTICAL QUALITY CONTROL: Quality improvement and statistics – control charts – control charts for measurements –
control charts for individual measurements – control charts for attributes. (5)

TIME SERIES ANALYSIS: Examples of time series – time series plots – nature and uses of forecasts – measuring forecast errors –
measurement of trends – moving average method – method of least squares. (5)
Total L: 60

REFERENCES:
1. William W Hines, Douglas C Montgomery, David M Goldsman and Connie M Borror, “Probability and Statistics in Engineering”,
John Wiley, 2003.
2. Douglas C Montgomery and George C Runger, “Applied Statistics and Probability for Engineers”, John Wiley, 2010.
3. Ronald E Walpole, Raymond H.Myers, Sharon L Myers and Keying Ye, “Probability & Statistics for Engineers & Scientists”,
Pearson Education, 2011.
4. Douglas C Montgomery, Cheryl L Jennings and Murat Kulahci, “Introduction to Time Series Analysis and Forecasting”, John
Wiley, 2008.

14MX12 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 4 0 0 4

SET THEORY: Set notation and description - basic set operations - Venn diagrams - laws of set theory - partition - min sets-
Principle of inclusion and exclusion. (8)

LOGIC: Propositions - logical operators - truth tables - normal forms - laws of logic - proofs in propositional calculus – Predicates
– variables – Quantifiers – Standard Forms – Inference in Predicate calculus – Mathematical induction. (13)

FUNCTIONS AND RELATIONS: Injective, Surjective, Bijective functions - composition, identity, inverse; Relations - properties of
relations - closure operations on relations. (6)

FORMAL LANGUAGES: Four classes of grammars (Phrase Structure, Context sensitive, Context Free, Regular) - definitions -
Context free Grammar : Right most , Left most derivations – Syntax trees – Unambiguity, ambiguity – Construction of grammars
for languages – Derivation of languages from grammars – Regular expressions. (10)

FINITE AUTOMATA: Definition of deterministic finite state automaton (DFA), Non deterministic finite state automaton (NFA) -
equivalence of DFA and NFA - Equivalence of regular grammars and finite automata. (9)

PUSH DOWN AUTOMATA (PDA): Informal description - definition - Deterministic PDA - Equivalence of acceptance by final
state and empty stack - Equivalence of PDA's and Context Free languages. (8)

1
TURING MACHINE (TM): Construction of simple Turing Machines - Universal TM - Halting Problem. (6)
Total L: 60

REFERENCES:
1. Kenneth H Rosen, “Discrete Mathematics and its Applications”, Tata McGraw Hill, 2011.
2. Bernard Kolman, Robert C Busby and Sharon Ross, “Discrete Mathematical Structures”, Prentice Hall, 2008.
3. John E Hopcroft, Rajeev Motwani, and Jeffrey D.Ullman, ‘Introduction to Automata Theory, Languages and Computation”,
Addison-Wesley/Pearson, 2006.
4. John Martin, “Introduction to Languages and the Theory of Computation”, Tata McGraw Hill, 2010.

14MX13 PRINCIPLES OF PROGRAMMING LANGUAGES 4 0 0 4

INTRODUCTION: Characteristics of programming Languages factors influencing the evolution of programming language,
developments in programming methodologies, desirable features and design issues. Programming language processors:
Structure and operations of translators, software simulated computer, syntax, semantics, structure, virtual computers, binding and
binding time. Operating and Programming Environment: Batch Processing Environments, Embedded system requirements
Programming language paradigms. (10)

IMPERATIVE PARADIGMS AND C – I: Elementary and Structured Data Types: Data object variables, constants, data types,
elementary data types, declaration, assignment and initialization, enumeration, characters, strings. Structured data type and objects:
Specification of data structured types, vectors and arrays, records, variable size data structure, pointers and programmer
constructed data structure, sets, files. Sub Program and programmer defined data types: Evolution of data types, abstractions,
encapsulations, information hiding, sub programs, abstract data types. (18)

IMPERATIVE PARADIGMS AND C – II : Sequence Control: Implicit and Explicit sequence control, sequence control with within
expression and statements, recursive sub programs, exception handling, co routines, Scheduled sub programs, concurrent
execution. Data control referencing environments, static and dynamic scope, local data referencing environment, shared data:
Explicit common environment dynamic scope parameter passing mechanism. Storage Management: Major run time requirements,
storage management phases, static storage management, stack based, heap based storage management. (22)

INTERNET LANGUAGE PARADIGMS: Markup and Script Languages - Multi- Paradigm –Domain specific Languages. Case
study Script Languages. (10)
Total L : 60

REFERENCES:
1. Terrence W Pratt, Marvin V Selkowitz and T V.Gopal, “Programming Languages Design and Implementation”, Pearson
Education, 2008.
2. Robert W Sebesta, “Concepts of Programming Languages”, Addison Wesley, 2008.
3. Ravi Sethi, “Programming Languages Concepts and Constructs “, Pearson Education, 2009.
4. Kernighan B.W. and Ritchie D.M., “C Programming Language (ANSI C)”, Prentice Hall , 1994.
5. Al Kelley and Ira Pohl, “ A Book on C “ Pearson Education, 2008.

14MX14 DATA STRUCTURES 4 0 0 4

INTRODUCTION: Data structures - Abstract data Types - Primitive data structures - Algorithms: Structure, properties – analysis of
iterative and recursive algorithms – best case, worst case, average case complexities- Notations . (6)

ARRAYS AND RECORDS: Operations - representation of one, two, three and multi dimensioned arrays – Applications.
Strings: Implementation - operations – Applications. Records: Implementation of variant records. (8)

STACKS AND QUEUES: Operations - implementation - Applications: Recursion handling; Parentheses matching; Evaluation of
expressions, Queues: Operations - sequential implementation – Circular Queues-Priority Queues - Dequeues - Applications. (12)

LISTS: Insertion and deletion of nodes - Singly linked lists, Doubly linked lists, Circular lists, Multiply linked lists - Linked stacks -
Linked queues- Applications: Addition of Polynomials; Sparse Matrix representation. (10)

BINARY TREE: Trees- Terminologies – Implementation-Binary Tree-Properties - sequential and linked representation - binary tree
traversals - Expression trees - Threaded trees (10)

SORTING: Insertion Sort, Selection Sort, Shell Sort, Bubble Sort, Quick Sort, Heap Sort, Merge Sort, Radix Sort – Algorithms -
Analysis. (8)

TABLES : Operations- Hash Table: Hash functions, Implementation, Overflow handling techniques, Linear Open Addressing,
Chaining, Successful and unsuccessful searches. (6)

2
 Total L : 60

REFERENCES
1. Sahni Sartaj, "Data Structures, Algorithms and Applications in C++", Silicon Press, 2005
2. Aaron M Tanenbaum, Moshe J Augenstein and Yedidyah Langsam, "Data structures using C and C++ ", PHI Learning, 2009.
3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education, 2006.
4. Vijayalakshmi Pai G A, “Data Structures and Algorithms: Concepts Techniques and Applications”, McGraw-Hill, 2009.
5. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein “Introduction to Algorithms”,
The MIT Press, 2009.
6. A. Chitra P T Rajan “Data Structures", Tata McGraw Hill Education, 2008.

14MX15 COMPUTER SYSTEM ARCHITECTURE 4 0 0 4

DATA FORMATS : Introduction - Number Systems – Number Bases – Arithmetic – Number Base conversion - Alphanumeric
character data – Other Binary codes-Representing Integer Data – Complements – (r-1)’s , r’s - signed number representation –
Floating Point Representation :Format , Normalization , Arithmetic operation – IEEE 754 format – Packed Decimal Format. (6)

DIGITAL LOGIC CIRCUIT : Digital computer - Logic gates - Boolean Algebra - Simplification of Boolean functions : Boolean laws
and postulates, Karnaugh’s Map method - NAND - NOR implementation. (4)

COMBINATIONAL CIRCUITS : Design of Combinational Circuits : Half-Adder, Full-Adder – Subtractor –parity checker-comparator-
Multiplexer - Demultiplexer - Encoder - Decoder. (4)

SEQUENTIAL CIRCUITS : Basic concepts: Clocks - Flip-Flops : SR-F/F, D-F/F, JK-F/F, T-F/F, Excitation Tables-characteristic
equation – Edge-triggered Flip-flop- Registers – Register with Parallel load – Shift registers: Its types - Bidirectional shift register
with parallel load – Asynchronous Up-down counters - Design of synchronous counters. (10)

REGISTER TRANSFER AND MICROOPERATIONS : Bus and Memory Transfer - Tri-state buffers - Arithmetic, Logic, Shift
Micro-operations – Arithmetic Logic Shift Unit. (4)

A BASIC COMPUTER DESIGN : Stored Program Organisation - Timing and Control : Instruction Cycle - Memory Reference
Instructions – Input-Output and interrupt cycle – Design of basic computer – Control Unit : Design of Hardwired Control Unit. (12)

CPU ORGANISATION : General Register Organisation – Stack Organisation - Instruction formats – Types of Interrupts – RISC -
Parallel Processing – Pipelining – Array Processors- Performance of a processor. (8)

INPUT AND OUTPUT ORGRANISATION: Input and Output interface – Asynchronous Data transfer – Modes of Transfer – DMA.
(6)

MEMORY ORGANISATION: Types of Memory - Memory Hierarchy- Main Memory-Memory interface to CPU- Associative Memory -
Cache Memory: Cache mapping schemes. (6)
Total L : 60

REFERENCES:
1. Morris Mano M, “Computer System Architecture”, Pearson Education, 2012.
2. Morris Mano M, “Digital Logic and Computer Design”, Pearson Education, 2011.
3. John Patrick Hayes, “Computer Architecture and Organization”, Tata McGraw Hill, 2007.
4. William Stallings, “Computer Organisation and Architecture: Designing for Performance”, Pearson Education, 2012.
5. Carl Hamacher, Zvonko Vronesic and Safwat Zaky, “Computer Organisation”, Tata McGraw Hill, 2002.

14MX16 PROBLEM SOLVING LABORATORY 1 0 3 2.5

PYTHON: Syntax and Style – Python Objects – Numbers – Sequences – Strings – Lists and Tuples – Dictionaries – Conditionals
and Loops – Files – Input and Output – Errors and Exceptions – Functions – Modules – Classes and OOP – Execution
Environment.

Experiments in the following topics:

1 Python sequences
2 Manipulation of Strings
3 Creating and processing Lists and tuples
4 Manipulation of Dictionaries
5 Looping and conditional constructs
6 File processing

3
 7 Errors and exceptions
8 Functions and modules
9 Creation of Classes and objects
Total L : 15 + P:45 = 60

REFERENCES:
1. Mark Summerfield, “Programming in Python 3: A Complete Introduction to the Python Language”, Addison-Wesley
Professional, 2009
2. Wesley J Chun, “Core Python Applications Programming”, Prentice Hall, 2012.
3. John Patrick Hayes, “Computer Architecture and Organization”, McGraw-Hill, 2007.
4. William Stallings, “Computer Organisation and Architecture: Designing for Performance”, Pearson Education, 2012.

14MX17 PROGRAMMING LANGUAGES LABORATORY 0 0 3 1.5

Experiments in the following topics:

1. Single and multi dimensional arrays

2. Functions and recursive functions
3. Structures, Unions and array of structures and unions
4. Pointers, operation on pointers and dynamic and static storage allocation
5. Data files Sequential, Random, Low-level and High Level file access.
6. Multi-file software and header file
7. C on Host and non-host environment and embedded programming.

Total P:45

14MX18 DATA STRUCTURES LABORATORY 0 0 3 1.5

Implementation of the following problems:

1 Various types of Matrices and operations
2 Library of string operations
3 Set operations
4 An appropriate illustration using Records and Variant records
5 Stacks : Operations and applications
6 Queues : Operations and applications.
7 Linked Lists: Singly linked, Doubly linked and Circular lists
8 Binary trees and Threaded trees
9 Hash Table

Total P: 45

SEMESTER II

14MX21 OPTIMIZATION TECHNIQUES 4004

INTRODUCTION : Statement of an optimization problems – classification of optimization problem – classical optimization

techniques : Single variable optimizations, Multi variable optimization, Equality constraints, Inequality constraints, No constraints.
(8)
LINEAR PROGRAMMING : Mathematical formulation of LPP – Graphical method for two dimensional problems – central problems
of Linear Programming – Definitions – Simplex – Algorithm – Phase I and Phase II of Simplex Method – Big M Method – Revised
Simplex Method - Simplex Multipliers – Dual and Primal – Dual Simplex Method
(13)
Transportation problem and its solution – Assignment problem and its solution by Hungarian method – Karmakar’s method –
statement, Conversion of the Linear Programming problem into the required form, Algorithm.
(7)
NON LINEAR PROGRAMMING – UNCONSTRAINED OPTIMIZATION: One dimensional minimization – Unimodal and Multimodal
Function - Unrestricted search –Interval halving method – Fibonacci method. Multi dimensional minimization – Uni-variate method
– Pattern search method – Hooke and Jeeves method – Gradient of a function – Steepest descent method – Conjugate gradient
method.
(13)

4
NONTRADITIONAL OPTIMIZATION ALGORITHMS: Genetic Algorithm – Working Principle – Comparison between GA and
traditional method – GA operators – GA for constrained Optimization – Real coded GA. Swarm intelligence, Particle Swarm
optimization, Ant Colony optimization, Comparison with GA .
(7)
DYNAMIC PROGRAMMING: Recursive Nature – Multistage decision processes – Principles of optimality – Computation
procedures.
(6)
DECISION MAKING: Decisions under uncertainty, under certainty and under risk – Decision trees – Expected value of perfect
information and imperfect information.
(6)

Total L: 60
REFERENCES:
1. Kalyanmoy Deb, “Optimization for Engineering Design Algorithms and Examples”, PHI Learning, 2012.
2. Singiresu S Rao, “Engineering Optimization Theory and Practice”, New Age International, 2011
3. Hillier and Lieberman, “Introduction to Operations Research”, Tata McGraw-Hill, 2011.
4. Hamdy A Taha , “Operations Research – An introduction”, Pearson Education, 2012.
5. Kambo N S, “Mathematical Programming Techniques”, Affiliated East – West Press, 2012.
6. Maurice Clerc, “Particle Swarm Optimization”, Wiley ISTE, 2012.
7. Marco Dorigo and Thomas Stützle “Ant Colony Optimization”, PHI Learning, 2012.

14MX22 OBJECT ORIENTED PROGRAMMING 4 0 0 4

PRINCIPLES OF OBJECT ORIENTED PROGRAMMING: Software crisis Software Evolution - Procedure Oriented Programming -
Object Oriented Programming Paradigm - Basic Concepts and Benefits of OOP - Object Oriented Programming Language -
Application of OOP - Structure of C++ - Types and Declarations - Pointers, Arrays, and Structures - Expressions and Statements -
Manipulators. (8)

FUNCTIONS IN C++: Function Prototyping - Call by Reference - Return by reference - Inline functions - Default, Const Arguments -
Function Overloading. (5)

CLASSES AND OBJECTS: Data members - Member functions - Nesting of Member functions - Private member functions -
Memory allocation for Objects - Static data members - Static Member Functions - Arrays of Objects - Objects as Function
Arguments - Friend Functions - Returning Objects - Const Member functions - Pointers to Members. (8)

CONSTRUCTORS: Parameterized Constructors - Multiple Constructors in a Class - Constructors with Default Arguments –
Dynamic Initialization of Objects - Copy and Dynamic Constructors – Destructors. (5)

INHERITANCE: Defining Derived Classes - Single Inheritance - Making a Private Member Inheritable - Multiple Inheritance –
Hierarchical Inheritance - Hybrid Inheritance - Virtual Base Classes - Abstract Classes - Constructors in Derived Classes - Member
Classes - Nesting of Classes – Composition – Aggregation. (10)

POLYMORPHISM: Compile and Run Time Polymorphism – Operators Overloading - Unary and Binary Operators Overloading –
Overloading using Friend functions – Virtual Functions – Virtual Destructors. (9)

TEMPLATES, EXCEPTION HANDLING & NAMESPACES: Templates, Generic Functions and Generic Classes – Exception
Handling – Examples – Namespaces. (9)

STREAMS: String I/O -Character I/O - Object I/O - I/O with multiple Objects - File pointers - Disk I/O with member functions. (6)
Total L: 60

REFERENCES:
1. Bjarne Stroustrup, “The C++ Programming Language”, Addison Wesley, 2013.
2. Stanley B Lippman, Josee Lajoie, Barbara E Moo “C++ Primer”, Pearson, 2012.
3. Harvey M Deitel and Paul J Deitel, “C++ How to Program”, Prentice Hall, 2010.

14MX23 ADVANCED DATA STRUCTURES AND ALGORITHMS 3 0 2 4

INTRODUCTION: Review of fundamental data structure – Analysis of Algorithms . (4)

SEARCH TREES: Binary search trees- Operations: Insert, delete, search –implementation- Analysis. AVL trees: Definition –
Height – searching – insert, delete operations- AVL rotations – Examples. (8)

MULTI-WAY SEARCH TREES: m-way search trees – B-Tree – B+ trees - Tries – Operations: Insert, delete, retrieve- Examples.
(7)

5
GRAPHS: Definition – terminologies- Representations: Adjacency matrix, Adjacency list, – Graph search methods: Breadth first
Search; Depth first Search. (6)

DIVIDE AND CONQUER: Method – Examples – Merge sort, Binary Search – Analysis. (4)

GREEDY METHOD: Method – Examples – Minimum cost spanning tree, Kruskal’s algorithm, Prim’s algorithm. (4)

DYNAMIC PROGRAMMING: Method – Examples – All pairs shortest path problem – Traveling salesman problem. (3)

BACK TRACKING: Method – Examples – Eight queen’s problem, Hamiltonian Cycles. (3)

BRANCH AND BOUND: Method – Examples – 0/1 Knapsack. (3)

NP-HARD, NP-COMPLETE CLASSES: Basic concepts – Non-deterministic algorithms – Satisfiability problem – NP-hard and NP-
complete Problems – Cooks theorem (informal proof). (3)
Total L : 45 + P:30 = 75

REFERENCES:
1. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein “Introduction to Algorithms”,
The MIT Press, 2009.
2. Vijayalakshmi Pai G A, “Data Structures and Algorithms: Concepts, Techniques and Applications”, Tata McGraw-Hill, 2009
3. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, ‘Computer Algorithms/C++’, Orient Black Swan, 2008.
4. Ellis Horowitz and Sartaj Sahni, “Fundamental of Computer Algorithms”, Galgotia publications, 2004.
5. Sartaj Sahni, “ Data Structures, Algorithms and Application in C++”, Orient Longman, 2005.
6. Stevens S Skiena, “The Algorithm Design Manual”, Springer–verlag, London Ltd, 2008.

14MX24 DATABASE MANAGEMENT SYSTEM 4 0 0 4

INTRODUCTION: Databases – Conventional file Processing – Data Modeling for a database – Three level architecture – Data
Independence – Components of a Database Management System –characteristics-Advantages and disadvantages of a DBMS-
roles- Data base administrator-functions and responsibilities. (8)

DATAMODELS: Hierarchical- Network data model- ER model: Entity Relationship diagram – Data association - Entities-attributes,
relationships- structural constraints– Extended ER diagram Generalization – Aggregation -Composition– Mapping ER diagram to
relations– applications. (10)

RELATIONAL MODEL: Relational data model basics -Codd’s rule – properties of Relations- Domains and Key concept – Integrity
rules- Relational algebra – Relational algebra queries – Relational calculus: Tuple Relational calculus, Domain relational calculus –
Queries in Relational calculus. (6)

RELATIONAL DATABASE MANIPULATION: SQL- data types- types of SQL –static -dynamic - Embedded SQL- table-
constraints- table handing commands- records handing commands- Basic data retrieval – Condition specification –aggregate
function- order by/group by clause- sub queries-in-any-all- correlated sub queries-exists-not exists-multi table queries - SQL Join –
set operations- synonyms- sequences- views- index- SQL API- triggers. (18)

DATA BASE DESIGN THEORY: Functional dependencies - Normal forms – Normalization: 1NF to 5NF- Domain Key Normal Form
–losses join and dependency preserving decomposition – Denormalization- Data base tuning. (6)

DATABASE TRANSACTION & SECURITY: - Transaction processing- properties- security and integrity threats- security violations-
identification and authentication - discretionary access control based on grant and revoking privilege-mandatory control and role
based access control. (6)

CASE STUDIES: Inventory system-Student information system- Hospital management system. (6)
Total L: 60

REFERENCES:
1. Elmasri R and Navathe S B, “Fundamentals of Database Systems”, Pearson Education, 2010.
2. Silberschatz A, Korth H and Sudarshan S, “Database System Concepts”, McGraw-Hill, 2010.
3. Raghu Ramakrishnan and Johannes Gehrke, “Database Management System”, McGraw Hill, 2006.
4. Thomas Condly, Carolyn Begg, “Database System” Pearson Education, 2009.
5. Date C J, “An Introduction to Database Systems”, Pearson Education 2008.

14MX25 MICROPROCESSORS AND EMBEDDED SYSTEMS 3024

INTRODUCTION TO COMPUTERS, MICROCOMPUTERS AND MICROPROCESSORS: Types of Computers - How computers

and microcomputers are used – Overview of microcomputer structure and operation – Microprocessor evolution and types. (4)

6
ARCHITECTURE OF 8086: Micro-architecture –Software model – Memory address space and data organization – Data types –
Segment registers and memory segmentation – Instruction pointer – Data registers – Pointer and index registers – Status register -
Stack – Input/output address space. (6)

ASSEMBLY LANGUAGE PROGRAMMING: Assembly language program development – Instruction set – Addressing Modes –
Machine Language Coding - Assembly Language Program Development with MASM - Syntax – Assembler directives – Assembling,
linking, loading and executing programs – C, A high-level language for system programming. (10)

8086 INTERRUPTS AND INTERRUPT APPLICATIONS: Interrupts and response – Hardware interrupt applications – 8254
programmable timer/counter – 8259A priority interrupt controller – Introduction to 8279. (6)

INTRODUCTION TO EMBEDDED SYSTEMS: Embedded systems vs. general computing systems – History of embedded systems
– Classification – Major application areas – Typical Embedded System – Core of embedded system – Communication interface –
Characteristics and Quality Attributes of Embedded Systems. (6)

DESIGNING EMBEDDED SYSTEMS: 8051 architecture - Designing with 8051 microcontroller – Features of 8052 microcontroller –
Programming 8051 – Instruction set – Addressing modes - Embedded Firmware Design and Development - Design approaches –
Development languages – Programming in embedded C –Keil IDE. (8)

INTRODUCTION TO ADVANCED EMBEDDED PROCESSOR AND SOFTWARE: ARM Processor - Unified Model Language
(UML) - Real Time Operating System (RTOS). (5)
Total L: 45 + P:30 = 75

REFERENCES:
1. Douglas V Hall and SSSP Rao, “Microprocessors and its Interfacing”, McGraw Hill Education, New Delhi, 2012.
2. Walter A Triebel and Avtar Signh, “The 8088 and 8086 Microprocessors”, Pearson India, New Delhi, 2009.
3. Shibu K V, “Introduction to Embedded Systems”, Tata McGraw Hill, New Delhi, 2009.

14MX26 OBJECT ORIENTED PROGRAMMING LABORATORY 0 04 2

Experiments in the following topics

1. Function Overloading and default arguments
2. Classes and objects
3. Array of objects and dynamic data members
4. Static members and member functions
5. Constructors and destructors
6. Inheritance
7. Operator overloading
8. Virtual functions
9. Generic programming
10. Exception handling
11. Namespaces
12. File I/O
13. Memory Handling

Total P: 60

14MX27 RDBMS LABORATORY

0 0 3 1.5

Experiments in the following topics

1 Table designing with related queries.
2 Database designing with constraints for
i. functional dependency
ii. referential integrity
iii. multi-valued dependency
3 Views and indices.
4 Triggers.
5 Imposing restrictions on queries for security reasons.
6 Definition of cursors, stored procedures
7 Transaction processing
8 Front End design and connectivity with database system.
9 Application Development

Total P: 45

7
 14MX28 PROFESSIONAL COMMUNICATION
0 021

Interpersonal – Intrapersonal Communication (2)

Group Communication (2)

Meetings – Agenda and Minutes Preparation (2)

Effective Presentation Skills (2)

Writing Technical Reports – Characteristics - types (3)

Writing E-mails & Business letters –Formats-Style- language (5)

Interview Techniques (2)

PRACTICALS

Making Presentations
Group Discussions
Mock Interviews (10)

Case Study Presentation (2)

Total P : 30

REFERENCES:
1. Meenakshi Raman and Sangeeta Sharma, “Technical Communication: Principles and Practice”, Oxford University
Press, New Delhi, 2010.
2. Dhanavel S P, “English and Soft Skills”, Orient BlackSwan, Hyderabad, 2010.
3. Murphy, Herta A, Hildelrandt, Herbert W and Thomas Jane P, “Effective Business Communication”, Tata Mc-Graw Hill
Publishing Company Ltd., New Delhi, 2008.
4. Priyadarshi Patnaik, “Group Discussion and Interview Skills”, Indian Institute of Technology, Kharagpur, 2011.

SEMESTER III

14MX31 ACCOUNTING AND FINANCIAL MANAGEMENT 4 0 0 4

COST ACCOUNTING: Cost classification – Types of costs - Preparation of Cost sheet & Machine Hour Rate Calculation-simple
problems - Concept of cost volume profit analysis- simple problems- Principles of Job costing, batch costing - Process costing ,
operating costing and Activity Based Costing- Cost control Techniques. (12)

FINANCIAL ACCOUNTING: Concepts and Conventions- Double Entry Book keeping -- Books of Accounts- Preparation of
Journals, Ledger, Trial Balance, Profit and Loss Account and Balance sheet - simple problems - An outline of Accounts of Non-
Profit making organizations - Methods of depreciation. (15)

FINANCIAL RATIO ANALYSIS: Uses and Nature - preparation of Liquidity Ratios – Activity ratios- Long term solvency ratios and
Profitability Ratios from profit & Loss Account and Balance sheet. (9)

GOALS AND FUNCTIONS OF FINANCIAL MANAGEMENT: Finance function - objectives of Financial Management - organization
of the finance function – Various sources of Finance – Dividend – Determinants of Dividend Policy. (5)

PRINCIPLES OF CAPITAL BUDGETING: Kinds of capital Budgeting Decisions - Evaluation of proposals from the given cash
inflows –Payback and discounted cash Flow Techniques –Problems. (7)

8
WORKING CAPITAL MANAGEMENT: Definition and importance of working capital - factors affecting working capital - Inventory
management - simple problems - Receivables Management - cash Budget Preparation - working capital Estimation. (6)

INTERNATIONAL FINANCE: International Business methods – Exchange Rate Mechanism – Interest Rate Parity (IRP) and
Purchasing Power Parity (PPP) – Exchange Rate Risks – Currency Derivatives - Exchange Rate Calculations -Simple Problems.
(6)
Case Study - Accounting software
Total L: 60

REFERENCES:
1. Grewal and Shukla S, “Financial Accounting”, Sultan Chand Publication, 2006.
2. Sharma R K and Shashi V K Gupta, “Management Accounting– Principles of Practice”, Kalyani Publishers, 2012.
3. Jain S P and Narang K L “Cost and Management Accounting”, Kalyani Publication, 2012.
4. Pandey I M, “Financial Management” Vikas Publishing, 2012.
5. Gupta R L and Gupta V K , “Financial Accounting” Sultan Chand & Sons, 2006.
6. Jeevanandam C, “Foreign Exchange and Risk Management”, Sultan Chand, 2012.
7. Jeff Madura, “International Financial Management” South - Western College Publishing, 2011.
8. Maheswari S N, “Principles of Management Accounting”, Sultan Chand and Sons, 2012.

14MX32 JAVA PROGRAMMING 3003

INTRODUCTION : Features of Java – Java Development Environment – Java Virtual Machine- byte codes in java. Naming
conventions and data Types - Operators - Control Structures - Arrays and Strings. (6)

OBJECT ORIENTED CONCEPTS : Classes and objects- creation- access specifiers- constructors - Methods- static- Inheritance -
Composition-polymorphism -nested classes–wrapper classes- Abstract classes. (6)

PACKAGES AND INTERFACES: - Packages - Access protection - Importing packages - Interface - Defining and Implementing
Interface. (4)

EXCEPTION HANDLING: Exception types - Uncaught Exception - Using Try and Catch - Multiple catch clauses - Nested try
statements - throw - throws - Java Built-in Exception - Creating user defined exceptions- Assertions. (6)

GENERIC PROGRAMMING AND COLLECTION CLASSES: Java Collection Framework-Iterators and for each loops – Array list –
Equality and Comparison – Linked Data Structure – Hash tables – Set – Trees – Maps. (5)

INPUT/OUTPUT: Files – Stream classes – Byte Streams – Character Streams – Serialization (4)

GUI PROGRAMMING- AWT-Swing classes - Components - Labels, Buttons, Check Boxes, combo box- Controls Menus –
Frames. Event delegation model –listener and listener methods –Event classes- Applets. (6)

MULTI THREADED PROGRAMMING: Java thread model - Priorities - Synchronization - Messaging - Thread class and runnable
Interface - Synchronization - Interthread Communication. (4)

DATABASE CONNECTIVITY: Architecture – connect RDBMS – Exploring java.sql package – Implementing DML & DDL
operations. (4)
Total L: 45

REFERENCES:
1. Cay S Horstmann and Gary Cornell, “Core Java Volume I & 2”, Pearson Education, 2013.
2. Herbert Schildt, JAVA - The Complete Reference, Tata Mc-Graw Hill, 2013.
3. Deitel and Deitel, “JAVA - How to Program”, Prentice Hall International Inc, 2011.
4. Walter Slavic, “Absolute Java” Pearson Education, 2013.

14MX33 OPERATING SYSTEMS 3 0 2 4

INTRODUCTION: Operating Systems Objectives and Functions – Evolution of Operating Systems – Structure of Operating System.
(3)
MEMORY MANAGEMENT: Memory hierarchy – Linking and Loading the process – Memory Management requirement - Fixed
partitioning - Dynamic partitioning – Buddy Systems – Simple paging – Multilevel paging – Inverted paging – Simple Segmentation –
segmentation and paging. (6)

VIRTUAL MEMORY MANAGEMENT: Need for Virtual Memory management – Demand Paging - Page Fault Routine – Demand
Segmentation – Combined demand segmentation and paging - Operating systems policies. (6)

9
PROCESS DESCRIPTION AND CONTROL: Process Creation - Process states – Process Description – Process Control. Process
Scheduling: Types of Scheduling – Scheduling Criteria – Scheduling Algorithms. (9)

PROCESS SYNCHRONIZATION: Concurrent Process – Principles of Concurrency – Mutual Exclusion – Software support –
Hardware Support – Operating System Support - Deadlock - Deadlock Prevention, Avoidance and Detection and recovery. Process
And Threads: Relationship between process and threads – Thread State – Thread Synchronization – Types of Thread. (10)

I/O MANAGEMENT AND DISK SCHEDULING: Organization of I/O function – Evolution of I/O function – Types of I/O devices –
Logical Structure of I/O functions – I/O Buffering – Disk I/O – Disk Scheduling algorithms – Disk Cache. (4)

FILE MANAGEMENT: Files – File management Systems – File System Architecture – Functions of File Management – File
Directories – Secondary Storage Management – File Allocation. (4)

CASE STUDIES: Windows, Linux, and Android. (3)

Total L : 45 + P:30 = 75

REFERENCES:
1. William Stallings, “Operating Systems: Internals and Design Principles”, Prentice-Hall, 2011.
2. Silberschatz A, Galvin P and Gagne G, “Operating System Concepts” John Wiley, 2013.
3. Charles Crowely, “Operating System a Design Oriented Approach”, Tata McGraw-Hill, 2001.
4. Dhamdhere D M, “Operating Systems- A Concept Based Approach”, Tata McGraw Hill, 2008.
5. Andrew S Tanenbaum, “Modern Operating System”, Prentice Hall, 2008.

14MX34 DATA MINING 3 0 0 3

DATA MINING: Motivation -Steps in Data Mining – Architecture - Data Mining and Databases – Data Warehouses – Data Mining
functionalities – Classification – Data Mining Primitives – Major issues. (6)

DATA PREPROCESSING :Descriptive data summarization -Data Cleaning – Data integration and transformation – Data Reduction
– Data discretization and concept hierarchy generation. (7)

DATA WAREHOUSE and OLAP TECHNOLOGY: Need for Data Warehouse- multidimensional data model- Data Warehouse
architecture - Data Warehousing to Data mining. (5)

MINING FREQUENT PATTERNS, ASSOCIATIONS AND CORRELATIONS: Frequent itemsets, Association rules – Efficient and
Scalable frequent itemset mining methods – mining various kinds of Association rules. (6)

CLASSIFICATION AND PREDICTION: Issues regarding classification and prediction – Classification by Decision Tree induction –
Bayesian Classification – Rule based classification – Classification using Neural Networks Prediction – Accuracy and error
measures – Evaluating the accuracy of classifiers and predictors (7)

CLUSTER ANALYSIS: Types of data – Partitioning Methods: k means and k Medoids – Hierarchical Methods: Agglomerative and
Divisive hierarchical clustering- Outlier analysis. (5)
MINING TIME SERIES, SEQUENCE DATA: Trend analysis – similarity search – sequence patterns in transactional data bases-
sequential pattern mining: concepts and primitives . (4)

MINING TEXT, MULTIMEDIA AND THE WORLD WIDE WEB: Text data analysis and information retrieval- Dimensionality
reduction for text – text mining approaches – similarity search in multimedia data – classification and prediction analysis -mining the
web page layout structure – mining multimedia data on the web- web usage mining. (5)
Total L: 45

REFERENCES:
1. HanJiawei, Micheline Kamber and Jian Pei “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2011.
2. Soman K P, Shyam Diwakar and Ajay V,” Insight into Data Mining Theory and Practice”, PHI Learning, 2009.
3. Arun K Pujari, “Data Mining Techniques”, University Press, 2013.

14MX35 PRINCIPLES OF COMPILER DESIGN 3024

INTRODUCTION: Programming languages - language processing system - structure of a compiler – phases of a compiler -
compiler writing tools. (4)

LEXICAL ANALYSIS : Role of a lexical analyzer – finite automata –regular expressions to finite automata – minimizing the number
of states of a deterministic finite automata – implementation of a lexical analyzer – symbol table management – introduction to Lex.
(8)

10
PARSING TECHNIQUES : Context free grammars – derivations and parse trees – ambiguity – capabilities of context free
grammars. Top down and Bottom up parsing: Shift reduce parsing – Operator Precedence parsing – Recursive descent parsing –
Predictive parsing. (10)

AUTOMATIC PARSING TECHNIQUES: LR parsers – canonical collection of LR (0) items – construction of SLR parsing tables –
Construction of canonical LR parsing Table Parser- syntax error handling – recovery strategies - introduction to YAAC. (8)

INTERMEDIATE CODE GENERATION: Postfix notation – Three address code - Quadruples, triples , indirect triples – Syntax
directed translation schemes - Intermediate code generation for assignment statements, Boolean expressions, Control statements:
If-then-else, while loop, for loop. (9)

CODE OPTIMIZATION AND GENERATION: Code optimization techniques – basic blocks – flow graphs - DAG representation –
error detection and recovery - code generation. (6)
Total L : 45 + P:30 = 75

REFERENCES:
1. Aho A V, Monica S Lam, Sethi R and Ullman J D, “Compilers Principles, Techniques and Tools”, Addison Wesley, 2013.
2. Cooper K D and Torczon L, “Engineering a Compiler”, Elsevier, 2008.
3. Dhamdhere D M, “Compiler Construction”, Macmillan Publishers India, 2000

14MX36 JAVA PROGRAMMING LABORATORY 0 0 3 1.5

Experiments in the following topics:

1. Arrays and strings
2. Polymorphism.
3. Abstract Class
4. Inheritance
5. Collection Framework.
6. Interface and Package
7. Exception Handing .
8. File handing.
9. GUI application( swing/ awt).
10. Multithreading.
11. Application Development.

Total P: 45

14MX37 DATA MINING LABORATORY 0 0 3 1.5

Experiments in the following topics:

1 Exploring R and WEKA

2 Statistical analyses of data using R
3 Data Preprocessing Techniques using R
4 Partition based and Hierarchical Clustering Algorithms in R and WEKA
5 Application of Regression based prediction to real world problems using R
6 Implementation of decision tree based classifier using WEKA
7 Implementation of Bayesian classifier using WEKA
8 Association rule mining using WEKA
9 Implementation of techniques demonstrative of text mining
10 Implementation of techniques demonstrative of web mining

Total P: 45

14MX38 .NET PROGRAMMING LABORATORY 1022

INTRODUCTION TO .NET FRAMEWORK: MSIL - Common Language Runtime (CLR), the .NET Framework class library (FCL),
Common Type System. (2)

C# FUNDAMENTALS: Basic classes, declarations, conditionals, loops, arrays, strings, enumerations, structures, Classes and
Objects, Access Modifiers, Abstract Classes, Virtual Members, Static Classes, Sealed Classes, Partial Classes, Reference Types.
(4)

11
WINDOWS FORMS: Console Applications, Introduction to Windows Form, Form Controls, User Define Controls, component class,
control class, control events – MVC Pattern. (3)

ASP.NET APPLICATIONS: ASP.NET Web Forms, Validation and Advanced Controls, Master Pages, Profiles and Themes,
Custom controls, Data Source Controls, ADO.Net Classes, Web Services and Web Security: Login system for web access. (6)

Experiments in the following topics

1. Create Console applications.

2. Develop Windows applications.
3. Working with ASP.Net Forms and Controls.
4. Develop ASP.NET web applications.
5. Construct web application to connect and access database tables.
6. Create custom user control in web applications.
7. Create login system for web access security.
8. .NET Assembly Creation and Deployment

Total=L: 15+P: 30=45

REFERENCES:
1. Herbert Schildt “The Complete Reference C# 4.0”, Tata McGraw-Hill, 2010
2. Stephen Walther, c,namfKcH oocS iiveKhae2. Kce S eof K,craPPc,”dHhs elcUc4KTae.Pa “ eoacH ooccS at,c.

SEMESTER IV

14MX41 UNIX ARCHITECTURE AND PROGRAMMING 4 0 0 4

UNIX ARCHITECTURE: Overview of Unix structure – Distribution of unix (4)

SHELL PROGRAMMING: Essential Commands - General Purpose Utilities - Bourne Shell - Simple Filters – Advanced filters -
Process Commands - Communication and Scheduling Commands - Programming with Shell. (15)

FILE SYSTEM STRUCTURE: Kernel architecture - Kernel data structure - Buffer Cache - Structure of Buffer pool - Scenarios for
buffer retrieval - Reading and Writing disk blocks - Advantages and Disadvantages of buffer cache - Inode - Structure of regular file -
Conversion of a pathname to an inode - Inode assignment to a new file - allocation of disk blocks. (17)

PROCESS SYSTEM: Process states and transitions - Context of a process - Saving the context of a process - Manipulating
Process address space - Process creation and termination – Signals – Awaiting process termination - System Boot and INIT
process - Process Scheduling. (14)

MEMORY MANAGEMENT: Swapping - allocation of swap space – swapping process out – swapping process in – Demand paging
- Data structures of demand paging - Page stealer Process - page aging and fault . (8)

CASE STUDY: Variants of Unix. (2)

Total L: 60

REFERENCES:
1. Maurice J Bach, “Design of the UNIX Operating System”, Prentice Hall of India, 2007.
2. Uresh Vahalia, “UNIX Internals: The New Frontiers”, Pearson Education, 2008.
3. Sumitabha Das, “Your Unix the Ultimate Guide”, Tata McGraw-Hill, 2005.
4. Richard F Gilberg, Behrouz A Forouzan, “Unix and Shell Programming – A Text Book”, Thomson Learning, 2003.
5. Keith Haviland, Dina Gray, “Unix System Programming”, Addison-Wesley, 1998.

14MX42 ENTERPRISE COMPUTING 4 0 0 4

ENTERPRISE FOUNDATIONS: Enterprise software characteristics – options - Enterprise Architectural overview – object oriented
software development for enterprise - Component Based software development for enterprise. Java Enterprise System- XML for
Enterprise Computing. (5)

ENTERPRISE DATA ENABLING: Enterprise Data - Basis of JDBC, Drivers, Connection, Statement, Result Set, AdvancedJDBC
features, Distributed transactions . Other approaches for persistence. (10)

ENTERPRISE WEB ENABLING: Web Browsers and Web Servers in Enterprise-Web Programming, Java Servlets - Java Server
pages, JSTL. JSF, State and session management. (10)

12
ENTERPRISE APPLICATION ENABLING : Enterprise Java Beans, Stateless Session Beans, Stateful Session Beans, Message
Driven Beans, Entity beans , Accessing and integrating EJBs. (15)

DISTRIBUTED ENTERPRISE COMMUNICATIONS ENABLING: Distributed Enterprise Communications Basis – distributed object
middleware – synchronous and Communications . (10)

CASE STUDIES: Development of Enterprise software for Hospital, University and manufacturing firm. Usage of frameworks for
software development. (10)

Total L: 60
REFERENCES:
1. Kogent Solutions Inc. “Java Server Programming” Dreamtech Press, 2008.
2. Paul J Perrone, Venkata S R, Krishna R and Chayanti, " Building Java Enterprise Systems with J2EE", Techmedia, 2000.
3. Eric Jendrock, Jennifer Ball, Debbie Carson, Ian Evans, Scott Fordin and Kim Haase “The Java EE 5 Tutorial”, Addison
Wesley, 2006.
4. Bill Burke and Richard Monson Haefel, “Enterprise Java Beans 3.0” O’Reily, 2006.
5. Raghu R Kodali, Jonathan R Wetherbee and Peter Zadrozny, “Beginning EJB 3 Application Development”, Apress, 2006.

14MX43 COMPUTER NETWORKS 4 0 0 4

INTRODUCTION: Need and Classification of Computer Networks – Requirements – Network Architecture - Network Topologies –
Implementing network software – performance of network (4)

PHYSICAL LAYER: Transmission Media – Signal Characteristics - Physical links and transmission media – Signal encoding
techniques - Channel access techniques – SDM-TDM – FDM. (6)

DATA LINK CONTROL : Link Layer Services – Framing – Error Control – Reliable Transmission – Media Access Control –
CSMA/CD – CSMA/CA – Ethernet and Multiple Access Networks (802,3) – Wireless Networks(802.11) – Bluetooth – MACA. (10)

ERROR DETECTION AND CORRECTION : Types of Errors- Single Bit and Multiple bit errors- VRC – LRC – CRC- Checksum –
Hamming Code (6)

INTERNETWORKING : switching – bridging – Interconnecting devices – repeaters, hubs, switches- Addressing – Ipv4 Addressing –
Subnetting – Classless IP addressing – Address Translation – Host Configuration – Error Reporting- Routing in Internet - Intra-
domain routing – Inter-domain Routing – RIP, OSPF, BGP - Ipv6 – Multicasting – MPLS – Mobile IP and routing. (12)

CONGESTION CONTROL AND RESOURCE ALLOCATION: Issues in resource allocation – Queueing disciplines – TCP
Congestion Control – Congestion Avoidance mechanism (6)

END-TO-END PROTOCOLS – Transport Services – Elements of Transport Protocols – UDP – Connection oriented, Reliable
service – TCP – Connection establishment – Connection Termination – Data Transfer. (6)

APPLICATIONS : Traditional Applications – E_Mail , WWW – Multimedia Applications – Session Control and Call Control –
Infrastructure Services – Name Services , Network Management services – Overlay Networks – Routing overlays, Peer-to-peer
networks ,Content Distribution networks. (10)
Total L: 60

REFERENCES:
1. Larry L Peterson and Bruce S Davie “Computer Networks: A systems approach”, Morgan Kaufmann Publishers, 2011.
2. Behrouz A Forouzan, Sophia Chung Fegan,“TCP/ IP Protocol Suite”, Tata McGraw-Hill, 2009.
3. Comer E, "Internetworking with TCP/IP, Principles Protocols and Architecture", Prentice Hall, 2006.
4. Andrew S Tanenbaum, David J Wetherall “Computer Networks”, Pearson Education, 2012.
5. James F Kurose, Keith W Ross, ”Computer Networking – A Top-Down Approach Featuring the Internet”, Pearson Education,
2012.

14MX44 SOFTWARE ENGINEERING METHODOLOGIES 4004

INTRODUCTION: Software Characteristics-Comparison with other Engineering disciplines-Software Crisis and Myths-Software life
cycle models-Selection of process models for projects- Agile methods- Software Engineering paradigms. (8)

REQUIREMENTS GATHERING: Requirements gathering tasks – Requirements Engineering Process - Qualities of good
requirements-Types of Requirements-Requirements elicitation- Requirements documentation- Analysis Documentation. (8)

13
FUNCTIONAL ORIENTED APPROACH : Functional Decomposition-Context diagram-Data low diagrams-Data Dictionary-
Functional Independence-Modular Design-Coupling-Cohesion- Design tools – Structured Chart, HIPO Diagram, Decision Tree,
Decision Table, Pseudo code – User Interface Design - Software Design Documentation (12)

OBJECT ORIENTED APPROACH : Objects and Classes-Object Identification-Relationship among objects-classification-Use

cases-UML Diagrams to support Object Oriented Analysis and Design. (16)

PROGRAMMING STANDARDS AND CODING: Structured programming coding standards-Maintainability of code. (4)

SOFTWARE TESTING FUNDAMENTALS – Black-Box and White-Box testing – Basis Path testing – Requirements phase testing
- Design phase testing - Program phase testing - Desk debugging and program peer view test tools - Evaluating test results -
Installation phase testing - Acceptance testing – Testing GUI – Testing Web Applications (8)

DEBUGGING : The art of Debugging – Debugging Process – Debugging Strategies. (4)

Total L: 60

REFERENCES:
1. Roger Pressman S, “Software Engineering: A Practitioner’s Approach”, Tata McGraw-Hill, New Delhi, 2010.
2. Ian Sommerville, “Software Engineering”, Pearson Education, 2010.
3. James Peter and Pedrycz W, “Software Engineering: An Engineering Approach”, John Wiley & Sons, 2007.
4. Craig Larman, “Applying UML and Pattern: An Introduction to Object-Oriented Analysis and Design – Iterative Development”,
Prentice Hall, 2004.
5. James Rumbaugh, Ivar Jacobson and Grady Booch, “The Unified Modeling Language Reference Manual”, Pearson, India,
2009.
6. Glenford J Myers, Tom Badgelt, Todd M Thomas and Corey Sandler, “The art of Software Testing”, John Wiley, 2004.

14MX46 UNIX AND NETWORKS PROGRAMMING LABORATORY 0 0 5 2.5

1. Simple Bash shell Programs with basic Unix Commands – General Purpose Utilities, Filters, Process and Communication.
2. Bash Shell Programs using advanced programming concepts.
3. Low level File, Process and IPC System Calls using C
Implement a package using Shell Programming / System Calls

COMPUTER NETWORKS LAB EXPERIMENTS:

1. Read a 4 bit binary number and hence find the 7 bit Hamming code to facilitate a single bit error correction.
2. Read a Binary string corresponding to the Message to be transmitted, and another binary string, corresponding to generator
Polynomial and hence generate the CRC check sum.
3. Implement Sliding Window Protocol.
4. Read a binary string corresponding to an HDLC frame, and bit-stuff, if needed, and identify the frame to be transmitted.
5. Read an IP Address in dotted notation, and hence, find out its network IP Address, with the help of a suitable mask.
6. Create a TCP socket between a server and a client and authenticate the user.
7. Implement a chat session using Socket Programming.
8. Implement the following
 Simple Chat Program using TCP Sockets
 Sliding Window Protocol using TCP Sockets
 DNS using UDP Sockets
 Ping using Raw Sockets
 HTTP Protocol using TCP Sockets
9. Study of Network Analyzer Tools
10. Implement Distance vector Routing Algorithm.
11. Design a DNS server, and resolve a Domain Name from a Client’s request.
Total P: 75

14MX47 ENTERPRISE COMPUTING LABORATORY 0 0 3 1.5

Experiments in the following topics:

1. Multi-tier software
2. Enterprise software development and deployment
3. Web Programming using servlets / JSP
4. Distributed object programming using synchronous, asynchronous communication and Web Services
5. Enterprise Application using session and entity EJB
6. Use of Struts, Hibernate and Spring for software development

14
 Total P: 45

14MX48 SOFTWARE ENGINEERING LABORATORY 0 0 2 1

Experiments in the following topics:

1. Implementation of requirement analysis process using the appropriate tool

2. Implementation of Estimation Techniques
3. Preparation of Analysis models using appropriate tool.
4. Preparation of SRS document for a system.
5. Implement of suitable design using the appropriate tool.
6. Preparation of Design document for the system considered in (2)
7. Writing of code following coding standards.
8. Automatic generation of code using appropriate tool
9. Testing Exercises.
10. Implementation of debugging process using the appropriate tool
Total P: 30

SEMESTER V

14MX51 SOFTWARE PROJECT MANAGEMENT 3024

INTRODUCTION: Software Projects various other types of projects - Problems with software projects - an overview of project
planning - Project evaluation - Project Analysis and technical planning - Project estimates - Preparation of Estimates - COCOMO
model - Function Point Analysis - Putnam Model - Non-development overheads. (8)

ACTIVITY PLANNING: Project schedules - Sequencing and scheduling projects - Network planning models - Shortening project
duration - Identifying critical activities. (9)

RISK MANAGEMENT: Resource allocation - Monitoring and Control - Managing people and organizing teams - Planning for small
projects - Handling large projects - Divide and Conquer - Software Project survival. (8)

SOFTWARE CONFIGURATION MANAGEMENT: Basic functions, responsibilities, standards, configuration Management,

Prototyping - Models of prototyping. (8)

SOFTWARE QUALITY ASSURANCE: Quality and the quality system - standards and procedures - Technical activities –
components - Continuous Improvement - Software Tasks - Management responsibility - Quality System - Contract Review -
Document Control - Product identification and trace ability. (9)

CASE STUDY: Using Project management tools. (3)

Total L : 45 + P:30 = 75

REFERENCES:
1. Mike Cotterell and Bob Hughes, “Software Project Management”, Tata McGraw-Hill, 2010.
2. Robert K Wysocki, Robert Beck Jr and David B Crane, “Effective Project Management , Traditional, Agile, Extreme”,
John Wiley & Sons Inc, 2011.
3. Pressman R S, “Software Engineering - A Practitioner’s Approach”, Tata McGraw-Hill Book Company, 2010.
4. Darrel Ince, “An Introduction to Software Quality Assurance and its Implementation”, Mc-Graw Hill Book Company Ltd, 2002.

14MX52 SERVICE ORIENTED ARCHITECTURE AND WEB SERVICES. 3 0 0 3

INTRODUCTION : Business Computing – Globalization and development of enterprise computing. Inventory of Distributed
computing - Service Orientation – Loose Coupling – Granularity - Scope variance. Software Architectures – Service oriented
architecture – benefits – Obstacles and roadmap for SOA. Service orientation, Object and Component orientation - Comparison -
Basic SOA Architecture concepts- Key Service characteristics-Technical and Business Benefits. (10)

COMBINING SOA AND WEB SERVICES : XML Technologies– XML – DTD – XSD. Web Services Basis - Web Services versus
SOA. Service Discoverability - Universal Description Discovery and Integration – Programming UDDI – UDDI Data Model – UDDI
SOAP APIs – Inquiry APIs – Publisher APIs. Service Description and Look up - Web Service Definition Language – Defining

15
Message data types – Defining Operations on Messages –WSDL documents usage Scenarios. Service Interactions– Simple Object
Access Protocol – SOAP Specification – SOAP Message processing – SOAP use of Namespaces – SOAP Multipart MIME
attachments. SOAP binding. State management and Security in Web Services. Web Service standards and extensions (15)

BUSINESS PROCESS MANAGEMENT AND MULTI CHANNEL ACCESS : Basic Business process management Concepts –
examples – Business modeling – options - Basis of workflow - atomic services and composite services Service orchestration and
Choreography – Business Process Execution Language. –Business process reengineering and management- Combining BPM –
SOA – Web Services.. Web Service Composition-BPEL-RESTFUL Services-comparison of BPEL and RESTFUL Services. SOA for
Multi-Channel Access-Business Benefits-Tiers- (8)

WEB SERVICES SECURITY AND TRANSACTION : Meta Data Management-Advanced Messaging- Addressing – Reliable
Messaging– Policies-WS-Policy– Security- WS-Security–Transaction Management (7)

CASE STUDIES: Inter-Enterprise applications like Insurance Claim processing - Credit Card based online transaction – Direct to
Home Services. SOA and Web services in J2EE and .Net Platform. (5)
Total L: 45

REFERENCES :
1. Eric Newcomer and Lomow, “Understanding SOA with Web Services”, Pearson Education, 2009.
2. Dirk Krafzig, Karl Banke and Dirk Slama, “Enterprise SOA, Service oriented architectures best practices”, Prentice Hall, 2008.
3. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services”, Pearson Education, 2007.
4. Thomas Erl, “Service Oriented Architecture (SOA): Concepts, Technology and Design”, Prentice Hall, 2005.
5. Dan Woods and Thomas Mattern, “Enterprise SOA Designing IT for Business Innovation” O’REILLY, 2006.

14MX56 SERVICE ORIENTED COMPUTING LABORATORY 0 0 3 1.5

EXPERIMENTS / PACAKAGE IN THE FOLLOWING TOPICS

1. XML and XML Schema
2. Parsing document using DOM and SAX parsers
3. Simple Object Access Protocol Messages
4. Web Services in Java and .Net
5. Web service Composition and Transaction
6. Business process modeling using BPEL and /BPMN
7. Web Service Security
8. Mobile Web Services.
Total P: 45

VI SEMESTER

Project Work
Total P: 24

ELECTIVES

NETWORK SYSTEM AND TECHNOLOGIES

14MXAA NETWORK MANAGEMENT 3 0 2 4

NETWORK MANAGEMENT ARCHITECTURES & APPLICATIONS: Management Standards and Models - Network Management
Functions - Configuration Management & Auto-discovery - Configuration Database & Reports - Abstract Syntax Notation One
(ASN.1) (6)

SNMP : SNMP v1 - Structure of Management Information -Std. Management Information Base (MIBs) -SNMPv1 Protocol –Network
Management Functions (6)

FAULT MANAGEMENT: Fault Identification and Isolation - Event Correlation Techniques - SNMP v2 - Version 2 Protocol
Specification - Version 2 MIB Enhancements -MIB-II - SNMP v3 - Version 3 Protocol & MIB - Network Management Functions. (7)

16
SECURITY MANAGEMENT: Functions - Protecting Sensitive Information - Host and User Authentication - Key Management – User
Based Security Model - View Based Access Model. (5)

ACCOUNTING MANAGEMENT: Performance Management - Network Usage, Metrics and Quotas. (3)

REMOTE NETWORK MONITORING: RMON 1 - Statistics Collection - Alarms and Filters - Remote Network Monitoring RMON 2 -
Monitoring Network Protocol Traffic. (6)

MANAGEMENT TOOLS: Application-Layer Visibility - Management Tools, Systems and Applications -Test and Monitoring Tools -
Integrating Tools - Development Tools - Web-based Enterprise Management - XML based network management – Distributed
Network Management – NMS software features and Design. (7)

DHCP: DHCP configuration - Implementing DHCP -Managing and Monitoring DHCP - Implementing Name Resolution Using DNS -
Managing and Monitoring DNS - Implementing and Managing Software Update Services. (5)
Total L : 45 + P:30 = 75

REFERENCES:
1. William Stallings, “SNMP, SNMPv2, SNMPv3 and RMON 1 and 2”, Addison Wesley, 1999.
2. Comer D E, “Internetworking with TCP/IP Vol- III”, (BSD Sockets Version), Prentice Hall of India, 2003.
3. David Zelsterman, “A practical guide to SNMPv3 Network Management”, Prentice Hall, 1999.

14MXAB WIRELESS NETWORKS 3024

INTRODUCTION: Evolution of wireless networks-overview of various wireless networks. (3)

WIRELESS FUNDAMENTALS: Spectrum Allocations – Propagation Modeling – Modern Communications Systems – Multiple
Access – Cellular and Ad-hoc-Concepts. (7)

WLAN TECHNOLOGIES: System Architecture – 802.11 PHYs – 802.11 MAC – WPA and 802.11i: Security – 802.11e: MAC
Enhancements for Quality of Service – Related Wireless Standards (Hyperlan, HomeRF, Bluetooth, Zigbee, Wireless USB). (7)

AD HOC AND SENSOR NETWORKS: Ad hoc Networks- Issues in Ad hoc wireless Networks, Applications , Sensor Networks –
Introduction- unique constraints and challenges- Network Architecture- Advantages and Applications of Sensor Network. – Network
Simulator . (10)

WLAN DEPLOYMENT ISSUES: Interference – Resource Allocation – Network Planning, Deployment and Analysis – Performance
Tuning – Network Monitoring. (9)

WLAN Related Technologies – 802.11 Trends – 802.16 – 802.20 – 802.22 – UWB, Cognitive Radios, RFID (9)
Total L : 45 + P:30 = 75

REFERENCES:
1. Steve Rackley, “Wireless Networking Technology”, Newnes, 2007.
2. Papadimitriou G I, Pomportsis A S, Nicopolitidis P, and Obaidat M S, “Wireless Networks”, John Wiley and Sons, 2004
3. Matthew Gast, “802.11 @ Wireless Networks: The Definitve Guide”, O’ Reilly, 2002.
4. Siva Ram Murthy C and Manoj B S “Ad hoc Wireless Networks Architecture and Protocols”, Pearson Education, 2008
5. Feng Zhao and Leonidas Guibas, “Wireless Sensor Networks-An Information Processing Approach”, Elsevier, 2009.
6. William Stallings, “Wireless Communication and Networks”, Prentice Hall of India, 2009.

14MXAC SECURITY IN COMPUTING 3 0 2 4

INTRODUCTION: Security Goals –Security Services- Security Attacks-Cryptographic tools- Classical Cryptosystem (Substitution
and Transposition ciphers. (5)

SYMMETRIC KEY ENCRYPTION : Conventional Encryption Model - Stream ciphers – Block ciphers –Modes of Operation- Data
Encryption Standard (DES)–Linear and Differential Cryptanalysis - Advanced Encryption Standard(AES) - RC4 – Attacks on Cipher
text. (8)

PUBLIC KEY ENCRYPTION ALGORITHMS: Public-key encryption Model (Secrecy & Authentication) - RSA – ElGamal
Cryptosystem- Elliptic Curve Cryptosystem (ECC) -Security of RSA – The Integer Factorization Problem - Pollard’s rho factoring
algorithm – The Discrete Logarithm Problem: Baby-step giant-step algorithm (10)

17
KEY GENERATION AND DISTRIBUTION: Random Key Generation - Manual Key distribution – Key distribution centers – Diffie–
Hellmann Key Exchange -Randomness - ANSI X9.17 generator - Linear Feedback Shift Registrars (LFSR) (6)

DIGITAL SIGNATURES AND HASH ALGORITHMS: Message Digest Algorithm (MD5)- General Structure of Hash function –
Secure Hash Algorithm (SHA – 1) – Signature using RSA - Digital Signature Algorithm (DSA) (6)

SECURITY AT LAYERS: Application Layer Security : E- Mail Security- Pretty Good Privacy (PGP) – PGP certificates- Transport
Layer security : Transport and Tunnel Modes – Secure Sockets Layer (SSL) Architecture and Protocol Network Layer Security
:Network Security Controls - IP Security- IP Sec- modes. (8)

LEGAL ISSUES IN COMPUTER SECURITY: Protecting Programs and Data – Rights of Employees and Employers – Computer
Crime., Digital Rights Management( DRM) (2)
Total L : 45 + P:30 = 75

REFERENCES:
1. Behrouz A Fououzan, “Cryptograhy & Network Security”, Tata McGraw Hill, 2007.
2. William Stallings, “Cryptography and Network Security – Principles and Practice”, Pearson Educational, 2013.
3. Josef Pieprzyk, Thomas Hardjono and Jennifer Sebery, “Fundamentals of Computer Security”, Springer, 2002.
4. Bruce Schneier, “Applied Cryptography”, John Wiley, 2008.
5. Charles P Pfleeger and Shari Pfleeger, “Security in Computing”, Pearson Education, 2009.

14MXAD CLOUD COMPUTING 3 0 2 4

INTRODUCTION TO PARALLEL AND DISTRIBUTED COMPUTING: Software as a Service (SaaS)- Virtualization-Parallelization.

(6)
ADVANCED WEB TECHNOLOGIES: AJAX and Mashup. (4)

CLOUD COMPUTING : Definition, History, Comparison of Cloud Computing with Grid, Cluster and Utility Computing, Pros and
Cons of Cloud Computing. (4)

VIRUTUALIZATION : Types of Virtualization, Tools for Virtualization, Architecture of VMM, Virtualization for Cloud. (5)

MAP REDUCE PARADIGMS: Introduction, GFS Architecture, HDFS Architecture, Hbase, Google big Table, Amazon’s (key value)
pair storage and Microsoft’s Azure infrastructure, Map reduce programming examples. (10)

CLOUD COMPUTING FRAMEWORK: Amazon EC3, S3 storage revises, Aneka frame work, IBM blue Cloud. (8)

APPLICATIONS: Distributed search engine and distributed data mining in the cloud. (8)
Total L : 45 + P:30 = 75

REFERENCES:
1. Liu M L, “Distributed Computing Principles and Applications”, Pearson Education, New Delhi, 2012
2. Ajay D Kshemkalyani, “Distributed Computing: Principles, Algorithms, and Systems”, Cambridge University Press, 2013.
3. Rajkumar Buyya, James Broberg and Andrzej M Goscinski “Cloud Computing: Principles and Paradigms” Wiley Press, 2011.
4. Barrie Sosinsky, “Cloud Computing Bible”, Wiley India Pvt. Ltd, 2011.
5. Dean J and Ghemawat S, “Map Reduce: Simplified Data Processing on Large Clusters” OSDI, 2004.
6. Venkata Josyula, Malcolm Orr and Greg Page, “Cloud Computing Automating the Virtualized Data Center”, Cisco press, 2012.

14MXAE PERVASIVE COMPUTING 3 0 2 4

INTRODUCTION: Pervasive Computing – Principles – Pervasive Computing Applications – Pervasive Information Technology –
Pervasive Information Access Devices – Smart Identification, Smart card, labels, tokens – Embedded Controls, Smart Sensors,
Actuators, Appliances, Home Networking, Entertainment – Pervasive Application Development Software – Operating System,
Windows CE, Palm OS, Symbian OS, Java Card – Middleware – Security – Connecting the World, WWAN, SRWC, DECT,
Bluetooth, IrDA – Mobile Internet – Internet Protocols. (8)

PERVASIVE APPLICATION DEVELOPMENT: Approaches for Developing Pervasive Applications – Developing Mobile
Applications – Presentation Transcoding – Device Independent View Component – Heterogeneity of Device Platforms – Dynamics
of Application Environment – ISAM Application Model – ISAM Architecture – Context Awareness and Mobility to Building Pervasive
Applications. (8)

LOCATION MANAGEMENT: Introduction to Location Management – DNS Server, Server Process, Client Process – Location
Update – Location Inquiry – Location Management Cost – Network Topology – Mobility Pattern, Memory Less Movement Model,

18
Markovian Model, Shortest Distance Model, Gauss-Markov Model, Activity Based Model, Mobility Trace, Fluid-Flow Model, Gravity
Model. (9)

LOCATION UPDATES AND LOCATING MOVING OBJECTS: Location Update Strategies, Always update, Never-Update, Time
Based, Movement Based, Distance Based Update Strategies – Architecture of Location Directories, Two-Tier Scheme, Hierarchical
Scheme – Optimization of the Architecture – Taxonomy and Location Management Techniques – Case Studies. (10)

LOCATION BASED SERVICES: Research on Location Based Services – Location Relatedness and the Query Model - Location
Dependent Data – Location Aware Queries – Location Dependent Queries – Moving Object Database Queries – Query
Classification – Query Translation Steps in LDQ Processing – Case Studies. (10)
Total L : 45 + P:30 = 75

REFERENCES:
1. Mohammad Ilyas and Imad Mahgoub, “Mobile Computing Handbook”, Auerbach Publications, 2005.
2. Horst Henn, Jochen Burkhardt and Thomas Schack, “Pervasive Computing”, Pearson Education, 2009.
3. Uwe Hansmann, Martin S Nicklous and Thomas Stoper, “Pervasive Computing Handbook”, Springer-Verlag, 2001.
4. Uwe Hansmann, Martin S. Nicklous and Thomas Stoper, “Principles of Mobile Computing”, Springer-Verlag, 2001

14MXAF MOBILE COMPUTING 3 0 2 4

INTRODUCTION: Introduction to wireless networking, Advantages and disadvantages of wireless networking, Evolution of mobile
communication generations – Wireless LAN and Wireless WAN - Mobile devices Profiles (4)

CELLULAR CONCEPT: Wireless transmission - Frequencies for radio transmission - Regulations - Signals , Signal propagation
,Path loss of radio signals , Additional signal propagation effects - Multi-path propagation - Multiplexing – Cellular Systems –
Frequency Reuse – Problems with MAC in cellular systems – MACA – CDMA (6)

MOBILE NETWORK INFRASTRUCTURE - GSM - Mobile services - System architecture -- Handover – GPRS – Mobile services
– System Architecture – WAP protocol stack – WAE- BlueTooth – Piconet,scaternet. (8)

MOBILE APPLICATIONS ARCHITECTURE : Wireless Internet – Wireless Internet Architecture – Smart Client – Smart Client
Architecture – Messaging Architecture – Sample Applications – Characteristics and benefits – Application Model - Infrastructure
and Managing Resources – Mobile Software Engineering – Frameworks and Tools (3)

PLATFORM FOR APPLICATION DEVELOPMENT : Palm OS – Symbian OS – Windows CE – Android - user interface - Generic
UI Development – VUIs and Mobile Applications – Text to Speech techniques – Designing the right UI – Multimodal and
Multichannel UI – Gesture based UIs – Screen Elements and Layouts – Voice XML – Java API. (6)

APPLICATION DEVELOPMENT: Overview of Android – Devices Running Android – Why for Android – Features of Android –
Architecture, Libraries – SDK – Views and View groups – layouts – Menus - Intents and services – Adapters – Using Internet
Resources – Dialogs – Capturing Date and Time – Validation – File System in android – File management - Developing Location
based applications – Creating map based activities - Packaging and Deployment - Security and Hacking - Android Application
Architecture - Event based programming - Event handling and Graphics services - Layer Animation – Android Instant
Messaging – Gtalk Service – Managing Chat sessions – Sending and receiving data messages - SMS (15)

SQLite: Overview – Creating database – Editing tasks – cursors and content values (3)
Total L : 45 + P:30 = 75

REFERENCES:
1. Martyn Mallick, “Mobile and Wireless design essentials” Wiley Publishing Inc, 2008.
2. Jochen Schiller, “Mobile Communications”, Addison-Wesley, 2003.
3. Zigurd Mednieks, Laird Dornin G, Blake Meike and Masumi Nakamura, “Programming Android”, O‟Reilly, 2011.
4. Reto Meier and Wrox Wiley, “Professional Android 2 Application Development”, 2010.
5. Hansmann, Merk, Nicklous and Stober, “Principles of Mobile Computing”, Springer, 2003.

14MXAG NETWORK SECURITY 3024

INTRODUCTION: Security problem in computing - Principles of Security – Types of Attacks – Defense methods. (4)

CONVENTIONAL ENCRYPTION ALGORITHMS: Conventional Encryption Model - Stream ciphers – Block ciphers – Data
Encryption Standard – RC4 - Encryption vulnerabilities – Reply attacks – Rewrite attacks – Convert Signaling Attacks. (6)

19
PUBLIC KEY ENCRYPTION ALGORITHMS: Diffie Hellman Key Exchange - Merkle – Hellmann knapsack encryption- RSA
- Elliptic Curve Cryptography –Hashing techniques- SHA-HMAC – Digital Signatures- DSS, Digital Signature Algorithm. (8)

NETWORK SECURITY & APPLICATIONS : Intruders and Intrusion – Viruses and Worms – Firewalls – Design Principles – Packet
Filtering – Application gateways – Trusted systems Authentication Applications: Kerberos – Electronic Mail Security: Pretty Good
Privacy (PGP) - IP Security: IP Security Architecture – Transport and Tunnel Modes – Encapsulating security payload – Web
Security: Secure Sockets Layer (SSL). (12)

SYSTEM SECURITY AND ISSUES: Security involving programs and operating systems - operating system controls in use of
programs- administration controls –– file protection mechanism – user authentication - Network security issues – Encryption in
networking – Access control – User Authentication – Local Area Networks – Multilevel security of network. (9)

SECURITY STANDARDS: IEEE, RSA and ISO standards-Blueprint for Security – Design of Security Architecture. (6)
Total L : 45 + P:30 = 75
REFERENCES:
1. William Stallings, “Network Security Essentials, Applications and Standards”, Dorling Kindersley I P Ltd, Delhi, 2008.
2. William Stallings, “Cryptography and Network Security - Principles and Practice”, Pearson Education, Delhi, 2007.
3. Behrouz A Forouzan, “Cryptography and Network Security”, Tata McGraw Hill Ltd, New Delhi, 2008.
4. Atul Kahate, “Cryptography and Network Security” Tata McGraw Hill Ltd, New Delhi, 2008.

14MXAH COMPUTER FORENSICS

3024

INTRODUCTION: Fundamentals – Types – Acquire the Evidence – Authenticate the evidence – Analysis – Internet Fundamentals –
Tracking Email – NETBIOS – Third Party programs – Web resources for researching Internet Inhabitants. (6)

FORENSICS EVIDENCE AND CAPTURE: Data Recovery – Evidence Collection and Data Seizure – Duplication and Preservation
of Digital Evidence – Computer Image Verification and Authentication. (10)

COMPUTER FORENSICS ANALYSIS: Discovery of Electronic Evidence – Identify of data – Reconstructing past Events –
Advanced Tools. (7)

LAW AND ETHICS: Software Forensics in Court – Legal Systems – Evidence – Ethics – Computer Virus and Malware Concept –
Programming Culture and Indicators – Stylistic Analysis and Linguistic Forensics. (10)

ADVANCED COMPUTER FORENSICS: Advance Encryption– Advance Hacking -Trackers and Hackers –Source Addresses –
Examples. (6)

CASE STUDY: Computer Forensic Needs and Challenges – Investigating Window Computers – Unix for Forensic Examiners. (6)

Total L: 45 + P:30 =75

REFERENCES:
1. Jay G Heiser and Warren G Kruse, “Computer Forensics: Incident Response Essentials”, Addison Wesley, New Delhi, 2010.
2. Robert M Slade, “Software Forensics: Collecting Evidence from the scene of a Digital Crime”, Tata McGraw Hill, New Delhi,
2011.
3. John R Vacca, “Computer Forensics: Computer Crime Scene Investigation”. Firewall Media, New Delhi, 2005.

WEB SERVICES AND TECHNOLOGIES

14MXBA SOCIAL NETWORKING AND WEB MINING 3 0 2 4

INTRODUCTION: Data mining and web mining – web community and social network analysis – Evolution of social networks –
Basic concept in social networks (5)

SOCIAL NETWORK DATA AND REPRESENTATION: Structural – composition - affiliation variables-modes-boundary

specification and sampling- type of networks- measurement and collection – Notation for social network data - Review of graph
theory - Data set- Tools - Pajek, Netdraw, UCInet (9)

STRUCTURAL PROPERTIES OF SOCIAL NETWORKS: Notions of centrality, cohesiveness of subgroups, roles and positions,
block models - stochastic block models – Information diffusion – power law (8)

WEB MINING: Web crawler – types of web crawler - Web search – Characteristic of Web data – types of web mining. (6)

20
WEB CONTENT MINING: Web Content Mining: Vector Space Model, Web Search, Activities on Web archiving, Personalized Web
Search, Feature Enrichment of Short Texts, Latent Semantic Indexing, Automatic Topic Extraction from Web Documents Opinion
Search and Opinion Spam (9)

WEB LINKAGE MINING : Hyperlinks- co-citation and bibliographic coupling- page rank and HITS algorithm – web community
discovery – web graph measurement and modeling- using link information for web page classification. (8)
Total L : 45 + P:30 = 75

REFERENCES:
1. Stanley Wasserman and Katherine Faust, “Social network analysis: methods and applications”, Cambridge University Press,
1999.
2. Guandong xu and Yanchun zhang, “Web mining and social networking: techniques”, “Springer Science and Business Media”,
2011
3. Bing Liu, “Web Data Mining”, Springer, 2010
4. Anthony Bonato, “A Course on Web Graphs”, Americal Mathematical Society, 2008

14MXBB XML AND ITS APPLICATIONS 3 02 4

INTRODUCTION: Comparison with HTML – XML documents – Well-formed XML document – Markup and character data – Prolog
and XML declaration – Processing Instructions – XML elements – Types of elements – Attributes – Elements Vs Attributes – CDATA
sections - XML Namespaces. (4)

DTD: Valid XML document – Document Type Declarations and Document Type Definitions(DTDs) – Internal and External DTDs –
Validating XML documents using DTD – Entities and Attributes – General and Parameter Entities. (7)

XML SCHEMA: Validating XML documents using XML Schema – Comparison with DTD – Creation of Simple Types – Specifying
attribute constraints and defaults – Creation of Complex type – Specifying different types of content using Complex type –
Specifying data types and restrictions in Schema. (9)

XSL TRANSFORMATIONS: XSLT style sheets in XML Documents – Creating XSLT style sheets – Matching Document structures
to template rules – Defining Template rules and Declarations – XPath Operators and Expressions – Branching and Control functions
– Variables and Parameters in XSLT – Working with Strings , Booleans and Numbers – Restructuring Input Documents and
Manipulating Document Subsets. (9)

DOM AND SAX: Comparison – Creating a DOM parser – Displaying and Filtering XML documents – Working with SAX –
Displaying and Filtering XML documents. (6)

XML TECHNOLOGIES: XForms – XQUERY – XLINK – RSS (6)

XML SECURITY: XML Encryption – Signature – Key management. (4)

Total L : 45 + P:30 = 75

REFERENCES:
1. William R Stanek, “XML Pocket Consultant”, O'Reilly Media, 2011.
2. Elliotte Rusty Harold and cH oocMaeK.cW, “XML in a Nutshell”, O'Reilly Media, 2009
3. Heather Williamson, “XML:The Complete Reference”, McGraw-Hill, 2010.

14MXBC SEMANTIC WEB TECHNOLOGIES 3 0 2 4

INTRODUCTION: Web and Semantic Web – Examples – Semantic Web Technologies – A Layered Approach (5)

DESCRIBING STRUCTURED WEB DOCUMENTS USING XML: Markup languages – The XML Language – Structuring – XML
Schema – Namespaces (8)

DESCRIBING WEB RESOURCES IN RDF: RDF – Basic Ideas – RDF: XML-Based Syntax – RDF Schema: Basic Ideas – RDF
Schema – A Direct Inference System for RDF and RDFS – SPARQL. (8)

WEB ONTOLOGY LANGUAGE: Knowledge representation – OWL Introduction – The OWL Language – Examples – OWL in
OWL – Future Extensions – Programming with JENA. (9)

TOPIC MAPS: Concepts – Topic – Name – Occurrence – Association – Topic Map – XTM Syntax – Conformance. (4)

LOGIC AND INFERENCE: Monotonic Rules – Syntax – Examples – Semantics – Nonmonotonic Rules: Motivation and Syntax
– Example of Nonmonotonic Rules – Rule Markup in XML for Monotonic Rules – Rule Markup in XML for Nonmonotonic Rules.

21
 (5)

PUBLISHING ON THE SEMANTIC WEB & APPLICATIONS: Open and Linked data, Semantic Web Vocabularies. Semantic Web
vs. Web2.0 – Applications: Horizontal Information Products – Data Integration – E-Learning – Web Services. (6)
Total L : 45 + P:30 = 75

REFERENCES:
1. Grigoris Antoniou and Frank van Harmelen, “A Semantic Web Primer”, The MIT Press Cambridge, Massachusetts London,
England, 2008.
2. John Hebeler, Matthew Fisher, Andrew Perez-Lopez and Ryan Blace “Semantic Web Programming”, Wiley, 2009
3. Pascal Hitzler, Markus Krotzsch and Sebastian Rudolph “Foundations of Semantic Web Technologies”, CRC Press, 2010
4. John Davies, Dieter Fensel and Frank van Harmelen, “Towards the Semantic Web”, Wiley, 2003.

INTELLIGENT SYSTEM AND TECHNOLOGIES

14MXCA MACHINE LEARNING 3 0 2 4

INTRODUCTION: Overview of machine learning, related areas, applications, software tools (3)

PARAMETRIC REGRESSION: linear regression, polynomial regression, locally weighted regression, numerical optimization,
gradient descent, kernel methods. (7)

GENERATIVE LEARNING: Gaussian parameter estimation, maximum likelihood estimation, Bayesian estimation (6)

DISCRIMINATIVE LEARNING: linear discrimination, logistic regression, logit and logistic functions (5)

NEURAL NETWORKS: The perceptron algorithm, multilayer perceptrons, backpropagation, nonlinear regression, multiclass
discrimination, training procedures, localized network structure, dimensionality reduction interpretation-Support vector machines (8)

GRAPHICAL AND SEQUENTIAL MODELS: Bayesian networks, conditional independence, Markov random fields, inference in
graphical models, belief propagation, Markov models, hidden Markov models, decoding states from observations, learning HMM
parameters. (8)

DIMENSIONALITY REDUCTION: feature selection, principal component analysis, linear discriminant analysis, factor analysis,
independent component analysis, multidimensional scaling, manifold learning. (8)
Total L : 45 + P:30 = 75

REFERENCES:
1. Alpaydin E, “Machine Learning”, MIT Press, 2010.
2. Bishop C, “Pattern Recognition and Machine Learning”, Springer, 2006.
3. Duda R, Hart E and Stork D, “Pattern Classification”, Wiley-Interscience, 2000.
4. Mitchell T, “Machine Learning”, McGraw-Hill, 1997.
5. Hastie T, Tibshirani R and Friedman J, “Elements of Statistical Learning”, Springer, 2001.

14MXCB SOFT COMPUTING 3 0 2 4

ARTIFICIAL INTELLIGENCE(AI): Evolution of computing – Defining AI - Characteristics of AI problem - State space representation
–Problem solving by intelligent search strategies : Brute force, depth first, breadth first, best first, hill climbing and A* algorithms.
(9)

KNOWLEDGE REPRESENTATION: Logic- Propositional calculus - Predicate calculus - Rules of inference - Resolution -
Unification algorithm - Semantic networks - Frames –Petri Nets – Scripts (7)

SOFT COMPUTING AND CONVENTIONAL AI: Constituents - Characteristics - Hybrid models. (2)

FUZZY SET THEORY: Fuzzy sets - Basic definitions - Membership functions - Fuzzy rules and reasoning - Fuzzy relations - Fuzzy
if-then rules - Fuzzy reasoning (10)

GENETIC ALGORITHMS:History – basic concepts – working principle – encoding methods – fitness function – reproduction
methods - Genetic inheritance operators - Cross over operators - Mutation - Reproduction –convergence - applications. (6)

22
NEURAL NETWORKS: Basic concepts - Network properties - Learning in simple neurons - Single layer perceptrons - Multilayer
perceptrons - Supervised and unsupervised learning – Backpropagation network, Kohonen's self organizing network, Hopfield
network. (11)
Total L : 45 + P:30 = 75

REFERENCES:
1. Peter Norvig and Stuart J Russel, “Artificial Intelligence: A Modern Approach”, Prentice Hall, 2009.
2. Ross Timothy J, "Fuzzy Logic with Engineering Applications", John Wiley and Sons Ltd, 2005.
3. Rajasekaran S and Vijayalakshmi Pai G A, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI Learning, 2003.
4. Amit Konar, “Artificial Intelligence and Soft Computing”, CRC Press, 2008.
5. Simon Haykin, “Neural networks and Machine learning”, Prentice Hall, 2008.

14MXCC ARTIFICIAL INTELLIGENCE 3 0 2 4

INTRODUCTION: Computerized reasoning - Artificial Intelligence (AI) - characteristics of an AI problem - Problem representation in
AI - State space representation - problem reduction. (6)

SEARCH PROCESS: AI and search process - Brute force search techniques, Depth first, Breadth first search techniques, Hill
climbing, Best first search, AND/OR graphs, A* algorithm - Constraint satisfaction. (10)

AI AND GAME PLAYING: Major components of a game playing program - plausible move generator - static evaluation - function
generator - Minimal strategy - Alpha - Beta techniques - problems in computer game playing programs. (7)

KNOWLEDGE REPRESENTATION: Logic, Propositional logic - Tautology - Contradiction - Normal forms - Predicate logic - Rules
of inference - Resolution - Unification algorithm - Production rules - Semantic networks - Frames – Scripts - Conceptual
dependency. (9)

KNOWLEDGE ENGINEERING: Design and architecture of expert systems - Expert system life cycle - Knowledge acquisition –
difficulties - strategies - major applications areas - Qualitative study of expert systems, DENDRAL, MYCIN. (8)

MACHINE LEARNING: Frame work for learning – Inductive learning –Supervised, Unsupervised learning – Parallel distributed
processing – Genetic Algorithms. (5)
Total L : 45 + P:30 = 75

REFERENCES:
1. Stuart Russel and Peter Norvig, “Artificial Intelligence – A modern approach”, Prentice Hall, 2009.
2. Elaine Rich, Kevin Knight and Shivashankar B Nair, “Artificial Intelligence”, Tata McGraw Hill, 2010.
3. Patrick Henry Winston, “Artificial Intelligence”, Addison Wesley, 2000.
4. Luger George F and Stubblefield William A, “Artificial Intelligence: Structures and Strategies for Complex Problem Solving”,
Pearson Education, 2002.

14MXCD BIOINFORMATICS 3 0 2 4

Bioinformatics - Classification of biological databases- Biological data formats - Application of bioinformatics in various fields. (5)

Single letter code of amino acids -Symbols used in nucleotides - Data retrieval– Entrez and SRS. (4)

Sequence alignment - Substitution matrices - Scoring matrices – PAM and BLOSUM - Local and Global alignment concepts - Dot
plot- Dynamic programming methodology - Multiple sequence alignment – Progressive alignment. Database searches for
homologous sequences – FASTA AND BLAST versions. (12)

Evolutionary analysis: Distances - Clustering methods – Rooted and unrooted tree representation – Bootstrapping strategies. (8)

Fragment assembly - Genome sequence assembly - Gene finding method - Gene prediction - Analysis and prediction of regulatory
regions. (8)

Concepts and secondary structure prediction –Probabilistic models: Markov chain - Hidden Markov Models -Gene identification
and other applications. (8)
Total L: 45 + P:30 =75

REFERENCES:
1. Arthur M Lesk, Introduction to BioInformatics , Oxford University press,2014

23
2. Richard Durbin, Sean Eddy, Anders Krogh, and Graeme Mitchison, “Biological Sequence Analysis: Probabilistic Models of
Proteins and Nucleic Acids”, Cambridge University Press,2008.
3. Bishop M.J., Rawlings C.J. (Eds.), “DNA and protein sequence analysis: A Practical Approach”, IRL Press, Oxford, 2010.
4. Doolittle R.F. (Ed.), “Computer methods for macromolecular sequence analysis Methods in Enzymology”, Academic Press,
2010

ADVANCED COMPUTING AND TECHNOLOGIES

14MXDA ADVANCED DATABASE TECHNOLOGY 3 0 2 4

QUERY AND TRANSACTION PROCESSING : Data Storage and Querying : Storage and File Structure - Indexing and Hashing –
Physical Database Design and Tuning - Query Processing Algorithms – Query Optimization Techniques – Transaction
Management: Transaction Processing Concepts – Concurrency Control – Recovery Techniques – Database Security. (9)

PARALLEL AND DISTRIBUTED DATABASES : Database System Architectures: Centralized and Client-Server Architectures –
Server System Architectures – Parallel Systems- Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query
Parallelism – Inter and Intra operation Parallelism – Distributed Database Concepts - Distributed Data Storage – Distributed
Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Three Tier Client Server Architecture-
Case Studies. (9)

OBJECT AND OBJECT RELATIONAL DATABASES : Concepts for Object Databases: Object Identity – Object structure – Type
Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex
Objects – Object Database Standards, Languages and Design: ODMG Model – ODL – OQL – Object Relational and Extended –
Relational Systems : Object Relational features in SQL / Oracle – Case Studies. (9)

ADVANCED DATA MODELS: Active Database Concepts and Triggers – Temporal Databases – Spatial Databases – Multimedia
Databases – Deductive Databases – XML Databases: XML Data Model – DTD - XML Schema - XML Querying - Geographic
Information Systems - Genome Data Management. (9)

MOBILE DATABASES: Location and Handoff Management - Effect of Mobility on Data Management - Location Dependent Data
Distribution - Mobile Transaction Models. (9)
Total L : 45 + P:30 = 75

REFERENCES:
1. Elmasri R and Navathe S B, “Fundamentals of Database Systems”, Pearson Education/Addison Wesley,
2010.
2. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design, Implementation and
Management”, Pearson Education, 2012.
3. Date C J, Kannan A and Swamynathan S, “An Introduction to Database Systems”, Pearson Education,
2012.
4. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”, McGraw Hill, 2006.
5. Subramanian V S, “Principles of Multimedia Database Systems”, Harcourt India Pvt Ltd., 2007.
6. Vijay Kumar, “Mobile Database Systems”, John Wiley & Sons, 2006.

14MXDB INFORMATION STORAGE AND MANAGEMENT 3 0 2 4

STORAGE TECHNOLOGY: Data proliferation and the varying value of data with time & usage, Sources of data and states of data
creation, Data center requirements and evolution to accommodate storage needs, Overview of basic storage management skills and
activities, The five pillars of technology, Overview of storage infrastructure components, Evolution of storage, Information Lifecycle
Management concept, Data categorization within an enterprise, Storage and Regulations. (8)

STORAGE SYSTEMS ARCHITECTURE: Intelligent disk subsystems overview, Contrast of integrated vs. modular arrays,
Component architecture of intelligent disk subsystems, Disk physical structure- components, properties, performance, and
specifications, Logical partitioning of disks, RAID & parity algorithms, hot sparing, Physical vs. logical disk organization, protection,
and back end management, Array caching properties and algorithms, Front end connectivity and queuing properties, Front end to
host storage provisioning, mapping, and operation, Interaction of file systems with storage, Storage system connectivity protocols.
(8)
NETWORKED STORAGE: JBOD, DAS, SAN, NAS, & CAS evolution, Direct Attached Storage (DAS) environments: elements,
connectivity, & management, Storage Area Networks (SAN): elements & connectivity, Fibre Channel principles, standards, &
network management principles, SAN management principles, Network Attached Storage (NAS): elements, connectivity options,
connectivity protocols (NFS, CIFS, ftp), & management principles, IP SAN elements, standards (iSCSI, FCIP, iFCP), connectivity
principles, security, and management principles, Content Addressable Storage (CAS): elements, connectivity options, standards,
and management principles, Hybrid Storage - solutions overview including technologies like virtualization & appliances. (9)

24
INFORMATION AVAILABILITY: Business Continuity and Disaster Recovery Basics, Local business continuity techniques, Remote
business continuity techniques, Disaster Recovery principles & techniques. (8)

MANAGING & MONITORING: Management philosophies (holistic vs. system & component), Industry management standards
(SNMP, SMI-S, CIM), Standard framework applications, Key management metrics (thresholds, availability, capacity, security,
performance), Metric analysis methodologies and trend analysis, Reactive and pro-active management best practices, Provisioning
& configuration change planning, Problem reporting, prioritization, and handling techniques, Management tools overview. (6)

SECURING STORAGE AND STORAGE VIRTUALIZATION: Define storage security. , List the critical security attributes for
information systems, describe the elements of a shared storage model and security extensions, Define storage security domains,
the common threats in each domain, virtualization technologies, block-level and file level virtualization technologies and processes.
(6)
Total L : 45 + P:30 = 75

REFERENCES:
1. Thejendra B S, “Disaster Recovery & Business continuity”, Shroff Publishers, 2008.
2. Robert Spalding and Robert Spalding, “Storage Networks: The Complete Reference”, Tata McGraw Hill, 2003.
3. Meeta Gupta, “Storage Area Network Fundamentals”, Pearson Education, 2003.
4. Marc Farley Osborne, “Building Storage Networks”, Tata Mac Graw Hill, 2001.
5. Gerald J Kowalski and Mark T Maybury, “Information Storage Retreival Systems theory & Implementation”, BS
Publications, 2000.

14MXDC GREEN COMPUTING 3 0 2 4

Importance of Green IT: The growing significance of Green IT and Green data centers -All basic steps towards Green IT -The
Basics of Green IT. (4)

Collaboration is key for Green IT- The government’s role - Regulation and EPA activity - Regulating greenhouse gases - Role of the
EPA - IT company support of government regulation - Educational institutions and government regulation. (12)
Magic of Incentive - The role of electric utilities - A most significant step -“Virtualizing” IT systems: Consolidation and Virtualization -
Data Storage. (10)

Need for standard IT Energy - Use metrics: SPEC - EPA – LEED - Green grid data center power -Efficiency metrics: PUE and DciE,
Data center - Strategies for increasing data center - Cooling efficiency - Fuel cells for data center electricity -Emerging technologies
for data centers. (8)

Web, Temporal and Spatial Data Mining Green IT Case Studies For Energy Utilities -Green IT case studies for universities and a
large company - Worldwide green IT - Case studies - The future of green IT for corporations. (11)
Total L : 45 + P:30 = 75

REFERENCES:
1. John Lamb, “The Greening of IT-How Companies can make a difference for the environment”, IBM Press, 2009.
2. Frederic P Miller, Agnes F Vandome and John McBrewster, “Green Computing”, Alpha Script Publishing, 2006.

14MXDD MULTIDIMENSIONAL DATA STRUCTURES 3 0 2 4

PROBABILISTIC ANALYSIS AND RANDOMIZED ALGORITHMS: The hiring problem – Indicator random variables – Randomized
algorithms- Probabilistic analysis (6)

HEAP STRUCTURES: Binary trees - Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps – Skew heaps -
Lazy-binomial heaps. (9)
SETS: Disjoint sets – Dynamic set operations – Van Emde Boas Trees (5)

SEARCH TREES: Red-black trees – AVL trees - Splay trees (6)

MULTIDIMENSIONAL STRUCTURES: Segment trees – k-d trees – Point Quad trees – MX-Quad trees – R-trees – TV trees. (9)

NP HARD AND NP COMPLETE PROBLEMS: Basic Concepts- Cooks theorem – NP Hard Graph Problems-Clique Decision
problem, Node cover decision problem- NP Hard Scheduling Problems: Scheduling Identical processors – Flow shop scheduling –
Job shop scheduling (10)
Total L : 45 + P:30 = 75

REFERENCES:
1. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein, “Introduction to Algorithms”, MIT Press, 2009.

25
2. Horowitz E, Sahni S and Rajasekaran S, “Fundamentals of Computer Algorithms”, Galgotia Publications, New Delhi, 2010.
3. Subrahmanian V S, “Principles of Multimedia Database Systems”, Morgan Kaufman, USA, 2001.
4. Mark Allen Weiss, “Data structures and Algorithm Analysis in C++”, Pearson Education, New Delhi, 2006.

14MXDE MULTI-CORE PROGRAMMING 3 0 2 4

Multi-core - Definition and hybrid architectures - The software developer’s viewpoint - The bus connection - From single core to
multi-core - Four effective multi-core designs. (8)

Challenges of Multi-core programming - Sequential model – definition -Concuurency – definition -Challenges pertaining to software
development - Processor architecture challenges - Operating system’s role. (10)

Process - Definition - Process creation - Working with process environment variables - Killing a process - Process resources -
Synchronous and a asynchrononus processes - Multithreading - Comparing threads to processes - Architecture of a thread -
Creation and management of threads. (9)

Communication and Synchronization - Thread strategy approaches - Decomposition and encapsulation of work - Approaches to
application design - PADL and PBS. (8)

UML- Modelling the structure of a system - UML and concurrent behavior - Basic testing types - Defect removal for parallel
programs - Standard software engineering tests. (10)

Total L : 45 + P:30 = 75
REFERENCES:
1. Herlihy M and Shavit N, “The Art of Multiprocessor Programming”, Morgan Kaufmann, 2008.
2. Kirk D B and Hwu W W, “Programming Massively Parallel processors: A Hands-on approach”, Morgan Kaufmann, 2010.
3. Huges C and Huges T, “Professional Multi-core programming: Design and Implementation for C++developers”, Wrox, 2008.

14MXDF APPLIED GRAPH THEORY 3 0 2 4

INTRODUCTION: Review on Definition and Basic Terminologies of Graphs – Representations of Graphs – Walks in Graphs and
Digraphs- Subgraphs-Vertex Degrees - Path and Cycles - Regular and Bipartite Graphs- Incidence Matrices- - Graph Traversals-
Applications: Markov Chains- Four Cubes Problem- Social Networks. (8)

EULERIAN AND HAMILTONIAN GRAPHS: Exploring and Travelling – Eulerian Graphs – Hamiltonian Graphs – Applications:
Dominoes – Chinese Postman Problem. (5)

PATHS AND CONNECTIVITY: Connected Graphs and Digraphs-Menger’s Theorem for Graphs-Applications: Reliable
Telecommunication Networks. (4)

PLANARITY: Planar Graphs – Euler’s Formula-Cycle Method for Planarity Testing – Kuratowski’s Theorem – Duality. (4)

COLORINGS AND DECOMPOSITIONS: Vertex Colorings – Edge Colorings – Algorithm for Vertex and Edge Colorings – Vertex
Decomposition – Edge Decomposition. (6)

MATCHING AND FACTORS: Matching, Perfect matching, Tutte’s 1-factor theorem, weighted Bipartite matching, Hall’s theorem. (5)

NETWORK FLOWS AND APPLICATIONS: Flows and cuts in Networks, Maximum-flow problem, flows and connectivity –
applications. (6)

RANDOM GRAPHS: Random graph – Properties of Random graph -Erdos theorem, threshold function. (7)
Total L : 45 + P:30 = 75

REFERENCES :
1. Douglas B West, “Introduction to Graph Theory”, Pearson Education, New Delhi, 2001.
2. Joan M Aldous and Robin J Wilson, “Graphs and Applications- An Introductory Approach,Springer-Verlag”, New York, 2007.
3. Bela Bollobas, “Random Graphs”, Cambridge University Press, New York, 2008.
4. Reinhard Diestel, ”Graph Theory”, Springer-Verlag, Berlin Heidelberg, 2009.
5. Haynes T W, Hedetniemi and Slater P J, “Fundamentals of Domination in Graphs”, Marcel Dekker, 1998.
6. Jonathan Gross and Jay Yellen, “Graph Theory and its Applications”, CRC Press, 2005.

14MXDG COMPUTER GRAPHICS 3 024

26
GRAPHICS INPUT - OUTPUT DEVICES: Raster scan Displays - Random scan displays - Direct view storage tubes - Flat panel
displays - Mouse - Track Ball - Joy Stick - Digitizers - Touch panels. (4)

TWO DIMENSIONAL GRAPHICS: Basic transformations - Matrix representation and homogeneous coordinates - composite
transformations - Line drawing algorithms: DDA and Bresenham's algorithms - Circle generation algorithms: Midpoint circle
algorithm - Point clipping - Line clipping: Cohen Sutherland algorithm - Polygon clipping: Sutherland Hodgeman algorithm - Line
covering. (11)

RASTER GRAPHICS: Fundamentals: generating a raster image, representing a raster image, scan converting a line drawing,
display characteristics, speed of scan conversion, natural images - Solid area scan conversion: Scan conversion of polygons, Y-X
algorithm, properties of scan conversion algorithms - Interactive raster graphics: painting model, moving parts of an image, feed
back images. (10)

CURVES AND SURFACES:Parametric representation of curves - Bezier curves - B-Spline curves - parametric representation of
surfaces - Bezier surfaces - curved surfaces - ruled surfaces - quadric surfaces. (7)

THREE DIMENSIONAL GRAPHICS: 3D transformations - viewing 3D graphical data - orthographic, oblique, perspective
projections - hidden lines and hidden surface removal. (5)

ANIMATION GRAPHICS:Design of Animation sequences - animation function - raster animation - key frame systems - motion
specification -morphing - tweening. (3)

COMPUTER GRAPHICS REALISM: Tiling the plane - Recursively defined curves - Koch curves - C curves - Dragons - space filling
curves - fractals - Grammar based models - graftals - turtle graphics - ray tracing. (5)
Total L : 45 + P:30 = 75

REFERENCES:
1. Wilbent O Galitz ,“The Essential Guide To User Interface Design – An introduction to GUI Design Principles and Techniques”,
John Wiley& Sons, 2007.
2. Deborah Mayhew, “The Usability Engineering Lifecycle: A Practitioner’s Handbook for User Interface Design (Interactive
3. Technologies)”, Academic Press, 1999.
4. Ben Shneiderman, “Design The User Interface – Strategies for Effective Human Computer Interaction”, Pearson Education,
1998.
5. Alan Cooper, “The Essential of User Interface Design”, Wiley – Dream Tech Ltd., 2002.
6. Sharp, Rogers, Preece, ‘Interaction Design : Beyond Human Computer Interaction’, Wiley India Edition, 2007

14MXDH OPEN SOURCE SYSTEMS 3 0 2 4

INTRODUCTION: Introduction to Open sources – Need of Open Sources – Advantages of Open Sources – Application of Open
Sources- Bug Fixing – Commercial aspects of Open Source Systems. (5)

OPEN SOURCE PROGRAMMING LANGUAGES: PHP: Introduction – Programming in web environment – variables – constants –
data types – operators – Statements – Functions – Arrays – OOP – String Manipulation and regular expression – File handling and
data storage – PHP and SQL database – PHP and LDAP – PHP Connectivity – Sending and receiving E-mails – Debugging and
error handling – Security – Templates. (9)

OPEN SOURCE DATABASE : Documents Database- MongoDB- Installation – crud operations- insert,modify, remove & quality
documents- 2-phase commits- Data models-Administration-security – aggregation- Indexes- Mongo shell – operators- couch DB
over MongoDB (10)

RAILS: Introduction - DRY - COC - MVC - REST - Migrations - Active Record Validations - Active Record Associations - Active
Record Query Interface - Layouts and Rendering - Action Controller - Rails Routing. (6)

RUBY: History and Design of Ruby – Classes, Objects and Variables – Containers, Blocks and Iterators – Standard Types –
Methods – Expressions – Exceptions – Modules – Input and Output – Threads and Processes – Ruby and Web – Reflection –
ObjectSpace – Distributing Ruby. (8)

OPEN SOURCE TOOLS AND TECHNOLOGIES: WEB SERVER: Apache Web server – Working with Web Server – Configuring
and Using apache web services. (7)
Total L : 45 + P:30 = 75

REFERENCES:
1. Karl Fogel, “Producing Open Source Software”, O’Reilly, 2006.
2. Kristina Chodorow and Michael Dirolf, “MongoDB: The Definitive Guide”, O’Reily, 2010.
3. Rasmus Lerdorf and Kevin Tatroe, “Programming PHP”, O’Reilly, 2013.
4. Bruce A Tate and Curt Hibbs, “Ruby on Rails: Up and Running”, O’Reilly Media, 2008
5. Carlson and Leonard Richardson, “Ruby Cookbook”, O’Reilly Media, 2008

27
6. Peter Wainwright, “Professional Apache”, Wrox Press, 2002.

14MXDI HUMAN COMPUTER INTERACTION 3 0 2 4

INTRODUCTION - Human–Computer Interface – Characteristics Of Graphics Interface –Direct Manipulation Graphical System –
Web User Interface –Popularity –Characteristic & Principles (8)

HUMAN COMPUTER INTERACTION - User Interface Design Process – Obstacles –Usability –Human Characteristics In Design
– Human Interaction Speed –Business Functions –Requirement Analysis – Direct – Indirect Methods – Basic Business Functions –
Design Standards – General Design Principles – Conceptual Model Design – Conceptual Model Mock-Ups (7)

WINDOWS - Characteristics– Components– Presentation Styles– Types– Managements–Organizations– Operations– Web

Systems– System Timings - Device– Based Controls - Characteristics– Screen – Based Controls –– Human Consideration In
Screen Design – Structures Of Menus – Functions Of Menus– Contents Of Menu– Formatting – Phrasing the Menu – Selecting
Menu Choice– Navigating Menus– Graphical Menus. Operate Control – Text Boxes– Selection Control– Combination Control–
Custom Control– Presentation Control. (12)

MULTIMEDIA - Text For Web Pages – Effective Feedback– Guidance & Assistance–Internationalization– Accessibility– Icons–
Image– Multimedia – Coloring. (9)

EVALUATION - Conceptual Model Evaluation – Design Standards Evaluation – Detailed User Interface Design Evaluation (9)
Total L: 45 + P: 30 = 75

REFERENCES:
1. Wilbent O Galitz ,“The Essential Guide To User Interface Design – An introduction to GUI Design Principles and Techniques”,
John Wiley& Sons, 2007.
2. Deborah Mayhew, “The Usability Engineering Lifecycle: A Practitioner’s Handbook for User Interface Design (Interactive
3. Technologies)”, Academic Press, 1999.
4. Ben Shneiderman, “Design the User Interface – Strategies for Effective Human Computer Interaction”, Pearson Education,
1998.
5. Alan Cooper, “The Essential of User Interface Design”, Wiley – Dream Tech Ltd., 2002.
6. Sharp, Rogers and Preece, “Interaction Design : Beyond Human Computer Interaction”, Wiley India Edition, 2007.

14MXDJ DESIGN PATTERNS 3 0 2 4

INTRODUCTION TO PATTERNS: Reusable object oriented software – Motivation - Best design practices of object oriented
software - Benefits of patterns – Definition – Types - Pattern description - How design patterns solve design problems - Pattern
Language - IDIOMS. (10)

DESIGN PATTERNS: Creational pattern: Abstract factory – Builder - Factory method – Prototype – Singleton, Structural patterns:
Adapter – Bridge – Composite – Decorator – Façade – Flyweight - Proxy, Behavioral patterns: Command – Interpreter - Iterator,
Mediator - Memento – Observer - State – Strategy - Template method – Visitor - Chain of Responsibility, Case Study (20)

ARCHITECTURAL PATTERNS: From Mud to Structure: Layers - Pipes and Filters - Blackboard, Interactive Systems: Model View
Controller (MVC), Case studies. (5)

CODE REFACTORING: What is refactoring - Principles in refactoring - Bad smells in code - Composing methods - Moving features
between objects - Organizing data - Simplifying conditional expressions - Making method calls simpler - Dealing with generalization.
(10)
Total L : 45 + P:30 = 75

REFERENCES:
1. Erich Gamma, Richard Helm, Ralph Johnsons and John Vlissides, “Design Patterns: Elements of Reusable Object Oriented
Software”, Pearson Education, New Delhi, 2004.
2. Frank Buschman, Regine Meunier, Hans Rohnert, Peter Sommerlad and Michael Stal, “Pattern-Oriented Software
Architecture: A System of Patterns”, Wiley, New Delhi, 2008.
3. Craig Larman, “Applying UML and Patterns”, Pearson Education, New Delhi, 2011.
4. Martin Fowler, Kent Beck, William Opdyke, Don Roberts, “Refactoring: Improving the Design of Existing Code”, Addison
Wesley, Massachusetts, 2011.
5. Sherif Yacoub, Hany Ammar, “Pattern-Oriented Analysis and Design: Composing Patterns to Design Software Systems”,
Addison Wesley, Boston, 2004.
6. Partha Kuchana, “Software Architecture Design Patterns in Java”, Auerbach Publications, New York, 2004.

28
7. William J Brown, Raphael C Malveau, Hays W McCormick and Thomas J Mowbray, “AntiPatterns: Refactoring Software,
Architectures, and Projects in Crisis”, Wiley, New York, 1998.

14MXDK GAMES ENGINEERING

3024
INTRODUCTION: Basics of Game Creation – Creating an engine for games – Graphics in games. (10)

USER INTERFACE: User Interface programming and Input Devices - Integrating sound and music -Animating the background –
Building a game. (10)

FRAMEWORK: POP – Animation – Simulating Physics – Critters – Sprites – Collisions – Listeners – Shooters and Bullet (10)

DIMENSIONAL VIEW: 2D Games – Concepts - 3D Games – Models – Shapes – Transformation – Translation – Scaling –
Shooting Games. (10)

GAMES DEVELOPMENT TOOLS: Milk Shape-3D Studio Max-MAYA-Light wave 3D-Game Maker 8.1-Code :: Blocks-3D Rad -
GamePlay 3D – Panda 3D. (5)
Total L: 45 + P:30 =75
REFERENCES:
1. Rudy Rucker, “Software Engineering and Computer Games”, Addison Wesley, 2011.
2. Kenneth C. Finney, “Advanced 3D Game Programming All in One”, Premier Press, 2011.
3. Michael Morrison, “Teach Yourself Game Programming in 24 Hours”, Sams Publishing, 2003.
4. Mike McShaffry, David Rez Graham, “Game Coding Complete”, Course Technology PTR, 2012.

MANAGEMENT AND DECISION MAKING

14MXEA KNOWLEDGE MANAGEMENT 3 0 2 4

INTRODUCTION: The value of knowledge – Knowledge Engineering and Knowledge Systems- Knowledge Engineering basics-
Principles – Model Suite – Process Roles – Terminology-Task and Organization Analysis - Steps - Organization Modeling Impact
and Improvement Analysis - Task and Agent modelling – Guidelines for the context Modeling Process. (7)

KNOWLEDGE MANAGEMENT AND MODELS: Explicit and Tacit knowledge – Knowledge Management Cycle – Knowledge
management and process - Components - Nature of knowledge – Challenges – Knowledge Management Model – Domain
Knowledge – Inference Knowledge – Task Knowledge – Typographic Conventions – Comparison with other analysis approaches -
Template knowledge Models – Reusing Knowledge Model Elements – A small task Template catalog – Classification – Assessment
– Diagnosis- Monitoring –Synthesis – Configuration design – Assignment – Planning – scheduling – task type combinations –
Relation to Task and Organization models. (14)

KNOWLEDGE MANAGEMENT CONSTRUCTION, MODELLING AND ELICITATION: Stages – Knowledge Identification –

Knowledge specification – Knowledge Refinement – Documenting the Knowledge Model. (5)

COMMUNICATION MODELLING: Role and Overview of the Communication model – The Communication plan – transactions
between agents – Detailing the Information Interchange – validating and balancing the Communication model – A structured
process for Communication modeling - Advanced knowledge modelling: Introduction - Domain, Inference and Task Knowledge -
Knowledge Elicitation - Introduction – Characteristics- Techniques – An Elicitation Scenario. (11)

DESIGN , IMPLEMENTATION AND APPLICATION OF KNOWLEDGE SYSTEMS: Overview of the design process- Steps –
Design of prototypes – Distributed Architectures- Implementation in Prolog and Aion - Project Management - Project Planning –
Assessing risks – Setting objectives through Model states – Documentation. (8)
Total L : 45 + P:30 = 75

REFERENCES:
1. Guss Schreiber, Hans Akkermans, Anjo Anjewierden, Robert de Hoog, Nigel Shadbolt, Walter Van de Velde and Bob
Wielinga, “Knowledge Engineering and Management” Universities Press, 2001.
2. Stuart Barnes, “Knowledge Management Systems: Theory and Practice”, Thomas Learning, 2002.
3. Jerry Honeycutt, “Knowledge Management Strategies”, Microsoft Press, 2000

14MXEB PRINCIPLES OF MANAGEMENT AND BEHAVIOURAL SCIENCES 3024

29
PRINCIPLES OF MANAGEMENT: Definition and significance of management - functions of Management - society and
environment, social responsibility of organisations.. (5)

BUSINESS ORGANISATION: Forms of business Organisations and Resource Mobilisation - internal and external sources of
resources. (6)

GLOBALISATION: Evolving paradigm for the new Economic Era issues for global competitiveness, and proactive forces of
globalisation - Importance and functions of Marketing , Advertisement and sales promotion activities. (6)

MATERIALS MANAGEMENT: Importance and scope of materials management - Inventory control and its systems - ROL, EOQ,
ABC Analysis, MRP, VED, FSN and value analysis. (6)

PROJECT MANAGEMENT: Definition and Objectives of Project Management - Phases in Project Management cycle - Project
appraisal. (4)

HUMAN RESOURCE MANAGEMENT: Importance objectives and its functions, Motivation - Frustration - Conflict Management -
Theories of Motivation - Stress Management. Leadership - Theories - Functions - Models. Human Resources development. (9)

GROUP BEHAVIOUR: Group dynamics, conformity, Sociometry and group cohesiveness leadership - Group Dynamics Informal
Organization- sociometry- cohesiveness-Interaction analysis. (6)

WELFARE INDUSTRY : Working Condition, service facilities and safety industries (3)
Total L : 45 + P:30 = 75

REFERENCES:
1. Hahold Koontz and O’Donnel, “Essentials of Management”, McGraw Hill, 2010.
2. Leap H and Cnino M D, “Personnel Human Resource Management” Macmillan Publishing Co., 1999.
3. Arun Monappa and Mirza Saiyadain S, “Personnel Management”, McGraw Hill Publishing Company, 2000
4. Sapru R K, “Project Management”, Excel Books, New Delhi, 1997.

14MXEC DATA ANALYTICS 3 0 2 4

INTRODUCTION: Data analysis-Decision making- modeling: graphical models, algebraic models, spread sheet models- seven step
modeling process. (4)

DATA EXPLORATORY ANALYSIS: Distribution of a single variable- basic concepts- categorical variables, numerical variables-
time series data- outliers- missing values. Finding relationships among categorical variables and numerical variables. (10)

DECISION MAKING UNDER UNCERTAINTY: Elements of decision analysis-Baye’s rule- Multistage decision problems-
incorporating attitudes towards risk (7)

REGRESSION ANALYSIS: estimating relationships- statistical inference- forecasting methods- testing for randomness- regression
based trend models- random walk models- autoregression models-moving averages-exponential smoothing. (10)

OPTIMIZATION AND SIMULATION MODELING: A two variable product mix model- sensitivity analysis- properties of linear models
–infeasibility and unboundedness- Introduction to simulation modeling. (9)

CASE STUDIES: Manufacturing, finance and banking applications (5)

Total L : 45 + P:30 = 75

REFERENCES:
1. Albright S Christian, Winston Wayne L and Zappe Christopher, “Data analysis and Decision Making”, South Western College
Publication, 2010.
2. James R Evans, “Statistics, Data analysis and Decision modeling”, Prentice Hall, 2012.
3. Andrew Gelman and Jennifer Hill, “Data Analysis Using Regression and Multilevel/Hierarchical Model”, Cambridge University
Press, 2006

INFORMATION SYSTEM AND TECHNOLOGIES

14MXFA TEXT MINING 3 0 2 4

INTRODUCTION: Text mining and information retrieval – Structured and unstructured data – Boolean queries and optimization –
Understanding and exploiting the structure of a text – tokenization – Stemming – Lemmatization – Stop words and phrases –
Indexing – Performance of indexing and retrieval – Several compression techniques. (12)

30
QUERY PROCESSING: Query correction, suggestions using synonyms – wild card queries – Automatic discovery of similar words
– trend analysis of queries – bigram indices – construction of Indices – construction of indices. (11)

CLASSIFICATION: Statistical based Algorithms – Distance based Algorithms – Decision Tree based Algorithms – Neural Network
based Algorithms – Rule based Algorithms – Combining Techniques. (11)

CLUSTERING: Similarity and Distance Measures – Hierarchical Algorithms – Partition Algorithms – Clustering – Large Databases
– Clustering with Categorical Attributes. (11)
Total L : 45 + P:30 = 75

REFERENCES:
1. Dan Sullivan, “Document Warehousing and Text Mining”, John Wiley & Sons, 2001.
2. Christopher D Manning, Prabhakar Raghavan and Hinrich Schutze, “ An Introduction to Information Retrieval”, Cambridge,
2008.
3. Michael W Berry, “Survey of Text Mining: Clustering, Classification, and Retrieval”, Springer, 2003.

14MXFB INTELLIGENT INFORMATION RETRIEVAL 30 24

IR PROBLEM: Introduction- Building inverted Index - Processing Boolean queries –Term vocabulary and postings list – Determini
ng the vocabulary of terms- faster postings list- positional postings-phrase queries - Dictionaries and tolerant retrieval. Indexing:
Introduction-Single pass in-memory indexing- Index compression –Dictionary compression- postings file compression. (9)

SCORING-TERM WEIGHTING- VECTOR SPACE MODEL : Term frequency and weighting- vector space model- variant tf-idf
functions- Computing scores in System: Efficient scoring and ranking- vector space scoring – query operator interaction. (4)

EVALUATION IN IR: Evaluation of unranked retrieval sets- evaluation of ranked retrieval results-assessing relevance - Relevance
feedback and query expansion - Global methods for query reformulation. (8)

RETRIEVAL MODELS: Probabilistic information retrieval- The probability ranking principle - The binary independence model
Language models for information retrieval: The query likelihood model - Language modeling versus other approaches in information
retrieval Text classification- Naïve Bayes- Vector space classification- Support vector machines- machine learning on documents.(8)

CLUSTERING: Clustering in IR- K-means clustering- Evaluation- Hierarchical clustering- Agglomerative clustering-centroid
clustering. Matrix Decompositions and singular value decompositions: Term document matrices- Latent semantic indexing. (9)

WEB SEARCHING: Basics - Web characteristics- The search user experience - Index size and estimation- Near-duplicates and
shingling –Crawling- Distributed indexes- Connectivity servers. Link analysis-Web graph-page rank. (7)
Total L : 45 + P:30 = 75

REFERENCES:
1. Christopher D Manning, Prabhakar Raghavan and Hinrich Schütze, “Introduction to Information Retrieval”, Cambridge University
Press, London, 2008.
2. Ricardo Baeza-Yates, Berthier Ribeiro-Neto, “Modern Information Retrieval”, Pearson Education, New Delhi, 2004
3. Robert R Korfhage, “Information Storage and Retrieval”, John Wiley & sons Inc. New Delhi ,2006
4. Kumar P S G, “Knowledge Organization, Information Processing and Retrieval Theory”, B R Publishing Company, 2003

31
 MATHEMATICAL MODELING

14MXGA NUMERICAL METHODS 3024

SOLUTION OF ALGEBRAIC SIMULTANEOUS EQUATIONS: Gauss – Jordan elimination, Cholesky method, Crout’s method,
Gauss – Jacobi method, Gauss – Seidel method. Matrix Inverse by Gauss – Jordan method. (8)

EIGEN VALUES AND ELGEN VECTORS: Power method of finding dominant eigen value and inverse power method for finding
smallest eigen value, Jacobi method for symmetric matrices. (4)

FINITE DIFFERENCES AND INTERPOLATION: Finite difference operators- Interpolation-Newton-Gregory forward and backward
Interpolation, Lagrange’s Interpolation formula. Solution of linear second order difference equations constant coefficients. (14)

DIFFERENTIATION AND INTEGRATION: Numerical differentiation using Newton-Gregory forward and backward polynomials.
Numerical integration-Gaussian quadrature, Trapezoidal rule and Simpson’s one third rule. (5)

ORDINARY DIFFERENTIAL EQUATIONS: Taylor series method, Euler and Modified Euler method, (Heun’s method), Runge-
Kutta method, Milne’s method, Adams-Moulton method, Solution of boundary value problems of second order by finite difference
method. (14)

Total L : 45 + P:30 = 75
REFERENCES:
1. Stevan C Charpa and Raymond P Canale , “Numerical Methods for Engineers with Software and programming Applications”,
Tata McGraw Hill,2007
2. John H Mathews and Kurtis D Fink , “Numerical Methods using Mat lab”, Prentice Hall, 2004.
3. Cuties F Gerald and Patrick O Whetly, “Applied Numerical Analysis”, Pearson Education, 2011
4. Rizwan Bulf , “Introduction to numerical analysis using Mat lab” Infinity Science Press, 2008.

14MXGB APPLIED MATHEMATICAL MODELING 3024

INTRODUCTION TO MODELING: Modeling process, Overview of different kinds of models. (2)

EMPIRICAL MODELING WITH DATA FITTING: Error functions, least squares; fitting data with polynomials and splines. (5)

QUALITATIVE MODELING WITH FUNCTIONS: Modeling species propagation, supply and demand, market equilibrium, market
adjustment. Inventory Models- Various types of inventory models with shortage and without shortage, Probabilistic Models. (12)

CAUSAL MODELING FORECASTING: Introduction, Modeling the causal time series, forecasting by regression analysis, prediction
by regression. Planning, development and maintenance of linear models, trend analysis, modeling seasonality and trend (8)

THEORY OF GAMES: Introduction – Two person zero sum games- The rules of dominance graphical method- linear programming
method (8)

MODELING WITH SIMULATION: Principles of Computer modeling and simulation, Monto-Carlo Simulation, Limitation of
Simulation, areas of application, discrete and continuous systems, variety of modeling approaches. Techniques of Random number
generation- Midsquare method, midproduct method, Constant multiplier technique, additive congruential method, linear
congruential method. Tests for random numbers- The Kolmogorov –Simmov test- The chi-square test. (10)

Total L : 45 + P:30 = 75

REFERENCES:
1. Hamdy A Taha, “Operation Research”, Pearson Education, 2012.
2. Jerry Banks, John S Carson and Barry L Nelson, “Discrete Event system Simulation”, Prentice Hall, 2002.
3. Edward A Bender, “An Introduction to Mathematical Modeling”, Dover, 2000.
4. Averil M Law and W David Ketlton W, “Simulation modeling and Analysis”, Tata Mc-Graw Hill, 2000.
5. Giordano F R, Weir M D and Fox W P, “ A First Course in Mathematical Modeling” Vikas publishing House PLtd, 2003.

32
 ONE CREDIT COURSES

14XK01 CREATIVITY AND INNOVATION IN SOFTWARE PROBLEM SOLVING AND DESIGN 1 0 0 1

Theory*
An Exploration of software creativity-Discipline Vs Flexibility- Formal methods Vs Heuristics – Qualitative Vs Quantitative reasoning-
Process Vs Product- Theory Vs Practice (10)
*Seminars/ Guest lecturers / Industrial presentations

Project (10)
Total L: 10 + P:10 =20

REFERENCES:
1. Robert L Glass, Tom DeMarco, Software Creativity 2.0, developer.*

14XK02 BUSINESS ANALYTICS 1 0 0 1

INTRODUCTION TO BUSINESS ANALYTICS: Need for analytics in business – differences between analysis and analytics -
appropriate uses of analysis and analytics- importance of analytics in solving business problem (1)

BUSINESS MODELLING – EXAMPLES AND ISSUES: analytics with examples from the business world - sample real world
problems - issues involved in solving these problems. – utility of these solutions in business decision making (1)

MODELLING WITH LINEAR REGRESSION: Ordinary Least Square (OLS) Regression – single variable – multiple-regression -
basics of the techniques – practical implementation over a data set – interpretation of the results. (2)

MODELLING WITH LOGISTIC REGRESSION: Natural sequel to OLS regression - Logistic Regression - Banking and business
applications - implementation over real world data - logistic regression solutions (2)

MODELLING WITH TIME SERIES: Decision making and modeling - Time Series solutions to enable decision making – Exposure
to single and multiple time series – Banking applications – limitations and utility of time series (2)

MODELLING WITH ARTIFICIAL NEURAL NETWORK: Data handling in real world business environment – limitations of Statistical
Modelling –Artificial Neural Networks (ANN) – solutions by ANN – advantages and dis-advantages of ANNs – real world marketing
applications. (2)

Case studies on business real world perspective to modeling. (10)

Total L: 10 + P:10 =20

REFERENCES:
1. Joseph F Hair, William C Black and Barry J Babin, “Multivariate Data Analysis”, Pearson Education, 2009.
2. Gauri Bhattacharya and R A Johnson, “Statistical Concepts and Methods”, John Wiley & Sons, 1977.
3. Rajasekaran S and Vijayalakshmi Pai GA, “Neural Networks, Fuzzy Logic and Genetic Algorithms : Synthesis and Applications”,
PHI Learning, 2003.
4. MIT Open Courseware - http://ocw.mit.edu/.

14XK03 DOMAIN SPECIFIC LANGUAGES 1001

Introduction: Domain Specific Language (DSL)- differences between a regular language and DSL.Usefulness and the power of
DSL: Need for DSL - its power over the generic languages such as Java and C# Real world examples of DSL: SQL: a language
dedicated to access the data from relational databasesXSLT: a language for transforming XML documents (2)

Grammar Language: describing the "text" of a DSL - syntax of the DSL -A simple DSL - the problem statement: Move a graphical
cursor across the screen, as per the program instructions (2)

Defining the language: Extension from the XBase language - support to declare variables, define and call subroutines
(like square) – accessing Java's Math.* functions - color constants (2)

Integrating with the IDE: Creating andediting the grammar in Eclipse IDE (2)

Runtime for the language in a Java VM (2)

Hands on sessions in the Laboratory (10)

Total L: 10 + P:10 =20

33
REFERENCES:
1. Xtext Framework http://www.eclipse.org/xtext
2. Grammar of XText http://git.eclipse.org
3. XBase language http://www.wiki.org/xbase
4. XText Documentation http://www.eclipse.org/xtext

14XK04 SOFTWARE TESTING – INDUSTRY PERSPECTIVES 1001

Testing Overview / Evolution of testing- Testing approaches; evolution of Software Development models, Various black box testing
techniques, test design techniques, Software Testing in Industry, Testing throughout the Life cycle, Types of Software Testing, Test
Concepts (2)

Test Management- Application of Project Management with respect to Testing, Evolution of Test Management, Test Management
in various Test cycles/phases (2)

Test Design/Test Techniques- Various black-box test design techniques, All-pairs, Exploratory Testing etc. - Functional testing &
Non-Functional Testing : test concepts , strategies and types. Testing automation testing- Best Practices and Challenges (3)

Testing of Enterprise applications- testing techniques/methodologies that are followed in end-to-end of the Enterprise applications,
challenges faced. (2)

Testing Big Data (HANA)/Mobile applications - testing of applications run on HANA DB, testing of mobile applications, challenges
faced (1)

PROJECT (10)
Total L: 10 + P:10 =20

REFERENCES:
1. Cem Kaner, Jack Falk, Hung Quoc Nguyen, “ Testing Computer Software”, Wiley publications, 1988.
2. William Perry, "Effective Methods for Software Testing", Wiley, New Delhi, 2009.
3. John Watkins, “Testing IT : An off the shelf Software Testing Process”, Cambridge Press, Cambridge, 2010.

14XK05 MAINFRAME SYSTEMS 1001

INTRODUCTION: Definition of a Mainframe system, Difference between Centralized and Distributed computing, History of
Mainframes, Attributes of Mainframes / Reasons for opting for Mainframes, Users of Mainframes - Batch processing,
Online/Interactive transactions. (4)

MAINFRAME WORKLOADS :Concept, strategy, and benefits of the z/OS environment, Application enablement in z/OS -Overview
of e-business support in z/OS, Connectivity to the z/OS environment -Security support provided by z/OS, System management
support ,Scalability, availability, backup, and recovery features in z/OS, z/OS system services, zSeries processor configurations (4)

Case Study : z/VM, Linux, zVSE, zTPF (2)

PROJECT (10)

Total L: 10 + P:10 =20

14XK06 OPERATING SYSTEM PERFORMANCE ASSESSMENT

1001

Workload Definition- Elements of OS Performance - CPU, I/O - Memory & Disk, Network- Elements of a performance test - Load,
Stress, Endurance, Spike, Volume, Scalability, Throughput (2)

In detail- CPU Performance - Memory Performance - Storage Performance - Network Performance (2)

Typical Performance Parameters monitored - Performance Tools - Designing a real world Performance test (2)

34
Some quick ways to check a system performance (2)

Comparison of a specific workload on Windows & Linux - Performance in a virtualized world - Distributed Systems & Performance
(2)
Case Studies (10)
Total L: 10 + P: 10 =20

14XK07 RESPONSIVE WEB DESIGN

1001

REST based Web Services using Spring (2)

HTML5 and CSS3 (2)
Rich Internet Application (2)
JavaScript Frameworks - JQuery, Backbone, Handlebars (2)
Android and IOS Development (2)
Hands on training (10)

Total L: 10 + P:10 =20

14MXDL / 11MX0X BIG DATA ANALYTICS

3 0 2 4

INTRODUCTION : Big Data Platform – Challenges of Conventional Systems - Intelligent data analysis – Nature of Data - Analytic
Processes and Tools - Analysis - Reporting - Modern Data Analytic Tools - Statistical Concepts: Sampling Distributions - Re-
Sampling - Statistical Inference - Prediction Error. (9)

DATA STREAMS: 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 Applications - Real Time Sentiment Analysis, Stock Market Predictions. (9)

BIG DATA PLATFORM : Hadoop- The Hadoop Distributed File System – Components of Hadoop- Analyzing the Data with
Hadoop- Scaling Out- Hadoop Streaming- Design of HDFS- Map Reduce: Architecture - Types and Formats- Anatomy of a Map
Reduce Job run-Failures-Job Scheduling-Shuffle and Sort – Task execution – Applications (10)

TOOLS: Pig – Hive – Mahout – Sqoop – Flume – NoSQL Databases – Need – Characteristics – Properties – Key-value Stores-
Hbase – Column Family Stores – Document Stores – MongoDB –Angular JS- Graph Databases – Neo4j-Yarn. (9)

CASE STUDIES: Social Network Analysis- APIs – Data Stream Analysis – Web Engineering – Personalized Information Systems.
(8)
Total L: 45 + P: 30= 75
REFERENCES:

1. Michael Minelli, Michele Chambers, Ambiga Dhiraj, “Big Data, Big Analytics: Emerging Business Intelligence and Analytic
Trends for Today's Businesses”, John Wiley and Sons, New Delhi, 2013.

2. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos, “Understanding Big Data: Analytics for Enterprise
Class Hadoop and Streaming Data”, McGrawHill Publishing, 2012.

3. Paul Zikopoulos,Dirk DeRoos, Krishnan Parasuraman, Thomas Deutsch, James Giles, David Corrigan, “Harness the Power of
Big Data The IBM Big Data Platform”, Tata McGraw Hill Publications, 2013

4. Tom White “ Hadoop: The Definitive Guide” Third Edition, O’Reilly Media, 2012.

5. Mike Barlow, “Real Time Big Data Analytics:Emerging Architecture”, O’Reilly, 2013

6. Eelco Plugge, Tim Hawkins and Peter Membrey, “The Definitive Guide to MongoDB: The NoSQL Dataase for Cloud and
Desktop Computing”, Apress, USA, 2010.

35
36