Syllabus for
Master of Computer Applications
Academic Year  (2017)

CIA - 50%

ESE -  50%

Understand the concept of a C program like variables, control structures, arrays, functions, pointers, macro processor, files. Understand the concepts of assembly level support by C, Graphics programming and Mouse programming in windows environment.

• Understand the use of structured program development in C as applied to both large software systems and to small programming projects. 
• Understand the use of arrays, functions, pointers, macro processors, structures, unions, files
• Understand the use and structure Graphics and mouse programming in C
• Understand the assembly language support of C

Introduction to C Language   

Applications of C – Language Features – Identifiers - Data Types – Typecasting- variables –

constants. Operators -  I/O Statements : Formatted- Unformatted. Control Structures.  

Functions         

User-defined functions – Standard library functions (Header files) - Function prototypes –

Call-by-Value – Command Line Arguments, Concept of variable number of arguments.

Storage Types          

Introduction to Storage Types – Static, Auto, Register, Extern 

Arrays

Introduction to Arrays – Limitations of Arrays – Types – Strings- I/O functions – String

Functions 

Memory formatting (sscanf & sprintf)- Passing arrays to functions

Pointers          

Definition – Pointer variables – Accessing variables through pointers – pointer declaration

and definition – Initialization - Pointers and Functions – Pointer topointers –- Pointer

Applications - - Introduction to Dynamic memory allocation functions (malloc, calloc, free,

realloc) - Array of pointers 

Derived Types       

Type definition (typedef) – Enumerated type – Structures – Accessing – Complex structure –

Array of structures – structures & functions – Union - Use of pointers to Structures and

Unions 

Macro Processor

Specialty of macro processing – Declaration, Conditional, Include directives

External storage           

Text files: Concept of Files – Files and Streams – Standard library I/O functions – Character I/O functions.

Binary files:  Operations – Standard library functions – Converting file type – Examples

Operations on Bits     

Introduction to Bit-Fields – Operators – showbits( ) function -C under windows Features – Graphics– Initialization Lines – Images – Patterns – Regular and non regular shapes – palettes – colors – text – justification of text – animation.

Self Learning

 Graphics using 'C' Language

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

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.

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.

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. 

 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, is SET, UNSET, gettype(), settype(), control statements (if, switch), Loops, User Defined Functions (with argument, return values), global variable, default value, GET - POST method,URL encoding, HTML Encoding, Cookies, Sessions, Include statement. File:read and write from the file. Ethical use of features of PHP. 

MySql            

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). Self Learning: Introduction to MySQL, CRUD - Select statements, Creating Database/Tables, Inserting values, updating and Deleting,

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. Service Learning: - Teaching the Website design to school / College students - Creating a website for a School/ NGO/ College/Department

[2] Steve suehring, JavaScript Step by Step, Microsoft Press, 2nd Edition, PHI, 2012 [3] Matt Doyle, Beginning PHP 5.3, Willey Publishing, 2010.  

