Syllabus for
Master of Science (Computer Science)
Academic Year  (2017)

CIA (Weight) ESE (Weight) 50% 50%

To introduce the concepts and principles of Java Programming language and to design, implement object oriented solutions to simple and complex problems. To give students experience in Java Programming and program development within an integrated development environment.

Data Types, Expressions, Keywords, Operators and Control Flow Statements, Structure of Java Program, Creating and Running Java Programs, Arrays.

Creating class and objects, methods, this keyword, Constructors, Garbage Collection, the finalize() method, Access Control, Static Blocks, Finals, Nested and Inner Classes, String Class and String Buffer Class, Command Line Arguments. 

History of Java, Characteristics of Java, The Java Environment – JVM, JDK & JRE, Different versions of Java, OOP Principles, Comparison of Java with C and C++.

Inheritance in java with Interfaces – Defining Interfaces, Implementing Interfaces, Extending Interfaces, Creating Packages, CLASSPATH variable, Access protection, Importing Packages, Interfaces in a Package.  

try-catch-finally mechanism, throw statement, throws statement, Packages and Classes for Exception Handling

Inheritance in classes, using super, Method overriding, Dynamic Method Dispatch.Abstract Classes, Using final with inheritance, the Object Class.

Life cycle of Applet, Applet Architecture, Applet restrictions, Creation and Execution of Java Applets, Animation in Applets, Advantages of Applets, Applets vs. Applications. 

java.io package, I/O Streams, Readers and Writers, Using various I/O classes: Reader, Writer, InputStream and Output Stream, Serialization of objects.

Life cycle of a thread, Java Thread priorities, Runnable interface and Thread Class, sharing limited resources, shared Object with synchronization. 

GUI concepts in Java, Basic GUI Components in AWT, Container Classes, Layout Managers, Flow Layout, Border Layout, Card Layout, Box Layout, Difference between AWT and SWING.

Self-Learning

SWING Java foundation Classes – javax.swing and Model View Controller, Creating a Frame in Swing, Displaying Image in Swing, JComponent class methods – Creating components in Swing, Writing GUI programs in java (with AWT or SWING), Event Handling – Handling Keyboard Events and Mouse Events. 

Creating a server that sends data, Creating a client that receives data, two way communication between server and client, Stages in a JDBC program, Registering the driver, Connecting to a database, Preparing SQL statements, Improving the performance of a JDBC program.

[3] Rao Nageswara ,Core Java-An Integrated Approach, Dreamtech press, 2nd Edition, 2010.

To help the students to understand the concept of HTML, CSS, Java script and PHP.

Cascading Style Sheet

Introduction, Levels of Style Sheet and specification formats, embedded style sheet, External Style Sheet, inline Style Sheet, Class and ID method, DIV and SPAN tags, Inheritance with CSS, Introduction to CSS 3, HTML 5 and CSS3.

Internet

WWW, Web Browsers, and Web Servers, URLs, MIME, HTTP, Security. HTML and CSS 

HTML - XHTML – HTML 5

Creating simple web page, basic text formatting, presentation elements, phrase elements, lists, font, grouping elements, basic links, internal document links, email link, Image, Audio and Video, image maps, image formats, Adding flash content and video, Tables – attributes, nested tables, Forms – Attributes, form controls, Frames – Frame set, nested frames, attributes. Introduction to HTML 5 - New tags of HTML 5 – embedding Media content, building input forms, painting on canvas.

Javascript

JavaScript Implementation, JavaScript in HTML, language basics – variables, operators, statements, functions, data type conversions, reference types, Document Object Model - Browser Object Model - window object, location object, navigator object, screen object, history object, Events and Event handling, Button elements, Navigator object, validations with regular expressions. Introduction to dynamic documents, positioning elements, moving elements, elements visibility, changing colors and fonts, dynamic content, locating mouse cursor, reacting to a mouse click, dragging and dropping of elements, basic animation with image using JavaScript.

PHP

Introduction to Server Side Programming, Introduction to PHP, PHP and HTML, essentials of PHP, Why Use PHP, Installation of Web Server, WAMP Configurations, Writing simple PHP program, embedding with HTML, comments in PHP, variables, naming conventions, strings, string concatenation, string functions, float functions, Arrays, Array – key pair value, array functions, isset(), unset(), gettype(), settype(), control statements (if, switch), loops, user defined functions (with argument and return values), global variable, default value, GET & POST method, URL encoding, HTML Encoding, Cookies, Sessions, Include statement, File – read and write from the file.

MySql

Introduction to MySQL, CRUD - select statements, creating database/tables, inserting values, updating and deleting, PHP with MySQL, creating connection, selecting database, perform database (query), use returned data, close connections, file handling in PHP – reading and writing from and to FILE, Using MySQL from PHP (Building a Guestbook).

Object Oriented Programming with PHP

Introduction to OOPS, creating classes, creating objects, setting access to properties and methods, constructors, destructors, overloading and overriding of methods. Accessing PHP and HTTP Data, Reading POST and GET variables, Form validation.

[2] Steve suehring, JavaScript Step by Step, Microsoft Press, 2nd Edition, PHI, 2012.

[3] Matt Doyle, Beginning PHP 5.3, Willey Publishing, 2010.  

[2] David  Sawyer McFarland,  CSS – The Missing Manual, Pogue Press, O’Reilley  Willey Publishing, 2nd Edition, 2009.

To introduce basic postulates of Boolean algebra, methods for simplifying Boolean expressions using laws and K-maps. It helps to learn about combinational circuits like multiplexers, demultiplexers, decoders, encodes and sequential circuits. The course also focuses on architecture of 8085 microprocessor and its operations.

Understand the number systems and conversions form one to other.

Be able to use Boolean algebra, and methods to simplify the expression using K- maps and design logic circuits. Understand the concepts and working of sequential circuits and combinational circuits, Identify the basic element, functions and architecture of 8085 microprocessor.  Finally learn the instruction set of 8085 and code in the assembly language program to develop the microprocessor based application.

