Syllabus for
Master of Computer Applications
Academic Year  (2015)

CIA - 50 % 

ESE - 50 % 

Christ University understands the limitations of compartmentalized knowledge which is not adequate enough to face the challenges of the globalized world. With a mission to prepare the students for life and not just for the acquisition of a degree, it encourages every initiative that would help students make perfect connections with the world outside. Inspired by the educational philosophy of Rousseau, Emerson, Ivan Illich, Paulo Freire, Gandhi, Tagore and Blessed Chavara, the University formulated this concept of Holistic Education more than fifteen years ago and included it in the curriculum and makes necessary changes every year. A group of teachers drawn from across the streams go through the whole process of designing the curriculum through a series of intense discussions under the broad classification of three skills: personal, interpersonal and societal. 

I Semester UG

Personal Skill : Goal Setting and  Cyber Etiquettes

Inter-Personal Skill : Dealing with Competition and Leading and Following

Societal Skill : Gender Sensitization and Community Living

III Semester UG

Personal Skill : Spirituality and Transition to Adulthood

Inter-Personal Skill : Alienation and Blocks in Relationship

Societal Skill : Gender Stereotypes and Good Governance

I Semester PG 

Personal Skill : Accountability and Mindful Living

Inter-Personal Skill : Alienationand Blocks in Relationship

Societal Skill : Gender Sensitization and Sustainable Development

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

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, 

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.  

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

• Understand the importance of the stages in the software life cycle.
• Understand the various process models.
• Be able to design software by applying the software engineering principles.
• Understand the importance of Software quality and testing.
• Develop the quality of efficient project management. 

Software and Software Engineering

Nature of software- Defining software, Software Application Domains, Legacy Software, Software Engineering, The software process, Software Engineering practice – The essence of Practice, General Principles, Software Myths.

Process models 

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 .

Understanding Requirements

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.

Case Study on requirement gathering based on some domain.

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.

Architectural Design

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.

Case study on architectural design

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. User Interface Design

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,

Case study on UI design for Web Apps

Quality Management

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.

Testing Conventional Applications

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.

Self Learning

Testing Web Applications, Testing concepts for WebApps- Dimensions of Quality, Errors within a WebApp Environment,Testing Strategy, Test planning-,

Concepts and Terminology

ISO 9000, SQA, Cost impact of software defects, Review metrics and their use, Formal technical reviews.

Case study on test cases

Process and Project Metrics

The management spectrum- The people, The product,The Process, The project-,  Metrics in the process and project domains-Process metrics and Software Process improvementProject 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.

Estimation for Software Projects

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.

Project Scheduling

Project scheduling- Basic principles, The relationship between People and Effort, Effort Distribution, Scheduling – Time line Charts, Tracking the schedule, Tracking progress for an OO Project, Scheduling for WebApp projects. 

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

• Descriptive statistics.
• Concepts of probability.
• Formulation & Testing of hypotheses using suitable test statistics.
• Measures of central tendency.

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.

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 of HRM. 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.

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

* All students have to do the programs based on domain chosen