[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 help students to understand the concept of number system, Boolean algebra, combinational & sequential logic circuits, and the concept of memory structure.

• Convert values from one number system to another number system, apply arithmetic operations to any number system, convert signed numbers to complementary system
• Write Boolean equations from truth tables in SOP or POS form, implement Boolean equations with logic gates, simplify Boolean expressions using Boolean Algebra and Karnaugh Map.
• Design and understand the function of basic combinational logic circuits such as adder, subtractor, encoder, decoder, multiplexer and de-multiplexer.
• Design and analyze sequential logic circuits such as latches and flip-flop, use flip-flops in designing sequential logic circuits and counters.

Digital Computers, Number Systems, Arithmetic Operations, Decimal Codes, Alphanumeric Codes.

Combinational Logic Circuits 

Binary Logic and Gates, Boolean algebra, DeMorgan's theorem, Simplification using Boolean laws, Standard forms, Karnaugh Map, Map Simplification (SOP and POS method),  NAND and NOR Gates, Exclusive-OR Gates, Integrated Circuits.

Combinational Circuits, Design Topics, Analysis Procedure, Design Procedure, Decoders, Seven segment decoder, Encoders, Multiplexers, Binary adders, Binary Subtractor, Binary adder – subtractors, Binary Multipliers, Decimal Arithmetic. 

Sequential Circuit Definitions, Latches, Clock, Types of Clock, positive, Negative edge triggered,  Flip-Flops- SR, D, JK, Edge Triggered, T Flip-Flop, Master-Slave, JK Flip-Flop.

Definition of Register and Counter, Registers, Shift Registers – Serial Transfer, Serial Addition, Shift register with Parallel Load and Bidirectional Shift Register, Synchronous  Ripple Counter, Asynchronous, Synchronous Binary Counters, BCD counter, Up/Down counter.

Definitions, Random-Access memory, RAM Integrated Circuits, Array of RAM Ic’s, Programmable Logic Technologies, ROM, Programmable Logic Array, Programmable Array Logic Devices, VLSI Programmable Logic Devices.

• To help the students to understand & analyze data using suitable statistical tools.

•  the theory and application behind the descriptive statistics, like measures of central tendency, dispersion, skewness and kurtosis

• the theory of probability and its applications
• various distributions and their usage
• the conceptsin testing of  hypothesis and its applications
  
• interval estimation of unknown parameters and their application
  

Measures of central tendency- Arithmetic mean, Median and Mode. Partition values- quartiles, deciles and percentiles. Measures of dispersion – range, quartile deviation, standard deviation and coefficient of variation for grouped and ungrouped data. Skewness – Karl Pearson and Bowley’s measure of skewness. Correlation – Karl Pearson and Spearman’s correlation coefficient. Regression – Simple linear regression.

Random experiment, sample space and events. Definitions of probability.Addition and multiplication rules of probability.Conditional probability.Random variables – Discrete and continuous. (univariate data) Probability mass functions and probability density functions.Expectation and variance.

Probability distributions – binomial, Poisson and normal distributions.Concepts of statistic, parameter, sampling distribution and standard error.Chi square, t and F distributions.

Statistical hypotheses-Simple and composite, Statistical tests, Critical region, Errors of Type I and Type II, Testing of hypothesis – null and alternative hypothesis, level of significance, Type I and Type II errors.

Test for single mean and difference between means (known and unknown variances), Paired t-test, Test for single proportion and difference between two proportions. Analysis of one-way and two-way classified data.

Interval estimation – single mean and difference between two means (known and known variance), single proportion and difference between two proportions.

Part A

Consists of 12 questions of 2 marks each, of which 10 have to be answered. The questions should cover the entire syllabus.

Definitions, statements, small problems with short answers to be asked in this section.

Part B

One question is from Unit I and one question from Unit 1 and Unit 2 and one question from Unit 3. Each question carries 20 marks and can have a maximum of 4 sub questions. The student has to answer any two main questions.

Part C

Two question from Unit 4, and One question from unit 5. Each question carries 20 marks and can have a maximum of 4 sub questions. The student has to answer any two main questions

To familiarize students with the concepts of HRM with respect to IT industry in specific, facilitate students in designing the recruitment and selection process with the support of IT. To impart knowledge on the important upcoming areas ofHRM. To introduce the students the relevance of HRM in globalized and techno based economy.

• Students will learn to design the E-recruitment and E-selection process.
• Students will learn to prepare online training and development modules for specific organizations.
• Students will learn role and importance of IT in HR department.
• Students will learn the role of trade unions and employee engagement in the modern organizations.

Human Resource Management                 

Concept, Objectives, Scope, Functions and Models of HRM. Corporate Strategies and HRM.

Human Resource Management in Changing Environment

Human Resource Management in India, Paradigm Shifts in People Management, Problems and Challenges of Human Resource Management in India. Importance of Strategic HRM in competitive driven economies. Exit policy and practices. Scope of HR Accounting in modern organizations.

Job Analysis: Job Description and Job Specification. 

Human Resource Planning                        

Definition, Objectives, Scope and Importance, Methods of Forecasting.

Talent Acquisition Recruitment:

Importance and Sources of Recruitment Selection: Importance and Process of Selection. Tests and Interviews for attracting and retaining the best talent.  Placement and Induction Process. 

Performance Management      

Meaning, Objectives, Scope and Purpose, Appraisal Process, Methods for Evaluating Performance, Problems and Challenges in Appraisal.

Human Resource Development

Meaning, Objectives and Scope of Human Resource Development in India. Methods for Training workers and managers, Problems and Challenges of training and Development in India, Evaluation of Training Effectiveness.

Career Planning and Development Career

Career Planning, Need for Career Planning, Process of career planning and development. Organizational and Individual career planning, succession planning.

Internal mobility and external Mobility

Importance and types of internal mobility. Meaning the types of external mobility. 

Job Evaluation:

Introduction, meaning and types of job evaluation Role of reward system. Definition and Objectives, Theory of Wages, Components of worker compensation, Components of executive compensation. Problems and Challenges in promoting equity in compensation and reward systems.

Fringe benefits of top 10 multi national companies. 

Labor Management Relations        

Definition, Objectives, Features of Industrial Relations in India, Methods of Managing Employment Relationship.

Trade Unions

Leadership: Meaning, importance and Types of Leaders. Leaders vs. Managers. Definition, Objectives and Purpose of Trade Unions, Trade Union Movement in India, Trade Union At 1926, Issues, Problems and Challenges of Trade Union in India.

Collective Bargaining        

Definition, Objectives and Scope of Collective Bargaining, Process of Collective Bargaining, Types of Collective Bargaining, Collective Bargaining in India, Productivity Bargaining.

Workers Participation in Management

Definition, Objectives and Scope of Workers Participation in Management, Levels of Participation, Workers Participation in India.

Part–A: Five questions to be answered out of seven 2 x 5 = 10

Part–B: Five questions to be answered out of six 5 x 5 = 25

Part–C: Three questions to be answered out of four 15 x 3 = 45

Part–D: Case study (compulsory) 20 x 1 = 20 Total Marks = 100

Course Description

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.

·         Zina O’Leary, The Essential Guide of Doing Research, New Delhi: PHI, 2005.

·         C. R. Kothari, Research Methodology Methods and Techniques, 3rd. ed. New Delhi: New Age International Publishers, Reprint  2014.

·         Zina O’Leary, The Essential Guide of Doing Research, New Delhi: PHI, 2005.

 Recommended Reading

[1] J. W. Creswell, Research Design: Qualitative, Quantitative, and Mixed Methods Approaches, 4th. ed. SAGE Publications, 2014.

[2] Kumar, Research Methodology: A Step by Step Guide for Beginners, 3rd. ed. Indian: PE, 2010.

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

1. Implementation of the various Data Types with modifiers and type conversion in C.

2. Demonstration of nested if and switch... case structure

3. Implementation of various Control structures in C

4. Implementation of arrays

5. Implementation of multidimensional arrays

6. Implementation of functions :call by value, call by reference, passing of arrays, Recursion

7. Demonstration of various user defined string operations

8. Implementation of the storage types

9. Demonstration of pointer operations.

10. Demonstration of macro processing.

11. Implementation of structures and array of structures

12. Implementation of Union.

13. Implementation of pointers to structures and unions.

14. Demonstration of dynamic allocation of memory

15. Demonstration of bitwise operations.

16. Demonstration of various Text file operations.

17. Demonstration of various fixed shapes with some animation

18. Demonstration of different graphics functions

ESE (Weight) 50%

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.

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

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

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

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

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

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

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

8.      Create a style Sheet that demonstrate Box Model 

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

10.  Write a JavaScript Program to demonstrate Functions (predefined / user defined) 

11.  Write a JavaScript program to demonstrate Event Handling 

12.  Object Creation and modification in JavaScript 

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

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

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

16.  Create a PHP page that uses Session and cookies. 

            17.  File Handling  in PHP 

18.  Implementing the OOPs concept in PHP 

Students have to write and execute both the programs.

Students have to attend a viva conducted by the examiner also.

To help students to understand the basics of 8085 microprocessor-based systems and assembly language programming. This Course Description: also gives the introduction to 8051 microcontroller.

• Identify the basic element and functions of microprocessor.
• Describe the architecture of microprocessor and its peripheral devices.
• Demonstrate fundamental understanding on the operation between the microprocessor and its interfacing devices.
• Apply the programming techniques in developing the assembly language program for microprocessor application.
• Understand the basic concept of microcontroller.

Introduction to Microprocessor 8085 –Signals -Address Bus, Data Bus, Control & status signals, Power supply and Frequency signals, Externally initiated signals, serial I/O ports 

8085 Machine cycles and bus Timings     

Opcode Fetch Machine cycle, Memory Read, Memory Write, I/O Read and I/O Write Machine cycles, Calculation of execution time for a program with examples

Block Diagrams, Registers, Flags, ALU, Timing and Control Unit, Instruction Decoder, Serial I/O Control, Stack, PC, Address/Data Buffers

The 8085 programming model, Instruction Classification, Data Format and storage, 8085 instruction Set Addressing Modes, Data Transfer Operations, Arithmetic Operations, Logic Operations, Branch Operations, Programming Techniques, Writing simple programs.

Programming Techniques with Additional instructions: 

Looping Counting and indexing Additional data transfer and 16 bit Arithmetic  Instructions, Arithmetic operations related to memory, Logic operations: Rotate, Compare. Writing assembly language programs- Binary and BCD addition of two 32 bit numbers, Binary and BCD subtraction of 16 bit number, Multiplication  and division of  8 bit numbers,  shifting  8 bit number by 1or  2 bit etc.,.

Counters and Time Delays

Counters and Time delays, Illustrative program, modulo Ten counter, Subroutine concepts, Subroutine call and return instruction 

Interrupts           

 Introduction – INTR, TRAP, RST 7.5, 6.5, 5.5 – RST, SIM and RIM instructions

Programmable peripheral interface

Block Diagram – Control Logic, Control Word – Modes of operations with examples, Mode 0, Mode 1, BSR Mode, Control word for each modes of operation Programming in 8255A with an example.

1. To introduce and practice advanced algorithms and programming techniques necessary for developing sophisticated computer application programs.
2. To get accustomed with various programming constructs such as divide-and-conquer, backtracking, and dynamic programming.
3. To learn new techniques for solving specific problems more efficiently and for analyzing space and time requirements.

Data structures, Asymptotic complexity, Abstract data type: Array, Stacks, Queues, Linked Lists, and their applications.

Insertion Sort, Selection Sort, Merge-Sort, Quick Sort, Heap Sort, Linear & Binary Search, Hashing, Chaining, String matching algorithms: Knuth-Morris- Pratt algorithm.

Trees: BST, AVL Trees, R B Trees, B Trees, B+ Tree definition, properties and their operations; Graph : Breath First Search, Depth First Search, Minimum Cost Spanning Tree algorithms- Prim’s, Kruskal’s.

Greedy Strategy: KnapSack Problem, Single Source Shortest Path, Huffman Coding ; Dynamic programming: Traveling Salesperson Problem (TSP), Longest Common Subsequence & All Pair Shortest Paths; Backtracking: The 8-Queens Problem, Sum of Subsets; Branch-and Bound: TSP.

Basic Concepts: P, NP, NP Complete, NP-Hard Graph Problems, NP-Hard Scheduling Problems, NP- Hard code generation problems.

      2. Gilberg, F. Richard & Forouzan, A. Behrouz, Data Structures:A Pseudocode approach with C, 2nd Edition, Cengage, 2008.

CIA 2- 50

CIA 3- 20

ESE-100

To provide strong foundation for database application design and development by introducing fundamentals of database technology.

 Understanding the database design process and its significance.

 Logic development for database application programming.

 Insights into recent developments in database technologies.

Database system concepts and architecture

Data models, schemas and instances, DBMS architecture and data independence, Database languages and interfaces, database system environment, Classification of DBMS.

Disk storage, basic file structures and hashing

Secondary storage devices, buffering of blocks, Placing File Records on Disk Operations on Files, Files of Unordered Records, Files of Ordered Records hashing techniques.

Data modeling using ER model

Entities, attributes and relationships, Different types of attributes, E- R Diagrams, Specialization and generalization, constraints and characteristics of specialization and generalization, Relationship types of degree higher than two.

Relational Data Model and Database design

Relational Model Concepts, Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions, and Dealing with Constraint Violations.

ER and EER to Relational Mapping

Relational database design using ER to Relational Mapping, Mapping EER Model concepts to relations.

Database Design

Informal design guidelines for Relation schemes, Functional dependencies, Normal forms based on primary keys, General definitions of second and thirdnormal forms.

Advanced normalization concepts and SQL

Boyce – Code normal form, multi-valued dependencies and fourth normal form, Join dependencies and fifth normal form.

Basic SQL

SQL Data Definition and Data Types, Specifying Constraints in SQL, Basic Retrieval Queries in SQL, INSERT, DELETE, and UPDATE Statements in SQL, Additional features of SQL.

Complex Queries, Triggers, Views, and Schema Modification More Complex SQL Retrieval Queries, Specifying Constraints as Assertions and Actions as Triggers, Views (Virtual Tables) in SQL, Schema Change Statements in SQL.

Transaction Management

Transaction - Introduction to transaction processing, transaction and system concept, Desirable properties of transaction, Transaction support in SQL, concurrency control techniques – Two phase Locking techniques for concurrency, timestamp based protocol.

Distributed Database

Introduction to Distributed database concepts, Types of Distributed DatabaseSystems, Data Fragmentation, Replication, and Allocation Techniques for Distributed Database Design.

Object, object relational and XML database

Object and Object-Relational Database– Overview of Object Database Concepts, Object- Relational Features: Object Database Extensions to SQL, The ODMG Object Model and the Object Definition Language ODL, The Object Query Language OQL.

Self Learning

Overview of Transaction Management in Distributed Database, Overview of Concurrency Control and Recovery in Distributed Database.

Service Learning

Students will engage in service learning which involves service is the field of tutoring or helping government school students as a part of their assignment

To prepare the students for a background in abstraction, notation, and critical thinking in the Discrete Mathematics.  

·         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.  

[2] B. Kolman, R. C. Busby and S. C. Ross,  Discrete Mathematical Structures, Pearson Education,  5th Edition, 2004.

[3] T. Koshy, Discrete Mathematics with Applications, Elsevier Academic Press,London,  2004.

[4] K. H. Rosen,  Discrete Mathematics and Its Applications,  Tata McGraw-Hill, 6th  Edition, 2006.

[5] G.S. Rao,  Discrete Mathematical Structures,  New Age International, 2009.

[6] J. P. Trembly and R. Manohar,  Discrete Mathematics with Applications  to Computer Science,Tata McGraw-Hill, 2003.

Pattern of the Question Paper

 To develop knowledge of recording business transactions.

 To develop skills in preparing financial statements

 To develop skills in analyzing financial statements

 To equip upcoming programmers to identify and solve finance related problems and manage finance related projects.

 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.

Basic terms -Principles- Concepts - Conventions- IFRS

Journal, Ledger, Cash Book, Closing of Books of Accounts and Preparation of Trial Balance.

Trading, Profit and loss Accounts and Balance Sheet of sole proprietary concern with normal

closing and adjusting entries- Adjustments – Closing stock-Depreciation- Outstanding expenses-

Prepaid expenses-Bad debts-provision for bad debt.

Income statement and Balance sheet (with schedules).

Meaning Role and Goals of Financial Management. (Theory only)

Meaning of the terms – Fund, flow of fund and working capital cycle. Cash flow statement – meaning, objectives, cash from operations, procedure of preparing cash flow statement (revised method).

Meaning advantages and Limitations.Types of ratios and their usefulness. Calculation of Current Ratio- Liquid Ratio- Cash ratio- Debtors Turnover Ratio- Creditors Turnover Ratio- Inventory Turnover Ratio- Working Capital Turnover Ratio- Gross Profit RATIO- Net profit Ratio- Operating Ratio- Operating Profit Ratio – Expense Ratio- Debt Equity Ratio – Fixed Asset Ratio- Earnings Per Share-Dividend per share- and their interpretations.

Meaning, Nature and importance.Preparation of Cost Sheet.

Meaning, Nature, scope and importance.Break-Even Analysis.

Budget and Budgetary Control - Meaning and Importance. Different types of Budgets. Preparation of Flexible Budget and Cash Budget.

Coding Logic and Codes Required, Master File, Transaction Files, Introduction to Documents used for Data Collection, Processing of different files and outputs obtained, Application Packages in Accounting Tally.

[2] I M Pandey Management Accounting, Third revised Edition,2010

[3] Lavy and Sarnat, Principles of Financial Managament, Prentice Hall.

[4] Arnolel, Financial accounting, PHI (Paper Back Edition).

[5] S N Maheshwari S K Maheshwari, An Introduction to accountancy, 10th Edition, 2010.

[6] Shashi K Gupta, R K Sharma, Financial Management Theory and Practice, 6th Revised Edition 2010.

Course Description:

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

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

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

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.

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.

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

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.

 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] Rudra Pratap, 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.