Number System (Binary, Hexadecimal, Octal, Decimal, Binary Arithmetic, Hexadecimal addition & subtraction, BCD addition & subtraction – 1's and 2's Compliment addition and subtraction, Basic gates, Universal gates, Positive and negative logic, Boolean Algebra, Simplification using Boolean Laws.

DeMorgan’s Theorem, Karnaugh map, sum of products, Pairs-Quads-Octets, Karnaugh map simplifications, Don't care conditions. Multiplexers, Demultiplexers, Decoders.

RS Flip-Flops, Edge-Triggered RS, D, JK Flip-Flops, Flip-Flop Timing, JK Master-Slave  Flip-Flops.

Types of Registers, Serial in-Serial out, Serial in-Parallel out, Parallel in-Serial out, Parallel in-Parallel out.

Asynchronous Counters, Synchronous Counters, Decade Counters.

Microprocessor Architecture and its operations – Address Bus, Data Bus, Control Bus, Internal data operations and Registers, The 8085 MPU – Architecture, Communication and Bus Timings, Demultiplexing the Bus, Generating Control Signals.

Memory, I/O Devices.

The 8085 programming model, Instruction classification, Instruction and Data Format, Data Transfer Operations, Arithmetic Operations, Logic Operations, Branch Operations, Writing ALP Programs.  

Looping, Counting, Indexing, Additional Data Transfer and 16-Bit Arithmetic Instructions, Arithmetic operations related to memory, Rotate and Compare of Logic operations. Assembly Language Programming – Addition of two 8 bit Hexadecimal numbers, Addition of N Hexadecimal numbers, Interchange N one byte numbers, etc.

Counters and Time Delays, Stack, Subroutines, Restart –Simulate a decade counter to count up to 99.  

The 8085 Interrupt – RST, SIM and RIM Instructions, Multiple Interrupts and Priorities, 8085 Vectored Interrupts – TRAP, RST 7.5, 6.5, 5.5.

ESE (Weight) 50%

To provide strong foundation for database design and application development, and understand the underlying core database concepts and emerging database technologies.

 Consolidate theoretical database understanding

 Get insights into recent developments in database technologies

Using High-Level Conceptual Data Models for Database Design - Entity Types, Entity Sets, Attributes,

and Keys - Relationship Types, Relationship Sets, Roles, and Structural Constraints - Weak Entity

Types - ER Diagrams, Naming Conventions, and Design Issues - Relationship Types of Degree Higher

than Two - Subclasses, Super classes, and Inheritance – Enhanced Entity Relationship Model -

Relational Database Design by ER- and EER-to-Relational Mapping - Role of Information Systems in

Organizations - Database Design and Implementation Process

Design Guidelines for Relation Schemas - Functional Dependencies - Normal Forms Based on Primary

Keys - Second and Third Normal Forms - Boyce-Codd Normal Form - Multivalued Dependency and

Fourth Normal Form - Join Dependencies and Fifth Normal Form - Inference Rules, Equivalence and

Minimal Cover - Properties of Relational Decompositions - Nulls and Dangling Tuples - File

Organization - Organization of Records in Files - Ordered Indices - B+ Tree Index Files - Static Hashing

- Bitmap Indices.

PL/SQL Block Structure – Identifiers – Literals – Comments - Conditional and Sequential Control -

Iterative Processing with Loops - Exception Handlers – Data Retrieval with Cursors - Procedures,

Functions, and Parameters – Packages.

Introduction - Documents and Collections - Data Types - Create, Read, Update and Delete Operations -

Querying using Find - Query Criteria – Type-Specific Queries – Where Queries

Mobile databases – Multimedia Databases – Geographic Information Systems – Genome Databases

[2] Kristina Chodorow, MongoDB: The Definitive Guide, O’Reilly, Second Edition, 2013.

[3] Steven Feuerstei, Oracle PL/SQL Programming, O’Reilly, Sixth Edition, 2014.

To prepare the students for a background in abstraction, notation and critical thinking in the Discrete Mathematics closely related  to computer science.

• Construct mathematical arguments using logical connectives and quantifiers.
• Verify the correctness of an argument using propositional and predicate logic and truth tables.
• Understand how Graphs  are used as tools and Mathematical Models in  the study of networks
• Construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases and mathematical induction. 
• Apply algorithms and use definitions to solve problems to prove statements in elementary number theory. 
• Perform operations on discrete structures such as sets, relations and functions and be familiar with concepts like Groups and Rings.

How to do Mathematics – Compound statements – Existential and Universal statements – Proof techniques – Logical operations – Logical equivalence- Conditional statements – Universal and Existential quantifiers – Concept of a function – Types of functions – Composition of functions.

Introduction to numbers – Divisibility – Greatest common divisor – Existence and uniqueness of prime factorization – Partition of a set – Partition of a positive integer – Even and odd permutations –  modular arithmetic – Latin squares.

Types of relations – Graphs as network – Types of graphs-Representation of graphs – Representation of relations through graphs – Paths and Cycles- Eulerian and Hamiltonian properties of paths – Equality of graphs  – Trees – Coloring of graphs – Max-Flow  –Min- Cut theorem.

Groups  –  Axiom of a group –  Examples and basic algebra in groups – Order of an element of a group – Isomorphism of groups – Cyclic groups – Subgroups – Cosets and Lagrange’s theorem – Rings-Fields.

Pattern of the Question Paper

  The research methodology module is intended to assist students in planning and carrying out research projects. The students are exposed to the principles, procedures and techniques of implementing a research project. The course starts with an introduction to research and carries through the various methodologies involved. It continues with finding out the literature using computer technology, basic statistics required for research and ends with linear regression.

•    Define research and describe the research  process and research methods

•  Understand and apply basic research methods including research design, data analysis, and interpretation.

Defining research problem - selecting the problem - necessity of defining the problem - techniques involved in defining a problem- Ethics in Research.

Principles of experimental design Working with Literature Importance, finding literature, using your resources, managing the literature, keep track of references, using the literature, literature review On-line Searching: Database – SciFinder – Scopus - Science Direct - Searching research articles - Citation Index - Impact Factor - H-index etc.

Measurement of Scaling: Quantitative, Qualitative, Classification of Measure scales, Data Collection, Data Preparation.

Descriptive Statistics Measures of Central Tendency, Measures of Dispersion, Measure of Skewness, Kurtosis, Measure of Relationship Linear Regression Analysis: Dependent and Independent variables, Simple Linear Regression model .

Scientific Writing and Report Writing: Significance, Steps, Layout, Types, Mechanics and Precautions, Latex: Introduction, text, tables, figures, equations, citations, referencing, and templates(IEEE style), paper writing for international journals, Writing scientific report.

• Review 1 Pre-Selected Papers (U: Unique for each student)

•Review 1 papers in areas of scholars choice (U)

• Using an IEEE MS Word Template and convert literature review done in previous paper reviews.Follow Reference Styles • Gather data from Wikipedia and populate a spreadsheet. (U)

• Using the data collected, analyze the data using 7 different spreadsheet statistics functions.

• Script a paper in IEEE LATEX template(U)

The course is designed to provide a practical exposure to the students.

• Demonstrate various data types and operators.
• Demonstrate method overloading and constructor overloading.
• Demonstrate the usage of static keyword in Java – use static data and static block.
• Demonstrate final keyword with respect to variable, method and class.
• Demonstrate inner classes in Java.
• Demonstrate multilevel inheritance and usage of the keywords this & super.
• Demonstrate abstract class.
• Demonstrate the usage of interface for multiple inheritance.
• Differentiate the usage of throw, throws and try-catch-finally by writing a Java program.  

• Demonstrate various I/O streams in Java.
• Demonstrate the Reader/Writer classes in Java.
• Demonstrate the multithreading concept by implementing Runnable interface.
• Demonstrate the multithreading concept by extending Thread class.
• Make some graphics in an applet program using paint function.
• Demonstrate the usage of different Layouts in Java.
• Demonstrate various GUI components in Java (AWT / SWING) with appropriate Event Handling.
• Implement two way communication between server and client. 18. Retrieve data from the table of the database. 

[2] RaoNageswara, Core Java, An Integrated Approach, Dreamtech press, 2nd Edition, 2010.

To help the students to understand the concept of HTML, CSS, Java script and PHP.

Guidelines:

* The output of the programs should be neatly formatted.

* The source code should be indented.

* The programs need to be interactive.

* Data validations can be done wherever applicable. 

* Include comments to improve the readability of the program .

* Use meaningful variable names.

* Program should be prepared by their own.

* Follow the ethics of Programming, Web Design and Development.

Programs:

• Create a Web page by making use of the following tags: Headers, Linking and Images. 

• Create a Web page that will have the following:  Frames, Unordered Lists, Nested and ordered Lists.

• Create a Web page Layout with Tables and all its attributes.

• Create a Web page that will have Application form (Forms),  make use of  Image Maps and  <meta> Tags.

• Create an External Style Sheet that defines the style for the following tag : H1, H2, Body , P, Li. 

• Create an Internal Style Sheet that defines a style for Positioning elements & setting the background (color / image). 

• Create a Style Sheets that defines the style with class method , Id method , make use of DIV and Span TAG. 

• Create a Style Sheet that demonstrate Box Model. 

• Write a JavaScript program to Demonstrate the use of Variable , message box , and loops. 

• Write a JavaScript program to demonstrate Functions (predefined / user defined). 

• Write a JavaScript program to demonstrate Event Handling. 

• Object Creation and modification in JavaScript. 

• Write a PHP program to demonstrate GET and POST method of passing the data between pages. 

•  Write a PHP program to demonstrate Array , Key-pair values.  

•  Write a PHP program to read and write the Data from the Database.

• Create a PHP page that uses Session and cookies. 

• File Handling in PHP .

• Implementing the OOP concept in PHP.

[2] Steve suehring, JavaScript Step by Step, Microsoft Press, 2nd Edition, PHI, 2012 [3] Matt Doyle,

Beginning PHP 5.3, Willey Publishing, 2010.

[2] David Sawyer McFarland, CSS – The Missing Manual, Pogue Press, O’Reilley Willey Publishing, 2nd Edition, 2009.

Two questions will be selected by the examiners. Students have to write and execute both the programs.

Data Structure is considered as one of the fundamental paper towards a more comprehensive understanding of programming and application development. Student is expected to work towards a sound theoretical understanding of Data Structures and also compliment the same with hands on implementing experience.

Introduction, Basic Terminology, Data Structures, Operations, Algorithms: Time & Space Complexity, Algorithmic Notation, Abstract Data Types. Programming standards and ethics.

Stacks, Array Representation, Arithmetic Expressions, Polish Notation, Application of Stacks, Recursion, Towers of Hanoi, Implementation of Recursive procedures by Stack, Queues, Queue Array Representation

Introduction, Linked lists and Memory Representation, Traversing, Searching, Memory Allocation,Garbage Collection, Insertion, Deletion, Circular Linked list, Two-way Lists(Doubly). Linked List Implementation of Stack and Queue

 Infix to Prefix

Introduction, Sorting, Insertion Sort, Selection Sort, Shell Sort, Merging, Merge-Sort, Quick Sort, Radix Sort, External Sorting. Hashed List Searches: Hashing Methods - Direct method, Subtraction Method, Modulo-division Method, Digit-extraction Method, Midsquare Method, Folding Method, Rotation Method, Pseudorandom Hashing.

Collision Resolution – Open addressing, Linear Probe, Quadratic Probe, Pseudorandom Collison Resolution, Linked List Collision Resolution, Bucket Hashing, Combination Approaches. Text Searching using Knuth-Morris-Pratt algorithm.

AVL Trees: AVL Balance Factor, Balancing Trees, AVL node structure, AVL Tree Rotate Algorithms.

 Heap, Heap Sort, splay and Red Black tree.

Introduction, Binary Trees, Representing Binary Trees in memory, Traversing Binary Trees, Traversal Algorithms, Binary Search Trees, Searching, Inserting and deleting in Binary Search Trees, Heap, Heap sort, Huffman’s Algorithm. 

Multiway Search Trees, B-Trees B-Trees: B-Tree insertion, Deletion, Traversal and Search algorithm, Simplified B Trees, 2-3 Tree, 2-3-4 Tree, Variations of B Tree - B+ Tree, B* Tree. 

Graphs-Graph Theory Terminology, Sequential representation of Graphs, Adjacency matrix, Path matrix, Linked representation of a Graph, Operations on Graphs, Depth First and Breadth First Traversing a Graph, Minimum Spanning Tree Algorithm.

[2] Richard Johnsonbaugh, Algorithims,Pearson Education, 2nd Edition, 2008

[3] Robert Sedgwick, Algorithim in C++, Addison-Wesley Publishing Company.

[4] Knuth, Donald E, Art of Computer Programming, Sorting & Searching, Addison-Wesley, 2005.

The course provides comprehensive understanding of the layered architecture of UNIX operating system, system calls, and file system structure. It also focuses on acquiring skills needed to develop UNIX shell programs, making effective use of wide range of UNIX programming standard and tools.

History, System structure, Users Perspective, OS Services.Architecture, System Concepts. The Buffer Cache: Headers, Structure of the Buffer Pool, Scenarios, Reading and writing Disk Blocks, Advantages and disadvantages of buffer cache. Algorithms: getblk, brelse, bread, breada, bwrite
INODES, Structure of a regular file, Directories, Conversion of a path name to an INODE, Super Block, INODE assignment, Allocation of Disk Blocks, System calls for the file system: Open, Read, Write, Close, Pipes, Mounting and Unmounting Files. Algorithms: iget, iput, ialloc, ifree, open, read, write, creat.

General purpose utilities, The File system, Handling Ordinary files, Basic File attributes, The Shell, The process, Hard links, Symbolic links, Umask, Modification and access time , Simple Filters: pr, head, tail, cut, paste, sort, uniq, tr, Filters using regular expressions: grep and sed ,Advanced Filters-awk, Essential System Administration

read, using command line arguments, exit and exit status command, logical and conditional operators, if condition, using test and [] ,case, expr, Loooping – while, for ,set and shift, trap, debugging, functions.
Advanced Shell Programming
Shells, sub shells, export, running a script in current shell, eval, exec.

Process States and Transitions, Layout of System Memory, Context of a Process, Manipulation of the process address space, Process Control: Creation, Signals, Process termination, Awaiting process termination, invoking other programs, The Shell, System Boot and Init Process, Process Scheduling and Time: Process scheduling, System calls for time, Clock.
Algorithms: fork, exit, wait, exec

Swapping, Demand Paging, the I/O sub system: Driver Interfaces, Disk Drivers, Terminal Drivers, and Streams.
Process Tracing, System V IPC: Messages, Shared memory, Semaphore, Network Communications: Sockets. Algorithms: msgsnd, msgrcv, shmat, semop.

To provide a sound technical exposure to the concepts, principles, methods, and best practices in software architecture and software design.

Origin of an Architecture , Software Processes and Architectural Business Cycle, A good architecture, Software Architecture, What is & what it is not the software Architecture is, Other points of view, Architectural Pattern, Reference Models and Reference Architectures, The Importance of Software Architecture, Architectural structures & views, Case study in utilizing Architectural Structures.

Understanding the quality Attributes 

Functionality and Architecture, Architecture and Quality Attributes, System Quality Attributes, Quality Attributes Scenarios in practice, Other System Quality Attributes, Business Qualities, Architecture Qualities.

Achieving Qualities Introducing Tactics – Availability, Modifiability, Performance, Security, Testability, Usability, Relationships of Tactics to Architectural Patterns, Architectural Patterns and Style.

Self Study: Achieving Qualities

Designing the Architecture

Architecture in the life cycle, Designing the Architecture, Forming the Team Structure, Creating the Skeletal System. Documenting Software Architectures, Uses of Architectural Documentation, Views, Choosing the relevant views, Documenting a view, Documentation across views.

ATAM (Architecture Tradeoff Analysis Method)

A comprehensive method for architecture evaluation, participants, outputs, phases of the ATAM, The Nightingale system - A case study in applying the ATAM.

CBAM (Cost Benefit Analysis Method)

A quantitative approach to architecture design decision making: Decision making context, basis for CBAM, Implementing CBAM.Architecture of ORACLE 12c, Java.
 

Reusing Architectural Assets

Overview – Successful working, Scope, Architectures and Difficulties in software product lines. Unix Architecture, Layered & State Diagram.

Building systems from off-the-shelf components.

Impact of components on Architecture,Architectural mismatch, Component-based design as search, ASEILM example.

[2] Jeff Garland,Richard Anthony,  Large-Scale Software Architecture – A Practical Guide Using UML,  Wiley –dreamtech India Pvt.,Ltd., 1st Edition,2002.  

[3]Pressman S Roger, Software Engineering, McGraw Hill International Editions, 7th Edition, 2009.

[4] Rumbaugh, James, Object Oriented Modeling and design, Pearson Education, New Delhi, 2005.

This course aims at providing a comprehensive overview of the important issues related to Wireless communication and Mobile Computing. They are grouped into four main areas: basic issues and problems, mobile communications, cellular networks and protocols. Different mobile communications methods and latest communication technologies are discussed. Protocols such as Mobile IP, medium access control and mobility management strategies that are needed to support mobile devices are covered under the specified topic.

History and Evolution of Wireless Radio Systems, Development of Modern Telecommunications Infrastructure, Overview of Existing Network Infrastructure, Wireless Network Applications: Wireless Markets.
Evolution and Deployment of Cellular Telephone Systems
Different Generations of Wireless Cellular Networks, 1G Cellular Systems, 2G Cellular Systems, 2.5G Cellular Systems, 3G Cellular Systems, 4G Cellular Systems and Beyond, Wireless Standards Organizations..

Common Cellular Network Components, Hardware and Software Views of the Cellular Network, 3G Cellular System Components, Cellular Component Identification, Cell establishment.
Wireless Network Architecture and Operation
The Cellular Concept, Cell Fundamentals, Capacity Expansion Techniques, Mobility Management, Wireless Network Security.

Introduction to GSM and TDMA, GSM Network and System Architecture, GSM Channel Concept, GSM Identities, GSM System Operations, GSM Infrastructure Communications

Introduction to CDMA, CDMA Network and System Architecture, CDMA Channel Concept, CDMA System Operations.
CDPD and Edge Data Networks
CDPD, GPRS, GPRS Networks, GPRS Network Details, GPRS Network Layout and Operation, GPRS Packet Data Transfer, GPRS Protocol Reference Model, GPRS Logical Channels, GPRS Physical Channels, GSM/GPRS/Edge Technology.

Introduction to wireless LAN 802.11X technologies, Evolution of Wireless LAN, Introduction to IEEE 802.15x Technologies, Wireless PAN Applications and Architecture, Bluetooth, Introduction to Broadband wireless MAN,802.16 technologies

To understand the need for Software Quality, Tools Used and Metrics involved. To appreciate software testing principles and methods to detect in the ever changing software technological changes. 

Ability to test code, artifacts better

 Learn to apply different Quality Tools

Understand the advantages of Extreme Testing and High Order Testing 

Create effective test plan 

Create detailed test cases 

Appreciate the need for Software Quality Metrics and Assessments 

Quality: popular view, Quality: professional view, software quality, total quality management, The defect prevention process, process maturity framework and quality standards (CMM , SPR Assessment, Malcolm Bridge, ISO9000)

Levels of measurement some basic measures, reliability and validity Software quality metrics Product Quality Metrics, in-process quality process, example of Metrics Program – Motorola, HP 

Ishikawas’ seven basic tools, checklist, pareto diagram, histogram, runchart, scatter diagram control chart cause and effect diagram. Defect Removal Effectiveness Literature review, a close look at DRE, defect removal effectiveness and quality planning 

Software Testing Principles, Economics of Testing Inspection and walkthrough, code inspection, an error checklist for Inspection, Walkthroughs, Desk Checking, Peer Rating Module Testing Self Study Two testing tools 

High Order Testing - Debugging by Brute Force, Induction, Deduction, Backtracking Extreme Programming basics, Extreme Testing, Extreme Testing Applied Java Unit Testing, Automatic testing. 

[2] GlenfordJ.Myers , The Art of Software Testing” John Wiley and Sons publications, 2004 

To understand the dynamics of cyber security and cyber law matrix, Creating techno-legal professionals with the blended skills of law and technology.

• Appreciate how the online world is similar and different from the physical world from a regulatory perspective;

• Analysing the legal issues involved in various problems and conflicts commonly encountered online

• Understand the E-governance, digital signature concepts

Object and Scope of the IT Act, Genesis, Object, Scope of the Act, Encryption

Symmetric Cryptography, Asymmetric Cryptography, RSA Algorithm, Public Key, Encryption.

Digital Signature: Technology behind Digital Signature, Creating a Digital Signature, Verifying a Digital Signature, Digital Signature and PKI, Digital Signature and the Law

E-Governance and IT Act 2000: Legal recognition of electronic records, Legal recognition of digital signature, Use of electronic records and digital, signatures in Government and its agencies.

CertifyingAuthorities: Need of Certifying Authority and Power, Appointment, function of Controller,Who can be a Certifying Authority?, Digital Signature Certifications, Generation, Suspension and Revocation Of Digital Signature Certificate.

Domain Name Disputes and Trademark Law

Concept of Domain Names, New Concepts in Trademark, Jurisprudence, Cyber squatting, Reverse Hijacking, Meta tags, Framin g, Spamming, Jurisdiction in Trademark Dispute .

Cyber Regulations Appellate Tribunal, Establishment & Composition Of Appellate Tribunal, Powers of Adjudicating officer to Award Compensation, Powers of Adjudicating officer to Impose Penalty.

The Cyber Crimes

Tampering with Computer Source Documents, Hacking with Computer System,Publishing of Information Which is Obscene in Electronic Form, Offences : Breanch of Confidentiality & Privacy, Offences : Related to Digital Signature Certificate.

[2] Cyber laws: For every netizen in India (With Information Technology Bill 1999) / NA Vijayashankar. - Bangalore: Ujvala Consultants Pvt. Ltd., 1999.

[3] Researching the legal web: A guide to legal resources on the Internet Nick Holmes and Dalia Venables. - 2nd Ed. - London: Butterworths, 1999.

Thiscourse intends to make the students familiar with the required mechanisms for conducting business transactions through electronic means. As a prerequisite, the students should be having a basic knowledge about computer networks and information technology.

•         To provide them with the fundamental knowledge of the use of computers in business.

•         To understand the various concepts of e-commerce.

•         To understand the methodology for online business dealing using e-commerce infrastructure.

•         To understand the interrelationships between two media channels –mobile and social and how brands can engage consumers through these channels.

•         To develop a strategic approach to define how mobile phones can be aligned and integrated into an overall marketing strategy in organizations. 

Electronic commerce fundamentals

 History and basic idea of EDI and electronic messaging, definition of e-commerce; administration, business, and consumer models of e-commerce; e-commerce enablers

- cost reduction, trust issues, products, processes, and markets.

Client-server computing in e-commerce

Client-server computing basics, design technologies

E-commerce Internet applications

Overview of e-commerce standardization activities and standards; overview of Java enterprise solutions; brief introduction to web service development advanced features, like SOAP, WSDL, UDDI; use of agent technology-like mobile agents; designing an e-com site.

XML in e-commerce

 Introduction to XML, XML-based enterprise applications, limitations of XML; future of XML.

Cryptography in e-commerce

Cryptography basics; private key encryption; public key encryption; cryptography and the WWW. Introduction to SSL.

Electronic payment systems

 Digital cash-Ecash, ECheque, Credit card based payment systems, Micropayments and Macro payments. Example protocols like iKP, payword, Millicent, SET, etc.

Search engines

Intelligent search technology & personalization, information addition & retrieval.

Social impacts of e-commerce

Changes in administration & business; electronic shopping; electronic forms; global e-commerce and future trends.

Mobile Commerce

Introduction to Mobile Commerce; Mobile Marketing; M-commerce Applications; M-commerce Strategy and Security, Social and Ethical Issues in M-commerce. 

[2] Ince, Darrel; Developing Distributed and E-commerce Applications; Addison Wesley, 2013.

[2] Murthy, C.S.V. (2002). E-Commerce – Concepts, Models, Strategies. (2012 ed.). Himalaya     Publishing House.

[3] Andersson, C., Freeman, D. James, I., Johnston, A. and Ljung, S. (2006) Mobile Media and     Applications, From Concept to Cash: Successful Service Creation and Launch. Wiley.

[4] Bouwman, H., de Vos, H. and Haaker, T. (2010) Mobile Service Innovation and Business Models. Springer.

To enable the students to learn the basic functions, principles and concepts of Computer Architecture, learn the fundamental aspects of Computer Architecture and design, focus on processor design, control unit design techniques and study on I/O interfacing.

Understood Computer Architecture.

Understood number systems, I/O, Registers and memory.

Understood processor design, control unit design.

Understood I/O interfacing.

Computer components – computer function – instruction fetch and execute – interrupts – I/O functions – interconnection structures – Bus interconnection – Bus structure – multiple bus hierarchies – elements of bus design.

Memory

Computer memory system overview – characteristics of memory system – memory hierarchy – cache memory principles – elements of cache design- cache size – mapping function – replacement algorithms – write policy – internal memory semiconductor memory – organization – DRAM and SRAM – types of ROM – chip logic – external memory – magnetic disk magnetic read write mechanisms – data organization and formatting – physical characteristics – disk performance parameters – RAID – optical memory.

Self Learning:

Introduction to Magnetic disks, optical memory.

External devices – I/O modules – programmed I/O – interrupt driven I/O – DMA – I/O processor – interface circuits – serial port – parallel port – standard I/O interfaces – PCI bus, SCSI bus, USB bus.

The arithmetic and logic unit – integer arithmetic – negation – addition – subtraction – multiplication and division – floating point representation – principles – IEEE standard for binary floating point representation – floating point arithmetic addition and subtraction – multiplication and division – precision considerations.

Instruction sets characteristics – types of operands – types of operations – addressing modes – instruction formats - processor organization – register organization – instruction cycle – instruction pipelining- reduced instruction set architecture – RISC verses CISC Case study: Pentium and power PC data types – operation types – addressing modes.

Control unit operations – micro operations – fetch cycle – indirect cycle – interrupt cycle – execute cycle – instruction cycle – control of the processor – functional requirements – control signals – hardwired implementation – control unit inputs and control unit logic – micro programmed control Basic concepts – Micro instructions – micro programmed control unit – micro instruction sequencing design considerations – sequencing techniques – address generation –micro instruction execution – micro instruction encoding.

Service learning: E-waste Management

[2] David A. Patterson and John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Elsevier, 2008.

[3] John P. Hayes, Computer Architecture and Organization, McGraw Hill, 3rd Edition, 2002.

[4] Vincent P. Heuring and Harry F. Jordan, Computer Systems Design and Architecture, Pearson Education, 2nd Edition, 2004.

[5] M. Morrris Mano, Computer system architecture, Pearson Education, 3rd Edition, 2005.

To familiarize the students with the concepts of computer graphics like line, circle drawing algorithms, transformations, clipping, projection, color models, curves. To make the students understand how to implement the computer graphics concepts using OpenGL.

• The concepts of Computer Graphics. 
• Implementing the Graphics concepts using OpenGL.

Applications, Overview of Graphics Systems – Video display devices, Raster-scan systems, Graphics software, Introduction to OpenGL.

Graphics Output Primitives

Coordinate Reference Frames, Two-Dimensional frame in OpenGL, Point Functions, Line Functions, Line-Drawing Algorithms – DDA, Bresenhams, Curve Functions, Midpoint Circle Algorithm, and Display-window reshape function.

Self-Learn: Area filling, Display lists, Basic colors, Attribute functions.

Basic two-dimensional geometric transformations, Homogeneous Coordinates, Composite transformations, Geometric transformations in three-dimensional space, Translation, Rotation, scaling, composite three-dimensional transformations, OpenGL geometric transformation functions.

Self-Learn: Reflection, shear.

Light sources, Basic illumination models, transparent surfaces, OpenGL illumination functions. Color Models, Standard primaries and chromaticity diagrams, RGB color model, HSV color model. OpenGL color functions.

Self-Learn: Ray-tracing and Texture mapping.

Two-dimensional viewing pipeline, clipping window, Normalization and viewport transformations, 2D viewing functions, Clipping Algorithms – Line clipping – Cohen- Sutherland and Liang-Barsky Line clipping, polygon clipping – Sutherland-Hodgman algorithm.

Three-dimensional viewing concepts – Projections, Three-dimensional viewing pipeline, Projection transformation, Parallel and Perspective projection matrices. 3D viewing functions. Self-Learn: Other clipping algorithms, Text clipping, and Projection derivations.

Spline representations, Cubic spline interpolation methods, Bezier curves and B-Spline curves. OpenGL approximation-Spline functions.

The World Wide Web has become a major delivery platform for information resources. Many applications continue to be developed in an ad-hoc way, contributing to problems of usability, maintainability, quality and reliability. This Course Description examines systematic, disciplined and quantifiable approaches to developing of high-quality, reliable and usable web applications.

RE Fundamentals and Specifics - Principles for RE - Adapting RE Methods - Modeling Fundamentals and Specifics - Modeling Requirements - Content Modeling - Hypertext Modeling - Presentation Modeling - Customization Modeling 

Fundamentals and Specifics – Components - Layered Architectures - Data-aspect Architectures - Evolutionary Perspective - Presentation Design - Interaction Design - Functional Design – Outlook 

Fundamentals and Specifics of Testing - Test Approaches and Schemes - Test Methods and Techniques - Test Automation – Challenges in Launch of a Web Application - Promoting a Web Application - Content Management - Usage Analysis 

Characteristics of Performance - Definition and Indicators – Workload - Analytical Techniques - Representing and Interpreting Results - Performance Optimization Methods - Aspects of Security - Encryption, Digital Signatures and Certificates - Secure Client/Server-Interaction - Client Security Issues - Service Provider Security Issues

Fundamentals - Client/Server Communication - Client-side Technologies - Ajax - Documentspecific Technologies - Server-side Technologies - Fundamentals and Specifics of Semantic Web - Technological Concepts and Tools

To make the students learn the principles and practices of Cryptography, Network Security and to enable the students understand the various methods of encryption and authentication and help them identify the application of these techniques for providing Network and System Security.

Introduction, The need for security, Security Approaches, Security Attacks, Security Services, Security Mechanisms, A Model for Network Security. Symmetric Cipher Models – Substitution techniques, Transposition techniques, Steganography, Block Cipher Operation, Electronic Code Book, Cipher Block Chaining, Block Cipher Principles, The Data Encryption Standard, A DES Example, The Strength of DES, Evaluation criteria for AES, AES Cipher.

Introduction To Number Theory, Modular Arithmetic, Prime Numbers, Euler’s Totient Function, Principles of Public Key Cryptosystems, The RSA Algorithm, Other Public key cryptosystems, Diffie Hellman Key Exchange. Applications of Cryptographic Hash Functions, Two Simple Hash Functions, Hash Functions Based on Cipher Block Chaining, MD5 Message Digest Algorithm, Secure Hash Algorithm SHA 512.

Message Authentication Requirements – Message Authentication Functions –Requirements for Security of MACs, MACs Based on Hash Functions, HMAC, MACs Based on Block Ciphers, Data Authentication Algorithm. Digital Signatures, Elgamal Digital Signature Scheme, Schnorr Digital Signature Scheme, Digital Signature Standard.

Symmetric Key Distribution Using Symmetric Encryption, Symmetric Key Distribution Using Asymmetric Encryption, Distribution of Public Keys, X.509 Certificates, Public Key Infrastructure.

Remote user Authentication Principles, Remote User-Authentication Using Symmetric Encryption, Kerberos, Motivation, Kerberos Version 4, Remote User-Authentication Using Asymmetric Encryption, Federated Identity Management.

Network & Internet Security

Transport-Level Security

Web security Considerations, Secure Socket Layer and Transport layer Security; E-Mail Security – Pretty Good Privacy, S/MIME.

IP Security

IP Security Overview, IP Security Policy, Encapsulating Security Payload, Combining Security Associations, Internet Key Exchange.

Self Learning

Legal and ethical aspects

Cyber Crime and computer crime, Intellectual property, privacy, Ethical issues.

[2] Brijendra Singh, Network Security and Management, PHI ,3rd Edition, 2013.

[3] Eric Maiwald, Information Security Series, Fundamental of Network security, Dreamtech press,2010.

[4] Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security: Private communication in public world, Prentice Hall, 2009.

Object Oriented Analysis and Design Using UML course provides instruction and practical experience focusing on the effective use of object-oriented technologies and the judicious use of software modeling as applied to a software development process.

• To know how to identify objects, relationships, services and attributes through UML.

• To understand the use-case diagrams.

• To know the Object Oriented Design process.

• To know about software quality and usability.

Complexity

The inherent complexity of software, The Structure of complex systems, Bringing order to chaos, on designing complex systems, Categories of analysis and Design methods.

The Object Model

The evolution of object model, Elements of object model, applying the object model, Foundations of the object model.

Classes and Objects

The nature of an object, Relationship among objects, the nature of a class, Relationship among classes, The interplay of classes and objects, On building quality classes and objects, invoking a method.

Classification

The importance of proper classification, Identifying classes and objects, Key abstraction and mechanisms, A problem of classification.

Basic BehaviouralModelling, Basic elements, class diagram, object, state Transition diagram, Interactions, Use Case Diagrams, Activity, module and process diagrams.

Principles, Micro and macro development process, Pragmatics- Management and planning, staffing, Release management, Reuse, Quality Assurance Metrics, Documentation, Tools, The benefits and risks and Object-oriented development.

Components, Deployment, Collaborations, Pattern and Frameworks, Component Diagram, Deployment Diagrams, Systems and Models.

Case Study: A domain based analysis and design using rational rose can be made.

[2] Grady Booch, James Rumbaugh and Ivar Jacobson, The Unified Modeling Languages User Guide, Addison Wesley, 4th Edition, Reprint 2000.

[3] Mike O’Docherty, Object Oriented Analysis and Design Understanding system development with UML2.0, John Wiley and Sons, 1st Edition, 2005.

The objective of this course: is for students to learn how to design, prototype and evaluate user interfaces to effective browse and search systems by examining what research has uncovered, what developers have produced, and how people perform information tasks.

• Learn basic user interface principles through practice. 

• Learn about cognitive and perceptual abilities and constraints that impact information use. 

• Learn about human information processing and how it is applied to the design of user interfaces. Learn to conduct user and task analysis specifically for information retrieval tasks. 

• Learn to design and prototype user interfaces. Prepare for further training and research in this area. 

•   Be familiar with research issues in user interface design.

Goals of User-Interface Design,  Human factors in user interface design, Theories, Principles, and Guidelines, Goals of Systems Engineering, Accommodation of Human Diversity, Goals for Our Profession, High Level Theories, Object-Action Interface model, Principle 1:Recognize the Diversity, Principle 2: Use the Eight Golden Rules of Interface Design, Principle 3: Prevent Errors, Guidelines for Data Display, Guidelines for Data Entry, Balance of automation and Human Control, Practitioner’s Summary, Researcher’s Agenda.  

Management Issues - Introduction, Organizational; Design to Support Usability, The three Pillars of Design, Development Methodologies, Ethnographic  Observation, Participatory Design, Scenario Development, Social Impact Statement for Early Design Review, Legal issues, Expert Reviews, Usability, testing and Laboratories, Surveys, Acceptance tests, Evaluation During Active Use, Controlled Psychologically Oriented Experiments, Practitioner’s Summary, Researcher’s agenda.

Introduction, Specification Methods; Interface-Building Tools, Evaluation and critiquing Tools. Direct Manipulation and virtual Environments: Introduction, Examples of Direct manipulation systems, Explanations of Direct manipulation, Visual Thinking and Icons, Direct Manipulation Programming, Home Automation, Remote Direct manipulation, Virtual Environments Menus: Task-Related Organization, Item Presentation Sequence, Response Time and Display Rate.

Fasty Movement through Menus, Menu Layout, Form Filling, Dialog boxes, Command-Organization strategies, The Benefits of Structure, Naming and Abbreviations, Command Menus, Natural Language in Computing, Practitioners Summary, Researcher’s Agenda.

Interaction Devices, Introduction, Keyboards and Function Keys, Pointing Devices, speech Recognition, Digitization, and Generation, Image and Video displays, Printers. Response Time and Display Rate: Theoretical; Foundations, Exceptions and attitudes, User Productivity, variability, Presentation Styles and Manuals: Introduction, Error messages, Non anthopomorphic Design, Color of Manuals, Help: Reading From paper Versus from Displays, Preparation of Printed manuals,  Preparation of Online Facilities, Practitioner’s Summary, Researcher’s Agend.

Introduction, Individual-Window Design, Multiple-window Design, Coordination by Tightly-Coupled Windows, Image Browsing and Tightly-Coupled Windows, Personal Role Management and Elastic Windows Computer-Supported Cooperative Work; Introduction, Goals of Cooperation, Asynchronous Interactions: Different Time, Different Place, Synchronous Distributed: Different Place, Same Time, Face to Face: Same Place, Same Time, Applying CSCW to Education.

Introduction, Database Query And Phrase Search in Textual Documents, Multimedia Document Searches, Information Visualization, Advanced Filtering. Hypermedia and the World wide Web: Introduction, Hypertext and Hypermedia, World Wide Web, Genres and Goals and Designers, Users and Their Tasks, Object Action Interface Model for Web Site Design, Practitioner’s summary, Researcher’s Agenda.

[2] Wilber O Galitz, An Introduction to GUI Design Principles and Techniques, John- Wiley &Sons, 2007.
 
 

[2] Alan Dix, Human-Computer Interaction, Pearson,2009.

Data Science is the latest buzz word in the modern era of cloud and big data in academic research and corporate world. Data Science experts must acquire analytical skill set for pursuing research and generating new knowledge in the business process. Data Analytics course delivers various techniques to discover new and hidden knowledge from the data set. This course provides insight into the complete research process in phases as research methodology, data exploration, modeling, evaluation and visualization.   R programming, MATLAB and Excel are the suggestive tools for implementation.

• collect data from various sources
• explore data using tools
• build analytical models
• interpret results based on the choice of domain

Introduction, Data and Relations-Matrix representation, variable measures, sequential relation, sampling and quantization.

Data Pre-processing-Cleaning, Transformation, Basic Visualization-PCA, multidimensional scaling, Histograms, Correlation. 

Linear and non-linear regression, Feature Selection. Forecasting-Recurrent Models, Classification-Rules, Trees, Naïve Bayes, SVM, Vector Quantization. Evaluation Metrics-Validation and Interpretation.

Optimization Methods – With derivatives, Gradient Descent. Clustering-Cluster Partition, Sequential, Prototype-Based, Relational, Cluster Validity and Self Organizing Map.

Introduction to Multi-criteria Decision Making, Using Numerical Methods in Data Science, Mathematical Modeling with Markov Chains.Modeling Spatial Data with Statistics- Getting predictive surfaces from special point data, Using trend surface analysis on spatial data.

Principles of Visualization-Understanding the type, Design Style, Data Graphic Type, Web-based Applications for Visualization Design, Best practices in dashboards, Making maps for Spatial Data.

Self Learning: Additional Exploration and Modeling Algorithms

Service based learning: Building models for social relevance issues

This course serves as an introduction to the basic theory of Computer Science, formal methods of computation and in-depth understanding of the compilation process. Topics include finite automata, regular expressions and languages; push‐down automata, context‐free languages; selected advanced language theoretical topics; emphasis on technique and compiler theory as well. 

Alphabets, Strings and Languages, Deterministic and Non-Deterministic Finite Automata, Finite Automata with ε -moves, regular expressions equivalence of NFA and DFA, two-way finite automata, Moore and Mealy machines, applications of finite automata. 

Context-Free Languages and Derivation Trees Ambiguity in Context-Free Grammars Chomsky Normal Form Greibach Normal Form, Push Down Automata Definition, Acceptance by Push Down Automata, Push Down Automata and Context Free Languages, properties of CFL. 

Compilers Analysis of the source program Phases of a compiler, Compiler construction tools, Role of Lexical Analyzer Input Buffering Specification of Tokens. 

Shift reduce parsing- operator precedence parsing, Recursive descend parsing, predictive parsing, LR parsing, Simple LR parsing, canonical LR parsing, LALR parsing. 

Intermediate languages Declarations, Assignment Statements, Boolean Expressions, Case Statements, Back patching Procedure calls. Code Optimization: Principle Sources of optimization, Loop Optimization, DAG Representation of basic blocks, Global Data Flow Analysis, Code Generation, Problems in code generation Register allocation and assignment, Code Generation from DAG s,Peephole-Optimization. 

2. A.V. Aho, J.D. Ullman, Principles of Compiler design' , Addison Wesley, 1998.

2. Tremblay, A.S., and Sorenson, P.G., 'The Theory and Practice of 38 Compiler Writing', McGraw-Hill Int. Edition, 1985.

3. Michael Sipser, Introduction to the Theory of Computations , Brooks/Cole, Thomson Learning, 1997.

4.Mishra&Chandrashekharan: Theory of Computer Science, Automata Lanauages& computation, 2nd Ed PHI, New Delhi.

5. John c. Martin, Introduction to Languages and the Theory of Computaiton, Tata McGraw-Hill, 2003.

6. LewishPapadimitra: theory of Computations, Prentice Hall of India, New Delhi. 

To present the main characteristics of distributed systems, as well as the related problems and the most common solutions. Student can implement a simple distributed application using a message based protocol.

•         Ability to implement a simple distributed software laboratory work with socket and RMI interfaces. 

•         Knowing the existing libraries and algorithmic solutions for the problems of distribution. 

•         Understanding the problems that will arise if atomicity and timing issues are not handled in a distributed application.

Introduction:

Distributed System, Examples of Distributed Systems, Important Issues in Distributed Systems, Implementing a Distributed System, Parallel versus Distributed Systems.

Inter process Communication: Introduction, Processes and Threads, Client–Server Model, Middleware, Network Protocols, Ethernet, Wireless Networks, OSI Model, IP, Transport Layer Protocols, Inter process Communication Using Sockets, 

The Client-Server Model – (Client and Servers, Addressing, Block versus Nonblocking Primitives, Buffered versus Unreliable Primitives) – Remote Procedure Call – (Basic RPC Operation, Parameter Passing, Dynamic Binding, RPC Semantics in the Presence of Failures) Distributed objects and remote invocation

Models for Communication: Need for a Model, Message-Passing Model for Inter process Communication, Process Actions, and Synchronous versus Asynchronous Systems.

Introduction -- Clock Synchronization – (Logical Clocks, Physical Clocks, Clock Synchronization Algorithms) – Election Algorithms – (The Bully Algorithm, A Ring Algorithm) – Atomic Transactions – (Introduction to Atomic Transactions, The Transaction Model. Implementation, Concurrency Control) – Deadlocks in Distributed Systems – (Distributed Deadlock Detection & Prevention). Resource Deadlock and Communication Deadlock, Detection of Resource Deadlock, Detection of Communication Deadlock.

Introduction, Solutions on Message-Passing Systems, Lamport’s Solution, Ricart–Agrawala’s Solution, Maekawa’s Solution, Token-Passing Algorithms, Suzuki–Kasami Algorithm, Raymond’s Algorithm’

Distributed Snapshot: Introduction, Properties of Consistent Snapshots, Cuts and Consistent Cuts, Chandy–Lamport Algorithm.

Global State Collection: Introduction, Elementary Algorithm for All-to-All Broadcasting, Termination-Detection Algorithms, Dijkstra–Scholten Algorithm.

Fault Tolerance and File Systems

Fault-Tolerant Systems: Introduction, Classification of Faults, Specification of Faults, Fault-Tolerant Systems, Masking Tolerance, Nonmasking Tolerance, Fail-Safe Tolerance, Graceful Degradation, Detection of Failures in Synchronous Systems, Tolerating Crash Failures.

Distributed File Systems                                                                                                                        Introduction – Distributed File System Design – (The File Service Interface, The Directory Server Interface, Semantics of File Sharing) -- Distributed File System Implementation – (File Usage, System Structure, Caching, Replication, An Example: Sun’s Network File System).

Distributed Shared Memory: Introduction, What is Shared Memory? , Consistency Models, Page-Based Distributed Shared Memory.

[2] Coulouris G., Dollimore J., Kindberg T., Blair G., Distributed Systems: Concepts and Design, Addison-Wesley, 5^th Edition, 2011.

[2] SinghalMukesh, Shivaratri G Niranjan, Advanced Concepts In Operating Systems Distributed Data Base and Multiprocessor Operating Systems, McGraw-Hill, Inc., 2009.

Course introduces students to basic Matlab programming concepts. At the end of the course, students should be able to use Matlab in their own work and be prepared to develop the skills necessary to handle research related projects in the area of Science effectively.

 Be fluent in the use of procedural statements--assignments, conditional statements, loops, function calls, arrays and files.

 Be able to design, code, and test small programs using GUI.

 Familiarity with graphics tools.

Matlab Installation, Features of Matlab - Some basics of using Matlab - The order of precedence, Algebraic functions, special characters, functions, Variables, Different types of variables

Matrices, vectors andscalars - Creating matrices, Addressing parts of matrices, Changing parts of a matrix, Some special commands for handling matrices, More about matrices

Mathematical operations with matrices - Functions that operate element-by-element, Elementary mathematical functions that operate column-wise, Matrix algebra, Solving systems of linear equations, Finding linear regression coefficients.

Importing and exporting data - Preparing data to import, Copy-and-paste importing, Importing using the Import Wizard, Importing using commands, Exporting to Excel files with commands

Graphics- Useful commands for two-dimensional plotting, Time series plotting, Plotting a function, Several graphs in one window and other types of graphs, Other two-dimensional graphs, Plotting tools.

Programming in Matlab – Scripts, The Editor, Writing a script, The search path, User interaction with the script

User defined functions - About the differences between scripts and user defined functions, More about functions.

Flow control – Loops, Relational and logical operators, Conditional statements, More about flow control.

Numerical analysis and curve fitting - Solving equations, Finding a function minimum point, Numerical integration, Curve fitting, More about numerical analysis

File Handling - fopen, fclose functions, Reading and Writing Text files and Binary Files.

Graphical User Interface- GUI Development Environment, GUI Components, Dialog Boxes, File Dialog Box, Creating Simple GUI.

2. Delores M Etter& David C Kuncicky, Introduction to Matlab, 2nd Ed, Pearson Publications, 2004.

3. RudraPratap, Getting Started with MATLAB 7, A Quick introduction for Scientist and Engineers”, Oxford University Press (2006).

2. Y. Kirani Singh & BB Chaudhuri, Matlab Programming, PHI Publications, 2007.

This course is used to provide an introduction to R, statistical language and environment that also provides more flexible graphics capabilities than other popular statistical packages. The course also covers the basics of R for statistical programming, computation, graphics, and modeling.

Benefits of using R-Unique features of R-Exploring R-Install-Packages- Working with code editor-First R session-navigating the workspace R-objects-Atomic Vectors- Attributes Matrices-Arrays-Class-Lists-Data Frames--Loading and Saving data

Control Structures- If-else-For Loops-While Loops-Repeat-Next, Break, Functions, Symbol Binding-R Scoping Rules-Optimization-Coding Standards-Dates and Time- Loop Functions-lapply(),apply(),mapply(),tapply(),split-Debbuging-Problem diagnosis-Reading Errors and Warnings-Reading error messages-Caring about warnings-Going Bug Hunting-Calculating the logit()-Knowing where an error comes from-Looking inside a function.

Graphics-Basic plotting-Manipulating the plotting window-Advanced plotting using lattice library- Saving plots

Measuring Central Tendency-Measuring Variability-Covariance and Correlation-Measuring Symmetry-PCA.Model formulae and model options-Output and extraction from fitted models. Models considered: Linear regression: lm() – Logistic regression: glm() – Poisson regression: glm() – Survival analysis: Surv(), coxph() – Linear mixed models: lme()

Entering data in the R text editor-Using the Clipboard to copy and paste-Reading data in CSV files, Reading data from Excel-Working with other data types. Manipulating and Processing Data-Deciding on the Most Appropriate Data Structure, Creating Subsets of Data, Adding Calculated Fields to Data, Combining and Merging Data Sets, Sorting and Ordering Data, Traversing Data with the Apply Functions, Getting to Know the Formula Interface, Working with Tables.

[2] Grolemund, Forword, Hadley Wickham, Garrett, Hands-On Programming with R,OREILLY Publishers. June 2014.

[2]Viswa Viswanathan, Shanthi Viswanathan, R Data Analysis Cookbook. ISBN 10: 1783989068, 2015.

This course describes the data:graphical and numerical description of the data and extensive usage of the SPSS to analyze the data. Also random variables and correlation and regression analysis introduced to assess the relationship among variables and predict the future values.

 What is data and different types of data and measurement scales

 How to analyze the statistical data using SPSS in their fields

 Graphical and numerical description of statistical data using SPSS

 Relationship between two or more variables using Karl Pearson’s correlation coefficient and Spearman’s rank correlation coefficient

 Concept of random variable and its applications in statistics

Data handling using SPSS: Introduction, importing different data formats into SPSS. Exporting data, variables, labels and values. Merging files, selecting cases, recoding, and sorting of data, defining new variables, split files. Analysis tools, frequencies, descriptive statistics, cross tabs, graphical representation, correlation and regression, curve fitting, editing output, usage of syntax.

Importance of statistics, concepts of statistical population and a sample - quantitative and qualitative data.Measurement scales-nominal, ordinal, interval and ratio.Diagrammatic and graphical representation of data.Construction of univariate and bivariate frequency distributions. Stem and leaf plot.

Measures of central tendency – mean, median and mode. Partition values - quartiles, deciles and percentiles. Measures of dispersion- range, quartile deviation and standard deviation. Coefficient of variation.Skewness and Kurtosis-definitions and their measures and applications.

Null Hypotheses-Type I error- Type II error-Significance level and p-value-One sample t Test –Independent-Sample t test-Paired-samples t-test-One way ANOVA- Pearson chi-square test-Data Input-Analysis and Interpretation of output of these tests.

Graphs and Charts

Chart Builder-Bar –Simple Bar-Simple Bar(with errors)-Clustered Bar-Stacked Bar-Line-Multiple Line-Pie Chart-Pie Chart(Split)-Histogram-Simple-Stacked-Simple Box Plot-Scatter Plot.

Introduction to correlation, types of correlations with examples, scatter diagram, Karl Pearson’s correlation coefficient and properties, coefficient of determination, Spearman’s rank correlation coefficient. Concept of regression, properties of regression coefficients, fitting of two variable regression models and their interpretation.Introduction to multivariate regression model.

[2] James B. Cunningham, James O.Aldrich, Using SPSS –An Interactive Hands-On Approach ,Sage Publications, 2012

[2] J.E.Freund, Mathematical Statistics. New Delhi, Prentice hall, 7th ed. 2004.

[3] Ross Sheldon, A First Course in Probability, Macmillan, 7th ed. 2005

Understand programming paradigms brought in by Python with a focus on Regular Expressions, List and Dictionaries. Work on Python case studies on Data Mining, Image and Data Processing to appreciate the fast changing landscape of programming. 

 Ability to program in Python

 Hands on Regular Expression

 Ability to Text Processing scripts

 Write to file handling scripts

 Learn to use Python for Data and Image processing

 Get hands on experience of Cluster Analysis using Python 

Introduction, Python Objects, Built-in Functions, Numbers and Strings, Conditionals and Loops, Functions, Passing Arguments, String Functions

Operators, Built-in Functions, List Type Built-in Methods, Special Features of Lists, Tuples, Tuple Operators and Built-in Functions, Special Features of Tuples File Objects, File Built-in Function, File Built-in Methods, File Built-in Attributes, Standard Files, Command-line Arguments, File System, File Execution, Persistent Storage Modules

Introduction/Motivation, Special Symbols and Characters for REs, REs and Python Introduction to Dictionaries, Operators, Built-in Functions, Built-in Methods, Dictionary Keys

Storing in List and Strings, Dispersion, Central Tendency, Mean Median Mode,FrequencyDistribution, Standard Deviation Using Files for large dataset, statistics with real data, reading data from internet, Accessing Stock Market Data, Correlating Stock data

Introduction, RGB Color Model, Object for Image Processing, Image Processing (Negative Images, Gray Scale, Resizing, Stretching, Flipping, Edge Detection) What is Data Mining? Implementing Cluster Analysis on Simple Data, Distance between two points, Clusters and Centroids, K-Means cluster Analysis, File Processing, Visualization

[2] Bradley N Miller, David L Ranum, Python Programming in Context, Second Edition, 2014

To study about basics of computer networks. Study the NS2 Simulator architecture to simulate network components, topologies, network models, protocols and algorithms.

Basics of Computer Networks: Reference Models (OSI, TCP/IP); Data Link protocols: Sliding Window protocols: Go back N and Selective repeat sliding window protocol, Channel Allocation; Network Layer Protocols: Routing Algorithms, Congestion Control Algorithms; Transport layer protocols: Connection Establishment, Connection Release, Flow Control and Buffering.

Simulation of Computer Networks: System Modeling, Time-Dependent Simulation, Network Simulator 2 (NS2), Basic Architecture, Installation, Directories and Convention, Running NS2 Simulation, A Simulation Example.

Linkage between OTcl and C++ in NS2: The Two-Language Concept in NS2, Class Binding, Variable Binding, Shadow Object Construction Process, Implementation of Discrete-Event Simulation in NS2: NS2 Simulation Concept, Events and Handlers, Scheduler, Simulator.

Nodes as Routers or Computer Hosts: An Overview of Nodes in NS2, Classifiers: Multi-Target Packet Forwarders, Routing Modules. Link and Buffer Management: Introduction to Simple Link Objects, Modeling Packet Departure, Buffer Management, Sample Two-Node Network.

Packet Header, Data Payload. An Overview and User Datagram Protocol Implementation: UDP and TCP Basics. Transmission Control Protocol: TCP Receiver, TCP Sender. Wireless Mobile Ad Hoc Network, Network Layer: Routing Agents and Routing Protocols, an Introduction to Node Mobility.

[2] Andrew S Tanenbaum, Computer Networks, PHI publications, 5th Edition, 2012.

[2] Forouzan, Behrouz, A. MosharrafFirouz., Computer Networks A Top-Down Approach, TaTa McGraw Hill publications, First Edition, 2012.

he subject is intended to give the knowledge of Big Data evolving in every real-time applications and how they are manipulated using the emerging technologies. This course breaks down the walls of complexity in processing Big Data by providing a practical approach to developing Java applications on top of the Hadoop platform. It describes the Hadoop architecture and how to work with the Hadoop Distributed File System (HDFS) and HBase in Ubuntu platform.

The value of data, historically for the few and not the many, a different approach, Techniques, Tools, Hadoop.

Too many clouds, a third way, Different types of costs, AWS – infrastructure on demand from Amazon, A dual approach.

Using languages other than Java with Hadoop, Analysing a large dataset.

Prerequisites, downloading Hadoop, setting up SSH, configuring the pseudo-distributed mode, HDFS directory, NameNode, Examples of MapReduce, Using Elastic MapReduce, Comparison of local versus EMR Hadoop.

Key/value pairs, The Hadoop Java API for MapReduce, Writing MapReduce programs, Hadoop-specific data types, Input/output.

 Simple, advanced, and in-between Joins, Graph algorithms, using language-independent data structures.

Graph 101, Graphs and MapReduce, Representing a graph, Overview of the algorithm -The mapper, the reducer, Iterative application.

Setting up a cluster, Cluster access control, managing the NameNode, Managing HDFS, MapReduce management, Scaling.

Architecture, Installation, Configuration, Hive vs RDBMS, Tables, DDL & DML, Partitioning & Bucketing, Hive Web Interface, Why Pig, Use case of Pig, Pig Components, Data Model, Pig Latin.

RDBMS Vs NoSQL, HBasics, Installation, Building an online query application – Schema design, Loading Data, Online Queries, Successful service.

Single Node Hadoop Cluster Set up in Amazon Cloud - How to create instance on Amazon EC2. How to connect that Instance Using putty.Installing Hadoop framework on this instance. Run sample programs which come with Hadoop framework.

[2] Tom White, “Hadoop: The Definitive Guide”, Publisher: O’Reilly Media, Inc., 2015 Edn

CIA 2 - 50 marks

CIA 3 - 20 marks

Attendance - 10 marks

End Semester Exam - 100 marks

CIA (Weight) - 50%

ESE (Weight) - 50%

Business intelligence (BI) is a broad category of application programs and technologies for gathering, storing, analyzing, and providing access to data to help enterprise users make better business decisions. BI applications support the activities of decision support, query and reporting, online analytical processing (OLAP) and analysis.

• Technical components of BI
• ETL and Analytical process of BI
• Generate Reports using report builder and power pivot
• Ethical values: Solving social problems using business Intelligence methods

Defining Business Requirements: Introduction, Uncovering Business Value, Prioritizing the Business Requirements.

Designing the Business Process Dimensional Model: Concepts and Terminology, Additional Design Concepts and Techniques.

The Toolset: Microsoft DW/BI Toolset, Architecture and Overview of the Toolset.

Creating the Relational Data Warehouse: Getting started, completing the physical design, Define storage and create constraints and supporting objects.

Master Data Services: Managing Master Reference Data, Introducing SQL Server MDS, Creating a Simple Application.

Design and Develop the ETL System: Developing the ETL Plan, Introducing SQL Server Integration Services, Extracting Data, Cleaning and Confirming Data, Delivering Data for Presentation.

Core Analysis Services OLAP Database: Overview, Design the OLAP structure-Planning, getting started, Data source view, Dimension design, Editing dimension, Editing Cube, Physical Design Consideration.

Building the BI Applications in Reporting Services: Overview, High Level Architecture for Reporting, System Design and Development Process, Building and Delivering Reports, Reporting Options.

Power Pivot and Excel: Using Excel for Analysis and Reporting, Architecture, Creating and using Power Pivot Databases, Power pivot Monitoring and Management.

Case study: Any Two Applications (eg. Healthcare, Retail Industry)

Self Learning:System setup: Installation and Configuration

Service based learning: Social impact of Business Intelligence based applications

Data Structure is considered as one of the fundamental paper towards a more comprehensive understanding of programming and application development. Student is expected to work towards a sound theoretical understanding of Data Structures and also compliment the same with hands on implementing experience 

• Understand the need for Data Structures when building application
• Appreciate the need for optimized algorithm
• Able to walk through insert and delete for different data structures
• Ability to calculate and measure efficiency of code
• Appreciate some interesting algorithms like Huffman, Quick Sort, Shortest Path etc
• Able to walkthrough algorithm
• Improve programming skills 

1. Implement sequential search and binary search techniques.

2. Implement Selection sort.

3. Implement Insertion sort.

4. Implement Stacks.

5. Implement Queues.

6. Implement linked lists and some operations on linked lists.

7. Write a program to convert an infix expression to the postfix form.

8. Write a program to evaluate a postfix expression.

9. Implement Quick sort.

10. Implement Merge sort for array.

11. Merge Sort a file contents (without loading the content into an internal data structure).

12. Implement Two-Way linked lists.

13. Implement Circular linked lists.

14. Implement Binary Search Tree.

15. Implement Shell sort.

16. Implement Heap sort.

17. Implement Radix sort.

18. Implement Depth First Search for Graphs.

19. Implement Breadth First Search for Graphs. 

[2] Knuth, Donald E, Art of Computer Programming, Sorting & Searching, Addison-Wesley, 2005.

Two questions will be selected by the examiners. Students have to write and execute both the programs.

The course is designed to provide a practical exposure to the students.

 Upon completion of the course, the students acquire the knowledge to build the logic and develop a solution for a problem statement.

1. Write a shell script to print prime numbers up to a given range using arguments.

2. Write a shell script which a. Converts a decimal number to binary b. Converts an octal number to hexadecimal.

3. Write a shell script which merge the contents of file1, file2, file3, sort them and display the sorted output on the screen page by page.

4. Write a shell script to locate users who have logged in today or earlier but have not logged out and mail the list to root. Users who have logged more than once should appear in the list only once.

5. Write a shell script to order the file /etc/passwd on GID (primary) and UID (secondary) which would place all users with same GID together. Users with a lower UID should be placed higher in the list

6. Write a script to find the number of days between two given dates using functions. 7. Write a script to compute the factorial value with and without using recursive functions.

8. Write a shell script to search given number using binary search using function.

9. Write a awk program that reads a file and prints a report that groups employees of the same department

The following are the contents of the report

a. The department name in the top

b. All detail of the employees

c. Total salary for the department

10. Write an awk program which accepts input from the standard input and prints the total of any column specified as an argument.

11. Demonstrate fork(), kill(), sleep() system calls

12. Demonstrate explicit locking and unlocking on a file using lockf()

13. Demonstrate process synchronization

14. Create a file and read, write operations using different child process

15. Demonstrate data sharing between process using Files

16. Implement sorting using pipes

17. Demonstrate FIFO’s

18. Implement Message Queues

19. Demonstrate Semaphores

20. Demonstrate Threads

The course is designed to provide a real-world project development and deployment environment for the students.

1. DBMS Lab includes an application project. The backend of the project may be any one of the following:

• MS-SQL Server

• Oracle

• DB2

• MySql

2. User interface could be made with any one of the front end tools available.

3. Students should have in-depth knowledge of the front and backend tool, which they are using.

4. Database tables are required to be normalized, at least to the second level.

5. There need to be independent forms for data entry operations.

6. All the forms in the project need to have similar look and feel in terms of background/foreground color, arrangement of controls, spacing and sizing of the controls, size of forms, etc.

7. There could be separate forms for searching purposes.

8. Master table data entry forms may include navigational buttons along with Add, Save, Delete etc.

9. Reports should be generated dynamically.

Note: Project should be developed by adopting software engineering process

The Objective of this course is to cover the basic theory and algorithms that are widely used in Digital image processing. Develop hands-on experience in using computers to process images with Matlab image processing toolbox.

• Understand the theoretical background of Image processing.
• Apply image enhancement, restoration, compression and segmentation in both frequency and spatial domain.
• Represent and recognize objects through patterns in application.

The origins of Digital Image Processing, Fundamental Steps in Image Processing, Elements of Digital Image Processing System, Image Sampling and Quantization, Basic relationships: Neighbors, Connectivity, Distance Measures between pixels, Linear and Non Linear Operations.

Gray Level Transformations, Histogram Processing, Histogram equalization, Histogram specification, Basics of Spatial Filters, Smoothening and Sharpening Spatial Filters.

Image Enhancement in Frequency Domain 

Introduction to Fourier Transform and the frequency Domain, Smoothing and Sharpening, Frequency Domain Filters.

Self Learning

Homomorphic Filtering

A model of The Image Degradation / Restoration Process, Noise Models, Restoration in the presence of Noise, Periodic Noise Reduction by Frequency Domain Filtering.  Image Compression models: Huffman coding, Run length coding, LZW coding.

Point, Line and Edge detection.Thresholding – Basic global thresholding, optimum global thresholding using Otsu’s Method. Region Based Segmentation – Region Growing and Region Splitting and Merging. Representation – Chain codes

Self Learning

Polygonal approximations using minimum perimeter polygons. 

Boundary descriptors – Fourier descriptors.Regional descriptors –Topological descriptors and Moment invariants.Introduction to Patterns and Pattern Classes. Decision-Theoretic Methods – Minimum distance classifier, K-NN classifier and Bayes’

Self Learning

classifier

This Course Description: aimed at helping learners create applications using Google's Android™ open- source platform. The Course Description: explains what Android™ is and how it compares to other mobile environments, the setup of the Android™ Eclipse-based development tools, the Android™ SDK, all essential features, as well as the advanced capabilities and APIs such as background services, accelerometers, graphics, and GPS.

• Build your own Android apps.
• Explain the differences between Android and other mobile development environments.
• Design and develop useful Android applications with compelling user interfaces by using extending and creating your own layouts and views and using menus.
• Secure, tune, package and deploy Android Applications.

Brief History of Embedded Device Programming , Introduction to  Android , Get to know the required tools , Creating your first Android application , Anatomy of android Application. Understanding Activities, linking Activities using intents, fragments, calling Built-in Applications using Intents, Displaying Notifications.