* Follow the coding standards and programming ethics (Originality/Plagiarism/Legal Software usage

Section A

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.

Section B

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  

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 

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.

·         To demonstrate the usage of data abstraction, encapsulation, inheritance.

·         Learn the other features of C++ language including templates, exceptions, STL

·         To master the techniques of software development in the C++ programming language and demonstrate the techniques by the solution of a variety of problems spanning the breadth of the language. 

·         Demonstrate significant experience with the program development environment.  

OOP Paradigm

Evolution of programming methodologies, Origins of C++, Procedural Approach Vs Object- Oriented Approach. Principles of OOP: Encapsulation and Abstraction, Message Passing, Inheritance – Reusability, Extensibility, Polymorphism – Overloading, Dynamic Binding.

Comparison of C and C++       

Limitations of C, Introduction to C++, Structure of the C++ program, Added features of C++ over C – Storage Classes, Reference variables, Inline functions. Simple I/O using cin & cout, I/O formatting and I/O functions. .

Introduction to Objects and Classes     

Defining the class, Defining Data members and member functions, Creating Objects of Class, Access Specifiers  – private, public and protected. Scope Resolution Operator, Nested Classes, Local Classes. Friend Functions and Friend Classes, passing objects as functions-returning objects – Static Members.this pointer, returning values using this pointer. Comparison of class with structure.

Self Learning: Nested Classes, Local Classes

Constructors and Destructors            

Purpose of Constructors and Destructors, Default Constructors, Constructors with & without parameters, Constructor Overloading, Copy Constructor-Deep copy and shallow copy.Invoking Constructors and Destructors.

Pointers in C++        

Introduction-Pointer variable declarations and Initilization- Pointer Operators-Passing Arguments to Functions by Reference with pointers.Using const with Pointers-Pointer Expressions and Pointer Arithmetic-Relationship between pointer and Arrays-Array of Pointers-Function Pointers.

Array of Pointers to String, memory management – new and delete, pointer to object – referencing members using pointers, wild pointers, Dangling pointers, Smart pointers.

Polymorphism                  

Overloading Concepts Function Overloading: Functions with different sets of parameters, default and constant parameters. Operator Overloading: Defining Operator Function, Rules for overloading Operators. Creating prefix and postfix forms of the increment and decrement Operators- operator Overloading using a  Friend Function-Overloading new and delete- overloading some special operators [],(),->,overloading the comma operator.

Type Conversions

Basic to Class, Class to Basic and one Class to another Class type.

Self Learning: Overloading (),->,overloading the comma operator.

Inheritance                                             

Basic Concepts, Reusability & Extensibility. Defining derived classes, protected access specifier in Base class – public, private & protected inheritance – constructors and destructors in derived classes – Types of Inheritances-Single, Multiple, Multilevel, Hierarchical,Hybrid- Ambiguity in multiple inheritance- Virtual base class, Virtual destructor.

Virtual Functions         

Normal member functions accessed with pointers, virtual member function access, late binding, pure virtual function, abstract classes.

Templates         

Introduction to Generic Functions- A generic swap function, Overloading a Function Template. Generic Classes – A stack generic class, type name and template keywords, Template Restrictions, The power of Templates.

Streams

Classic streams Vs Standard Streams-Stream Input-Stream Output-Unformatted I/O using read, write. Introduction to Stream Manipulators-Stream Form States and Stream Manipulators, Stream Error States

Self Learning: Stream Form States and Stream Manipulators, Stream Error States

File Processing

Introduction-Data Hierarchy-Files and Streams-Creating a Sequential file-Reading a  data from a Sequential File-Updating Sequential files-Random Access Files-Creating a Random Access file-Writing data Randomly to  a Random-Access File-Reading from  a Random Access File Sequentially.

Exception Handling

Introduction- Exception Handling overview, When to use Exception Handling, Catching Class Types, Using Multiple catch statements, Catching All Exception, Restricting Exception, Re throwing an exception, throw statement,  Uncaught exception,, and Built-In Exceptions. Introduction to Standard Template Library– Introduction to Containers- Iterators.

Self Learning: Introduction to Standard Template Library– Introduction to Containers- Iterators.

[2] M T Somashekar, D S Guru, Object Oriented Programming with C++, PHI, 2nd Edition , 2012

• To acquire the fundamental knowledge of the operating system architecture and components.
• To understand its behavior and performance while handling various tasks with respect to different system architecture.

• Describe how operating systems have evolved over time and its working process.
• Brief all the tasks performed by the operating systems.
• Understand the internal structure of the operating system with relevant system call or functions.
• Solve problems based on process and memory management.
• Identify potential threats to operating systems and find scope to perform further study in the security features and the relevant design.
• Describe how issues are influencing operating system design through assignments on latest developments. 

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

Process:

Process concepts, scheduling, operations on processes, Inter process communication, Examples of IPC systems, Communication in client server systems, Threads, Multi threading models, threading issues. 

Scheduling:

Basic concepts, scheduling criteria, scheduling algorithms, Thread scheduling, Multiple-processor scheduling.

Synchronization

Critical section problems, Peterson solution, Introduction to semaphores, classic problems of synchronization, Monitors, synchronization examples, atomic transaction.

Deadlock

System model, deadlock characterization, methods for handling deadlock, deadlock prevention, avoidance, detection and recovery from deadlock.

Inheritance                                              

Memory Management Strategies: Background, swapping, Memory allocation, Paging, Structure of the page table, Segmentation, Example: the Intel Pentium. Virtual Memory Management: Demand paging, Page replacement, allocation of frames, thrashing, memory mapped files, Allocating kernel memory.

File system

File concepts, access methods, directory and disk structure, File system mounting, File sharing, Protection, directory implementation, allocation methods, free-space management.

Self Learning

I/O Systems

I/O hardware, Application I/O Interface, Kernel I/O subsystem, Transforming I/O requests to hardware operations.

Case study: windows 7 , history, design , principles, system components, environmental subsystems, file systems

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

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 Database Systems, 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.

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.  

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

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

Profit and Loss Account- Profit and Loss Appropriation Account and Balance Sheet

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

Meaning of the terms – Fund, flow of fund and working capital cycle.

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.

-

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.    

-

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

* All students have to do the programs based on situation (*domain based)

1. Implement Classes and Objects.

2. Implement Constructors and Destructors with array of Objects.

3. Implement Passing and returning parameters by reference.

4. Demonstrate Function Overloading.

5. Demonstrate overloading of different operators – incr & decr operators with post & pre forms, new, delete, [], () and arithmetic operators.

6. Implement  pointer sort operation.

7. Demonstrate friend functions and friend classes.

8. Implement different types of inheritances like Multiple, Multilevel and Hybrid.

 9. Demonstrate the use of Virtual Functions.

10. Demonstrate the use of abstract classes.

11. Demonstrate I/O streams and functions.

12. Overload << and >> operators as a member and as a non-member operator functions.

13. Create a file to store some records and search for a particular record and display it.

14. Demonstrate Namespaces and Volatile member functions.

15. Perform all possible Type Conversions.

16. Create function Templates and overload the function Templates.

17. Create a generic stack class and member functions to perform stack operations.

18. Implement Exception Handling with minimum 5 exception classes including two built- in exceptions.    

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

Introduction and overview        

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

Stacks and Queues  

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.

Sorting            

Introduction, Sorting, Insertion Sort, Selection Sort, Shell Sort, Merging, Merge-Sort, Quick Sort, Radix Sort, External Sorting

Searching 

Hashing, Chaining, Linear Probe, Double Hashing, Text Searching using Knuth-Morris-Pratt algorithm, Regular Expression Matching

Trees           

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

Balanced Tree 

AVL Trees: AVL Balance Factor, Balancing Trees, AVL node structure, AVL insert and delete algorithm walkthrough with examples.

B-Trees          

B-Trees: B-Tree insertion, Deletion, Traversal and Search algorithm walkthrough with examples, Applications of BTrees, Variations of BTree (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, Shortest Path Algorithm, Minimum Spanning Tree Algorithm.

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

• Demonstrate a broad and integrated understanding of UNIX architecture.
• Understand UNIX file system, process management, memory management and inter- process communication.
• Able to write shell scripts for basic and advanced level shell programming.
• Able to create programs with awk.

Introduction to UNIX                                   

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

File Systems 

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

Essential Shell Programming

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

Memory management and The I/O sub system 

Swapping, Demand Paging, the I/O sub system: Driver Interfaces, Disk Drivers, Terminal Drivers, and Streams.

Inter process Communication

Process Tracing, System V IPC: Messages, Shared memory, Semaphore, Network Communications: Sockets. Algorithms: msgsnd, msgrcv, shmat, semop

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 System

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

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

Object Oriented Analysis and Design Using UML Course Description: 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 understand the object oriented life cycle.
• 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 Behavioural Modelling, 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. 

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

Introduction

Uses of Computer Networks, Network Hardware: LAN, MAN, WAN, Wireless Network, 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.

The Physical Layer

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.

The Data Link Layer     

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 Medium Access Control Sublayer

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.

Introducing the students to concepts of advanced data structure

1)   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.  

Introduce Students to UNIX Operating system and Shell Script writing concepts, and enhance the scriptinng knowledge of students

Section – A (Shell Programming) 

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

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.

 Section – B (System Programming)

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

To Introduce software development life cycle skills to 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.  

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

Introduction to java Programming

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

Language Fundamentals

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

Class and Objects

Creating class and Objects, Methods, this key word, 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 Java

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

Interfaces and Packages

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

Exception Handling in Java

try-catch-finally mechanism, throw statement, throws statement. Classesfor Exception Handling

Input / Output in java

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

Multithreading         

Lifecycleofathread,JavaThreadpriorities,RunnableinterfaceandThreadClass.Sharing limited Resources, Shared Object with Synchronization

Applets 

Life cycle of Applet, Applet Architecture, Applet restrictions, Creation and Execution of java Applets. Animation in Applets-Advantages of Applets. Applets Vs Applications

GUI Components (AWT & SWING)

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.

Swing(Self-Learning Topic)

Java foundation Classes- javax. swing and Model View Controller-Creatinga  Frame in Swing- Displaying  Image  in  Swing-  J Component  class  methods- Creating  components  in  Swing. Writing GUI programs in java (with AWTorSWING). 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 database- Preparing SQL statements -Improving the performance of a JDBC program.

To introduce the classic algorithms in various domains. To study the different techniques for designing efficient algorithms. 

• Design efficient algorithms using the various approaches for real world problems.
• Analyze the running time of algorithms for problems in various domains.
• Apply the algorithms and design techniques to solve problems.

The role of Algorithms in Computing – Algorithms, Algorithms as a technology. Getting Started – Insertion sort, Analyzing algorithms, Designing Algorithms. Growth of Functions – Asymptotic Notations. Recurrences – The Substitution method, Recursion Tree method and Master method.

General Method

Binary Search, Finding the Maximum and Minimum, Merge Sort, Quick Sort, Selection sort, Strassens Matrix Multiplication. 

Greedy Method

Knap Sack Problem, Minimum Spanning Trees, Prims algorithm and Kruskal’s algorithm.

Optimal Binary Search Trees, Traveling Salesman Problem, Longest Common Subsequence

Back Tracking

Introduction - The 8-queens problem, Sum of Subsets

Branch n Bound

General Method- Traveling Salesman Problem  

Representation of Graph, Depth First Search, Breadth first search.

Single Source shortest path – Dijkstra’s Algorithm and Bellman Ford Algorithm.

All Pair Shortest Path – Floyd-Warshall Algorithm.

Lower Bound Theory Comparison trees for sorting and searching.

Basic Concepts, NP-Hard graph problems, NP-Hard Scheduling problems, NP-Hard code generation problems, some simplified  NP-Hard problems

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. Consuming Web Services using HTTP, consuming JSON Services, Basic Socket Programming.

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 provide strong foundation for database application development, appreciate the underlying core database engine and emerging database technology.

• Ability to create Stored Database Procedures for writing consistent, well tuned backend code 
• Appreciate Query Optimisation in the Database Engine
• Understand the need for Document Oriented Database for Distributed System
• Able to consolidate theoretical database understanding
• Insights into recent developments in database technologies

Variables, Reserve Words, Identifiers, Anchored Data types, Block, Labels. Use of DML in PL/SQL, Commit, Rollback, Savepoint. Conditional Control: IF,CASE, NULLIF, COALESCE

Iterative Processing with Loops: Loop Basics, Simple Loop, While, For (Numeric and Cursor)

Scope, User Defined Exception, Exception Propagation, Raise Application Error, Exception-Init, SQLCODE, SQLERRM

Data Retrieval: Cursor, Use of Record Types, Explicit Cursors, Cursor Attributes, Cursor For Loop, for update and where current cursors

Procedures: Creating Procedures, Query Data Dictionary for Information on Procedure, IN and OUT parameters, Creating and Using Functions.

Unary Relational Operations SELECT and PROJECT, Relational Algebra Operations from Set Theory, Binary Relation Operators: JOIN and DIVISION, Additional Relational Operations, Examples of Queries in Relational Algebra Query Optimization

Translating Queries into relational algebra, Algorithms for external sorting,  Algorithms for Select, Join, Project, Implementing aggregate operation and outer join, Combining operation, Using heuristic in query optimization, Using selectivity and cost, estimates in query optimization, Query Optimization in oracle.

Active database concepts and triggers, Temporal database concepts, Spatial and Multi Database, Introduction to Deductive Database Emerging Database Tech and Applications

Mobile Database, Multimedia Database, Geographic Information System, Genome Data Management

Case Study for a Document Oriented Database as a standalone or for high volume distributed applications. “Couchedb” Introduction, Why CouchDB, Eventual Consistency: Grain, CAP Theorem, Local Consistency, Distributed Consistency. Core API: Server, Database, Documents, Replications. Design Documents, Finding Data with Views, Validation Functions, Show Functions

• This Course will provide the students with an overview of multimedia technologies and the latest developments in multimedia systems. 
• Students will be able to gain valuable hands on experience in multimedia systems and applications. 
• Issues in effectively representing, processing, and retrieving multimedia data will also be addressed.
• Recent multimedia papers or technique reports will be presented or assigned as homework.

Introduction, Definition of Multimedia, Digitization principles- Analog signals, Encoder design, Decoder design, Text-Unformatted text, Formatted text, Hypertext, Images- Graphics, digitized documents, digitized pictures, Audio – PCM speech, CD quality audio, Synthesized audio. Video- Broadcast television, digital video, PC video, Video Content.

Introduction, compression principles- Source encoders and destination decoders, Lossless and lossy compression, entropy encoding, source encoding. Text compression- static and dynamic Huffman coding, Arithmetic coding, Image compression-Graphics interchange format, Tagged image file format, digitized documents, digitized pictures, JPEG.

Introduction, Audio compression, Frequency, amplitude, sample rate, Differential pulse code modulation, Adaptive differential PCM, Adaptive predictive coding, Linear predictive coding, code-excited LPC, perceptual coding, MPEG-MP3 audio coders, Dolby audio coders. Video compression principles, video Standards: NTSC, PAL, SECAM, Inter-frame, Intra- frame, video encoding, algorithms H.261, H.263, MPEG, MPEG1, MPEG2, MPEG4, Video for WEB

Reference models-TCP/IP, Protocol basics, standards relating to interpersonal communications, Circuit mode networks, Packet-switched networks, Electronic mail, standards relating to interactive applications over the Internet, information browsing, Electronic commerce, intermediate systems, Java and Java Script, Standards for entertainment applications, Movie/Video on demand, Interactive television.

Understanding Designing and implementations of interactive applications, entertainment applications, Multimedia in internet and Web, Video Emails, video conferencing, Web casting, Software for image editing and Compression, Audio editing and compression, Video editing and compression, Voice recognition applications, Gesture based applications, interactive games design and implementation.

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

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 

High Order Testing - Debugging by Brute Force, Induction, Deduction, Backtracking Extreme Programming basics, Extreme Testing, Extreme Testing Applied

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. The Course Description: introduces the methodologies, techniques and tools that support their design, development, evolution and evaluation.

• Be able to understand the concepts, principles and methods of Web engineering.
• Be able to apply the concepts, principles and methods of Web engineering to Web applications development.
• Be familiar with current Web technologies.
• Be familiar with Web application development software tools and environments currently available on the market.
• Be able to understand the technologies, business models and societal issues of Web 2.0/Web 3.0 and Semantic Web.

The arrival of the Browser, flattening of the world, from linking to searching, commercialization of the Web, Peer-to-Peer networks and free file sharing. Technological development- IP networking, HTML and XML, Web services and RSS. 

Socialization of the Web

Blogs and wikis, Social networks. Arrival of Web 2.0.

Developments in Web Technology

HTML,XML,CSS, Scripting technologies, Web applications of XML-Web services, Web feed forms, P2P file sharing networks, other P2P applications.

Rich Internet Applications-sample RIAs email applications, XMLHttpRequest, the link needed for Ajax, More RIA- Office and Map applications. API. WPCs and their mach-ups

The situation in Web 1.0, content syndication with Web feeds, Mach-ups based on WPCs, Tagging- Flicker and tagging, Social bookmarking, Folksonomies.

Development methodologies, client-side Ajax toolkit, development of Zimlet using AjaxTK, Server-side frameworks-Ruby on Rails, Creating web applications with rails, Framework for RIA technologies-RIA development with OpenLaszlo, Flash versus Ajax. Impacts of Next Generation of the Web-Commission-based brokerage and merchants, Advertising, Information intermediaries, The Community and the subscription models, Data Ownership.

Software as a Service(SaaS)

A look back ASP model, Provider oriented View, The Consumer-oriented view and service customization.

Social search, social aspects of software, Impacts of online social networks, user generated content in advertising. Second life. Semantic Web and Web 2.0/Web 3.0 Search revisited, Data and information integration, The semantic Web idea, the structure of the Semantic Web, Languages of the semantic Web- The Resources Description Framework (RDF), RDF Schema (RDFS), Web ontology language(OWL). 

Ontologies

Introduction, Design of an ontology, OntoMedia: an ontology-based personal entertainment system.  

Security issues, causes, Solutions, Design Patterns and best practices

Case Study Web – Smartphone Applications using native coding and Cross-platform technology using HTML 5, CSS3 and JavaScript. Learning about Windows 8 Apps, Android Apps, Google Chrome Web Store Apps. Hands on Experience with Phone Gap, Sencha and Titanium platforms.

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.

• Understand the principles and practices of Cryptography and Network Security.
• Describe the five keys of Network Security. 
• Appreciate the role played by Cryptographic techniques in enhancing Network and system Security. 
• Identify and explain the concepts, protocols and technologies associated with a secure    communication across the Network and the Internet. 
• Discuss the objectives of authentication and access control methods and describe how  the available methods are implemented in the defense of a network.

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. 

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. E-Commerce Security – SET Overview, Key Features of SET, SET Participants, Dual Signature.

To understand the concepts of Data Warehouse system.

• Discuss the role of data warehousing and enterprise intelligence in industry and government.
• Summaries the dominant data warehousing architectures and their support for quality attributes.

Introduction to Data Warehouse

Basic elements of the Data Warehouse: Source system- Data staging Area-Presentation Server-Dimensional Model-Business process-Data Mart-Data warehouse. 

Data Warehouse Design

The case for dimensional modeling – Putting Dimensional modeling together: the data warehouse bus architecture – Basic dimensional modeling techniques. 

Data Warehouse Architecture

The value of architecture – An architectural framework and approach – Technical architecture overview – Back room data stores – Back room services. Back   Room Services. 

Data Staging

Data staging overview – Plan effectively – Dimension Table staging – Fact Table loads and warehouse operations – Data quality and cleansing – issues.

Metadata

Metadata, metadata interchange initiative, metadata repository, metadata management, implementation examples, metadata trends, reporting and query tools and applications- tool categories, the need for applications. 

OLAP

Operational Data Store-OLAP: ROLAP, MOLAP and HOLAP. Need for OLAP, multidimensional data model, OLAP guidelines, multidimensional versus multi relational OLAP, categorization of OLAP tools. 

Business considerations, Design considerations, technical considerations, implementation considerations, integrated solutions, benefits of data warehousing, Relational data base technology for data warehouse, database architectures for parallel processing, parallel RDBMS features, alternative technologies.

Data layout for best access, multidimensional data model, star schema, STARjoin and STARindex, bitmapped indexing, column local storage, complex data types, Data extraction, clean up and transformation tools-tool requirements, vendor approaches, access to legacy data, vendor solutions, transformation engines

To teach the concept of Java

Section – A

1. Write a program to demonstrate various data types and operators.
2. Write  a program to implement command line arguments
3. Demonstrate method overloading and constructor overloading.
4. Demonstrate the usage of static keyword in java – use static data and static block.
5. Demonstrate final keyword with respect to variable, method and class.
6. Write a program to demonstrate the usage of the keywords this & super.
7. Demonstrate abstract class.
8. Demonstrate the usage of interface for multiple inheritance.
9. Differentiate the usage of throw, throws and try-catch-finally by writing a java    program.                                                                 

Section – B

1. Demonstrate various I/O streams in java.
2. Demonstrate the Reader/Writer classes in java.
3. Demonstrate the multithreading concept by implementing Runnable interface.
4. Demonstrate the multithreading concept by extending Thread class.
5. Write an applet program and using paint function make some graphics.
6. Write a program to demonstrate the usage of different Layouts in java.
7. Write a java program to demonstrate various GUI components in java (AWT / SWING) with appropriate Event Handling.
8. Write a program to implement two way communication between server and client.    

To Introduce em architecture concepts and embeded system coding

Students should be divided into batches, each batch containing not more than 3 students. It can be either hardware-software or simulation software related to CA principles/algorithms. This lab is intended to practice the principles (theory) that they have studied in Computer architecture. It is entertained to do a hardware related project incorporating innovative/new ideas. 

Some of the project titles:

Processor:

• Design of Micro control unit
• Design of LCM processor
• Design of Arithmetic unit
• Design of logic unit
• Design of shift unit
• Design of nano control unit
• Design processor for Recursive functions
• Design of Floating Point Operation processor
• Design of disassembler (converting from object code to Assembly language code)