End Semester Exam Weightage is 50%

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.

Introduction to R-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() 

Getting Data into R-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 Plo

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

[2] Lutz, Mark, Learning Python, 4th Edition, O Rielly, 2009

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

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.

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

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

An Overview of Nodes in NS2

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. Mosharraf Firouz., 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.

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

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.

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

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

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

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.

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.

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

[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. 

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 42 Service based learning: Social impact of Business Intelligence based applications 

[2] Mike Biere ,Business Intelligence for the Enterprise , second edition, 2009 

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

 Upon completion of the course, the students acquire the knowledge to build the logic and develop an assembly language rogram for a problem statement.

Write assembly language programs for the following:

1.      Write a program to add N one byte number.

2.      Write a program to interchange N one bytes of data.

3.      Write a program to check whether the 4th bit of a number is zero or one.  Display FF if 1 otherwise display 00. 

4.      Write a program to find the first 10 terms of a Fibonacci sequence

5.      Write a program to find sum of first 10 terms of odd and even series.

6.      Write a program to check whether a byte belongs to the 2-out-of-5codes. Display FF if it is a 2-out-of- 5 code otherwise00.(Number is 2-out-of-5 code if the left most three bits are zero and in the  remaining five bits  there are exactly two 1’s)

7.      Write a program to perform linear search over a set of N numbers.  Display FF and its position if found otherwise 00.

8.      Write a program to add two 32 - bit binary numbers.

9.      Write a program to add two 32 - bit BCD numbers.

10.  Write a program to subtract a 16 - bit number from another 16 - bit number.

11.  Write a program to subtract a 16 - bit BCD number from another 16 – bit BCD number.

12.  Write a program to multiply two 8 - bit number.

13.  Write a program to divide a 16 - bit number by an 8 - bit numbers.

14.  Write a program to find the largest and smallest of N numbers.

15.  Write a program to sort the numbers in ascending and in descending and in descending order using bubble sort.

16.  Write a program to display a rolling message.

17.  Write a program to determine the HCF of two one byte numbers.

18.  Write a program to display FF and 00 alternatively with 1.5 sec delay.

19.  Write a program to check whether a one byte number is a palindrome or not.

20.  Write a program to prepare a look-up table for the squares of one -digit BCD numbers.

21.  Write a program to simulate the throw of dice.

22.  Write a program to determine the LCM of two one byte numbers.

23.  Write a program to simulate a BCD counter to count from 0 to 100.

24.  Write a program to simulate a stopwatch with a provision to stop the watch.

25.  Write a program to implement block move with the without overlap condition.

26.  Write a program to interface keyboard using 8255A interface.

27.   Write a program to interface Seven Segment Display using 8255A interface.    

Students has to write, enter, debug and execute both the programs.

Students are suppose to attend a viva on the subject also.

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

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) AVL Trees (insertion, deletion)

8) Implement Quick sort.

9) Implement Merge sort for array.

10) String matching algorithms

11) Dijkstra algorithm

12) Depth first search

13) Breadth first search

14)N queens problem

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.

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++. Data Types, Expressions, Keywords, Operators and Control Flow Statements. Structure of Java Program, Creating a nd 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. 

Inheritance in classes, Using super, Method overriding, Dynamic Method Dispatch. Abstract Classes, Using final with inheritance, the Object Class.Inheritance in javawith 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. Classes for Exception Handling. 

java.io package, I/O Streams, Readers and Writers, Using various I/O classes: Reader, Writer, input Stream and Output Stream, Serialization of objects. Lifecycle of a thread, Java Thread priorities, Runnable interface and Thread Class.Sharing limited Resources, Shared Object with Synchronization.Life cycle of Applet, Applet Architecture, Applet restrictions, Creation and Execution of java Applets.Animation in Applets-Advantages of Applets.Applets Vs Applications. 

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. Java foundation Classes- javax.swing and Model View Controller-Creating a Frame in Swing- Displaying Image in Swing- J Component 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 databasePreparing SQL statements-Improving the performance of a JDBC program. 

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

To acquire the fundamental knowledge of the operating system architecture and components.

Operating system definition, Computer system organization, structure, architecture and operations, process and storage management, Protection and security, Distributed systems, Special purpose systems, Computing Environments, Linux Operating Systems. System structure: operating system services, user interface, system calls, system programs, OS design, Implementation and structure, virtual machines, system boot
OS structure and system calls can be demonstrated using Linux.

Process concepts, scheduling, operations on processes, Inter process communication, Examples of IPC systems, Communication in client server systems, Threads, Multi threading models, threading issues, Basic concepts, scheduling criteria, scheduling algorithms, Thread scheduling, Multiple-processor scheduling.
IPC, Threads, Scheduling algorithms can be demonstrated using Linux.

Critical section problems, Peterson solution, Introduction to semaphores, classic problems of synchronization, Monitors, synchronization examples, atomic transaction, System model, deadlock characterization, methods for handling deadlock, deadlock prevention, avoidance, detection and recovery from deadlock.
Process synchronization and deadlock concepts can be demonstrated using Linux.

Memory Management Strategies: Background, swapping, Memory allocation, Paging, Structure of the page table, Segmentation. Virtual Memory Management: Demand paging, Page replacement, allocation of frames, thrashing, memory mapped files, Allocating kernel memory.
Memory management concepts can be demonstrated using Linux.

File concepts, access methods, directory and disk structure, File system mounting, File sharing, Protection, directory implementation, allocation methods, free-space management. I/O Systems, I/O hardware, Application I/O Interface, Kernel I/O subsystem, Transforming I/O requests to hardware operations.
File management concepts can be demonstrated using Linux.

To provide the students to understand the concepts software engineering. To prepare the students to develop the skills necessary to handle software projects. To make the students aware of the importance of software engineering principles in designing software projects.

A generic process model – Defining a framework activity, identifying a Task Set, Process Patterns, Process Assessment and improvement, Prescriptive Process Models – The waterfall Model, Incremental Model, Evolutionary Process Model, Concurrent Model, Component based Development, The formal Methods Model. Requirements Engineering, Establishing the groundwork – Identifying Stakeholders, Recognizing multiple viewpoints, Working toward Collaboration, Asking the first questions, Eliciting requirements – Collaborative requirement gathering, Quality function Deployments, Usage Scenario Elicitation Work Products, Developing use cases, building the requirements model – Elements of the requirements Model, Analysis pattern, Negotiating requirements, validating requirements.

The design within the context of Software Engineering, The design process – Software quality guidelines and attributes, The evolution of software design, Design concepts – Abstraction, Architecture, Patterns, Separation of concerns, Modularity, information hiding, Functional Independence, refinement, Aspects, Refactoring, Object Oriented design concepts Design classes, The design Model – Data Design elements, Architectural Design elements, Interface Design Elements, Component-Level Design elements, Deployments level Design elements. Software architecture – What is architecture, Why is Architecture important, Architectural descriptions, Architectural Decisions, Architectural style – Brief taxonomy of Architectural styles, Architectural Patterns, Organization and refinement.

What is a component – An Object-Oriented View, The Traditional View, A Process-Related View, Designing class based components – Basic Design Principles, Component-level Design guidelines, Cohesion, Coupling, Functional design at the Component level, designing traditional components – Graphical design notation, Tabular Design Notation, Program Design Language, Component based development- Domain Engineering, Component qualification, Adaptation, and Composition, Analysis and Design for reuse, classifying and retrieving components. The golden rules- Place the User in Control, Reduce the User's Memory load, Make the interface Consistent, Interface Analysis and Design models, The Process, Interface Analysis User Analysis, Task Analysis, Analysis of Display Content, Analysis of the Work Environment, Interface design steps – Applying Interface Design steps, User Interface design patterns, Design Issues,

Software Quality, Garvin's Quality Dimensions, McCall's Quality Factors, ISO 9126 Quality Factors, Targeted Quality factors, Transition to a Quantitative view, Achieving software quality- Software Engineering Methods, Project Management Techniques, Quality Control, Quality Assurance. Software testing fundamentals, internal and external view of testing, White-box testing, Basic path testing - Flow graph notation, Independent program path, Deriving test cases, Graph matrices-, , control structure testing – Condition testing, Data flow testing, loop testing-, Black- box testing – Graph- based Testing Methdos, Equivalence Partitioning, Boundary Value Analysis, Orthogonal Array Testing, Model Based Testing, Testing for specialized environments, Architectures, and Applications – Testing GUIs, Testing of Client-Server Architectures, Testing Documentation and Help facilities, testing for Real-Time Systems, Patterns for software testing.

The management spectrum- The people, The product, The Process, The project-, Metrics in the process and project domains-Process metrics and Software Process improvement Project Metrics-, software measurement-Size Oriented metrics, Function Oriented Metrics, Reconciling LOC and FPMetrics, Object Oriented Metrics, Use case oriented metrics, WebApp project metrics-, Metrics for software quality – Measuring quality, Defect removal Efficiency. Observations on estimation, The project planning process, Software scope and Feasibility, Resources-Human resources, reusable software resources, Environmental resources, software project estimation, Decomposition techniques – Software sizing, Problem based estimation, Example of LOC based estimation, Example of FP based estimation, Process based estimation, Example of process based estimation, estimation with use cases, example of use case based estimation, Reconciling estimates, Empirical estimation models – The structure of Estimation model, COCOMO II Model, Software equation.

CIA 2- 50

CIA 3-20

ESE - 100

To enable the students to learn the basic functions, principles and concepts of Computer architecture. This paper helps the students to learn the fundamental aspects of computer architecture and design. This paper focuses on processor design, control unit design techniques and IO interfacing.

• Understood computer architecture
• Understood number systems, I/O, Registers and memory
• Understood processor design ,control unit design
• Understood IO 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.

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

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 consideration.

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

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

• Write a program to demonstrate various data types and operators.
• Write a program to implement command line arguments 
• 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.
• Write a program to demonstrate the 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.
• Write an applet program and using paint function make some graphics.
• Write a program to demonstrate the usage of different Layouts in java.
• Write a java program to demonstrate various GUI components in java (AWT / SWING) with appropriate Event Handling.
• Write a program to implement two way communication between server and client. 

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

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 C program to simulate any two UNIX commands – ls, cp, grep.

2. Write a C program to implement I/O system calls – open( ), read( ), write( ).

3. Write a C program to create process using fork( ).

4. Implement IPC using wait( ) and kill( ).

5. Implement IPC message queue.

6. Implement threads.

7. Implement pipes.

8. Implement semaphores.

9. Implement FIFO.

10. Implement shared memory concepts.

11. Implement CPU scheduling algorithms.

12. Implement Deadlock algorithm.

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

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

           a.       MS-SQL Server
           b.      Oracle 
           c.       DB2
           d.      MySql

• User interface could be made with any one of the front end tools available.
• Students should have in-depth knowledge of the front and backend tool, which they are using.
• Database tables are required to be normalized, at least to the second level.
• There need to be independent forms for data entry operations.
• 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.
• There could be separate forms for searching purposes.
• Master table data entry forms may include navigational buttons along with Add, Save, Delete etc.   
• Reports should be generated dynamically.  

[2] O’neil Patric, O’neil Elizabeth ,Database Principles, Programming and Performance, Argon Kaufmann Publishers, 2nd Edition, 2002.

[3] Ramakrishnan and Gehrke, Database Management System, McGraw-Hill, 3rd Edition, 2003.

Students should do a thorough literature review in their research area. They should give a presentation and submit a document containing the following:

•  Introduction to topic, existing scenario and applications
•  Literature review
•  Existing Model and Methodology
•  Concrete problem statement definition

Problem Identification

Students have to select a topic related to the current trends and technologies in the field of Computer Science. They need to prepare the synopsis and detailed report in consultation with the faculty guide. Each Student has to give one hour presentation to their fellow classmates and to a panel of guides.    

Students can improve in team work, communication skills and good knowledge in the recent trends in the field of computer applications.

The students Confidence level will increase.

It can enrich their group discussion activity and public speaking skills.

Students have to select a topic related to the current trends and technologies in the field of Computer Science. They need to prepare the synopsis and detailed report in consultation with the faculty guide. Each Student has to give one hour presentation to their fellow classmates and to a panel of guides.

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.

Understanding the components of a screen, adapting to display orientation, managing changes to screen orientation, Utilizing the Action Bar, Creating the user Interface programmatically, Listening for UI Notifications.Using Basic Views, Using Picker views, Using List views to display lists, Understanding specialized fragments

Using Image Views to display pictures, using menus with views, some additional views. Saving and loading user preferences , persisting Data Files, Creating and using Databases. Sharing Data in Android, using content provider, creating your own content providers, using content providers.

SMS Messaging , Sending E-mail, Displaying Maps, Getting Location Data, Monitoring a Location. Hands on project : Building a Location Tracker.

Creating your own services , Establishing Communications between a service and an activity, binding activities to services, understanding Threads, Preparing for Publishing, Deploying APK Files.

To study about network components, topologies, network models, protocols and algorithms

Uses of Computer Networks, Internetworks; Network Software: Protocol hierarchies, Design issues for the layers, Connection Oriented and Connection less Services, Service Primitives; Reference Models: OSI, TCP/IP, Comparison of OSI and TCP reference models.

Network Hardware: LAN, MAN, WAN, Wireless Network,
Guided Transmission media: Magnetic Media, Twisted Pair, Coaxial Cable, Fiber Optics

Wireless Transmission, Brief introduction about bluetooth and wimax. Multiplexing: Frequency Division Multiplexing, Wavelength Division Multiplexing, Time Division Multiplexing; Switching: Circuit Switching, Message Switching, Packet Switching; Ethernet cabling, Manchester encoding, Differential Manchester Coding.

Data Link layer design issues, Error Detection and Correction, Elementary Data Link protocols: Unrestricted simplex protocol, Simplex stop-and-wait protocol, Simplex protocol for a noisy channel; Sliding Window protocols: One-bit sliding window protocol, Protocol using Go back N, Example Data link protocol: Higher Level Data Link Control, Data link layer in the internet

The Channel Allocation problem, Multiple access protocols: ALOHA, Pure ALOHA, Slotted ALOHA, Carrier Sense Multiple Access protocols, Persistent and Non persistent CSMA, CSMA with collision detection, Collision-Free protocols: Bit map protocol, Binary countdown; Limited Contention protocols; Brief introduction to IEEE 802 standards; Ethernet MAC address, Brief introduction to Wireless LAN's, Bluetooth: Architecture, Applications, Protocol stack, Radio Layer, Bluetooth based layer, Frame structure; High-Speed LAN's, Satellite Networks.

Network layer design issues, Routing Algorithms: Optimality principle, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing; Congestion Control Algorithms: Congestion Prevention Policies, Jitter Control, Techniques for achieving good quality of service, Congestion control for multicasting; Internetworking, The Network layer in the Internet.

The Transport service, Elements of Transport protocols: Addressing, Connection Establishment, Connection Release, Flow Control and Buffering, Multiplexing, Crash recovery; A simple Transport protocol, The Internet Transport protocols: UDP, TCP.

Introduction to Application Layer, lossy and lossless compression techniques, Audio and Video Compression Techniques, Video on demand; Network Security: Cryptography: Introduction to cryptography, Substitution Ciphers, Transposition Ciphers, One-Time Pads, Fundamental Cryptographic Principles; Symmetric key encryption, Symmetric Key Algorithms: DES, Cipher Modes, Cryptanalysis; Public-Key Algorithms: Public-Key encryptions, RSA. Web Security: Threats, Secure Naming, Mobile Code Security.

The Objective of this Course Description: 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.