m.kumarasamy college of engineering, … object oriented programming 3 0 0 3 50 50 100 ucs12303...

MKCE-CSE[R2012]

M.KUMARASAMY COLLEGE OF ENGINEERING, KARUR

(AUTONOMOUS)

REGULATIONS 2012

B.E COMPUTER SCIENCE AND ENGINEERING

CURRICULUM FROM III TO VIII SEMESTERS AND ELECTIVES

(Applicable to the students admitted from the Academic year 2012-2013 onwards)

SEMESTER – III

Code No. Course Title

Hours/

week Credit Maximum Marks

L T P C CIA ESE Total

THEORY

UMA12302 Numerical Methods 3 1 0 4 50 50 100

UEC12311 Digital Principles and System Design

3 1 0 4 50 50 100

UCS12301 Data Structures 3 1 0 4 50 50 100

UCS12302 Object Oriented Programming 3 0 0 3 50 50 100

UCS12303 Computer Architecture 3 0 0 3 50 50 100

UCS12304 Design and Analysis of Algorithms

3 0 0 3 50 50 100

PRACTICAL

UEC12312P Digital Laboratory 0 0 3 2 50 50 100

UCS12305P Data Structures Laboratory 0 0 3 2 50 50 100

UCS12306P C++ Programming Laboratory 0 0 3 2 50 50 100

UTP12301P Career Skill Development -I 0 0 1 1 100 0 100

Total 28 1000

MKCE-CSE[R2012]

SEMESTER – IV


Hours/



THEORY

UMA12401 Probability and Queuing Theory 3 1 0 4 50 50 100

UEC12414 Microprocessors & Microcontrollers

3 1 0 4 50 50 100

UEC12411 Analog and Digital

Communication 3 0 0 3 50 50 100

UCS12401 Software Engineering 3 0 0 3 50 50 100

UCS12402R Database Management Systems 3 0 0 3 50 50 100

UCS12403 Operating Systems 3 0 0 3 50 50 100

PRACTICAL

UEC12415P Microprocessors and Microcontrollers Laboratory

0 0 3 2 50 50 100

UCS12404P Database Management Systems Laboratory

0 0 3 2 50 50 100

UCS12405P Operating Systems Laboratory 0 0 3 2 50 50 100

UTP12401P Career Skill Development -II 0 0 1 1 100 0 100

Total 27 1000

MKCE-CSE[R2012]

SEMESTER – V


Hours/



THEORY

UCS12501 Java Programming 3 0 0 3 50 50 100

UCS12502 Open Source Software 3 1 0 4 50 50 100

UCS12503 Computer Networks 3 0 0 3 50 50 100

UCS12504 Object Oriented Analysis and Design

3 0 0 3 50 50 100

UCS12505 Theory of Computation 3 0 0 3 50 50 100

UCS12506 Data Warehousing and Data Mining

3 0 0 3 50 50 100

PRACTICAL

UCS12507P Java Programming Laboratory 0 0 3 2 50 50 100

UCS12508P CASE Tools Laboratory 0 0 3 2 50 50 100

UCS12509P Computer Networks Laboratory 0 0 3 2 50 50 100

UCS12510P Mini Project 0 0 3 2 50 50 100

UTP12501P Career Skill Development -III 0 0 1 1 100 0 100

Total 28 1100

MKCE-CSE[R2012]

SEMESTER – VI


Hours/



THEORY

UMA12601 Discrete Mathematics 3 1 0 4 50 50 100

UCS12601 Web Technology 3 1 0 4 50 50 100

UCS12602 Principles of Compiler Design 3 1 0 4 50 50 100

UCS12603 Computer Graphics 3 1 0 4 50 50 100

UCS12604 Mobile Computing 3 0 0 3 50 50 100

E1 Elective -I 3 0 0 3 50 50 100

PRACTICAL

UCS12606P FOSS Laboratory 0 0 3 2 50 50 100

UCS12607P Web Technology Laboratory 0 0 3 2 50 50 100

UCS12608P Computer Graphics Laboratory 0 0 3 2

50 50 100

UTP12601P Career Skill Development -IV 0 0 1 1 100 0 100

Total 29 1000

MKCE-CSE[R2012]

LIST OF ELECTIVES FOR B.E- COMPUTER SCIENCE AND ENGINEERING

SEMESTER VI

Code No. Course Title L T P C

UCS12651 C# and. Net Programming 3 0 0 3

UCS12652 Embedded Systems 3 0 0 3

UCS12653 Middleware Technology 3 0 0 3

UCS12654 Optical and Access Networks 3 0 0 3

UCS12655 Pervasive Computing 3 0 0 3

UCS12656 Unix Internals 3 0 0 3

UCS12657 Mobility and Big-Data 2 0 1 3

UBA12653 Total Quality Management 3 0 0 3

UMA12651 Transforms and Partial differential

Equations 3 0 0 3

MKCE-CSE[R2012]

SEMESTER – VII


Hours/



THEORY

UCS12701 Cryptography and Network Security

3 1 0 4 50 50 100

UCS12702 Multimedia Systems 3 0 0 3 50 50 100

UBA12703 Principles of Management 3 0 0 3 50 50 100

E2 Elective –II 3 0 0 3 50 50 100

E3 Elective -III 3 0 0 3 50 50 100

PRACTICAL

UCS12706P Mobile Computing Laboratory 0 0 3 2 50 50 100

UCS12707P Multimedia Systems Laboratory 0 0 3

2

50 50 100

UCS12708P Project Work Phase - I 0 0 4 2 50 50 100

Total 22 800

MKCE-CSE[R2012]

SEMESTER – VIII


Hours/



THEORY

UCS12801 Cloud Computing 3 0 0 3 50 50 100

E4 Elective – IV 3 0 0 3 50 50 100

E5 Elective – V 3 0 0 3 50 50 100

PRACTICAL

UCS12802P Project Work Phase - II 0 0 24 12 100 100 200

Total 21 500

Total Credits = 155

MKCE-CSE[R2012]


SEMESTER VII


UCS12751 Adhoc Networks 3 0 0 3

UCS12752 Bio Informatics 3 0 0 3

UCS12754 Cyber Forensics 3 0 0 3

UCS12755 Grid Computing 3 0 0 3

UCS12756 Neural Networks 3 0 0 3

UCS12757 Parallel Computing 3 0 0 3

UCS12758 Real Time Systems 3 0 0 3

UCS12759 Service Oriented Architecture 3 0 0 3

UCS127510 Soft Computing 3 0 0 3

UCS127511 Software Testing 3 0 0 3

UCS127512 System Software 3 0 0 3

UBA12751 E-Commerce 3 0 0 3

MKCE-CSE[R2012]


SEMESTER VIII


UCS12851 Advanced DBMS 3 0 0 3

UCS12852 Advanced Java Programming 3 0 0 3

UCS12853 Artificial Intelligence 3 0 0 3

UCS12856 Fundamental of Nano science 3 0 0 3

UCS12857 High Speed Networks 3 0 0 3

UCS12858 Robotics 3 0 0 3

UCS12859 Software Project Management 3 0 0 3

UCS128510 Software Quality Assurance 3 0 0 3

UCS128511 User Interface Design 3 0 0 3

UCS128512 Web Services 3 0 0 3

UBA12854 Enterprise Resource planning 3 0 0 3

UBA12858 Professional Ethics 3 0 0 3

MKCE-CSE[R2012]

SEMESTER – III

UMA12302 NUMERICAL METHODS

(Common to CSE & IT) L T P C

3 1 0 4 AIM:

To facilitate the understanding of the principles and to cultivate the art of formulating physical problems in the language of mathematics.

OBJECTIVES:

At the end of the course, the students would be acquainted with the basic concepts in

numerical methods and their uses are summarized as follows:

The roots of nonlinear (algebraic or transcendental) equations, solutions of large

system of linear equations and eigen value problem of a matrix can be obtained

numerically where analytical methods fail to give solution.

When huge amounts of experimental data are involved, the methods discussed on

interpolation will be useful in constructing approximate polynomial to represent the

data and to find the intermediate values.

The numerical differentiation and integration find application when the function in

the analytical form is too complicated or the huge amounts of data are given such as

series of measurements, observations or some other empirical information.

Since many physical laws are couched in terms of rate of change of one/two or more

independent variables, most of the engineering problems are characterized in the

form of either nonlinear ordinary differential equations or partial differential

equations. The methods introduced in the solution of ordinary differential equations

and partial differential equations will be useful in attempting any engineering

problem.

UNIT I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3 Introduction – Direct method – Gauss Elimination Method - Gauss Jordan elimination method-

Solution of simultaneous equations – Method of triangular decomposition or factorization – crouts

reduction method - Iterative methods: Gauss Jacobi and Gauss- Seidel methods

UNIT II INTERPOLATION AND APPROXIMATION 9+3 Gregary Newton Forward interpolation - Backward interpolation – striling interpolation -

Lagrangian Interpolation – Hermites Interpolation - Interpolating with a cubic spline

UNIT III NUMERICAL DIFFERENTIATION AND INTEGRATION 9+3 Derivatives based on Newton‘s forward and backward interpolation – Partial derivatives based on

Finite differences - Numerical integration by Newton Cote‘s Quadrature formulae - Romberg‘s method – Lobatto Integration method – Double integrals using trapezoidal and Simpson‘s rules.

MKCE-CSE[R2012]

UNIT IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL

EQUATIONS

9+3

Single step methods: Taylor series method – Euler and modified Euler methods – Fourth order

Runge – Kutta method for solving first and second order equations – Multistep methods: Milne‘s and Adam‘s predictor and corrector methods.

UNIT V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL

DIFFERENTIAL EQUATIONS

9+3

Finite difference solution of second order ordinary differential equation – Finite difference

solution of one dimensional heat equation by explicit and implicit methods – One dimensional

wave equation and two dimensional Laplace and Poisson equations.

TOTAL : 60 PERIODS

TEXTBOOKS:

1. Veerajan T., Ramachnadran T., ―Numerical Methods‖, Tata McGraw-Hill Education Pvt. Ltd., New Delhi, 2009

2. Steven C Chapra, Raymond P Canale, ―Numerical Methods for Engineers‖, Fifth Edition, Tata

McGraw-Hill Education Pvt. Ltd., New Delhi, 2007.

3. Sankar Rao, ―Numerical Methods for Scientists and Engineers‖, Second Edition, PHILearning,

New Delhi, 2004

REFERENCES:

1. .Kandasamy, P., Thilagavathy, K. and Gunavathy, K., ―Numerical Methods‖, S.Chand Co. Ltd., New Delhi, 2003.

2. Burden, R.L and Faires, T.D., ―Numerical Analysis‖, Seventh Edition, Thomson Asia Pvt. Ltd.,

Singapore, 2002.

MKCE-CSE[R2012]

UEC12311 DIGITAL PRINCIPLES AND SYSTEM DESIGN


3 1 0 4 AIM:

To provide an understanding of the fundamentals of digital logic and digital circuit design

OBJECTIVES:

To understand Boolean algebra, Boolean functions and realization of functions with basic gates.

To design combinational and sequential circuits.

To design circuits with MSI devices.

To learn the use of HDL for designing larger systems.

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9

Number Systems: Binary, Octal, Decimal, Hexadecimal Number systems – complements – Binary Arithmetic- Binary codes: Weighted – BCD - 2421 - Gray code-Excess-3 code – ASCII –

EBCDIC. Boolean algebra: Boolean postulates and laws –De-Morgan‘s Theorem- Principle of

Duality- Boolean expression – Minimization of Boolean expressions– Sum of Products (SOP), Product of Sums (POS) and its Conversion – Minimizat ion: Karnaugh map, Tabulation Method-Don‘t care conditions. Logic Gates Implementations of Logic Functions usinggates,

NAND – NOR implementations. UNIT II COMBINATIONAL LOGIC 9

Design procedure of Combinational circuits: Adders - Subtractors – Parallel adder/ Subtractor- Carry look ahead adder- BCD adder- 2- bit Magnitude Comparator- Multiplexer / Demultiplexer-

Encoder / Decoder – Parity Generator/Checker – Code converters: Binary to Gray – Gray to Binary - BCD to Excess 3 – Excess 3 to BCD -Implementation of combinational logic using

decoders and multiplexers. UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9

Flip flops SR, JK, T, D and Master slave – Characteristic and excitation tables and equations –Level and Edge Triggering –Realization of one flip flop using other flip flops – counters - Ring

counters and Sequence detector - Design of Synchronous counters - Registers – shift registers- Universal shift register - Analysis and design of sequential circuits with state diagram, State table, State minimization and State assignment. UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9

Design of fundamental mode – primitive state / flow table – Minimization of primitive state table – state assignment – Excitation table - cycles – Races –Hazards: Static, Dynamic and

Essential – Hazards elimination – Introduction to Hardware Description Language (HDL) – HDL for Flip Flops – Shift Registers – Counters.

UNIT V MEMORY AND PROGRAMMABLE LOGIC DEVICES 9

Classification of memories – ROM Organization: PROM, EPROM, EEPROM – RAM

Organization: Static RAM, Dynamic RAM - Programmable Logic Array (PLA) - Programmable Array Logic (PAL) – Field Programmable Gate Arrays (FPGA) - Implementation of

combinational logic circuits using

PROM, PLA, PAL

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS:

1. Mano, M, ―Digital Design‖, Third Edition, Prentice Hall of India, New Delhi, 2003.

2. Roth, Charles H., ―Fundamentals of Logic Design‖, Thomson Publication Company, New

Delhi, 2003 REFERENCES:

1. Yarbrough, John M., ―Digital Logic Applications and Design‖, Thomson Publications,

New Delhi, 2007.

2. Leach, Dona ld P. and Malvino, Albert Paul., ―Digital Principles And Applications‖,

Fifth Edition, Tata McGraw-Hill, New Delhi, 2003.

3 Givone, Donald D., ―Digital Principles and Design‖, Tata McGraw-Hill, New Delhi, 2003.

MKCE-CSE[R2012]

UCS12301/

UIT12301

DATA STRUCTURES


3 1 0 4 AIM:

To provide an in-depth knowledge in problem solving techniques and data structures.

OBJECTIVES:

To learn the systematic way of solving problems To understand the different methods of organizing large amounts of data

To learn to program in C To efficiently implement the different data structures To efficiently implement solutions for specific problems

UNIT I LINEAR DATA STRUCTURES 9

Introduction to Algorithms – ADT – Analysis of algorithm – Space and Time Complexities. List: List ADT – Array based implementation – Linked list implementation – Cursor based linked lists – Doubly- linked lists – Applications of lists. Stacks: Stack ADT– Array Representation and Implementation of stack – Operations on Stacks – Array Representation of

Stack – Linked Representation of Stack – Application of stack. Queues: Array and linked representation and implementation of queues – Operations on Queue – Applications of Queue.

UNIT II TREE STRUCTURES 9

Basic Terminologies – Binary Tree – The Search Tree ADT – Binary Search Trees- AVL Tree – B-trees – Splay Tree - Tree Traversal – Applications of Trees. UNIT III HASHING AND PRIORITY QUEUE 9

Introduction to Hashing – Separate Chaining – Open Addressing – Rehashing –

Extendible Hashing – Introduction to Priority Queue – Implementation of Priority Queue – Binary Heap – Applications – d-Heaps – Leftist heaps – Skew Heaps – Binomial Queues. UNIT IV GRAPH 9

Introduction – Topological sort – Shortest path algorithms – Unweighted Shortest Paths –

Dijkstra‘s Algorithm – Network flow problems – Minimum Spanning Tree (Prim‘s & Kruskal‘s Algorithm) – Applications of Depth First search – Introduction to NP – completeness-

Applications of Graph. UNIT V SORTING TECHNIQUES 9

Introduction – Insertion sort – Selection Sort - Shell sort – Heap sort – Merge sort – Quick sort – Bubble Sort – Sorting Large Structures – Bucket sort – External sorting–

Applications of Sorting.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C‖, Second Edition, Pearson

Education, 1997.

REFERENCES:

1.

A.V.Aho, J . E. Hopcroft, and J . D. Ullman, ―Data Structures and Algorithms‖,Pearson Education, 1983

2

.

R. F. Gilberg, B. A. Forouzan, ―Data Structures‖, Second Edition, Thomson India Edition,

2005. 3 A. M. Tenenbaum, Y. Langsam, and M. J. Augenstein, ―Data Structures using C‖,Pearson

Education, 1998.

MKCE-CSE[R2012]

UCS12302/

UIT12302

OBJECT ORIENTED PROGRAMMING L T P C

(IN C++)

(Common to CSE & IT)

L T P C

3 1 0 4 AIM:

To understand the concepts of object-oriented programming and master OOP using C++.

OBJECTIVES:

To identify and practice the object-oriented programming concepts and techniques

To practice the use of C++ classes and class libraries, modify existing C++ classes,

develop C++ classes for simple applications

To practice the concepts of Object-Oriented Analysis and Design (OOA/OOD) and

design patterns and frameworks by developing a C++ based project.

UNIT I INTRODUCTION 9 Programming paradigms – Basic concepts and benefits of OOP-Structure of C++ program – Tokens – Keywords – Identifiers – Constants – Data types – Functions – Statements – Dynamic

initialization – Reference Variables – Scope Resolution Operator – Member dereferencing operators – memory management operators – An Overview of C++.

UNIT II CLASSES & OBJECTS 9 Classes & Objects – Arrays-Pointers – References – Dynamic Allocation Operators –

Function Overloading – Copy constructors – Default Arguments

UNIT III INHERITANCE & POLYMORPHISM 9 Operator Overloading – Inheritance – Virtual Functions – Polymorphism.

UNIT IV TEMPLATE & EXCEPTION HANDLING 9 Templates – Exception Handling – Run Time Type ID and the Casting Operators.

UNIT V FILE I/O 9 The C++ I/O System basics – C++ file I/O –Introducing the Standard Template Library.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Herbert Schildt, ―The Complete reference C++‖, TATA Mc GRAWHILL EDITION, Fourth Edition (Reprint 2009).

REFERENCES: 1. E.Balagurusamy, ―Object Oriented Programming with C++‖, TATA Mc GRAW

HILL EDITION, Third Edition (Reprint 2007). 2. Ira Pohl, ―Object-Oriented Programming using C++‖, 2nd ed., Pearson Education,

1997.

3 Bjarne Stroustrap, ―The C++ Programming Language‖, Pearson Education, Third EditioN 2007.

MKCE-CSE[R2012]

UCS12303/

UIT12303

COMPUTER ARCHITECTURE


3 0 0 3 AIM:

To understand the basics of digital design, the design of various components of the computer system and its organization.

OBJECTIVES:

To understand the fundamentals of Boolean logic and functions.

To design and realize these functions with basic gates, and other components using combinational and sequential logic.

To understand the design and organization of a von-neumann computer system.

To comprehend the importance of the hardware-software interface.

UNIT I BASIC STRUCTURE OF COMPUTERS 9

Functional Units – Basic Operational Concepts – Bus Structures – Software Performance – Memory Locations and Addresses – Memory Operations – Instruction set architecture Instruction and Instruction Sequencing – Addressing Modes – Assembly Language – Basic I/O Operations – Stack and Queue. UNIT II ARITHMETIC AND BASIC PROCESSING UNIT 9 Addition and Subtraction of Signed Numbers – Multiplication of Positive numbers – Signed

operand Multiplication – Fast Multiplication –Integer Division – Floating-Point Numbers and Operations – Basic Processing Unit – Fundamental Concepts – Execution of a Complete

Instruction – Multiple Bus Organization – Hardwired Control – Micro programmed Control – Case study (Nano Programming).

UNIT III PIPELINING 9

Pipelining – Basic Concepts – Data Hazards –Instruction Hazards – Influence on

Instruction Sets – Data Path and Control Consideration –Superscalar Operation – Performance Considerations – Case study Ultra SPARC-II (Pipeline Structure).

UNIT IV MEMORY SYSTEM 9 Memory Concepts – Semiconductor RAMs – ROMs – Speed, Size and Cost – Cache Memories

–Performance Considerations – Virtual Memories – Memory Management Requirements – Secondary Storage device (Optical Disk) – Case study (Blue-ray Disk).

UNIT V ORGANIZATION 9 Accessing I/O Devices – Interrupts – Direct Memory Access – Buses – Interface Circuits – Standard I/O Interfaces (PCI - SCSI - USB) – Case study (Keyboard and Mouse).

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, ―Computer Organization‖, Fifth Edition,McGraw-Hill, 2002.

REFERENCES:

1. William Stallings, ―Computer Organization and Architecture: Designing for Performance‖, Sixth Edition, Pearson Education, 2003

2. David A Patterson and John L.Hennessy, ―Computer Organization and Design The hardware /

software interface‖, Second Edition, Morgan Kaufmann, 2002. 3 John P Hayes, ―Computer Architecture and Organization‖, Third Edition, McGraw-Hill, 1998.

MKCE-CSE[R2012]

UCS12304/

UIT12304

DESIGN AND ANALYSIS OF ALGORITHMS


3 0 0 3 AIM:

The aim is to introduce the basics of algorithm design paradigms and analysis to enable designing of efficient algorithms.

OBJECTIVES:

To introduce the basic concepts of algorithm analysis

To introduce the design paradigms for algorithm design

To introduce the basic complexity theory.

UNIT I BASIC CONCEPTS OF ALGORITHMS 9

Basic Concepts – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem types – Fundamentals of Analysis Framework – Asymptotic Notations and Basic Efficiency Classes. Mathematical Analysis of Non–recursive Algorithm – Mathematical

Analysis of Recursive Algorithm.

UNIT II ANALYSIS OF SORTING AND SEARCHING ALGORITHMS 9

Brute Force – Sequential Search and Brute – Force String Matching –Divide And Conquer – Merge Sort – Quick Sort – Binary Search – Finding Maximum and Minimum –Depth First

Search and Breadth First Search. UNIT III GREEDY ALGORITHMS 9

Greedy Algorithms: General Method – Container Loading – Knapsack Problem - Prim‘s Algorithm – Kruskal‘s Algorithm – Dijkstra‘s Algorithm- Huffman trees

UNIT IV DYNAMIC PROGRAMMING 9 Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths – Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem

UNIT V BACKTRACKING 9

Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring – Hamiltonian problem – Knapsack problem-Branch and Bound –Assignment Problem

TOTAL : 45 PERIODS TEXTBOOKS:

1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithm‖, Pearson Education,

2009.(For Units I and II)

2.

Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second

Edition, Universities Press, 2007. (For Units III to V)

REFERENCES:

1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, "Introduction to Algorithms", Second Edition, Prentice Hall of India Pvt. Ltd, 2003.

2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "The Design and Analysis of

Computer Algorithms", Pearson Education, 1999. 3 T.H. Cormen C.E. Leiserson, R.L. Rivest and C. Stein, ―Introduction to Algorithms‖, Second

Edition, PHI, 2007. 4 Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C‖, Second Edition, Pearson

Education, 1997.

MKCE-CSE[R2012]

UEC12312P DIGITAL LABORATORY (Common to CSE & IT)

L

T

P C

0 0 3 2

AIM:

The aim of this laboratory is to provide a background in digital electronics and to give an

understanding of the fundamentals of computer hardware.

OBJECTIVES

To understand the main building blocks of digital circuits. To understand the components of Microprocessor systems, in particular microcontrollers.

To understand the practical aspects of digital electronics.

LIST OF EXPERIMENTS

1 Verification of Boolean theorems using digital logic gates.

2 Design and implementation of combinational circuits using basic gates and universal gates.

3 Design and implementation of code converters.

4 Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI

devices.

5 Design and implementation of parity generator / checker using basic gates and MSI devices.

6 Design and implementation of magnitude comparator.

7 Design and implementation of Multiplexers/ Demultiplexers.

8 Verification of operation of flip-flops.

9 Design and implementation of Shift registers in SISO, SIPO, PISO, PIPO modes using

suitable IC‘s.

10 Design and implementation of Synchronous counters/ Asynchronous counters.

11 Simulation Of Combinational Circuits- Multiplexer and Demultiplexers using Hardware

12 Description Language (HDL) (VHDL/ Verilog HDL Software Required)

13 Simulation Of Sequential Circuits- Flip-flops using Hardware Description Language(HDL)

14 (VHDL/ Verilog HDL Software Required)

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12305P/

UIT12305P DATA STRUCTURES LABORATORY

(Common to CSE & IT) L

T

P

C

0 0 3 2 AIM:

To teach the principles of good programming practice and to give a practical training in writing efficient programs in C

OBJECTIVES

To teach the students to write programs in C

To implement the various data structures as Abstract Data Types

To write programs to solve problems using the ADT.

LIST OF EXPERIMENTS

1 Array Implementation of List ADT

2 Linked List Implementation of List ADT

3 Implementations of Stack ADT

4 Balanced Parenthesis

5 Evaluating Postfix Expressions‘ Queue ADT

6 Search Tree ADT – Binary Search Tree

7 Tree Traversal

8 Heap Sort

9 Quick Sort

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12306P

/UIT12306P C++ PROGRAMMING LABORATORY


0 0 3 2 AIM: The aim of this course is to provide a solid introduction to programming in C++ and to provide an overview of the principles and constraints that affect the way in which C++ programming la nguages have been designed and is used.

OBJECTIVES

Explain the principles of the object oriented programming paradigm specifically including abstraction, encapsulation, inheritance and polymorphism

Use an object oriented programming language, and associated class libraries, to develop object

oriented programs Design, develop, test, and debug programs using object oriented principles in conjuncture with

an integrated development environment Describe and explain the factors that contribute to a good object oriented solution.

LIST OF EXPERIMENTS

1 . Design C++ classes with static members, methods with default arguments, friend functions. (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)

2 Implement complex number class with necessary operator overloading and type conversions such as integer to complex, double to complex, complex to double etc.

3 Implement Matrix class with dynamic memory allocation and necessary methods. Give proper

constructor, destructor, copy constructor, and overloading of assignment operator. 4 Overload the new and delete operators to provide custom dynamic allocation of memory.

5 Develop a template of linked- list class and its methods.

6 Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort,

and quick sort. 7 Design stack and queue classes with necessary exception handling.

8 Define Point class and an Arc class. Define a Graph class which represents graph as a collection of Point objects and Arc objects. Write a method to find a minimum cost spanning

tree in a graph. 9 Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse,

Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic polymorphism

and RTTI.

10 Write a C++ program that randomly generates complex numbers (use previously designed

Complex class) and writes them two per line in a file along with an operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and

write the result to another file (one per line). TOTAL: 45 PERIODS

MKCE-CSE[R2012]

SEMESTER - IV

UMA12401 PROBABILITY AND QUEUEING THEORY


L T P C

3 1 0 4 AIM:

The probabilistic models are employed in countless applications in all areas of science and engineering. Queuing theory provides models for a number of situations that arise in real life. The

course aims at providing necessary mathematical support and confidence to tackle real life problems.

OBJECTIVES:

Have a fundamental knowledge of the basic probability concepts.

Have a well – founded knowledge of standard distributions which can describe real

life phenomena.

Acquire skills in handling situations involving more than one random variable and

functions of random variables.

Understand and characterize phenomena which evolve with respec t to time in a probabilistic manner.

Be exposed to basic characteristic features of a queuing system and acquire skills in analyzing queuing models.

UNIT I RANDOM VARIABLES ( 9+3 )

Discrete and continuous random variables - Moments - Moment generating functions and their properties. Binomial, Poisson, Geometric, Negative binomial, Uniform, Exponential, Gamma, and Weibull distributions.

UNIT II TWO DIMENSIONAL RANDOM VARIABLES ( 9+3 )

Joint distributions - Marginal and conditional distributions – Covariance – Correlation and regression - Transformation of random variables - Central limit theorem.

UNIT III MARKOV PROCESSES AND MARKOV CHAINS ( 9+3 ) Classification - Stationary process - Markov process - Markov chains – Transition probabilities

- Limiting distributions - Poisson process UNIT IV QUEUEING THEORY ( 9+3 )

Markovian models – Birth and Death queuing models - Steady state results: Single and multiple server queuing models - queues with finite waiting rooms - Finite source models - Little‘s

Formula UNIT V NON-MARKOVIAN QUEUES AND QUEUE NETWORKS ( 9+3 )

M/G/1 queue- Pollaczek- Khintchine formula, series queues- open and closed networks

TOTAL : 45/60 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS:

1. O.C. Ibe, ―Fundamentals of Applied Probability and Random Processes‖, Elsevier, 1st Indian Reprint, 2007 (For units 1, 2 and 3).

2. D. Gross and C.M. Harris, ―Fundamentals of Queuing Theory‖, Wiley Student edition, 2004 (For units 4 and 5).

REFERENCES:

1.

A.O. Allen, ―Probability, Statistics and Queuing Theory with Computer Applications‖, Elsevier, 2nd edition, 2005.

2

.

H.A. Taha, ―Operations Research‖, Pearson Education, Asia, 8th edition, 2007.

3 K.S. Trivedi, ―Probability and Statistics with Reliability, Queuing and Computer Science

Applications‖, John Wiley and Sons, 2nd edition, 2002

MKCE-CSE[R2012]

UEC12414 MICROPROCESSORS AND MICROCONTROLLERS


3 1 0 4 AIM:

To have an in depth knowledge of the architecture and programming of 8-bit and 16- bit Microprocessors, Microcontrollers and to study how to interface various peripheral devices with

them.

OBJECTIVES:

To study the basic architectures and operational features of the processors and Controllers

To learn the assembly language programming

To design and understand the multiprocessor configurations

To understand the interfacing concepts of the peripheral devices with that of the Processors

UNIT I 8085 MICROPROCESSOR 9 Introduction to 8085, Microprocessor architecture - Addressing modes - Instruction set –

Interrupts - Programming with 8085

UNIT II 8086 SOFTWARE ASPECTS 9 Intel 8086 Microprocessor - Architecture - Instruction Set - Addressing modes - Assembler Directives – Assembly Language Programming - Procedures – Macros -

Interrupts.

UNIT III MULTIPROCESSOR CONFIGURATION 9

Interconnection Topologies - Coprocessor Configuration – Closely Coupled Configuration –

Loosely Coupled Configuration – 8087 Numeric Data Processor – Architecture – Bus Arbitration - 8089 I/O Processor – Architecture

UNIT IV I/O INTERFACING WITH 8085 9

External Memory Interfacing and I/O Interfacing – Parallel Communication Interface

(8255) – Serial Communication Interface (8251) – Timer (8254) - Keyboard/Display

Controller (8279) – Interrupt Controller (8259) – DMA Controller (8237) – Stepper Motor

Interfacing.

UNIT V 8051 MICROCONTROLLER AND INTERFACING 9

Architecture of 8051 Microcontroller – Signals – Instruction Set - I/O ports – Memory –

Counters and Timers – Serial Data I/O – Interrupts - Interfacing - Keyboard, LCD, ADC &

DAC.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. RameshS.Gaonkar, ―Microprocessor–Architecture,Programming and Applications

with the 8085‖, Penram International Publisher, 5th Ed., 2006

2.

A.K.Ray & K.M Bhurchandi, ―Advanced Microprocessor and Peripherals –

Architecture, Programming and Interfacing‖, Tata McGraw Hill, 2006. REFERENCES:

1. Douglas V. Hall, ―Microprocessors and Interfacing: Programming and Hardware‖, second edition, Tata McGraw Hill, 2006.

MKCE-CSE[R2012]

2. Kenneth J. Ayala, ―The 8051 microcontroller Architecture, Programming and applications‖, second edition, Penram international.

3 Mohammed Ali Mazidi, Janice Gillespie Mazidi, ―The 8051 microcontroller and

embedded systems using Assembly and C‖, second edition Pearson education/Prentice hall

of India, 2007.

MKCE-CSE[R2012]

UEC12411 ANALOG AND DIGITAL COMMUNICATION


3 0 0 3 AIM:

To study about the various modulation techniques like amplitude and angle modulation, that is used for data transmission and reception of analog signals and also to understand about the

modulation techniques used for digital transmission along with spread spectrum and multiple access techniques.

OBJECTIVES:

To study about the amplitude modulation techniques.

To study bout the angle modulation techniques.

To understand about the modulation techniques used for digital data transmission.

To have the knowledge about the digital communication.

To study about the spread spectrum and multiple access techniques

UNIT I AMPLITUDE MODULATION - TRANSMISSION AND RECEPTION 9 Principles of amplitude modulation – AM envelope, frequency spectrum and bandwidth, modulation

index and percentage modulation, AM power distribution, AM transmitters – low level

transmitters, high level transmitters.AM reception: AM receivers - Super heterodyne receivers,

Double Conversion AM receivers. (Block Diagrams only)

UNIT II ANGLE MODULATION- TRANSMISSION AND RECEPTION 9 Angle Modulation – FM and PM waveforms, phase deviation and modulation index, frequency

deviation, phase and frequency modulators and demodulators, Narrowband FM and Broadband

FM, Angle modulation Vs amplitude modulation. FM Receivers: Block diagrams of direct FM

demodulators, Frequency Vs Phase modulation

UNIT III DIGITAL MODULATION AND MULTIPLE ACCESS TECHNIQUE 9

Introduction, ASK, BPSK, DPSK, QPSK, BFSK, Duo B inar y E ncod ing - Performance Comparison Of Various Systems of Digital Modulation. Multiple access technique - FDMA, TDMA

and CDMA, Comparisons of Various Multiple access techniques. UNIT IV BASE BAND DATA TRANSMISSION 9

Sampling theorem, Quantization Process, Aliasing, discrete, PAM signals, I S I , Nyquist Criteria for Distortion less base and binary Transmission, eye patterns. Adaptive equalization for data

transmission, base band M-ary PAM systems. UNIT V SPREAD SPECTRUM AND ERROR CONTROLLING TECHNIQUES 9

Introduction, Pseudo Noise sequence, DS Spread spectrum with coherent binary PSK, Processing gain, FH Spread spectrum. Error controlling techniques- Linear Block Codes, Cyclic

Codes, Convolution Codes.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Kolimbiris ―digital communication systems‖ with satellite &optical communication Pearson education

2. Simon Hawkins ―communication systems‖ second edition

MKCE-CSE[R2012]

REFERENCES:

1. KolAnokh Singh, ―Principles of Communication Engineering―Scand & Co., 1999.

2. Proakis, ―Digital Communication‖, McGraw-Hill, 1992.

3. A.B.Carlson, ―Communication Systems‖, McGraw-Hill, 1992.

MKCE-CSE[R2012]

UIT12401 /

UCS12401

SOFTWARE ENGINE ER ING


L T P C

3 0 0 3

AIM:

The course is intended to give Software Engineering principles in classical sense.

OBJECTIVES:

To be aware of a member of generic models to structure the software development process.

To understand fundamental concepts of requirements engineering and requirements specification.

To understand different notion of complexity at both the module and system level

To be aware of some widely known design methods.

To understand the role and contents of testing activities in different life cycle phases

UNIT I INTRODUCTION TO SOFTWARE ENGINEERING 9

Nature of software - Software Process – Generic Process Models – Prescriptive Process Models - Specialized Process Models – Unified Process – Personal and Team Process Models UNIT II SOFTWARE REQUIREMENTS 9

Requirements Engineering – Establishing Groundwork - Eliciting Requirements – Developing use case - Requirement Analysis - Scenario Based Modeling - Data Modeling Concepts - Class Based Modeling - UML models that supplement the use case UNIT III DESIGN CONCEPTS 9 Introduction to Analysis and Design – Design Process - Design Concepts - Design Model -

Software Architecture - Architectural Design Component level design: Designing class based

components -User Interface Design steps

UNIT IV TESTING THE SYSTEM 9

A Strategic Approach to Software Testing – Strategic Issues - Test Strategies for Conventional software – Unit Testing - Integration Testing - Validation testing – System Testing - Black Box Testing - White Box Testing – Basis Path Testing - Control Structure Testing - Art Of Debugging UNIT V SOFTWARE CONFIGURATION MANAGEMENT 9

Software Configuration Management - SCM Repository - SCM Process - Identification of Objects in the software configuration - Version control - Change Control - Configuration Audit - Status Reporting - Risk Management

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Roger S.Pressman, Software Engineering: A Practitioner‘s Approach, McGraw Hill

International edition, Seventh edition, 2010.

2. Ian Sommerville, Software Engineering, 8th Edition, Pearson Education, 2008

REFERENCES: 1. Stephan Schach, Software Engineering, Tata McGraw Hill, 2007

2. Software Engineering Theory and Practice Shari Lawrence Pfleeger, Joanne M.Atlee ,Third Edition ,Pearson Education ,2006

MKCE-CSE[R2012]

UCS12402R/

UIT12402R

DATABASE MANAGEMENT SYSTEMS


L T P C

3 0 0 3

AIM:

To provide a strong foundation in database technology and an introduction to the current trends

in this field.

OBJECTIVES:

To learn the fundamentals of data models and to conceptualize and depict a database

system using ER diagram.

To make a study of SQL and its types

To learn the fundamental concepts of PL/SQL

To know the fundamental concepts of transaction processing- concurrency control

techniques and recovery procedure.

To have an introductory knowledge about the S torage and Query processing

techniques

UNIT I INTRODUCTION 10 Introduction: Purpose of Database System – Views of data – Data Models – Database Architecture –

Entity – Relationship model (E-R model) – Constraints – Removing Redundant Attributes in Entity set – Extended E-R Features Introduction to relational Model: Database Schema – Keys – Structure of Relational Databases –

Relational Algebra – Functional dependencies – Normalization for Relational Databases (up to DKNF) – Denormalization

UNIT II SQL 10 SQL Standards – Data types – Database Objects – DDL– DML– DCL–TCL– Integrity Constraints –

SQL Functions – Join Expressions - SET operations – Nested Sub queries – Views – SQL Sequences – Embedded SQL – Static Vs Dynamic SQL

UNIT III PL/SQL 9 Introduction to PL/SQL – Environment Setup – Data types – Variable – Operators – Conditions – Loops – Strings –Arrays – Procedures – Functions – Cursors –Triggers

UNIT IV TRANSACTION MANAGEMENT 9

Transaction: Transaction Concept – Simple Transaction Model – Transaction Atomicity and Durability – Transaction Isolation – Serializability – Transaction Isolation and Atomicity – Isolation Levels – Implementation of Isolation Levels

Concurrency Control: Lock Based Protocols – Deadlock Handling –Multiple Granularity – Timestamp Based Protocols –Validation Based Protocols – Multi version Schemes

UNIT V DATA STORAGE AND QUERYING 9 RAID – File Organization – Indexing and Hashing: Basic Concepts – Ordered Indices – B+ Tree

Index File – Multiple Key Access – Static Hashing – Dynamic Hashing Query Processing and Optimization: Measures of Query cost – Selection Operation – Sorting –

Join operation – Other operations – Evaluation of Expressions – Transformation Relational Expression –Estimation Statistics of Expression results – Choice of Evaluation plans – Materialized views

TOTAL : 47 PERIODS

http://www.studytonight.com/dbms/joining-in-sql

http://www.studytonight.com/dbms/set-operation-in-sql

http://www.studytonight.com/dbms/sql-sequences



MKCE-CSE[R2012]

TEXTBOOKS: 1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan ― Database System Concepts, Sixth

Edition, McGraw-Hill, 2013.

2.

Steven Feuerstein, Bill Pribyl― Oracle PL/SQL Programming, Sixth Edition, O'Reilly Media,

February 2014

REFERENCES: 1. RamezElmasri and Shamkant B. Navathe ― Fundamentals of Database Systems, Seventh

Edition, Pearson Education, 2015.

2. James Groff, Paul Weinberg, Andy Oppel ― SQL:The Complete Reference, 3rd Edition,

McGraw-Hill, 2009

3 Oracle® Database, PL/SQL Language Reference, 11g Release 2 (11.2), December 2014

http://www.oreillynet.com/pub/au/344

http://www.oreillynet.com/pub/au/595

http://www.mhprofessional.com/contributor.php?id=47609



MKCE-CSE[R2012]

UCS12403 /

UIT12403

OPERATING SYSTEMS L T P C (Common to CSE & IT)

L T P C

3 0 0 3 AIM:

The course introduces the students to the basic principles of operating systems.

OBJECTIVES:

To be aware of the evolution of operating systems

To learn what processes are, how processes communicate, how process

synchronization is done and how to manage processes

To have an understanding of the main memory and secondary memory management

techniques.

To understand the I/O Subsystem

To have an exposure to Linux and Windows 2000 operating systems

UNIT I OPERATING SYSTEMS OVERVIEW 9

Operating system – Types of Computer Systems – System components – System calls – System programs – System structure – Process concept – Process scheduling – Operations on processes – Cooperating processes – Inter process communication – Multithreading models – Threading issues – Pthreads.

UNIT II PROCESS SCHEDULING AND SYNCHRONIZATION 9 Scheduling criteria – Scheduling algorithms – Multiple processor scheduling – Real time scheduling – Algorithm Evaluation – Process Scheduling Models – The critical section problem

– Synchronization hardware – Semaphores – Classic problems of synchronization – Critical regions – Monitors – Case Study : Process Management in Linux

UNIT III DEADLOCK AND STORAGE MANAGEMENT 9

Deadlock: System model – Deadlock characterization – Methods for handling deadlocks – Recovery from deadlock.

Memory Management: Swapping – Contiguous memory allocation – Paging –Segmentation – Segmentation with paging. Virtual Memory: Background – Demand paging – Process creation – Page replacement – Allocation of frames – Thrashing. UNIT IV FILE SYSTEMS & I/O SYSTEMS 9

File concept – Access methods – Directory structure – File-system mounting –Protection – Directory implementation – Allocation methods – Free-space management – Disk scheduling – Disk management – Swap-space management. UNIT V DISTRIBUTED SYSTEMS 9

Distributed file system – Background – Naming and Transparency – Remote file access – State full versus Stateless service – File Replication. Distributed Co-ordination – Event ordering – Mutual Exclusion – Atomicity – Concurrency control – Deadlock Handling – Election Algorithms

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS: 1. Silberschatz, Galvin & Gagne, ―Operating System Concepts‖, Sixth Edition, John Wiley &

Sons Inc 2003.

REFERENCES: 1. Andrew S. Tanenbaum, ―Modern Operating Systems‖, Second Edition, AddisonWesley, 2001.

2. Gary Nutt, ―Operating Systems‖, Second Edition, Addison Wesley, 2003.

3 H M Deital, P J Deital and D R Choffnes, ―Operating Systems‖, Pearson Education,2004

MKCE-CSE[R2012]

UEC12415P MICROPROCESSORS AND MICROCONTROLLERS

LABORATORY

(Common to CSE & IT )

L

T

P

C

0 0 3 2 AIM:

To learn the assembly language programming of 8085, 8086 and 8051 and also to give a

practical training of interfacing the peripheral devices with the processor.

OBJECTIVES :

To implement the assembly language programming in 8085,8086 and 8051

To study the system function calls like BIOS/DOS.

To experiment the interface concepts of various peripheral device with the processor

LIST OF EXPERIMENTS

1 Programming with 8085- 8 Bit and 16 Bit Arithmetic and Logical Operations.

2 Programming with 8085- Code Conversion and Matrix Multiplication.

3 Interfacing with 8085-Parallel Communication Interface, 8253, 8279, 8251.

4 Interfacing with 8085-Serial Communication Interface.

5 Interfacing with 8085 Keyboard and Display Controller.

6 Programming with 8086-experiments including BIOS/DOS calls: Keyboard control, Display, File Manipulation.

7 Interfacing with 8086 - Parallel Communication Interface.

8 Interfacing with 8086 – Serial Communication Interface.

9 Interfacing with 8051 Microcontroller with Stepper Motor.

10 Interfacing with 8051 Microcontroller with Traffic Light Controller.

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12404P/

UIT12404P DATABASE MANAGEMENT SYSTEMS

LABORATORY


L T P C

0 0 3 2

AIM:

To inculcate the abilities of applying the principles of database management systems. The

course aims to prepare the students for projects where a proper implementation of databases will be required.

OBJECTIVES:

The students will be able to create a database file

The students will be able to query a database file

The students will be able to append and update a database file

LIST OF EXPERIMENTS

1 Data Definition Language (DDL) commands in RDBMS.

2 Data Ma n ip u la t io n L a n gua ge (DML) a nd Da ta C o n t ro l L a ngua ge (DCL)

commands in RDBMS.

3 High- level language extension with Cursors.

4 High level language extension with Triggers

5 Procedures and Functions.

6 Embedded SQL.

7 Design and implementation of Payroll Processing System.

8 Design and implementation of Banking System.

9 Design and implementation of Library Information System.

10 Database Design using E-R model and Normalization.

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12405P /

UIT12405P OPERATING SYSTEMS LABORATORY


L

T

P

C

0 0 3 2 AIM:

To have hands-on experience in operating system concepts and programming in the UNIX environment.

OBJECTIVES:

To learn shell programming and the use of filters in the UNIX environment.

To learn to program in C using system calls.

To learn to use the file system related system calls.

To have knowledge in how processes are created and processes communicate.

To learn how process synchronization is done using semaphores.

LIST OF EXPERIMENTS

1 Write programs using the following system calls of UNIX operating system: fork, exec, getpid, exit, wait, close, stat, opendir, readdir

Write programs using the I/O system calls of UNIX operating system (open, read, write,

etc)

2 Shell Programming

Loops

Patterns

Expansions

Substitutions

3 Write C programs to simulate UNIX commands like ls, grep, etc.

4 Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for F C F S and SJF. For e a c h of t h e s c h e d u l i n g policies,

compute and print the average waiting time and average turnaround time. (2 sessions)

5 Given the list of processes, their CPU burst times and arrival times, display/print the

Gantt chart for Priority a nd Round robin. For e a c h of t he scheduling policies, compute and print the average waiting time and average turnaround time. (2 sessions)

6 Developing Application using Inter Process Communication (using shared memory, pipes

or message queues)

7 Implement the Producer – Consumer problem using semaphores (using UNIX system calls)

8 Implement some memory management schemes – I

9 Implement some memory management schemes – II

10 Implement any file allocation technique (Linked, Indexed or Contiguous)

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

SEMESTER – V UCS12501/

UIT12501

JAVA PROGRAMMING


L T P C

3 0 0 3

AIM: To understand the concepts of object-oriented, event driven and concurrent programming paradigms and to develop skills in using these paradigms in Java.

OBJECTIVES:

To understand the fundamentals of object – oriented programming in Java, including

defining classes, invoking methods, using class libraries, etc.,

To learn the concepts of Array, String and collections

To study the basics of generics and multithreading

To establish a firm foundation on core Java concepts such as Events, Exception, etc.,

To develop GUI Interfaces and to work with design frameworks

UNIT I INTRODUCTION 9 Object oriented programming concepts – Objects and classes in Java – defining classes – methods – access specifiers – static members – constructors – finalize method – abstract classes – Inheritance –

Arrays – Strings – Case Study: Summary of differences between Java versions.

UNIT II PACKAGES AND COLLECTIONS 9 Packages – Interfaces – Polymorphism – Collections – Lists – Stack – Queue – Sets – Maps – Java Doc comments – I/O streams – File streams – Object class – object cloning – object serialization.

UNIT III GENERIC PROGRAMMING AND MULTITHREADING 9 Motivation for generic programming – generic classes – generic methods – generic interfaces – generic class hierarchies – Multi-threaded programming – interrupting threads – thread states –

thread priorities – thread synchronization – inter thread communication.

UNIT IV EVENT AND EXCEPTION HANDLING 9 Basics of event handling – Delegation event model – event classes – event listener interfaces – adapter classes – inner classes – AWT event hierarchy – Exception handling – exception hierarchy –

throwing and catching exceptions – Accessing database with JDBC – JPI Overview.

UNIT V JAVAFX AND DESIGN PATTERNS 9 Introduction to JAVAFX – Controls – Menus – Introduction to Design patterns – types – MVC design pattern – implementation – Frameworks.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Herbert Schildt, ―Java the Complete Reference‖, ninth edition, McGraw-Hill Osborne Media.

REFERENCES: 1. P.J.Deitel and H.M.Deitel , ― JAVATM HOW TO PROGRAM‖, seventh edition, Pearson

International Edition, 2009.

2. K. Arnold and J. Gosling, ―The JAVA programming language‖, Third edition, Pearson

Education, 2000.

3 Timothy Budd, ―Understanding Object-oriented programming with Java‖, Updated Edition,

Pearson Education, 2000.

4 C. Thomas Wu, ―An introduction to Object-oriented programming with Java‖, Fourth Edition,

Tata McGraw-Hill Publishing company Ltd., 2006.

MKCE-CSE[R2012]

UCS12502/

UIT12502

OPEN SOURCE SOFTWARE


3 1 0 4

AIM: To understand the basic principles of open source software and learn to process software development such as bug reporting, patching code, developing tools.

OBJECTIVES:

To provide exposure in FOSS and to develop open source software foe society

UNIT I PHILOSOPHY 9 Linux, GNU and Freedom, Brief history of GNU, Licensing free software –GPL and copy Left,

trends and potential- global and Indian, overview and usage of various Linux distributions- user friendliness perspective –scientific perspective

UNIT II SYSTEM ADMINISTRATION 9 GNU and Linux installation –Boot process, commands Using bash features, The man pages, files

and file systems, file security, partitions, processes, Managing processes, I/O redirection, Graphical environment, installing software, Backup techniques

UNIT III FOSS PROGRAMMING PRACTICES 9 GNU debugging tools, using source code versioning and managing tools, Review of common

programming practices and guidelines for GNU/Linux and FOSS, Documentation

UNIT IV PROGRAMMING TECHNIQUES 9 Application programming –Basics of X Windows server architecture –QT programming –GTK + programming-Python programming –open source equivalent of existing commercial software

UNIT V PROJECTS AND CASE STUDIES 9

Linux for portable Devices, Creation of Bootable CD and USB from Command line, Case studies-Samba, Libre office, Assistive technology

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, Linux in a nutshell , Sixth

edition, OPeilly media, September 2009.

REFERENCES:

1. Philosophy of GNU URL:http://www.gnu.org/ Philosophy/

2. Overview of Linux Distributions URL:http://distrowatch.com/dwres,php?resource=major

3 Introduction to Linux- A Hands on guide, URL:http://tldp.org/guides.html

4 Linux:Rute‘s User tutorial and exposition, URL: http://rute.2038bug.com/index.html.gz

5 Version Control System, URL: http://git-scm.com/

6 SVN Version control, URL :http://svnbook.red-bean.com/

http://distrowatch.com/dwres,php?resource=major

http://tldp.org/guides.html

http://rute.2038bug.com/index.html.gz

http://git-scm.com/

MKCE-CSE[R2012]

7 GTK+/GNOME

Application Development

Havoc Pennington URL

http://developer.gnome.org./doc/GGAD Python Tutorial, Guido van Rossum, Fred L.Drake, jr., Editor .URL:

http://www. Python.org/doc/current/tut/tut.html

8 Doug Abbot ,Linux for Embedded and Real time applications, Newnes

9 Case study SAMBA URL: http://www.samba.org/

MKCE-CSE[R2012]

UCS12503 /

UIT12503

COMPUTER NETWORKS


3 0 0 3

AIM:

To introduce the concepts, terminologies and technologies used in modern days Data Communication and Computer Networking.

OBJECTIVES:

At the end of this course the student will be able to trace the flow of information from one node to another node in the network

Identify the component required to build different types of networks

Understand the division of network functionalities into layer

Identify solution for each functionality at each layer

Choose the required functionality at each layer for given application

UNIT I FUNDAMENTALS 9

Building a network-Network edge and core-Layering and protocols-Internet Architecture-Networking devices: modems, Routers, Switches, Gateways- Needs/principles of Application Layer Protocols-Web and HTTP-FTP-Electronic Mail( SMTP,POP3,IMAP,MIME) –DNS-SNMP.

UNIT II TRANPORT LAYER 9

Overview of transport layer-UDP-TCP-Reliable byte stream-connection management –flow control-Retransmission-congestion control-congestion avoidance

UNIT III NETWORK AND ROUTING 9 Circuit switching-Packet switching-Virtual circuit switching-Routing-IP-Global Address –

Datagram Forwarding - sub netting-CIDR – ARP- DHCP- RIP- OSPF- BGP- ICMP- IPV6-Multicasting- PIM

UNIT IV DATA LINK LAYER AND LAN 9 Link layer services- Framing- Error control - flow control-Media access control-Ethernet-

CSMA/CD-Token ring-FDDI-wireless LANs-CSMA/CA UNIT V DATA COMMUNICATION 9

Signal characteristics- Data transmission –physical links and transmission media- Signal encoding techniques- channel access techniques- TDM- FDM

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Larry L. Peterson, Bruce S. Davie,‖Computer Networks: A system approach‖, Fifth Edition,

Morgan Kaufmann Publishers, 2010.

2. James F. Kurose, Keith W. Ross, ―Computer Networking- A Top –Down Approach Featuring the Internet ―, Fifth Edition, Pearson Education, 2009.

3. Nader. F. Mir, ―Computer and Communication Networks‖, Pearson Prentice Hall Publishers, 2010.

REFERENCES: 1. Ying-Dar Lin, Ren -Hung Hwang, Fred Baker, ―Computer Networks: An Open Source

Approach‖, McGraw Hill publisher, 2011.

MKCE-CSE[R2012]

UCS12504/

UIT12504

OBJECT ORIENTED ANALYSIS AND DESIGN


L T P C

3 0 0 3

AIM: The course introduces the students to the basic concept of object oriented analysis and design.

OBJECTIVES:

To learn basic OO analysis and design skills through an elaborate case study.

To use the UML design diagrams

To apply the appropriate design patterns

UNIT I FUNDAMENTALS 9

Introduction OOAD – Two Orthogonal Views of the Software - Why object orientation – Object basics – Object oriented systems development life cycle.

UNIT II OBJECT ORIENTED METHODOLOGIES 9 Rumbaugh methodology − Booch methodology − Jacobson methodology − Patterns − Frameworks − Unified approach − Unified modeling language − Use case diagram − Class diagram − Sequence

diagram − Activity diagram.

UNIT III OBJECT ORIENTED ANALYSIS 9 Identifying use cases – Identifying Tentative classes – Identifying Classes and their Behaviors using SCM -Identifying object relationships – Attributes and methods.

UNIT IV OBJECT ORIENTED DESIGN 9

Design axioms – Designing classes – Object storage – Introduction – Object store and persistence overview – Database Management Systems.

UNIT V SOFTWARE QUALITY AND USABILITY 9 Introduction to SQA – Quality Assurance Tests – Testing Strategies – Impact of object orientation

on Testing – Test cases-Test Plan – System usability and measuring user satisfaction.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Ali Bahrami, ―Object Oriented Systems Development‖, Tata McGraw - Hill, 1999.

2. Martin Fowler, ―UML Distilled‖, 2nd Edition, Prentice Hall of India / Pearson Education, 2002.

REFERENCES:

1. Stephen R. Schach, ―Introduction to Object Oriented Analysis and Design‖, Tata McGraw - Hill, 2003.

2. James Rumbaugh, Ivar Jacobson and Grady Booch ―The Unified Modeling Language

Reference Manual‖, Addison Wesley, 1999.

3 Hans - Erik Eriksson, Magnus Penker, Brain Lyons and David Fado, ―UML Toolkit‖, OMG

Press Wiley Publishing Inc., 2004.

4 Barclay, ―Object-Oriented Design with UML and Java‖, Elsevier, 2008.

MKCE-CSE[R2012]

UCS12505 THEORY OF COMPUTATION L T P C

3 0 0 3 AIM:

The theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm.

OBJECTIVES:

Introduce concepts in automata theory and theory of computation

Identify different formal language classes and their relationships

Design grammars and recognizers for different formal languages

Prove or disprove theorems in automata theory using its properties

Determine the decidability and intractability of computational problems

UNIT I AUTOMATA 9 Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA)

– Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure

properties of regular languages – Equivalence and minimization of Automata

UNIT III CONTEXT-FREE GRAMMARS AND LANGUAGES 9 Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition

of the Pushdown automata – Languages of a Pushdown Automata –Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata.

UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9 Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines

– Programming Techniques for TM. UNIT V UNDECIDABALITY 9

A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Universal Languages - Undecidable problems about Turing Machine – Rice Theorem. Post‘s

Correspondence Problem. The classes P and NP – Travelling Salesman Problem – Kruskal‘s Algorithms


1. J.E. Hopcroft, R. Motwani and J.D. Ullman, ―Introduction to Automata Theory, Languages and Computations‖, second Edition, Pearson Education, 2007.

REFERENCES: 1. H.R. Lewis and C.H. Papadimitriou, ―Elements of the theory of Computation‖, Second Edition,


2. Thomas A. Sudkamp,‖ An Introduction to the Theory of Computer Science, Languages and

Machines‖, Third Edition, Pearson Education, 2007.

3. Raymond Greenlaw an H.James Hoover, ―Fundamentals of Theory of Computation, Principles and Practice‖, Morgan Kaufmann Publishers, 1998.

http://en.wikipedia.org/wiki/Model_of_computation

http://en.wikipedia.org/wiki/Algorithm

MKCE-CSE[R2012]

4. Micheal Sipser, ―Introduction of the Theory and Computation‖, Thomson Brokecole, 1997.

5. J. Martin, ―Introduction to Languages and the Theory of computation‖ Third Edition, Tata Mc

Graw Hill, 2007.

MKCE-CSE[R2012]

UCS12506/

UIT12603

DATA WAREHOUSING AND DATA MINING


3 0 0 3

AIM:

The purpose of this course is to provide understanding of the need for data warehousing and to realize the importance of good mining techniques.

OBJECTIVES:

To introduce the theoretical background of the data mining functionalities

To emphasize on the practical issues in designing and implementing data warehouse

To introduce the mining in World Wide Web

UNIT I DATA WAREHOUSING 9 Data Warehousing : Data Warehousing Components-building a Data Warehouse-Mapping the Data Warehouse to a Multiprocessor Architecture-DBMS Scheme for Decision Support-Metadata-Online

analytical processing(OLAP)-OLAP and Multidimensional Data Analysis.

UNIT II DATA MINING 9 Data Mining: -Data Mining-Functionalities-Data Preprocessing-Data Cleaning-Data Integration and Transformation-Data Reduction-Data Discretization

UNIT III CLASSIFICATION AND PREDICTION 9

Classification and Prediction:-Issues Regarding Classification and Prediction-Classification by Decision Tree Induction-Bayesian Classification-Rule Based Classification –Classification by Back

propagation-Prediction-Accuracy and Error Measures-Evaluating the Accuracy of a Classifier or Predictor

UNIT IV CLUSTERING AND PARTITIONING 9 Cluster Analysis:-Types of Data in Cluster Analysis-Clustering Methods: Partitioning Methods-

Hierarchical Methods ,Outlier Analysis UNIT V APPLICATIONS AND TRENDS IN DATA MINING 9

Spatial Data-Mining-Multimedia Data mining-Text Mining-Mining the World Wide Web.

TOTAL : 45 PERIODS TEXTBOOKS: 1. Jiawei Han and Micheline Kamber‖Data Mining Concepts and Techniques‖ Third

Edition,Elsevier Reprinted 2008.

REFERENCES: 1. Alex Berson and Stephen J.Smith‖Data Warehousing,Data mining &OLAP‖, Tata McGraw-

Hill Edition,Tenth Reprint 2007

2. K.P. Somen,Shyam Diwakar and V.Ajay ―Insight into Data Mining Theory and practice‖,

Easter Economy Edition, Prentice Hall of india ,2006

3. G.K. Gupta ―Introduction to Data mining with case studies ―, Easter Economy Edition, Prentice

Hall of india, 2006.

4. Pang-Ning Tan, Michael Steinbach and vipin Kumar ―Introduction to Data mining ―Pearson Education, 2007.

MKCE-CSE[R2012]

UCS12507P/

UIT12506P

JAVA PROGRAMMING LABORATORY


L

T

P

C

0 0 3 2

AIM :

To introduce students to programming fundamentals of Java which provides a suitable

basis for many Java – based applications.

OBJECTIVES :

To understand the fundamentals and basic concepts of Java programming

To enable the students to develop Java based applications

To apply the general programming constructs to Java environment

To apply the object oriented development concepts in Java

LIST OF EXPERIMENTS

1 Develop a Java package with simple Stack and Queue classes. Use JavaDoc comments for

documentation.

2 Design a class for Complex numbers in Java. In addition to methods for basic operations

on complex numbers, provide a method to return the number of active objects created.

3 Design a Date class similar to the one provided in the java.util package

4 Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle,

Ellipse, Triangle, Polygon, etc. Design a simple test application to demonstrate dynamic

polymorphism.

5 Design a Java interface for ADT Stack. Develop two different classes that implement this

interface, one using array and the other using linked- list. Provide necessary exception

handling in both the implementations.

6 Write a Java program to read a file that contains DNA sequences of arbitrary length one

per line (note that each DNA sequence is just a String). Your program should sort the

sequences in descending order with respect to the number of 'TATA' subsequences present.

Finally write the sequences in sorted order into another file.

7 Develop a simple paint- like program that can draw basic graphical primitives in different

dimensions and colors. Use appropriate menu and buttons 8 Develop a scientific calculator using even-driven programming paradigm of Java.

9 Develop a template for linked- list class along with its methods in Java.

10 Design a thread-safe implementation of Queue class. Write a multithreaded producer-

consumer application that uses this Queue class.

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12508P/

UIT12507P

CASE TOOLS LABORATORY


L

T

P

C

0 0 3 2

AIM :

To help the students practice the general software engineering methodologies in the objected – oriented development of applications.

OBJECTIVES :

To understand the fundamentals and basic concepts of Software Engineering

To enable the students to develop creative applications

To practice the object oriented software development methodologies

To be aware of the database management techniques while developing applications

LIST OF EXPERIMENTS

1 Prepare the following documents for two or three of the experiments listed below and

develop the software engineering methodology.

2 Program Analysis and Project Planning.

Thorough study of the problem – Identify project scope, Objectives, Infrastructure.

3 Software requirement Analysis

Describe the individual Phases / Modules of the project, Identify deliverables.

4 Data Modeling

Use work products – Data dictionary, Use diagrams and activity d iagrams, Build and test

class diagrams, Sequence diagrams and add interface to class diagrams.

5 Software Development and Debugging

6 Software Testing

Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop

test case hierarchy, Site check and Site monitor.

7 SUGGESTED LIST OF APPLICATIONS:

1. Student Marks Analyzing System

2. Banking System

3. ATM System

4. Online Ticket Reservation System

5. Payroll Processing System

6. Course Registration System

7. Library Management System

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12509P COMPUTER NETWORKS LAB L

T

P

C

0 0 3 2

AIM :

To have hands-on experience in network programming to analyze network protocols

OBJECTIVES :

To learn socket programming.

To analyze the performance of protocols in different layers in computer networks

using simulation tools.

LIST OF EXPERIMENTS

1 Network topology configuration with hubs/ switches

2 Socket programming

3 Data grams

4 TCP

5 SMTP

6 FTP

7 Implementation of any two congestion control algorithms

8 Study of various IP Address classes practically(IPv4 , IPv6 dual stack configuration)

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

SEMESTER – VI

UMA12601 DISCRETE MATHEMATICS


3 1 0 4 AIM:

To provide an insight to the area of mathematics known as discrete mathematics and apply it to special applications such as coding and cryptography.

OBJECTIVES:

To obtain general knowledge about the area of discrete mathematics

To understand a variety of methods and to construct mathematical proofs

To model situations in a mathematical way and derive useful results

UNIT I PROPOSITIONAL CALCULUS 10+3 Propositions – Logical connectives – Compound propositions – Conditional and biconditional

propositions – Truth tables – Tautologies and contradictions – Contra positive – Logical equivalences and implications – DeMorgan‘s Laws - Normal forms – Principal conjunctive and

disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.

UNIT II PREDICATE CALCULUS 9+3 Predicates – Statement function – Variables – Free and bound variables – Quantifiers – Universe of

discourse – Logical equivalences and implications for quantified statements – Theory of inference – The rules of universal specification and generalization – Validity of arguments.

UNIT III SET THEORY 10+3 Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and

Cartesian product – Relations on sets –Types of relations and their properties – Relational matrix and the graph of a relation – Partitions – Equivalence relations – Partial ordering – Poset – Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra – Homomorphism.

UNIT IV FUNCTIONS 7+3

Definitions of functions – Classification of functions –Type of functions - Examples – Composition of functions – Inverse functions – Binary and n-ary operations – Characteristic function of a set – Hashing functions – Recursive functions – Permutation functions.

UNIT V GROUPS 9+3

Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids – Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange‘s theorem – Normal subgroups – Normal algebraic system with two binary operations - Codes and group codes – Basic

notions of error correction - Error recovery in group codes.

TOTAL : 60 PERIODS TEXTBOOKS: 1. Trembly J.P and Manohar R, ―Discrete Mathematical Structures with Applications to Computer

Science‖, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.

2.

Ralph. P. Grimaldi, ―Discrete and Combinatorial Mathematics: An Applied Introduction‖,

Fourth Edition, Pearson Education Asia, Delhi, 2002.

MKCE-CSE[R2012]

REFERENCES:

1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, ―Discrete Mathematical Structures‖,

Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.

2. Kenneth H.Rosen, ―Discrete Mathematics and its Applications‖, Fifth Edition, Tata McGraw –

Hill Pub. Co. Ltd., New Delhi, 2003.

MKCE-CSE[R2012]

UCS12601/

UIT12601

WEB TECHNOLOGY


L T P C

3 1 0 4 AIM:

To provide an introduction to Java and basic Web concepts and enable the student to create simple Web based applications.

OBJECTIVES:

To introduce the basic Web developing concepts

To understand the Java web programming concepts

To create simple Web pages and provide client side validation

To create dynamic web pages using server side scripting

UNIT I INTRODUCTION WEB SERVICES 9 Web services architecture – overview of web services – service oriented roles and architecture –

architectural process – three tier web based architecture UNIT II XML 9

Introduction to XML – XML fundamentals – well- formed XML documents – components of XML document – XML tools – XML style sheets – XSL – CSS - XML namespaces- WSDL - SOAP –

UDDI

UNIT III CLIENT SIDE PROGRAMMING 9

Client Tier using HTML – Basic HTML tags – Look and feel using CSS – Client side scripting using Java Script and Validations - Document Object Model (DOM)

UNIT IV JAVA- SERVER SIDE PROGRAMMING 9 Presentation tier using JSP – Role of Java EE in Enterprise applications – Internationalization –

Basics of Servlets - To introduce server side programming with JSP

UNIT V BUILDING WEB APPLICATIONS 9 Building Web applications - cookies – sessions – open source environment – PHP

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Rashim Mogha, Preetham.V.V., ― Java Web Services Programming‖, Wiley Dreamtech, New Delhi, 2002.

2. Chris Bates, ―Web Programming – Building Internet Applications, ―Wiley India, 2006.

REFERENCES:

1. Deitel, ―XML How to Program‖, first edition, Pearson Education, USA, 2002.

2. Bhanu Pradhap, ―Understanding Active Server Pages ―, Cyber Tech Publications, New Delhi, 2001.

3. Jeffrey C Jackson, ―Web Technology – A computer Science perspective‖, Pearson Education, 2007.

MKCE-CSE[R2012]

UCS12602/

UIT12602

PRINCIPLES OF COMPILER DESIGN


3 1 0 4

AIM:

To introduce students to the concepts underlying the design and implementation of various compilers.

OBJECTIVES:

To design the front end of the compiler, scanner, parser, intermediate coed generator,

object code generator, and the parallel compilation strategies

UNIT I LEXICAL ANALYSIS 9

Introduction to compiler- compilers-Analysis of the Source Program-The phases of compiler –compiler construction tools-Lexical analyzer- input buffering-specification of tokens-Recognition of tokens-A language for specifying lexical analyzer

UNIT II SYNTAX ANALYSIS AND RUN-TIME ENVIRONMENTS 9 Syntax Analysis: the role of the parser – Context – Free grammars- writing a grammar- Top Down parsing – Bottom up parsing - LR parsers-constructing SLR parsing table-type checking - Type

systems-specification of a simple type checker-Run – Time Environment-Source language issues-storage organization - Storage allocation strategies.

UNIT III INTERMEDIATE CODE GENERATION 9 Intermediate languages-Declarations-Assignment statements-Boolean expressions-flow of Control

statements-Back patching-Procedure calls

UNIT IV CODE GENERATION 9

Issues in the design of a code generator - Target machine – Run-time storage management – Basic block and flow graphs-Next-use information – Simple code generator-Register allocation and

assignment - The DAG representation of basic blocks - Generating code from DAGs

UNIT V CODE OPTIMIZATION 9

Principle sources of optimization – Peephole optimization – Optimization of basic blocks – Loops in flow graphs – Introduction to global data - Flow analysis - Code improving transformations.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Alfred V. Aho, Ravi Sethi Jeffrey D.Ullman, ―Compilers: Principles, Techniques and Tools‖, Pearson Education, 2011.

REFERENCES:

1.

David Galles ,‖Modern compiler design‖, Pearson Education, 2008.

2

.

Steven S.Muchnick,‖Advanced compiler Design & implementation ―, Morgan Kaufmann

Publishers, 2000.

3 Charles N.Fischer, Richard. J.LeBlanc, ―Crafting a compiler with C‖, Pearson Education, 2008.

MKCE-CSE[R2012]

UCS12603

COMPUTER GRAPHICS L T P C

3 1 0 4 AIM:

To enable students to gain an understanding of the methods and applications of computer graphics.

OBJECTIVES:

Study basic graphics primitives and concepts.

Explain two and three dimensional concepts and their applications

Identify all techniques related to modern graphics programming concepts

Learn the concepts of hidden surfaces removal, lighting and libraries used is OpenGL.

UNIT I Introduction to Computer Graphics & Scan conversion 10 Introduction - Overview of Computer Graphics, CRT, Raster Refresh, Random Refresh Displays,

LCD displays, Video Basics- the Video Controller, Random-Scan Display Processor - Line, Circle and Ellipse drawing algorithms, Point, Lines, and Polygon Clipping algorithms.

UNIT II Two-Dimensional Transformations 8 Two dimensional Geometric transformations – Translation, Rotation, Scaling, Reflection and

Shearing, Combined Transformation, the Window to- Viewport Transformations.

UNIT III Three-Dimensional Transformations 9

Three dimensional Geometric transformation- Translation, Rotation, Scaling, Reflection, Shearing, Composite Transformation, Parallel and Perspective projections, View volumes for

projections. UNIT IV Solid Modeling & Visible-Surface Determination 9

Sweep Representations, Spatial-Partitioning Representations - Octree representation, B-Reps, Constructive Solid Geometry. Visible-Surface Algorithms-Back face removal, The Z-Buffer

Algorithm, Scan- line method, Painter‘s algorithms, Area sub-division method, BSP trees, Visible-Surface Ray Tracing, comparison of the methods.

UNIT V Illumination and Shading & Graphics Programming using OPENGL 9 Reflectance properties of surfaces, Ambient, Specular and Diffuse reflections, Phong‘s model,

Gouraud shading, - Graphics programming using OPENGL, Features in OpenGL, OpenGL operations, Abstractions in OpenGL, 3D viewing pipeline, a few examples and demos.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. D. Hearn and M. Pauline Baker, Computer Graphics (C Version), Pearson Education, 2nd

Edition, 2004.

REFERENCES:

1. J. D. Foley, A. Van Dam, S. K. Feiner and J. F. Hughes, Computer Graphics - Principles and Practice, Second Edition in C, Pearson Education, 2003.

2. F. S. Hill Jr., Computer Graphics using OpenGL, Pearson Education, 2003.

MKCE-CSE[R2012]

UIT12604/

UCS12604

MOBILE COMPUTING


3 0 0 3 AIM:

To give a comprehensive exposure to the developments taking place in the areas of wireless networks and computing

OBJECTIVES:

To impart the fundamental concepts of mobile communication systems.

To understand the issues relating to wireless applications.

To learn the working principles of Wireless LAN standards and Wireless Application

Protocols.

UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9

Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas – Signal Propagation – Multiplexing – Modulation – Spread Spectrum –Medium Access Control (MAC) – Space Division Multiple Access(SDMA) –Frequency Division Multiple Access (FDMA)

– Time Division Multiple Access (TMDA) – Code Division Multiple Access(CDMA)

UNIT II WIRELESS TELECOMMUNICATION NETWORKS 9 Telecommunication systems – Global System for Mobile (GSM)– GPRS -– Satellite systems – Basics –Routing – Broadcast Systems – Digital Audio Broadcasting (DAB) – Digital Video Broad

casting (DVB).

UNIT III WIRELESS LAN 9 Advantages and disadvantages of Wireless Local Area network (WLAN) – IEEE 802.11 – System Architecture – Medium Access Control management (MAC) – High Performance Radio LAN

(HIPERLAN) – Bluetooth Architecture – Security.

UNIT IV MOBILE NETWORK LAYER 9 Mobile IP – Internet Protocol version 6 (IPv6) – Dynamic Host Configuration Protocol – Mobile ad-hoc networks –Routing – Destination Sequence Distance Vector – Dynamic Source Routing.

UNIT V TRANSPORT AND APPLICATION LAYERS 9

Traditional TCP – Classical TCP improvements – Wireless Application Protocol – Architecture – Wireless Datagram Protocol (WDP) – Wireless Transport Layer Security(WTLS) –Wireless Session Protocol (WSP) – Wireless Application Environment (WAE) – Wireless Markup Language

(WML)– Wireless Markup Language Script (WML Script) – Wireless Telephony Application (WTA) – Push architecture – Push/pull services.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Ochen H.Schiller, Mobile Communications, Pearson Education, 2007. (Reprint 2011)

REFERENCES: 1. William Stallings, Wireless Communications and Networks, PHI/Pearson Education, 2002

2. Kaveh Pahlavan and Prasanth Krishnamoorthy, ―Principles of Wireless Networks‖, PHI/Pearson Education,2003

3. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile Computing‖, Springer, New York, 2003

4. Hazysztof Wesolowshi, ―Mobile Communication Systems‖, John Wiley and Sons Ltd, 2002

MKCE-CSE[R2012]

UIT12606P/

UCS12605P FOSS LABORATORY


L

T

P

C

0 0 3 2

AIM:

To understand the basic principles of open source software and learn to work in different open source platforms.

OBJECTIVES

To practice the installation of various open source softwares in different modes

To learn to program simple applications in PHP

To learn to successfully build Interfaces using IDEs

To establish a firm foundation in NS2 simulator

LIST OF EXPERIMENTS

1 GNU/Linux OS installation (provide details of how to detect , configure disk partitions & file system and successfully install a GNU/Linux distribution)

2 Basic shell commands –logging in, listing files, editing files, copying/moving files, viewing file contents, changing file modes and permissions, process managements

3 User and group management, file ownerships and permissions, PAM authentication,

Introduction to common system configuration files & log files.

4 Configuring networking, basics of TCP/IP networking and routing , connection to the

internet (through dialup, DSL, Ethernet, leased line)

5 Performing everyday tasks using GUN/Linux-accessing the internet, playing music,

editing documents and spreadsheets, sending and receiving email, copy files from disks and over the network, playing games, writing CDs.

6 Setting up web servers-using apache(for HTTP services), setting up proxy services, printer

services, firewall .Using the GNU compiler collection –getting acquainted with the GNU

compiler tools-the C preprocessor (cpp), the C compiler (gcc) and the c++ compiler (g++), and the assembler(gas)

7 Python Programming

8 QT Programming

9 GTK Programming

10 PHP & MY SQL Connectivity

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UIT12607P/

UCS12607P

WEB TECHNOLOGY LABORATORY


T

P

C

0 0 3 2

AIM: To enable the students to program in Java and to create simple Web based applications.

OBJECTIVES

To design a simple web page using HTML.

To write simple programs using VB Script and JAVA script.

To create simple Web pages and provide client side validation.

To create dynamic web pages using server side scripting.

LIST OF EXPERIMENTS

1 Creation of simple HTML5 pages with divisions, links, tables, canvas and other tags.

2 Client Side Programming.

a. JavaScript for displaying date and comparing two dates.

b. Form validation including text field, radio buttons, checkboxes, list box and

other controls

c. Jquery Exercises, AJAX

3 XML - DTD

4 XML - XSL

5 Webpage – CSS, Style sheet Inclusion Techniques

6 Active Server Pages

7 Java Server Pages – Request, Session, Implicit Objects

8 Java Servlets

9 Sample web application development in the open source environment.

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UCS12608P

COMPUTER GRAPHICS LABORATORY


L

T

P

C

0 0 3 2 AIM: To show how to generate, manipulate and display graphical images OBJECTIVES

Implement Digital differential Algorithm for line, Bresenham‘s algorithm for speedy

line, circle and ellipse generation.

Learn about clipping of polygons and viewing of objects

Perform 2D and 3D transformations using homogeneous coordinates.

LIST OF EXPERIMENTS

1 Implementation of Line Drawing Algorithms

a) DDA b) Bresenham

2 Implementation of Bresenham‘s Circle Generation Algorithm

3 Implementation of Bresenham‘s Ellipse Generation Algorithm

4 Implementation of Two Dimensional Transformations

5 Implementation of Cohen-Sutherland Line Clipping Algorithm

6 Implementation of Sutherland-Hodgeman Polygon Clipping Algorithm

7 Implementation of 2D Window – to – Viewport Conversion

8 Implementation of 3D Transformations

9 Animation Using C Graphics

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

ELECTIVES

UIT12652/

UCS12651

C# AND .NET FRAMEWORK


3 0 0 3 AIM: To cover the fundamental concepts of the C# language and the .Net Framework.

OBJECTIVES:

To Understand the concept of .NET framework, study the different techniques of security,

introduce web services with ASP.NET, and explore window based applications.

UNIT I C# LANGUAGE BASICS 8

C# and the .NET framework- C# basics-Objects and types-Inheritance-Arrays-Operators and casts-

Indexes

UNIT II C# ADVANCE FEATURES 9 Delegates and Events-Strings and regular expressions-Generics- Collections-Memory management

and pointers-Errors and exceptions.

UNIT III BASE CLASS LIBRARIES AND DATA MANIPULATION 8

Tracing and events-Threading and synchronization-.NET security-Localization –Manipulating XML

–Managing the file System –Basic network programming.

UNIT IV DATA BASE WEB SERVICES 8 Window based applications-Data access with .NET-basic of ASP.NET-Introduction to web services.

UNIT V .NET FRAMEWORK 12 Architecture –Assemblies-Shared assembling –CLR hosting- App domains-Reflection

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Christian Nagel et.al. ―Professional C# 2005 with .NET 3.0‖, Wiley India, 2007.

REFERENCES: 1. Ian Gariffiths Mathew Adams, Jesse Liberty, ―Programming C# 4.0‖, O‘Reilly, Fourth Edition,

2010.

2. Andrew Troelson, ―Pro C# with .NET 3.0‖, Apress, 2007

3. Kevin Hoffman, ―Microsoft Visual C# 2005‖, Pearson Education, 2006. Thamarai Selvi, R.Murugesan, ‖A Text Book of C#‖, Pearson Education, 2003

MKCE-CSE[R2012]

UCS12652 EMBEDDED SYSTEMS L T P C

3 0 0 3 AIM:

To give sufficient background for undertaking embedded systems design.

OBJECTIVES:

To introduce students to the embedded systems, its hardware and software

To introduce devices and buses used for embedded networking.

To explain programming concepts and embedded programming in C.

To explain real time operating systems, inter-task communication.

UNIT I EMBEDDED COMPUTING 9

Challenges of Embedded Systems – Embedded system design process. Embedded processors – 8051 Microcontroller, ARM processor – Architecture, Instruction sets and programming.

UNIT II MEMORY AND INPUT / OUTPUT MANAGEMENT 9 Programming Input and Output – Memory system mechanisms – Memory and I/O devices and

interfacing – Interrupts handling.

UNIT III PROCESSES AND OPERATING SYSTEMS 9

Multiple tasks and processes – Context switching – Scheduling policies – Inter process communication mechanisms – Performance issues.

UNIT IV EMBEDDED SOFTWARE 9 Programming embedded systems in assembly and C – Meeting real time constraints – Multi-

state systems and function sequences. Embedded software development tools – Emulators and debuggers.

UNIT V EMBEDDED SYSTEM DEVELOPMENT 9 Design issues and techniques – Case studies – Complete design of example embedded systems.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Wayne Wolf, ―Computers as Components: Principles of Embedded Computer

System Design‖, Elsevier, 2006.

2. Michael J. Pont, ―Embedded C‖, Pearson Education, 2007

REFERENCES: 1. Steve Heath, ―Embedded System Design‖, Elsevier, 2005.

2. Muhammed Ali Mazidi, Janice Gillispie Mazidi and Rolin D. McKinlay, ―The 8051 Microcontroller and Embedded Systems‖, Pearson Education, Second edition, 2007.

MKCE-CSE[R2012]

UCS12653 MIDDLEWARE TECHNOLOGY

L T P C

3 0 0 3 AIM:

The aim of the course is to teach the role of middleware in the distributed Environment and its common services.

OBJECTIVES:

. To understand how middleware facilitates the development of distributed

applications in heterogeneous environments.

To study how it helps to incorporate application portability, distributed application

component interoperability and integration

To learn the object oriented middleware basics through the example of the following

CORBA objects.

To understand the basics of Web services that is the most often used middleware

technique.

UNIT I CLIENT / SERVER CONCEPTS 9 Client-Server − File server − Database server − Group server − Object server − Web server − Middleware − General middleware − Service specific middleware − Client / server building blocks

−RPC − Messaging − Peer-to-Peer.

UNIT II EJB ARCHITECTURE 9 EJB − EJB architecture − Overview of EJB software architecture − View of EJB − Conversation −Building and deploying EJBs − Roles in EJB.

UNIT III EJB APPLICATIONS 9

EJB session beans − EJB entity beans − EJB clients − EJB deployment − Building an application with EJB.

UNIT IV CORBA 9 CORBA − Distributed systems − Purpose − Exploring CORBA alternatives − Architecture

overview − CORBA and networking model − CORBA object model − IDL − ORB − Building an application with CORBA.

UNIT V COM 9 COM − Data types − Interfaces − Proxy and stub − Marshalling − Implementing server/client −

Interface pointers − Object creation − Invocation − Destruction − Comparison COM and CORBA − Introduction to .NET − Overview of .NET architecture − Marshalling − Remoting.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Robert Orfali, Dan Harkey and Jeri Edwards, ―The Essential Client / Server Survival Guide‖, Galgotia Publications Pvt. Ltd., 2002.

2. Tom Valesky, ―Enterprise Java Beans‖, Pearson Education, 2002.

MKCE-CSE[R2012]

REFERENCES: 1. Mowbray, ―Inside CORBA‖, Pearson Education, 2002.

2. Jeremy Rosenberger, ―Teach Yourself CORBA in 14 days‖, TEC Media, 2000.`

3. Jason Pritchard, ―COM and CORBA Side by Side‖, Addison Wesley, 2000.

4. Jesse Liberty, ―Programming C#‖, 2nd Edition, O‘Reilly Press, 2002.

MKCE-CSE[R2012]

UCS12654 OPTICAL AND ACCESS NETWORKS L T P C

3 0 0 3 AIM:

To provide the students with the in-depth knowledge in design principles and implementation issues of Optical Communication Networking.

OBJECTIVES:

To study and understand about the different optical system components.

To get acquainted with different types of optical network architectures and their applications.

To study about different wavelength routing network.

To learn about designing of optical communication networks and managing them.

o .

UNIT I INTRODUCTION TO OPTICAL NETWORKS 9 Introduction: Optical Networks, Optical Layers, Transmission Basics, System and network

Evolution – Light Propagation in Optical Fibers: Loss and Bandwidth, Non Linear Effects, Solutions – Optical Network Components: Couplers, Isolators & Circulators, Multiplexers & Filters,

Optical Amplifiers, Transmitters, Detectors, Switches, Wavelength Converters. UNIT II OPTICAL NETWORK ARCHITECTURES 9

First Generation Networks: SONET / SDH, Optical Transport Network, Metropolitan Area Networks, Layered Architecture - Broadcast and Select Networks: Topologies, Media-Access

Control Protocols, Test beds - WDM and DWDM Systems. UNIT III WAVELENGTH ROUTING NETWORKS 9

Wavelength Routing Networks: The Optical Layer, Node Designs, Network Design and Operation, Optical Layer Cost Tradeoff, Routing and Wavelength Assignment, Wavelength Routing

Testbeds, Architectural Variations - Virtual Topology Design: Virtual topology design problem, Combined SONET/WDM Network Design, An ILP Formulation, Regular Virtual Topologies.

UNIT IV ACCESS NETWORKS 9 Access Networks: Network Architecture Overview, Present and Future Access Networks, HFC,

FTTC - Photonic Packet Switching: OTDM, Multiplexing and Demultiplexing, Synchronization, Buffering, Testbeds, Broadcast OTDM networks - Optical Access Networks Deployment Considerations.

UNIT V NETWORK DESIGN AND MANAGEMENT 9

Transmission System Engineering: System model, Power Penalty, Transmitter and Receiver, Optical Amplifiers, Crosstalk, Dispersion; Wavelength Stabilization - Overall Design Considerations - Network Management: Network Management Functions, Configuration

Management, Performance and Fault Management, Optical Safety and Service Interface.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Rajiv Ramaswami and Kumar N. Sivarajan, ―Optical Networks: A Practical Perspective‖, Morgan Kaufmann Third Edition 2010.

MKCE-CSE[R2012]

REFERENCES: 1. C. Siva Ram Moorthy and Mohan Gurusamy, ―WDM Optical Networks: Concept, Design and

Algorithms‖, Prentice Hall of India, Ist Edition, 2002.

2. P.E. Green, Jr., ―Fiber Optic Networks‖, Prentice Hall, NJ, 1993.

3. Biswanath Mukherjee, ―Optical WDM Networks‖, Springer Series, 2006.

MKCE-CSE[R2012]

UIT12656/

UCS12655

PERVASIVE COMPUTING (Common to CSE & IT)

L T P C

3 0 0 3

AIM: The course introduces the students to the basic principles of pervasive computing.

OBJECTIVES:

To be aware of the concepts of pervasive computing

To have an exposure of pervasive computing and web based applications

To have an understanding of the middleware ,PDA, user interface in pervasive computing

UNIT I PERVASIVE COMPUTING APPLICATION 9

Pervasive Computing devices and Interfaces – Device technology trends, pervasive computing principles Pervasive computing infrastructure-applications- Device Technology - Hardware, Human-machine Interfaces, Biometrics, and Operating systems– Device Connectivity – Protocols,

Security, and Device Management- Pervasive Web Application architecture

UNIT II PERVASIVE COMPUTING AND WEB BASED APPLICATIONS 9 XML and its role in Pervasive Computing - Wireless Application Protocol (WAP) Architecture and Security – Wireless Mark-Up language (WML) –Introduction

UNIT III MIDDLEWARE COMPONENTS 9

Programming consumer devices, Smart card programming, messaging components, Database components

UNIT IV PDA IN PERVASIVE COMPUTING 9 Introduction - PDA software Components, Standards, emerging trends – PDA Device characteristics

- PDA Based Access Architecture

UNIT V USER INTERFACE ISSUES IN PERVASIVE COMPUTING 9 Architecture - Smart Card- based Authentication Mechanisms – Wearable computing Architecture

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Jochen Burkhardt, Horst Henn, Stefan Hepper, Thomas Schaec, Klaus Rindtorff, "Pervasive

Computing Technology and Architecture of Mobile Internet Applications", Addison Wesley, New Delhi, 2002.

REFERENCES:

1. Uwe Hansman, Lothat Merk, Martin S Nicklous, Thomas Stober, "Principles of Mobile Computing", Springer- Verlag, New Delhi, 2003

MKCE-CSE[R2012]

UIT12657/

UCS12656

UNIX INTERNALS


3 0 0 3 AIM:

To understand the kernel, I/O and files, process control, scheduling an memory management policies in unix. OBJECTIVES:

To get through understanding of the kernel

To understand the file organization and management.

To know the various system calls

To have knowledge of process architecture, process control & scheduling and memory

management..

UNIT I INTRODUCTION 9

Unix Operating system – Unix Commands – Vi – Editors – Shell Programming. Introduction to the Kernel-Architecture - System Concepts-Data Structures- System Administration.

UNIT II THE BUFFER CACHE 9 The Buffer Cache-Headers-Buffer Pool-Buffer Retrieval-Reading and Writing Disk Blocks -

Advantages and Disadvantages. Internal Representation of Files - Inodes- Structure-Directories-Path Name to Inode - Super Block - Inode Assignment-Allocation of Disk Blocks - Other File

Types. UNIT III SYSTEM CALLS FOR FILE SYSTEM 9

System Calls for the File System- Open - Read - Write - Lseek-Close-Create-Special files Creation - Change Directory and Change Root-Change Owner and Change Mode-Stat-

Fstat - Pipes - Dup-Mount – Unmount – Link – Unlink – File System Abstraction - Maintenance UNIT IV STRUCTURE OF PROCESSES 9

The System Representation of Processes – States - Transitions-System Memory - Context of a Process - Saving the Context - Manipulation of a Process Address Space - Sleep

Process Control-signals - Process Termination – Awaiting - Invoking other Programs - The Shell - System Boot and the INITProcess

UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT

TECHNIQUES

9

Memory Management Policies-Swapping-Demand Paging - a Hybrid System - I/O Subsystem - Driver Interfaces - Disk Drivers - Terminal Drivers.


1. Maurice J. Bach, "The Design of the Unix Operating System", Pearson Education, 2002.

REFERENCES:

1. Uresh Vahalia, "UNIX Internals: The New Frontiers", Prentice Hall, 2000.

2. John Lion, "Lion's Commentary on UNIX", 6th edition, Peer-to-Peer Communications, 2004.

3. Daniel P. Bovet & Marco Cesati, ―Understanding the Linux Kernel‖, O‘REILLY, Shroff

Publishers &Distributors Pvt. Ltd, 2000.

4. M. Beck et al, ―Linux Kernel Programming‖, Pearson Education Asia, 2002

MKCE-CSE[R2012]

UBA12653 TOTAL QUALITY MANAGEMENT


3 0 0 3 AIM:

This course will provide the student with the underlying principles and techniques of Total Quality Management (TQM) with emphasis on their application to technical organizations.

OBJECTIVES:

To help students to develop a working knowledge of the best practices in Quality and

Process Management.

To impart knowledge on the quality management process and key quality management

activities.

UNIT I INTRODUCTION TO QUALITY MANAGEMENT 9

Basic concepts of TQM -Definition of TQM – TQM Framework- reasons for adopting TQM. Benefits, Quality-vision, mission and policy statements. , Historical Review, Principles of TQM, Barriers to TQM implementation-Dimensions of product and services, cost of quality

UNIT II TQM PRINCIPLES AND PHILOSOPHIES 10

Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality, Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition and Reward, Performance Appraisal, Benefits, Continuous Process Improvement. PDCA cycle, 5S,

Kaizen - JIT, POKAYOKE -The Contributions of Deming, Juran Crosby.

UNIT III STATISTICAL PROCESS CONTROL (SPC) 9 The seven tools of quality- Overview of statistical process control -New seven management tools- Process capability-meaning, significance and measurement – Six-sigma: Concepts, methodology,

applications to manufacturing, service sector including IT industries.

UNIT IV TQM TOOLS AND TECHNIQUES 8 Bench marking –Reason to bench mark, bench mark process –FEMA –Stages ,types ,Business process re-engineering(BPR)-Principles, applications and process. Total Productivity Maintenance

TPM)

UNIT V QUALITY SYSTEMS 9 Need for ISO 9000 and Other quality Systems, ISO 9000-2000 Quality Systems - Elements, ISO documentation procedures ,Quality Auditing, Introduction to ISO 14000 concepts, Requirements

and benefits and OSHAS 18000,Implementationof TQM

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Dale H.Besterfiled, et al., Total Quality Management, Pearson Education, Inc. 2003. (Indian

reprint 2004). ISBN 81-297-0260-6.

2. Shridhara Bhatk 1st Edition 2002, Total Quality Management, Himalaya Publications.

REFERENCES:

1. James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th Edition),

South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).

MKCE-CSE[R2012]

2. Feigenbaum.A.V. ―Total Quality Management, McGraw Hill, 1991.

3. Oakland.J.S. ―Total Quality Management Butterworth – Hcinemann Ltd., Oxford. 1989.

4. Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age

International 1996.

5. Zeiri. ―Total Quality Management for Engineers Wood Head Publishers, 1991.

6. V.Jayakumar,Total quality management,1st Edition 2005,Lakshmi Publications

MKCE-CSE[R2012]

UMA11651 TRANSFORMS AND PARTIAL DIFFERENTIAL

EQUATIONS

L T P C

3 0 0 3 AIM:

This course will provide the student with the skills in areas of Transforms and Partial Differential Equations. T h i s c o u r s e w i l l he lp i n t he ir s tudies r e la t e d t o large number of engineering subjects like heat conduction, communication systems, electro-optics and

electromagnetic theory.

OBJECTIVES:

. The course objective is to develop the skills of the students in the areas of Transforms and Partial Differential Equations. This will be necessary for their effective studies in a

large number of engineering subjects like heat conduction, communication systems, electro-optics and electromagnetic theory. The course will also serve as a prerequisite for post

graduate and specialized studies and research.

UNIT I FOURIER SERIES 9+3

Dirichlet‘s conditions – General Fourier series – Odd and even functions – Half range sine series – Half range cosine series – Complex form of Fourier Series – Parseval‘s identify –

Harmonic Analysis.

UNIT II FOURIER TRANSFORMS 9+3 Fourier integral theorem (without proof) – Fourier transform pair – Sine and Cosine transforms – Properties – Transforms of simple functions – Convolution theorem – Parseval‘s

identity.

UNIT III PARTIAL DIFFERENTIAL EQUATIONS 9+3 Formation of partial differential equations – Lagrange‘s linear equation – Solutions of standard types of first order partial differential equations - Linear partial differential equations of

second and higher order with constant coefficients. UNIT IV APPLICATIONS OF PARTIAL DIFFERENTIAL EQUATIONS 9+3

Solutions of one dimensional wave equation – One dimensional equation of heat conduction – Steady state solution of two-dimensional equation of heat conduction (Insulated edges excluded) – Fourier series solutions in Cartesian coordinates.

UNIT V Z -TRANSFORMS AND DIFFERENCE EQUATIONS 9+3 Z-transforms - Elementary properties – Inverse Z-transform – Convolution theorem - Formation of

difference equations – Solution of difference equations using Z-transform.

TOTAL : 45 PERIODS TEXTBOOKS: 1.

Grewal, B.S, ‗Higher Engineering Mathematics‘ 40th Edition, Khanna publishers, Delhi,

(2007)

REFERENCES:

1. Bali.N.P and Manish Goyal ‗A Textbook of Engineering Mathematics‘, Seventh Edition, Laxmi Publications(P) Ltd. (2007)

2. Ramana.B.V. ‗Higher Engineering Mathematics‘ Tata Mc-GrawHill Publishing Company limited, New Delhi (2007).

3. Glyn James, ‗Advanced Modern Engineering Mathematics‘, Third edition-Pearson Education (2007).

4. Erwin Kreyszig ‘Advanced Engineering Mathematics‘, Eighth edition-Wiley India (2007).

MKCE-CSE[R2012]

UCS12657 MOBILITY AND BIG-DATA

(Recommended by TCS) L T P C

3 0 0 3 AIM:

To develop android mobile application and to explore Big Data concepts, Selecting Big Data stores, Processing Big Data, Handling streaming data, Tools and Techniques to Ana lyze Big Data, apply these concepts using an industry standard non-relational database environment.

OBJECTIVES:

. Integrating key Big Data components to create a Big Data platform

Loading unstructured data into Hadoop Distributed File System

Querying Hadoop MapReduce jobs using Hive

Simplifying Big Data processing and communicating with Pig Latin

UNIT I MOBILE APPLICATION DEVELOPMENT 9 Introduction to Android – An open platform for mobile development – Android project frame work – Android AVD – Android Activities & UI Design - Intents and Permission, Activity Class, Lifecycle of the Activity class, Fragments – UI Layouts – XML Introduction GUI Objects. Hands-on (small activities) – Mobile app development

UNIT II BIG-DATA & HADOOP ECOSYSTEM 9 Introduction to Big-data- Challenges for processing Big data- Hadoop Ecosystem -Hadoop Execution Environment , Hadoop Distributed File System (HDFS) -HDFS Architecture and Configuration – Data Storage in HDFS - HDFS Access, Commands, APIs, and Applications. Hands-on (small activities)-HDFS UNIT III MAPREDUCE FRAMEWORK AND PIG 9 MapReduce (MR) Framework – Architecture – how map reduce works – Mapper, Reducer, Partitioner, Counter – MapReduce Programming model - Introduction to Apache Pig – Basic Latin commands-Keywords, Data types, Operators, UDF statements, Load/Store Functions. Hands-on : MapReduce Programming, Pig commands

UNIT IV DAT A WA REH OUS E AND DAT AB ASE OF HAD OOP 9 Introduction to Apache HIVE – HIVE architecture – Managing Tables – Datatypes and Schemas, Partitions and buckets - Introduction to NoSql Databases -Introduction to Apache HBASE – Architecture – HMaster and region server, Column Families and Region – Basic HBase commands - Introduction to MongoDB - CRUD and the MongoDB shell. Hands-on :Hive Commands

UNIT V ADVANCED BIG-DATA TECHNOLOGIES 9 Introduction to Kafka - Introduction to Spark – Spark Ecosystem - Spark-streaming - Resilient Distributed Datasets and Transformations – Introduction to IoT - Combination of IoT and BigData tools to solve problems. Hands-on –Spark in Scala Programming language.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Professional Android 2 Application Development 2nd Edition by Reto Meier.

2. Tom White, ―Hadoop The Definitive Guide‖, First Edition. O‘Reilly, 2009.

MKCE-CSE[R2012]

REFERENCES: 1. Bill Franks, Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data

Streams with advanced analytics, John Wiley & sons, 2012.

2. Glenn J. Myatt, Making Sense of Data, John Wiley & Sons, 2007 Pete Warden, Big Data Glossary, O‘Reilly, 2011.

3. Learning Spark: Lightning-Fast Big Data Analysis Kindle Edition by Holden Karau , Andy Konwinski , Patrick Wendell , Matei Zaharia.

MKCE-CSE[R2012]

SEMESTER - VII

UIT12701 /

UCS12701

CRYPTOGRAPHY AND NETWORK SECURITY

(Common to IT & CSE) L T P C

3 1 0 4 AIM: To learn about wired and wireless network security with various cryptographic techniques,

which include private and public key algorithms along with attacks types.

OBJECTIVES:

Understand OSI security architecture and classical encryption techniques.

Acquire fundamental knowledge on the concepts of finite fields and number theory.

Understand various block cipher and stream cipher models.

Describe the principles of public key cryptosystems, hash functions and digital signature.

UNIT I INTRODUCTION & NUMBER THEORY 9 Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical

Encryption techniques (Symmetric cipher model, substitution techniques, transposition techniques, Stenography).Finite Fields And Number Theory: Groups, Rings, Fields-Modular arithmetic-Euclid‘s

algorithm-Finite fields- Polynomial Arithmetic –Prime numbers-Fermat‘s and Euler‘s theorem-Testing for primarily -The Chinese remainder theorem- Discrete logarithms.

UNIT II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY 9 Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced

Encryption Standard (AES)-Triple DES-Blowfish-RC5 algorithm. Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-Key management - Diffie Hellman Key exchange-Elliptic curve arithmetic-Elliptic curve cryptography.

UNIT III HASH FUNCTIONS AND DIGITAL SIGNATURES 9

Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication protocols – DSS – EI Gamal – Schnorr.

UNIT IV SECURITY PRACTICE & SYSTEM SECURITY 9

Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-Commerce Transactions. Intruder – Intrusion detection system – Virus and

related threats – Countermeasures – Firewalls design principles – Trusted systems – Practical implementation of cryptography and security.

UNIT V E-MAIL, IP & WEB SECURITY 9 E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys

privacy-authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME. IPSecurity: Overview of IPSec - IP and IPv6-Authentication Header-Encapsulation

Security Payload (ESP)-Internet Key Exchange (Phases of IKE, ISAKMP/IKE Encoding). Web Security: SSL/TLS Basic Protocol-computing the keys- client authentication-PKI as deployed by SSL Attacks fixed in v3- Exportability-Encoding-Secure Electronic Transaction (SET).

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS:

1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March

2013.

2. Charlie Kaufman, Radia Perlman and Mike Speciner, ―Network Security”, Prentice Hall of

India, 2002.

REFERENCES: 1 Behrouz A. Ferouzan, ―Cryptography & Network Security‖, Tata Mc Graw Hill, 2007.

2 Man Young Rhee, ―Internet Security: Cryptographic Principles‖, ―Algorithms and Protocols‖,

Wiley Publications, 2003.

3 Charles Pfleeger, ―Security in Computing‖, 4th Edition, Prentice Hall of India, 2006.

4 Ulysess Black, ―Internet Security Protocols‖, Pearson Education Asia, 2000.

5 Charlie Kaufman and Radia Perlman, Mike Speciner, ―Network Security, Second Edition,

Private Communication in Public World‖, PHI 2002.

6 Bruce Schneier and Neils Ferguson, ―Practical Cryptography‖, First Edition, Wiley Dreamtech

India Pvt Ltd, 2003.

7 Douglas R Simson ―Cryptography – Theory and practice‖, First Edition, CRC Press, 1995.

8 http://nptel.ac.in/.

MKCE-CSE[R2012]

UIT12702/

UCS12702

MULTIMEDIA SYSTEMS


L T P C

3 0 0 3 AIM:

To explore the range of technologies that shape this world, investigate the next generation of devices and interfaces, and explore how these might shape the applications and entertainment of the future.

OBJECTIVES:

To develop, design and implement two and three dimensional graphical structures

To enable students to acquire knowledge on Multimedia compression and animations

To learn Creation, Management and Transmission of Multimedia objects

UNIT I INTRODUCTION AND QOS 9

QOS Requirements and Constraints - Concepts – Resources - Establishment Phase – Run -Time Phase - Management Architectures

UNIT II OPERATING SYSTEMS 9 Real-Time Processing – Scheduling – Inter process Communication-Memory and Management –

Server Architecture - Disk Management. UNIT III FILE SYSTEMS AND NETWORKS 9

Traditional and Multimedia File Systems-Caching Policy-Batching-Piggybacking-Ethernet-Gigabit Ethernet-Token Ring-100VG Any LAN-Fiber Distributed Data Interface (FDDI)- ATM Networks-

MANWAN. UNIT IV COMMUNICATION 9

Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported Cooperative Work-Architecture-Session Management-MBone Applications.

UNIT V SYNCHRONIZATION 9 Synchronization in Multimedia Systems – Presentation - Synchronization Types - Multimedia

Synchronization Methods - Case Studies - MHEG-MODE-ACME.

TOTAL : 45 PERIODS REFERENCES:

1 Ralf Steinmetz and Klara Nahrstedt, ―Multimedia Systems‖, Springer, I Edition 2004.

2 Ralf Steinmetz and Klara Nahrstedt , Media Coding and Content Processing, Prentice hall,2002

3 Vaughan T, Multimedia, Tata McGraw Hill, 1999.

4 Mark J.B., Sandra K.M., Multimedia Applications Development using DVI technology,

McGraw Hill, 1992.

5 K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovacovic, D. A. Milovacovic , Multimedia

6 Communication Systems: Techniques, Standards, and Networks, Prentice Hall, 1st Edition,2002

7 Ze-Nian Li and Mark S. Drew, Fundamentals of Multimedia, Pearson, 2004.

MKCE-CSE[R2012]

UBA12754/

UBA12703

PRINCIPLES OF MANAGEMENT


3 0 0 3 AIM:

To learn the different principles and techniques of management in planning, organizing, directing and controlling.

OBJECTIVES:

To study the evolution of Management

To study the functions and principles of Management

To learn the application of the principles in an organization

UNIT I INTRODUCTION TO MANAGEMENT AND ORGANIZATIONS 9

Definition of Management – Science or Art – Manager Vs Entrepreneur – types of managers – managerial roles and skills – Evolution of Management – Scientific Management – Types of Business organization –Public and Private sector enterprises – Organization culture and

Environment – Current trends and issues in Management.

UNIT II PLANNING 9 Nature and purpose of planning – planning process – types of planning – objectives – setting

objectives – policies – Planning premises – Mission & Vision Statement –Strategic Management – Planning Tools and Techniques – Decision making steps and process

UNIT III ORGANISING & STAFFING 9

Nature and purpose – Formal and informal organization – organization chart – organization structure – types –– Job Design – Human Resource Management – HR Planning, Recruitment,& E-

Recruitment and Selection, Training and Development, Performance Management, Career planning and management.

UNIT IV DIRECTING 9

Foundations of individual and group behavior – motivation theories – motivational techniques – job satisfaction – job enrichment – leadership – types and theories of leadership – communication –

process of communication – barrier in communication – effective communication – communication and IT.

UNIT V CONTROLLING 9 System and process of controlling – budgetary and non-budgetary control techniques – use of

computers and IT in Management control – Productivity problems and management – control and performance – direct and preventive control - reporting

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Harold Koontz & Heinz Weihrich ―Essentials of management‖ Tata McGraw Hill, 1998.

REFERENCES: 1 Stephen P.Robbins & Mary Coulter, ―Management‖, Prentice Hall (India) Pvt.Ltd. 10 th Edition,

2009.

2 JAF Stoner, Freeman R.E and Daniel R Gilbert ―Management‖, Pearson Education, 6 th Edition,

2004.

3 Stephen A.Robbins & David A. Decenzo & Mary Coulter, ―Fundamentals of Management‖ Pearson Education, 7th Edition, 2011

4 Robert Kreitner & Mamata Mohapatra, ―Management‖, Biztantra, 2008.

5 Tripathy PC & Reddy PN, ―Principles of Management‖, Tata McGraw Hill, 1999.

MKCE-CSE[R2012]

UIT12704P/

UCS12706P MOBILE COMPUTING LABORATORY


T

P

C

0 0 3 2 AIM

To make the students to be familiar with the basic concepts of Mobile Communication and Mobile devices.

OBJECTIVES

To know the components and structure of mobile application development frameworks

for Android and Windows OD based mobiles

To understand how to work with various mobile application development frameworks

To learn the basic and important design concepts and issues in development of mobile

applications

To understand the capabilities and limitations of mobile devices

LIST OF EXPERIMENTS

1 Develop an application that uses GUI components, Font and Colors

2 Develop an application that uses Layout Managers and event listeners.

3 Develop a native calculator application.

4 Write an application that draws basic graphical primitives on the screen.

5 Develop an application that makes use of database.

6 Develop an application that makes use of RSS Feed.

7 Implement an application that implements Multi threading

8 Develop a native application that uses GPS location information.

9 Implement an application that writes data to the SD card.

10 Implement an application that creates an alert upon receiving a message.

11 Write a mobile application that creates alarm clock

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

UIT12705P/

UCS12707P MULTIMEDIA SYSTEMS LABORATORY


T

P

C

0 0 3 2 AIM:

To acquire knowledge on multimedia concepts using various tools in Adobe Photoshop and Macromedia Flash.

OBJECTIVES:

To apply and display the transformations in the output for various multimedia concepts

To gain knowledge on the resources and tools of Photoshop and flash

To have hands on training in various tools in Adobe Photoshop and Flash

To emphasize on the practical issues in designing using multimedia concepts

LIST OF EXPERIMENTS

PHOTOSHOP

1 Perform Copy, Cut, Paste, Move functions using Selection tools.

2 Perform Copy, Paste Into, Move Tool, Zoom Tool, Transform, Opacity using Lasso-

and Polygonal Lasso Selection Tools. 3 Refine the picture and perform Invert selection using Quick Select Tool (or Magic

Wand Tool).

4 Format several layers of a picture using Paint Bucket Tool, Color Picker, Brush Tool

5 Use Layers and Eraser Tool in a picture.

6 Use Text Tool to add text to the speech bubbles and Use the Transform function and the

Move Tool in cartoons. 7 Perform selection type and color balance using selection tools on a picture.

8 Use crop and canvas tool in a picture.

9 Use Clone stamp tool and smudge tool in a picture.

10 Use filters in a picture.

FLASH

11 Perform motion tweening

12 Create a 24 spokes on a wheel

13 Change and shape an object using a shape tweening concept

14 Working on layers

15 Masking layers

TOTAL: 45 PERIODS

MKCE-CSE[R2012]

ELECTIVES

UIT12751/

UCS12751

ADHOC NETWORKS


3 0 0 3 AIM: To introduce students to the theory, architecture, protoco ls and techniques in wireless and

mobile networks

OBJECTIVES:

To introduce students to the mathematical models and network protocol designs in

wireless networks

To provide a systematic exposition of network protocols and their cross – layer

interactions

To provide a broad perspective on the active research areas in wireless adhoc networks


Introduction-Fundamentals of Wireless Communication Technology - The Electromagnetic Spectrum - Radio Propagation Mechanisms - Characteristics of the Wireless Channel - IEEE

802.11 Standard – Origin Of Ad hoc: Packet Radio Networks - Technical Challenges - Architecture of PRNETs - Components of Packet Radios – Ad hoc Wireless Networks -What is an Ad Hoc

Network. Heterogeneity in Mobile Devices - Wireless Sensor Networks - Traffic Profiles - Types of Ad hoc Mobile Communications - Types of Mobile Host Movements - Challenges Facing Ad Hoc Mobile Networks

UNIT II AD HOC ROUTING PROTOCOLS 9 Introduction - Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks -

Classifications of Routing Protocols -Table-Driven Routing Protocols - Destination Sequenced Distance Vector (DSDV) - Wireless Routing Protocol (WRP) - Cluster Switch Gateway Routing (CSGR) - On- Demand Approaches - Ad Hoc On-Demand Distance Vector Routing (AODV) -

Dynamic Source Routing (DSR) -Temporally Ordered Routing Algorithm (TORA) – Hybrid Routing - Zone Routing Protocol (ZRP)

UNIT III TRANSPORT LAYER AND SECURITY PROTOCOLS 9 Introduction - Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks –

Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks -Classification of Transport Layer Solutions - TCP Over Ad Hoc Wireless Networks - Security in Ad Hoc Wireless

Networks - Network Security Requirements - Issues and Challenges in Security Provisioning - Network Security Attacks - Key Management - Secure Routing in Ad Hoc Wireless Networks – Security-Aware Ad Hoc routing protocol – Security-Aware AODV

UNIT IV QUALITY OF SERVICE 9

Introduction - Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks -Classifications of QoS Solutions - MAC Layer Solutions - Network Layer Solutions - QoS Frameworks for Ad Hoc Wireless Networks

UNIT V ENERGY MANAGEMENT 9

Introduction - Need for Energy Management in Ad Hoc Wireless Networks - Classification of Energy Management Schemes – Battery Management Schemes - Transmission Power Management Schemes - System Power Management Schemes

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS: 1. C.Siva Ram Murthy and B.S. Manoj ―Ad Hoc Wireless Networks: Architectures and

Protocols‖, Prentice Hall PTR, 2012.

REFERENCES:

1 Feng ZHAO and Leonidas GUIBAS, Wireless Sensor Networks: An Information Processing

Approach, Morgan Kaufman Publishers, 2012.

2 C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR 2008.

3 Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2008.

MKCE-CSE[R2012]

UIT12852 /

UCS12752

BIO INFORMATICS


3 0 0 3 AIM:

To provide an in-depth knowledge in the field of Bioinformatics OBJECTIVES:

To get exposed to the domain of bioinformatics

To understand the role of data warehousing and data mining for bioinformatics

To learn to model bioinformatics based applications

To understand how to deploy the pattern matching and visualization techniques in

bioinformatics

To study the Microarray technologies for genome expression


Introduction-Historical Overview and Definition- Bioinformatics Applications-Major Databases in Bioinformatics- Data Management and Analysis- Molecular Biology and Bioinformatics- Central Dogma of Molecular Biology

UNIT II DATABASES 9

Introduction- Characteristics of Bioinformatics Databases- Categories of Bioinformatics Databases- Navigating databases- Sequence Databases- Nucleotide sequence database- secondary Nucleotide sequence database –protein sequence databases- structure databases- Structure file formats- Protein

Structure Database Collaboration- PDB- CATH –SCOP- Other databases- Enzyme Databases- MEROPS- Pathway Databases:CAZy

UNIT III TOOLS 9 Introduction- Need for Tools- Knowledge Discovery- Data- Mining Tools- Data Submission tools-

Nucleotide Sequence Submission and Protein Submission tools- Data Analysis tools- Prediction Tools- Phylogenetic trees and Phylogenetic Analysis- Modeling Tools

UNIT IV ALGORITHMS 9 Introduction- Classification of Algorithms- Biological Algorithms- Implementing Algorithms-

Biological Algorithms- Bioinformatics Tasks and Corresponding Algorithms- Data Analysis Algorithms- Sequence Comparison Algorithms – Substitution Matrices Algorithms –Sequence

Alignment Optimal Algorithms Prediction Algorithms- Phylogenetic prediction Algorithm – Protein Structure Prediction

UNIT V GENOME ANALYSIS AND SEQUENCE ALIGNMENT 9 Introduction- Genome Analysis- Genome mapping- The Sequence Assembly Problem- Genome

Sequencing- Biological Motivation of Alignment Problems- Methods of Sequence Alignments- Using Scoring matrices- Measuring Sequence Detection Efficiency- Working with FASTA and BLAST

TOTAL : 45 PERIODS

TEXTBOOKS: 1. OrpitaBosu, Simminder KaurThukral , ―Bioinformatics: Database, Tools, Algorithms‖, Oxford

University Press, Chennai, 2007.

2. Rastogi S. C., NamitaMendiratta, Parag Rastogi, ―Bioinformatics: Methods and Applications:

Genomics, Proteomics and Drug Discovery‖, Third Edition, PHI Learning Pvt. Ltd., New Delhi, 2011.

MKCE-CSE[R2012]

REFERENCES: 1 Bryan Bergeron, ―Bioinformatics computing‖, PHI Learning Pvt. Ltd, New Delhi, 2010.

2 Rastogi S.C., NamitaMendiratta, Parag Rastogi, ―Bioinformatics: Concepts‖,Skills &

Applications, Second Edition, CBS Publishers & Distributors Pvt. Ltd,2009

3 Arthur M. Lesk, ―Introduction to Bioinformatics‖, Third Edition, Oxford University Press,

Chennai, 2010

4 Gautham N., ―Bioinformatics:Databases and Algorithms‖, alpha Science 2006

MKCE-CSE[R2012]

UIT12653/

UCS12754

CYBER FORENSICS

(Common to CSE and IT)

L T P C

3 0 0 3

AIM:

To study different types of Cyber forensic technologies a nd enable the student to have a foundation in this emerging area.

OBJECTIVES:

To study the fundamentals of computer forensics

To have an overview of techniques for Data Recovery and Evidence Collection

To study various threats associated with security and in fo rmation warfare

To study the tools and tactics associated with cyber forensics

UNIT I NETWORK LAYER SECURITY &TRANSPORT LAYER SECURITY 9 IPSec Protocol - IP Authentication Header - IP ESP - Key Management Protocol for IPSec

.Transport layer Security: SSL protocol, Cryptographic Computations – TLS Protocol. UNIT II E-MAIL SECURITY & FIREWALLS 9

PGP - S/MIME - Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-Commerce Transactions.

UNIT III INTRODUCTION TO COMPUTER FORENSICS 9 Introduction to Traditional Computer Crime, Traditional problems associated with Computer Crime.

Introduction to Identity Theft & Identity Fraud. Types of CF techniques - Incident and incident response methodology - Forensic duplication and investigation. Preparation for IR: Creating response tool kit and IR team. - Forensics Technology and Systems - Understanding Computer

Investigation – Data Acquisition.

UNIT IV EVIDENCE COLLECTION AND FORENSICS TOOLS 9 Processing Crime and Incident Scenes – Working with Windows and DOS Systems. Current Computer Forensics Tools: Software/ Hardware Tools.

UNIT V ANALYSIS AND VALIDATION 9

Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition – Network Forensics – Email Investigations – Cell Phone and Mobile Devices Forensics


1. . Man Young Rhee, ―Internet Security: Cryptographic Principles‖, ―Algorithms and Protocols‖, Wiley Publications, 2003.

2. Nelson, Phillips, Enfinger, Steuart, ―Computer Forensics and Investigations‖, Cengage Learning,India Edition, 2008.

REFERENCES: 1 John R.Vacca, ―Computer Forensics‖, Cengage Learning, 2005

2 Richard E.Smith, ―Internet Cryptography‖, 3rd Edition Pearson Education, 2008

3 Marjie T.Britz, ―Computer Forensics and Cyber Crime‖: An Introduction‖, 3rd Edition, Prentice Hall, 2013.

MKCE-CSE[R2012]

UIT12754/

UCS12755

GRID COMPUTING


3 0 0 3 AIM:

The aim is to introduce the basics of grid computing and to enable designing of efficient grid services infrastructure.

OBJECTIVES:

To introduce the basic concepts of grid computing

To introduce the tools used for designing grid computing infrastructure

To understand the advantages and limitations of distributed grid computing

UNIT I INTRODUCTION AND OVERVIEW OF GRID COMPUTING 9

Early Grid Activities-Current Grid Activities-An Overview of Grid Business Areas-Grid Applications-Grid Infrastructure

UNIT II WEB SERVICES AND RELATED TECHNOLOGIES 9

Service – Oriented Architecture-Web Service Architecture-XML, Related Technologies, and Their Relevance to Web services-XML Messages and Enveloping-Service Message Description Mechanisms-Relationship between Web Service and Grid Service – Web Service Interoperability

and the Role of the WS-I Organization

UNIT III DISTRIBUTED OBJECT TECHNOLOGY FOR GRID COMPUTING 9 Introduction to Open Grid Services Architecture (OGSA) - Commercial Data Center- National Fusion Collaborator- The OGSA Platform Components

UNIT IV OPEN GRID SERVICES INFRASTRUCTURE (OGSI 9

Introduction-Grid Services-A High-Level Introduction to OGSI – Introduction to Service Data Concepts - Grid Service: Naming and Change Management Recommendations.

UNIT V OGSA BASIC SERVICES AND THE GRID COMPUTING TOOLKITS 9 Common Management Model (CMM)-Security Architecture- GLOBUS GT3 Toolkit: Architecture

GLOBUSGT3 Toolkit: - Architecture, Programming model, High level services.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Joshy Joseph & Craig Fellenstein, ―Grid Computing‖, Pearson/PHI PTR-2003.

REFERENCES:

1 Ahmar Abbas, ―Grid Computing: A Practical Guide to technology and Applications‖, Charles Rivermedia – 2003.

MKCE-CSE[R2012]

UIT12758/

UCS12756

NEURAL NETWORKS


3 0 0 3 AIM:

The course introduces the students to a range of topics in the field of artificial neural networks and to provide familiarity with the associated applications.

OBJECTIVES:

To understand aspects of the social, intellectual, and neurobiological context of neural

networks

To have an understanding of a variety of neural network techniques

To have an awareness of the computational theory underlying NNs


Definition of ANN-Biological Neural Networks-Applications of ANN-Typical Architectures-Setting the weights-Common Activation functions-Development of Neural Networks-McCulloch-Pitts Neuron

UNIT II SIMPLE NEURAL NETS FOR PATTERN CLASSIFICATION 9

General discussion - Hebb net – Perceptron- Adaline – Back propagation neural net- Architecture- Delta Learning Rule Algorithm-Applications

UNIT III PATTERN ASSOCIATION 9

Training Algorithm for Pattern Association-Hetero associative memory neural network applications-Auto associative net-Iterative Auto associative net- Bidirectional Associative Memory-Applications

UNIT IV NEURAL NETS BASED ON COMPETITION 9 Fixed Weights Competitive Nets- Kohonen‘s Self-Organizing Map –Applications- Learning Vector

Quantization-Applications-Counter Propagation Network- Applications. UNIT V ADAPTIVE RESONANCE THEORY AND NEOCOGNITRON 9

Motivation – Basic Architecture- Basic Operation-ART1-ART2-Architecture- Algorithm-applications-Analysis Probabilistic Neural Net-Cascade Correlation- Neocognitron: Architecture—

Algorithm-Applications. TOTAL : 45 PERIODS

TEXTBOOKS:

1. LaureneV. Fausett, ―Fundamentals of Neural Networks-Architectures, Algorithms and

Applications‖, Pearson Education, 2011.

REFERENCES:

1 James. A. Freeman and David.M.Skapura, "Neural Networks Algorithms, Applications and

Programming Techniques ",Pearson Education, Sixth Reprint, 2011.

2 Simon Haykin, "Neural Networks and Learning Methods‖, PHI Learning Pvt. Ltd., 2011.

3 James A. Anderson, ―An Introduction to Neural Networks‖, PHI Learning Pvt. Ltd., 2011.

4 Martin T. Hagan, Howard B. Demuth, Mark Beale, ―Neural Network Design‖, Cengage

Learning, Fourth Indian Reprint, 2010.

5 Bart Kosko, ―Neural Networks and Fuzzy Systems-A Dynamical Approach to Machine

Intelligence‖, PHI Learning Pvt. Ltd., 2010.

6 http://www.willamette.edu/~gorr/classes/cs449/intro.html

7 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-867-machine- learning

8 http://ocw.mit.edu/courses/sloan-school-of-management/15-062-datamining-spring-2003

/lecture-notes/NeuralNet2002.pdf

MKCE-CSE[R2012]

UIT12759/

UCS12757

PARALLEL COMPUTING


3 0 0 3 AIM

The course introduces the students to Parallel programming paradigms and algorithms for shared and distributed memory computer architectures; performance analysis; use of shared infrastructure and applications in scientific computing.

OBJECTIVES:

To be able to design for high – performance computing applications

To learn the issues in designing parallelism

To introduce the students to various cutting edge technologies in parallel computing

UNIT I SCALABILITY AND CLUSTERING 9 Evolution of Computer Architecture – Dimensions of Scalability – Parallel Computer Models – Basic Concepts Of Clustering – Scalable Design Principles – Parallel Programming Overview –

Processes, Tasks and Threads – Parallelism Issues – Interaction / Communication Issues – Semantic Issues In Parallel Programs.

UNIT II ENABLING TECHNOLOGIES 9 System Development Trends – Principles of Processor Design – Microprocessor Architecture

Families – Hierarchical Memory Technology – Cache Coherence Protocols – Shared Memory Consistency – Distributed Cache Memory Architecture – Latency Tolerance Techniques –

Multithreaded Latency Hiding. UNIT III SYSTEM INTERCONNECT 9

Basics of Interconnection Networks – Network Topologies and Properties – Buses, Crossbar and Multistage Switches, Software Multithreading – Synchronization Mechanisms.

UNIT IV PARALLEL PROGRAMMING 9 Paradigms And Programmability – Parallel Programming Models – Shared Memory Programming.

UNIT V MESSAGE PASSING PROGRAMMING 9

Message Passing Paradigm – Message Passing Interface – Parallel Virtual Machine


1. Kai Hwang and Zhi.Wei Xu, ―Scalable Parallel Computing‖, Tata Mc GrawHill, New Delhi,

2003.

2. Michael J. Quinn, ―Parallel Computing Theory and Practice‖, Second Edition, Tata McGraw-

Hill Publishing Co. Ltd., New Delhi, 2003.

REFERENCES: 1. David E. Culler & Jaswinder Pal Singh, ―Parallel Computing Architecture: A

Hardware/Software Approach‖, Morgan Kaufman Publishers, 1999.

2. Michael J. Quinn, ―Parallel Programming in C with MPI & OpenMP‖, Tata McGraw-Hill,

New Delhi, 2003.

3 Kai Hwang, ―Advanced Computer Architecture‖ Tata McGraw-Hill, New Delhi, 2003.

MKCE-CSE[R2012]

UCS12758 REAL TIME SYSTEMS L T P C

3 0 0 3 AIM

To introduce students to the fundamental problems, concepts, and approaches in the design and analysis of real- time systems.

OBJECTIVES:

Overview of real-time applications and concepts with emphasis on the distinguishing

characteristics of real- time systems and the constraints that they must satisfy.

Real-time scheduling and schedulability analysis, including clock-driven and priority-

driven scheduling.

Real-time operating systems. Basic operating-system functions needed for real-time

computing.

Resource management in real- time systems, including potential problems and their

resolution as well as practical issues in building real-time systems.

Resource sharing in real-time systems.

Distributed real-time systems, multiprocessor real-time systems

UNIT I INTRODUCTION 9 Introduction - Issues in Real Time Computing, Structure of a Real Time System. Task Classes,

Performance Measures for Real Time Systems, Estimating Program Runtimes. Task Assignment and Scheduling - Classical Uniprocessor scheduling algorithms, UniProcessor scheduling of IRIS Tasks, Task Assignment, Mode Changes, and Fault Tolerant Scheduling.

UNIT II PROGRAMMING LANGUAGES AND TOOLS 9

Programming Language and Tools – Desired Language characteristics, Data Typing, Control structures, Facilitating Hierarchical Decomposition, Packages, Run-time(Exception) Error handling, Overloading and Generics, Multitasking, Low Level programming, Task scheduling, Timing

Specifications, Programming Environments, Run-time Support.

UNIT III REAL TIME DATABASES 9 Real time Databases - Basic Definition, Real time Vs General Purpose Databases, Main Memory Databases, Transaction priorities, Transaction Aborts, Concurrency Control Issues, Disk Scheduling

Algorithms, Two-phase Approach to improve Predictability, Maintaining Serialization Consistency, Databases for Hard Real Time systems.

UNIT IV COMMUNICATION 9 Real-Time Communication - Communications Media, Network Topologies Protocols, Fault

Tolerant Routing. Fault Tolerance Techniques - Fault Types, Fault Detection. Fault Error containment Redundancy, Data Diversity, Reversal Checks, Integrated Failure handling.

UNIT V EVALUATION TECHNIQUES 9 Reliability Evaluation Techniques - Obtaining Parameter Values, Reliability Models for Hardware

Redundancy, Software Error models. Clock Synchronization - Clock, A Non fault-Tolerant Synchronization Algorithm, Impact of Faults, Fault Tolerant Synchronization in Hardware, Fault

Tolerant Synchronization in Software. TOTAL : 45 PERIODS

TEXTBOOKS:

1. C.M. Krishna, Kang G. Shin, ―Real-Time Systems‖, McGraw-Hill International Editions, 1997.

MKCE-CSE[R2012]

REFERENCES:

1 Stuart Bennett, ―Real Time Computer Control-An Introduction‖, Second edition Perntice Hall

PTR, 1994.

2 Peter D. Lawrence, ―Real time Micro Computer System Design – An Introduction‖, McGraw

Hill, 1988.

2 S.T. Allworth and R.N. Zobel, ―Introduction to real time software design‖, Macmillan, II

Edition, 1987.

3 R.J.A Buhur, D.L. Bailey, ―An Introduction to Real-Time Systems‖, Prentice-Hall International,

1999.

4 Philip.A.Laplante ―Real Time System Design and Analysis‖ PHI , III Edition, April 2004

MKCE-CSE[R2012]

UIT12857 /

UCS12759

SERVICE ORIENTED ARCHITECTURE


3 0 0 3 AIM:

To understand the concepts of Service oriented Architecture, Analysis Techniques and to develop skills and knowledge about service designs and web service standards.

OBJECTIVES:

Learn XML fundamentals.

Be exposed to build applications based on XML.

Understand the key principles behind SOA.

Be familiar with the web services technology elements for realizing SOA.

Learn the various web service standards.

UNIT I INTRODUCTION TO XML 9

XML document structure – Well formed and valid documents – Namespaces – DTD – XML

Schema – X-Files.

UNIT II BUILDING XML- BASED APPLICATIONS 9 Parsing XML – using DOM, SAX – XML Transformation and XSL – XSL Formatting – Modeling

Databases in XML.

UNIT III SERVICE ORIENTED ARCHITECTURE 9 Characteristics of SOA, Comparing SOA with Client-Server and Distributed architectures – Benefits

of SOA -- Principles of Service orientation – Service layers.

UNIT IV WEB SERVICES 9 Service Oriented analysis and design – Service Modeling – Design standards and guidelines –

Composition – WS – BPEL – WS coordination – WS policy – WS Security – SOA support in J2EE.

UNIT V BUILDING SOA-BASED APPLICATIONS 9 Service descriptions – WSDL – Messaging with SOAP – Service discovery – UDDI – Message

Exchange Patterns – Orchestration – Choreography –WS Transactions.

TOTAL : 45 PERIODS TEXTBOOKS: 1. Ron Schmelzer et al. ―XML and Web Services‖, Pearson Education, 2002 2. Thomas Erl,

―Service Oriented Architecture: Concepts, Technology, and Design‖, Pearson Education, 2005.

REFERENCES: 1 Frank P.Coyle, ―XML, Web Services and the Data Revolution‖, Pearson Education, 2002.

2 Eric Newcomer, Greg Lomow, ―Understanding SOA with Web Services‖, Pearson Education, 2005.

3 Sandeep Chatterjee and James Webber, ―Developing Enterprise Web Services: An Architect's Guide‖, Prentice Hall, 2004.

4 James McGovern,Sameer Tyagi, Michael E.Stevens, Sunil Mathew, ‖Java Web. Services

Architecture‖, Morgan Kaufmann Publishers, 2003.

MKCE-CSE[R2012]

UIT12858 /

UCS127510

SOFT COMPUTING

(Common to IT & CSE)

L T P C

3 0 0 3 AIM:

To give an overall understanding on the theories those are available to solve hard real- world problems.

OBJECTIVES:

Learn the various soft computing frame works.

Be familiar with design of various neural networks.

Be exposed to fuzzy logic.

Learn genetic programming.

Be exposed to hybrid systems.

UNIT I INTRODUCTION 9 Artificial neural network: Introduction, characteristics- learning methods – taxonomy – Evolution of

neural networks- basic models - important technologies - applications. Fuzzy logic: Introduction - crisp sets- fuzzy sets - crisp relations and fuzzy relations: cartesian product of relation - classical relation, fuzzy relations, tolerance and equivalence relations, non- iterative fuzzy sets. Genetic

algorithm- Introduction - biological background - traditional optimization and search techniques - Genetic basic concepts.

UNIT II NEURAL NETWORKS 9 McCulloch-Pitts neuron - linear separability - hebb network - supervised learning network:

perceptron networks - adaptive linear neuron, multiple adaptive linear neuron, BPN, RBF, TDNN-

associative memory network: auto-associative memory network, hetero-associative memory

network, BAM, hopfield networks, iterative auto associative memory network & iterative

associative memory network –unsupervised learning networks: Kohonen self organizing feature

maps, LVQ – CP networks, ART network.

UNIT III FUZZY LOGIC 9

Membership functions: features, fuzzification, methods of membership value assignments-

Defuzzification: lambda cuts - methods - fuzzy arithmetic and fuzzy measures: fuzzy arithmetic -

extension principle - fuzzy measures - measures of fuzziness - fuzzy integrals - fuzzy rule base and

approximate reasoning : truth values and tables, fuzzy propositions, formation of rules-

decomposition of rules, aggregation of fuzzy rules, fuzzy reasoning-fuzzy inference systems-

overview of fuzzy expert system-fuzzy decision making.

UNIT IV GENETIC ALGORITHM 9 Genetic algorithm and search space - general genetic algorithm – operators - Generational cycle -

stopping condition – constraints - classification - genetic programming – multilevel optimization –

real life problem- advances in GA.

UNIT V HYBRID SOFT COMPUTING TECHNIQUES & APPLICATIONS 9 Neuro-fuzzy hybrid systems - genetic neuro hybrid systems - genetic fuzzy hybrid and fuzzy genetic

hybrid systems - simplified fuzzy ARTMAP - Applications: A fusion approach of multispectral

images with SAR, optimization of traveling salesman problem using genetic algorithm approach,

soft computing based hybrid fuzzy controllers.

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS: 1. J.S.R.Jang, C.T. Sun and E.Mizutani, ―Neuro-Fuzzy and Soft Computing‖, PHI / Pearson

Education 2004.

2. S.N.Sivanandam and S.N.Deepa, "Principles of Soft Computing", Wiley India Pvt Ltd, 2011.

REFERENCES:

1 S.Rajasekaran and G.A.Vijayalakshmi Pai, "Neural Networks, Fuzzy Logic and Genetic Algorithm: Synthesis & Applications", Prentice-Hall of India Pvt. Ltd., 2006.

2 George J. Klir, Ute St. Clair, Bo Yuan, ―Fuzzy Set Theory: Foundations and Applications‖ Prentice Hall, 1997.

3 David E. Goldberg, ―Genetic Algorithm in Search Optimization and Machine Learning‖ Pearson

Education India, 2013.

4 James A. Freeman, David M. Skapura, ―Neural Networks Algorithms, Applications, and

Programming Techniques, Pearson Education India, 1991.

5 Simon Haykin, ―Neural Networks Comprehensive Foundation‖ Second Edition, Pearson

Education, 2005.

MKCE-CSE[R2012]

UIT12703/

UCS127511

SOFTWARE TESTING


3 0 0 3 AIM:

To provide students with skills and knowledge critical to the successful testing of software.

OBJECTIVES:

Expose the criteria for test cases.

Learn the design of test cases.

Be familiar with test management and test automation techniques.

Be exposed to test metrics and measurements.


Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic definitions –

Software Testing Principles – The Tester‟s Role in a Software Development Organization – Origins

of Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design – Defect

Examples – Developer/Tester Support of Developing a Defect Repository – Defect Prevention

strategies.

UNIT II TEST CASE DESIGN 9

Test case Design Strategies – Using Black Box Approach to Test Case Design – Random Testing – Requirements based testing – Boundary Value Analysis – Equivalence Class Partitioning – State-based testing – Cause-effect graphing – Compatibility testing – user documentation testing – domain

testing – Using White Box Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing – code functional testing – Coverage and Control Flow Graphs – Covering Code

Logic – Paths – code complexity testing – Evaluating Test Adequacy Criteria. UNIT III LEVELS OF TESTING 9

The need for Levels of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests – The Test Harness – Running the Unit tests and Recording results – Integration tests – Designing

Integration Tests – Integration Test Planning – Scenario testing – Defect bash elimination System Testing – Acceptance testing – Performance testing – Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO systems – Usability and Accessibility

testing – Configuration testing – Compatibility testing – Testing the documentation – Website testing

UNIT IV TEST MANAGEMENT 9 People and organizational issues in testing – Organization structures for testing teams – testing

services – Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items –

test management – test process – Reporting Test Results – The role of three groups in Test Planning

and Policy Development – Introducing the test specialist – Skills needed by a test specialist –

Building a Testing Group.

UNIT V TEST AUTOMATION 9

Software test automation – skill needed for automation – scope of automation – design and

architecture for automation – requirements for a test tool – challenges in automation – Test metrics

and measurements – project, progress and productivity metrics.

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS: 1. Srinivasan Desikan and Gopalaswamy Ramesh, ―Software Testing – Principles and Practices‖,


2. Ron Patton, ―Software Testing‖, Second Edition, Sams Publishing, Pearson Education, 2007.

REFERENCES:

1 Ilene Burnstein, ―Practical Software Testing‖, Springer International Edition, 2003.

2 Edward Kit,‖ Software Testing in the Real World – Improving the Process‖, Pearson Education,

1995.

3 Boris Beizer,‖ Software Testing Techniques‖ – 2nd Edition, Van Nostrand Reinhold, New York, 1990.

4 Aditya P. Mathur, ―Foundations of Software Testing _ Fundamental Algorithms and

Techniques‖, Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2008.

MKCE-CSE[R2012]

UCS127512 SYSTEM SOFTWARE L T P C

3 0 0 3 AIM:

To have an understanding of foundations of design of assemblers, loaders, linkers, and macro processors.

OBJECTIVES:

To understand the relationship between system software and machine architecture

To know the design and implementation of assemblers

To know the design and implementation of linkers and loaders

To have an understanding of macro processors

To have an understanding of system software tools.

UNIT I INTRODUCTION 9 System software and machine architecture – The Simplified Instructional Computer - (SIC) -

Machine architecture - Data and instruction formats - addressing modes - instruction sets - I/O and programming.

UNIT II ASSEMBLERS 9 Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures -

Machine dependent assembler features - Instruction formats and addressing modes– Program relocation - Machine independent assembler features - Literals –Symbol-defining statements –Expressions - One pass assemblers and Multi pass assemblers - Implementation example –MASM

assembler.

UNIT III LOADERS AND LINKERS 9 Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader - Machine dependent loader features - Relocation – Program Linking – Algorithm and Data Structures for

Linking Loader - Machine- independent loader features – Automatic Library Search – Loader Options - Loader design options - Linkage Editors – Dynamic Linking – Bootstrap Loaders -

Implementation example - MSDOS linker. UNIT IV MACRO PROCESSORS 9

Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data structures - Machine- independent macro processor features - Concatenation of Macro

Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example - MASM Macro Processor – ANSI C Macro language.

UNIT V SYSTEM SOFTWARE TOOLS 9 Text editors - Overview of the Editing Process - User Interface – Editor Structure. - Interactive

debugging systems - Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Leland L. Beck, ―System Software – An Introduction to Systems Programming‖, 3rd Edition,

Pearson Education Asia, 2006.

MKCE-CSE[R2012]

REFERENCES: 1 D. M. Dhamdhere, ―Systems Programming and Operating Systems‖, Second Revised Edition,

Tata McGraw-Hill, 2000

2 John J. Donovan ―Systems Programming‖, Tata McGraw-Hill Edition, 2000.

3 John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers,

2000

MKCE-CSE[R2012]

UBA12651

UBA12751

E- COMMERCE L T P C

3 0 0 3 AIM:

To expose the students to the different business strategies involving electronic commerce to be used in business in a global environment.

OBJECTIVES:

To learn the advancements of electronic commerce which has become a compelling

necessity in the present day communication based commerce.

To understood the key issues involved in managing electronic commerce initiatives.

UNIT I TELECOMMUNICATION NETWORKS 9

Telecommunication Networks : Introduction - LAN - WAN- Internet - Electronic Commerce - Brief history of Electronic Commerce - Advantages and Limitations of Electronic Commerce - Types of Electronic commerce - Integrating Electronic Commerce

UNIT II THE INTERNET AND THE WORLD WIDE WEB 9

The Internet and the World Wide Web: The Internet Today - History of the Web - Unique benefits of the Internet - Internet Architecture - World Wide Web - Concepts and Technology - Creating an Effective Web – Web Site Usability – Connecting With Customers- Launching a Business on the

Internet.

UNIT III ELECTRONIC PAYMENT SYSTEMS 9 Electronic Payment Systems: Overview of the Electronic payment Technology - Requirements for Internet Based payments - Electronic payment Medias -. Electronic Cash – Electronic Wallets –

Stored-Value Cards – Internet Technologies and the Banking Industry – Planning for E-Commerce Initiatives – Strategies for Developing E-commerce

UNIT IV E – SECURITY 9 E-security: Security in the cyberspace - Designing for security - Virus - Security Protection and

Recovery - Encryption - The Basic Algorithm System - Authentication and Trust – Key management - Internet Security Protocols and Standards – cryptography –authentication.

UNIT V WEB BASED BUSINESS 9 Web based Business: Business-to-Business Electronic Commerce-Intranets and Extranets -Intranets

and Supply Chain Management - Legal and Ethical issues – web based marketing – search engines and Directory registration – online advertisements – website design issues.

TOTAL : 45 PERIODS REFERENCES:

1 Elias. M. Awad, ―Electronic Commerce", Prentice - Hall of India Pvt Ltd, 2002.

2 Ravi Kalakota, Andrew B. Whinston, "Electronic Commerce - A Manager's guide", Addison -

Wesley, 2000.

3 Efraim Turban, Jae Lee, David King, H.Michael Chung, ―Electronic Commerce – A Managerial Perspective", Addison - Wesley, 2001.

4 Elias M Award, ―Electronic Commerce from Vision to Fulfilment‖, 3rd Edition, PHI, 2006

5 Judy Strauss, Adel El-Ansary, Raymond Frost, ―E-Marketing‖, 3RD Edition, Pearson Education, 2003

MKCE-CSE[R2012]

6 Ravi Kalakota, Andrew B. Whinston, "Frontiers of Electronic Commerce‖, Addition – Wesley, 2000.

7 Gary P Schneider ―Electronic commerce‖, Thomson learning & James T Peny Cambridge

USA,2001.

8 Manlyn Greenstein and Miklos ―Electronic commerce‖ McGraw-Hill, 2002.

9 Brenda Kienew E commerce Business Prentice Hall, 2001.

MKCE-CSE[R2012]

SEMESTER VIII

UIT12801/

UCS12801

CLOUD COMPUTING

(Recommended by Infosys - Common to CSE & IT) L T P C

3 0 0 3 AIM:

To emphasize virtualized data centers and cloud systems for understanding, research.

OBJECTIVES:

To introduce the broad perceptive of cloud architecture and model

To understand the concept of Virtualization

To be familiar with the lead players in cloud.

To understand the features of cloud simulator

To apply different cloud programming model as per need.

To be able to set up a private cloud.

To understand the design of cloud Services.

To learn to design the trusted cloud Computing system

UNIT I UNDERSTANDING CLOUD COMPUTING 6

Cloud Computing – History of Cloud Computing – Cloud Architecture – Cloud Storage – Why

Cloud Computing Matters – Advantages of Cloud Computing – Disadvantages of Cloud Computing – Companies in the Cloud Today – Cloud Services

UNIT II DEVELOPING CLOUD SERVICES 10

Web-Based Application – Pros and Cons of Cloud Service Development – Types of Cloud Service Development – Software as a Service – Platform as a Service – Web Services – On-Demand Computing – Discovering Cloud Services Development Services and Tools – Des igning

UI for the Cloud - Amazon Ec2 – Google App Engine – IBM Clouds

UNIT III CLOUD COMPUTING FOR EVERYONE 10 Centralizing Email Communications – Collaborating on Schedules – Collaborating on To- Do

Lists – Collaborating Contact Lists – Cloud Computing for the Community – Collaborating on Group Projects and Events – Cloud Computing for the Corporation

UNIT IV USING CLOUD SERVICES 10

Collaborating on Calendars, Schedules and Task Management – Exploring Online Scheduling Applications – Exploring Online Planning and Task Management - Collaborating on

Event Management – Collaborating on Contact Management - Collaborating on Project Management – Collaborating on Word Processing -Collaborating on Databases – Storing and Sharing Files

UNIT V OTHER WAYS TO COLLABORATE ONLINE 9

Collaborating via Web-Based Communication Tools – Evaluating Web Mail Services –Evaluating Web Conference Tools – Collaborating via Social Networks and Groupware –

Collaborating via Blogs and Wikis

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

REFERENCES: 1. Lars Nielsen ‖The Little Book of Cloud Computing‖, 2013 Edition [Kindle Edition]

2. Kumar Saurabh, ―Cloud Computing – Insights into New Era Infrastructure‖, Wiley Indian

Edition, 2011.

3 Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work

and Collaborate Online, Que Publishing, August 2008.

4 Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited, July 2008.

MKCE-CSE[R2012]

UIT12851/

UCS12851

ADVANCED DBMS


L T P C

3 0 0 3 AIM:

To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram, make a study of SQL, know the fundamental concepts of transaction processing

OBJECTIVES:

Be familiar with a commercial relational database system (Oracle) by writing SQL

using the system.

Be familiar with the relational database theory, and be able to write relational algebra

expressions for queries.

UNIT I PARALLEL AND DISTRIBUTED DATABASES 9

Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures – Parallel Systems- Distributed Systems – Parallel Databases: I/O Parallelism – Inter

and Intra Query Parallelism – Inter and Intra operation Parallelism – Distributed Database Concepts - Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Three Tier Client Server Architecture- Case Studies.

UNIT II OBJECT AND OBJECT RELATIONAL DATABASES 9

Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database Standards, Languages and Design: ODMG Model – ODL –

OQL – Object Relational and Extended – Relational Systems : Object Relational features in SQL / Oracle – Case Studies.

UNIT III XML DATABASES 9 XML Databases: XML Data Model – DTD - XML Schema - XML Querying – Web Databases –

JDBC – Information Retrieval – Data Warehousing – Data Mining.

UNIT IV MOBILE DATABASES 9 Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management - Location Dependent Data Distribution - Mobile Transaction Models - Concurrency Control -

Transaction Commit Protocols- Mobile Database Recovery Schemes.

UNIT V INTELLIGENT DATABASES 9 Active databases – Deductive Databases – Knowledge bases – Multimedia Databases- Multidimensional Data Structures – Image Databases – Text/Document Databases- Video Databases

– Audio Databases – Multimedia Database Design.

TOTAL : 45 PERIODS

REFERENCES:

1. Henry F Korth, Abraham Silberschatz and S. Sudharshan, ―Database System Concepts‖, Sixth Edition, McGraw Hill, 2011.

2. C.J.Date, A.Kannan and S.Swamynathan,‖An Introduction to Database Systems‖, Eighth

Edition, Pearson Education, 2006

3 R. Elmasri, S.B. Navathe, ―Fundamentals of Database Systems‖, Fifth Edition, Pearson

Education/Addison Wesley, 2007.

MKCE-CSE[R2012]

4 Thomas Cannolly and Carolyn Begg, ―Database Systems, A Practical Approach to Design, Implementation and Management‖, Third Edition, Pearson Education, 2007.

5 Subramaniam, ―Multimedia Databases‖, Morgan Kauffman Publishers, 2008.

MKCE-CSE[R2012]

UCS12852 ADVANCED JAVA PROGRAMMING L T P C

3 0 0 3

AIM:

To enable the students to design and develop enterprise strength distributed and multitier applications – Using Java Technology.

OBJECTIVES:

To learn advanced Java programming concepts like interface, threads, Swings etc.

To develop network programs in Java

To understand Concepts needed for distributed and multitier applications

To understand issues in enterprise applications development

UNIT I JAVA FUNDAMENTALS 9

Java I/O streaming – filter and pipe streams – Byte Code interpretation - Threading – Swing.

UNIT II NETWORK PROGRAMMING IN JAVA 10 Sockets – secure sockets – custom sockets – UDP Datagrams – multicast sockets – URL classes – Reading Data from the server – writing data – configuring the connection – Reading the header –

telnet application – Java Messaging services. UNIT III APPLICATIONS IN DISTRIBUTED ENVIRONMENT 10

Remote method Invocation – activation models – RMI custom sockets – Object Serialization – RMI – IIOP implementation – CORBA – IDL technology – Naming Services – CORBA programming

Models - JAR file creation UNIT IV MULTI-TIER APPLICATION DEVELOPMENT 9

Server side programming – Servlets – Java Server Pages - Applet to Applet communication – applet to Servlet communication - JDBC – Applications on databases – Multimedia streaming applications

– Java Media Framework UNIT V ENTERPRISE APPLICATIONS 7

Server Side Component Architecture – Introduction to J2EE – Session Beans – Entity Beans –

Persistent Entity Beans

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Elliotte Rusty Harold, ― Java Network Programming‖, O‘Reilly publishers, 2000

2. Ed Roman, ―Mastering Enterprise Java Beans‖, John Wiley & Sons Inc., 1999.

3. Hortsmann & Cornell, ―CORE JAVA 2 ADVANCED FEATURES, VOL II‖, Pearson

Education, 2002.

REFERENCES: 1. Web reference: http://java.sun.com.

2. Patrick Naughton, ―COMPLETE REFERENCE: JAVA2‖, Tata McGraw-Hill, 2003.

MKCE-CSE[R2012]

UIT12651/

UCS12853

ARTIFICIAL INTELLIGENCE


3 0 0 3 AIM:

The aim of this course is to give students a comprehensive understanding of Artificial Intelligence, developing computer applications, which encompasses perception, reasoning, learning and to provide an in-depth understanding of major techniques used to simulate intelligence.

OBJECTIVES:

To provide a strong foundation of fundamental concepts in Artificial Intelligence

To provide a basic exposition to the goals and methods of Artificial

Intelligence

To describe the logical languages and apply it for knowledge representation.

To outline the importance of learning agent and the forms of learning.

To Design of communicative agent and its usage in domains.

UNIT I INTRODUCTION 8 Intelligent Agents – Agents and environments - Good behavior – The nature of environments –

structure of agents - Problem Solving - problem solving agents – example problems – searching for solutions – uniformed search strategies - avoiding repeated states – searching with partial information

UNIT II SEARCHING TECHNIQUES 10

Informed search and exploration – Informed search strategies – heuristic function – local search algorithms and optimistic problems – local search in continuous spaces – online search agents and unknown environments - Constraint satisfaction problems (CSP) – Backtracking search and Local

search for CSP – Structure of problems - Adversarial Search – Games – Optimal decisions in games – Alpha – Beta Pruning – imperfect real-time decision – games that include an element of chance.

UNIT III KNOWLEDGE REPRESENTATION 10

Logical Agents – Wumpus world - Propositional logic - First order logic - syntax and semantics –

Using first order logic – Inference – forward chaining – backward chaining– Knowledge representation – Ontological Engineering – Categories and objects – Actions – Simulation and

events – Mental events and mental objects. UNIT IV LEARNING 9

Learning from observations – forms of learning – Inductive learning - Learning decision trees – Ensemble learning – Knowledge in learning – Logical formulation of learning – Explanation based learning – Learning using relevant information – Reinforcement learning – Passive reinforcement

learning – Active reinforcement learning – Generalization in reinforcement learning.

UNIT V APPLICATIONS 8 Communication –Communication as action -A formal grammar for a fragment of English – Syntactic Analysis – Augmented Grammars – Semantic Interpretation – Ambiguity and

Disambiguation – Discourse Understanding – Grammar Induction.

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS: 1. Stuart Russell, Peter Norvig, ―Artificial Intelligence – A Modern Approach‖, 2nd Edition,

Pearson Education / Prentice Hall of India, 2004.

REFERENCES: 1. Nils J. Nilsson, ―Artificial Intelligence: A new Synthesis‖, Harcourt Asia Pvt. Ltd., 2000.

2. Elaine Rich and Kevin Knight, ―Artificial Intelligence‖, 2nd Edition, Tata McGraw-Hill, 2003.

3. George F. Luger, ―Artificial Intelligence-Structures And Strategies For Complex Problem

Solving‖, Pearson Education / PHI, 2002.

MKCE-CSE[R2012]

UIT12753 /

UCS12856

FUNDAMENTALS OF NANOSCIENCE


3 0 0 3 AIM:

To be able to critically evaluate nano science concepts and therefore be equipped to delve deeper into nano science research.

OBJECTIVES:

To demonstrate the techniques of microscopy for investigations on the nanoscale

To acquire knowledge of basic approaches to synthesize inorganic colloidal nano

particles and their self-assembly in solution and surfaces

To understand and describe 8the use of unique optical properties of nanoscale

metallic structures for analytical and biological applications


Nanoscale Science and Technology- Implications for Physics, Chemistry, Biology and Engineering-Classifications of nano structured materials- nano particles- quantum dots, nano wires-ultra-thin

films-multilayered materials. Length Scales involved and effect on properties: Mechanical, Electronic, Optical, Magnetic and Thermal properties. Introduction to properties and motivation for study (qualitative only)

UNIT II PREPARATION METHODS 10

Bottom-up Synthesis-Top-down Approach: Precipitation, Mechanical Milling, Colloidal routes, Self-assembly, Vapour phase deposition, MOCVD, Sputtering, Evaporation, Molecular Beam

Epitaxy, Atomic Layer Epitaxy, MOMBE.

UNIT III PATTERNING AND LITHOGRAPHY FOR NANOSCALE

DEVICES

5

Introduction to optical/UV electron beam and X-ray Lithography systems and processes, Wet

etching, dry (Plasma /reactive ion) etching, Etch resists-dip pen lithography

UNIT IV PREPARATION ENVIRONMENTS 9 Clean rooms: specifications and design, air and water purity, requirements for particular processes, Vibration free environments: Services and facilities required. Working practices, sample cleaning,

Chemical purification, chemical and biological contamination, Safety issues, flammable and toxic hazards, biohazards.

UNIT V APPLICATIONS 8 Communication –Communication as action -A formal grammar for a fragment of English –

Syntactic Analysis – Augmented Grammars – Semantic Interpretation – Ambiguity and Disambiguation – Discourse Understanding – Grammar Induction.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Stuart Russell, Peter Norvig, ―Artificial Intelligence – A Modern Approach‖, 2nd Edition, Pearson Education / Prentice Hall of India, 2004.

REFERENCES: 1

.

Nils J. Nilsson, ―Artificial Intelligence: A new Synthesis‖, Harcourt Asia Pvt. Ltd., 2000.

2

.

Elaine Rich and Kevin Knight, ―Artificial Intelligence‖, 2nd Edition, Tata McGraw-Hill, 2003.

3 George F. Luger, ―Artificial Intelligence-Structures And Strategies For Complex Problem

Solving‖, Pearson Education / PHI, 2002.

MKCE-CSE[R2012]

UCS12857

HIGH SPEED NETWORKS L T P C

3 0 0 3 AIM:

To highlight the features of different technologies involved in High Speed Networking and their performance.

OBJECTIVES:

Students will get an introduction about ATM and Frame relay.

Students will be provided with an up to date survey of developments in High Speed Networks.

Enable the students to know techniques involved to support real time traffic and congestion control.

Students will be provided with different levels of quality of service to different applications.

UNIT I HIGH SPEED NETWORKS 9 Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical

Connection – ATM Cell – ATM Service Categories – AAL. High Speed LAN‘s: Fast Ethernet – Gigabit Ethernet– Fibre Channel – Wireless LAN‘s, WiFi and WiMax Networks applications,

requirements – Architecture of 802.11. UNIT II CONGESTION AND TRAFFIC MANAGEMENT 8

Queuing Analysis – Queuing Models – Single Server Queues – Effects of Congestion –Congestion

Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay Congestion Control.

UNIT III TCP AND ATM CONGESTION CONTROL 12

TCP Flow control – TCP Congestion Control – Retransmission – Timer Management – Exponential

RTO backoff – KARN‘s Algorithm – Window management – Performance of TCP over ATM. Traffic and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame

work, Traffic Control – ABR traffic Management – ABR rate control, RM cell formats – ABR Capacity allocations – GFR traffic management.

UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 8

Integrated Services Architecture – Approach, Components, Services- Queuing Discipline – FQ – PS – BRFQ – GPS – WFQ – Random Early Detection – Differentiated Services.

UNIT V PROTOCOLS FOR QOS SUPPORT 8 RSVP – Goals & Characteristics, Data Flow, RSVP operations – Protocol Mechanisms –

Multiprotocol Label Switching – Operations, Label Stacking – Protocol details – RTP – Protocol Architecture – Data Transfer Protocol– RTCP.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. William Stallings, ―High speed networks and internet‖, Second Edition, Pearson Education, 2002.

MKCE-CSE[R2012]

REFERENCES: 1. Warland, Pravin Varaiya, ―High performance communication networks‖, Second Edition‘ Jean

Harcourt Asia Pvt. Ltd., , 2001.

2. Irvan Pepelnjk, Jim Guichard, Jeff Apcar, ―MPLS and VPN architecture‖, Cisco Press, Volume 1 and 2, 2003.

3. Abhijit S. Pandya, Ercan Sea, ―ATM Technology for Broad Band Telecommunication Networks‖, CRC Press, New York, 2004

MKCE-CSE[R2012]

UCS12858

ROBOTICS L T P C

3 0 0 3 AIM:

To understand the basic concepts of robotics and its various applications and implementations. OBJECTIVES:

To introduce the basic concepts, parts of robots and types of robots

To make the student familiar with the various drive systems for robot, sensors and

their applications in robots, programming of robots

To discuss about the various applications of robots, justification, implementation and

safety of robot

UNIT I SCOPE OF ROBOTS AND INTELLIGENCE 9 The scope of industrial Robots - Definition of an industrial robot - Need for industrial robots -

applications. Robot Intelligence – State Space Search – Problem Reduction –Use of Predicate – logic – means Ends Analysis – Problem Solving – Robot Learning –Robot Task Planning – Basic

Problems in Task Planning.

UNIT II ROBOT COMPONENTS 9

Fundamentals of Robot Technology - Automation and Robotics - Robot anatomy -Work volume - Precision of movement - End effectors - Sensors

UNIT III ROBOT PROGRAMMING 9

Robot Programming - Methods - interlocks textual languages. Characteristics of Robot level languages, characteristic of task level languages.

UNIT IV ROBOT WORK CELL 9 Robot Cell Design and Control - Remote Center compliance - Safety in Robotics.

UNIT V FUTURE TRENDS 9

Advanced robotics, Advanced robotics in Space - Specific features of space robotics systems - long-term technical developments, Advanced robotics in under – water operations. Robotics Technology of the Future - Future Applications.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Barry Leatham - Jones, "Elements of industrial Robotics" PITMAN Publishing, 1987.

REFERENCES: 1. Mikell P.Groover, Mitchell Weiss, Roger N.Nagel Nicholas G.Odrey, "Industrial Robotics

Technology, Programming and Applications ", McGraw Hill Book Company 1986

2. Fu K.S. Gonzalez R.C. and Lee C.S.G., "Robotics Control Sensing, Vision and Intelligence (chapter 10) " McGraw Hill International Editions, 1987.Volume 1 and 2, 2003.

3. Bernard Hodges and Paul Hallam, " Industrial Robotics", British Library Cataloging in

Publication 1990. 4. Deb, S.R. Robotics Technology and flexible automation, Tata Mc Graw Hill, 1994

5. Schilling R J, ―Fundamentals of Robotics- Analysis and controls‖, PHI Learning India 2010

6. Saeed B.Niku, ―Introduction to Robotics‖, PHI Learning India 2009

MKCE-CSE[R2012]

UIT12859 /

UCS12859

SOFTWARE PROJECT MANAGEMENT


L T P C

3 0 0 3 AIM: To attain knowledge in training software project managers and other individuals involved in software project planning and tracking and oversight in the implementation of the software project management process

OBJECTIVES:

To outline the need for Software Project Management

To highlight different techniques for software cost estimation and activity planning.

UNIT I PROJECT EVALUATION AND PROJECT PLANNING 9

Importance of Software Project Management – Activities Methodologies – Categorization of Software Projects – Setting objectives – Management Principles – Management Control – Project portfolio Management – Cost-benefit evaluation technology – Risk evaluation – Strategic program

Management – Stepwise Project Planning.

UNIT II PROJECT LIFE CYCLE AND EFFORT ESTIMATION 9

Software process and Process Models – Choice of Process models - mental delivery – Rapid Application development – Agile methods – Extreme Programming – SCRUM – Managing interactive processes – Basics of Software estimation – Effort and Cost estimation techniques –

COSMIC Full function points - COCOMO II A Parametric Productivity Model - Staffing Pattern.

UNIT III ACTIVITY PLANNING AND RISK MANAGEMENT 9

Objectives of Activity planning – Project schedules – Activities – Sequencing and scheduling – Network Planning models – Forward Pass & Backward Pass techniques – Critical path (CRM)

method – Risk identification – Assessment – Monitoring – PERT technique – Monte Carlo simulation – Resource Allocation – Creation of critical patterns – Cost schedules.

UNIT IV PROJECT MANAGEMENT AND CONTROL 9 Framework for Management and control – Collection of data Project termination – Visualizing

progress – Cost monitoring – Earned Value Analysis- Project tracking – Change control- Software Configuration Management – Managing contracts – Contract Management.

UNIT V STAFFING IN SOFTWARE PROJECTS

9

Managing people – Organizational behavior – Best methods of staff selection – Motivation – The Oldham-Hackman job characteristic model – Ethical and Programmed concerns – Working in teams

– Decision making – Team structures – Virtual teams – Communications genres – Communication plans.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw Hill, New Delhi, 2012.

MKCE-CSE[R2012]

REFERENCES: 1. Robert K. Wysocki ―Effective Software Project Management‖ – Wiley Publication, 2011.

2. Walker Royce: ―Software Project Management‖- Addison-Wesley, 1998.

3. Gopalaswamy Ramesh, ―Managing Global Software Projects‖ – McGraw Hill Education (India), Fourteenth Reprint 2013.

MKCE-CSE[R2012]

UIT127510/

UCS128510

SOFTWARE QUALITY ASSURANCE


L T P C

3 0 0 3

OBJECTIVES:

Understand the basic tenets of software quality and quality factors.

Be exposed to the Software Quality Assurance (SQA) architecture and the details of

SQA components.

Understand of how the SQA components can be integrated into the project life cycle.

Be familiar with the software quality infrastructure.

Be exposed to the management components of software quality.

UNIT I INTRODUCTION TO SOFTWARE QUALITY & ARCHITECTURE 9

Need for Software quality – Quality challenges – Software quality assurance (SQA) – Definition and objectives – Software quality factors- McCall‟s quality model – SQA system and architecture –

Software Project life cycle Components – Pre project quality components – Development and quality plans.

UNIT II SQA COMPONENTS AND PROJECT LIFE CYCLE 9

Software Development methodologies – Quality assurance activities in the development process-

Verification & Validation – Reviews – Software Testing – Software Testing implementations – Quality of software maintenance – Pre-Maintenance of software quality components – Quality

assurance tools – CASE tools for software quality – Software maintenance quality – Project Management.

UNIT III SOFTWARE QUALITY INFRASTRUCTURE 9

Procedures and work instructions - Templates - Checklists – 3S development - Staff training and

certification Corrective and preventive actions – Configuration management – Software change control – Configuration management audit -Documentation control – Storage and retrieval.

UNIT IV SOFTWARE QUALITY MANAGEMENT & METRICS 9 Project process control – Computerized tools - Software quality metrics – Objectives of quality

measurement – Process metrics – Product metrics – Implementation – Limitations of software metrics – Cost of software quality – Classical quality cost model – Extended model – Application of Cost model.

UNIT V STANDARDS, CERTIFICATIONS & ASSESSMENTS 9

Quality management standards – ISO 9001 and ISO 9000-3 – capability Maturity Models – CMM and CMMI assessment methodologies - Bootstrap methodology – SPICE Project – SQA project process standards – IEEE 101.2 & 102.8 – Organization of Quality Assurance – Department

management responsibilities – Project management responsibilities – SQA units and other actors in SQA systems.

TOTAL : 45 PERIODS TEXTBOOKS: 1. Daniel Galin, ―Software Quality Assurance‖, Pearson Publication, 2009.

REFERENCES: 1. Alan C. Gillies, ―Software Quality: Theory and Management‖, International Thomson

Computer Press, 1997.

2. Mordechai Ben-Menachem ―Software Quality: Producing Practical Consistent Software‖,

International Thompson Computer Press, 1997.

MKCE-CSE[R2012]

UIT127512 /

UCS128511

USER INTERFACE DESIGN

(Common to IT & CSE - Recommended by Infosys)

L T P C

3 0 0 3 AIM:

The course aims to provide students with knowledge of the theoretical foundations of human computer interaction; appreciation for human factors in software systems, and for what makes an

interface good; and practice in designing user-centered interfaces.

OBJECTIVES:

To provide in-depth understanding of the methods and techniques that can be utilized

in the design, implementation and testing of user interfaces

To develop critical capabilities that enable evaluation and selection of appropriate

methods and techniques for interface design

To engender practical abilities in visual and technical aspects of the design process


An Introduction and Overview – Defining the User Interface – Importance of Good Design – Human Computer Interface – Characteristics of Graphical and Web User Interfaces – The GUI – The Web User Interface – 10 Usability Heuristics for UID

UNIT II HUMAN COMPUTER INTERACTIONS 9

The User Interface Design Process – Human Characteristics in Design – Human Considerations in

Design – Understand the Business Function – Business Definition and Requirement Analysis – Determining the Basic Business Function - Design Standards or Style Guides – System Training and Documentation needs - Menus – Structures of Menus – Functions of Menus – Contents of

Menu – Formatting – Phrasing the Menu – Selecting Menu Choices – Navigating Menus – Graphical Menus

UNIT III WINDOWS 9

Characteristics – Components – Presentation Styles – Types of windows – Window Management –

Organizing Window Functions – Window Operations – Web Systems – Device Based Controls –

Characteristics of Device Based Controls – Selecting the Proper Device Based Controls – Screen Based Controls – Operable Controls – Text Entry / Read-Only Controls – Selection Controls –

Combination Entry – Custom Controls – Presentation Controls – Other Operable Controls UNIT IV MULTIMEDIA 9

Text for Web Pages – Providing Effective Feedback and Guidance and Assistance – Providing the

Proper Feedback – Guidance and Assistance – International Considerations – Accessibility – Icons

and Images – Multimedia – Coloring – Choosing the Proper Colors UNIT V WINDOWS LAYOUT TEST 9

Usability Test – Purpose and Importance – Scope of Testing – Prototypes – Kinds of Tests – Developing and Conducting the Test – Analyze , Modify and Retest – Evaluation

TOTAL : 45 PERIODS

MKCE-CSE[R2012]

TEXTBOOKS: 1. Wilbert. O. Galitz, ―The Essential Guide to User Interface Design‖, Wiley - India, Second

Edition, 2012.

2. Deborah Mayhew, ―The Usability Engineering Lifecycle‖, Morgan Kaufmann, 1999.

REFERENCES:

1. Ben Sheiderman, ―Design the User Interface‖, Pearson Education, 1998.

2. Alan Cooper, ―The Essential of User Interface Design‖, Wiley – Dream Tech Ltd 2002.

3. Sharp, Rogers, Preece, ‗Interaction Design‘, Wiley India Edition, 2007.

MKCE-CSE[R2012]

UIT128510 /

UCS128512

WEB SERVICES


L T P C

3 0 0 3 AIM:

The basic aim of this subject is to provide students with insight into XML Web Services, various key technologies for web services

OBJECTIVES:

To know about XML Web Services

To know protocol architecture of XML services

To learn how the web services can be developed using XML

To learn about various security issues in the XML document.


Role Of XML – XML and the Web – XML Language Basics – SOAP – Web Services –

Revolutions of Xml –Service Oriented Architecture (SOA) – Introduction to SOAP.

UNIT II II XML TECHNOLOGY 9

XML-Namespaces – Structuring With Schemas and DTD – Presentation Techniques –

Transformation – XML Infrastructure.

UNIT III RESTFUL WEB SERVICES 9

Introduction to REST – RESTful Architectural Principles – REST Vs SOAP – Designing Restful Services –The Object Model – Model the URIs – Defining the Data Format – Assigning HTTP

Methods - RESTful Java Clients. UNIT IV WEB SERVICES 9

Overview – Architecture – Key Technologies – UDDI – WSDL – ebXML – Web services in E-Com – Overview of .NET And J2EE.

UNIT V XML SECURITY AND XML INPRACTICE 9 Security Overview – Canonicalization – XML Security Frame Work – XML Encryption – XML

Digital Signature –XKMS Structure – Guidelines for Signing XML Documents – XML in Practice.

TOTAL : 45 PERIODS

TEXTBOOKS:

1. Frank. P. Coyle, XML, Web Services And The Data Revolution, Pearson Education, 2002.

REFERENCES: 1. Ramesh Nagappan, Robert Skoczylas and Rima Patel Sriganesh, ―Developing Java Web

Services‖, Wiley Publishing Inc., 2004.

2. Sandeep Chatterjee, James Webber, ―Developing Enterprise Web Services‖, Pearson

Education, 2004.

3. McGovern, et al., ―Java Web Services Architecture‖, Morgan Kaufmann Publishers, 2005

MKCE-CSE[R2012]

UBA12854 ENTERPRISE RESOURCE PLANNING


L T P C

3 0 0 3 AIM:

To understand the strategic importance of ERP in business process and how to create competitive advantage from managerial point of view.

OBJECTIVES:

To understand the importance of Enterprise-wide systems to business operations

To understand basic concepts, tools and techniques of Enterprise Resource Planning

To understand issues of ERP architecture, design, development, implementation, and

project management

To gain exposure to enterprise software from SAP

To understand the steps and activities in the ERP life cycle.

UNIT I INTRODUCTION TO ERP 9

Overview – Benefits of ERP – ERP and Related Technologies – Business Process Reengineering –

Data Warehousing – Data Mining – On–line Analytical Processing – Supply Chain Management. UNIT II ERP IMPLEMENTATION

9

Implementation Life Cycle – Implementation Methodology – Hidden Costs – Organizing Implementation – Vendors, Consultants and Users – Contracts – Project Management and

Monitoring UNIT III BUSINESS MODULES 9

Business Modules in an ERP Package – Finance – Manufacturing – Human Resource – Plant Maintenance – Materials Management – Quality Management – Sales and Distribution

UNIT IV ERP MARKET 9 ERP Market Place – SAP AG – PeopleSoft – Baan Company – JD Edwards World Solutions

Company – Oracle Corporation – QAD – System Software Associates.

UNIT V ERP – PRESENT AND FUTURE 9 Turbo Charge the ERP System – EIA – RP and E–Commerce – ERP and Internet – Future

Directions in ERP.

TOTAL : 45 PERIODS TEXTBOOKS: 1. Alexis Leon, ―ERP Demystified‖, Tata McGraw Hill, Second Edition, 2008.

2. Vinod Kumar Garg and N.K.Venkita Krishnan, ―Enterprise Resource Planning-Concepts and Practice‖, Prentice Hall of India.

REFERENCES:

1. Joseph A. Brady, Ellen F. Monk, Bret J. Wangner, ―Concepts in Enterprise Resource Planning‖, Thomson Learning, 2001.

2. Jose Antonio Fernandz, ― The SAP R /3 Hand book‖, Tata McGraw Hill

3. .Mary Sumner, ―Enterprise Resource Planning‖, Pearson Education, 2007

MKCE-CSE[R2012]

UBA12858 PROFESSIONAL ETHICS


L T P C

3 0 0 3 AIM:

To learn about the Human Values and Ethics that is followed in the field of engineering.

OBJECTIVES:

To create an awareness on Engineering Ethics and Human Values.

To instill Moral and Social Values and Loyalty.

To appreciate the rights of others.

UNIT I HUMAN VALUES 9

Morals, Values and Ethics - Integrity - Work Ethic - Service Learning - Civic Virtue - Respect for

Others - Living Peacefully - caring - Sharing - Honesty - Courage - Valuing Time - Co-operation - Commitment - Empathy - Self-Confidence - Character - Spirituality

UNIT II ENGINEERING ETHICS 9

Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral

autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy - Models of Professional Roles - theories about right action - Self- interest - customs and religion - uses of ethical

theories. UNIT III ENGINEERING AS SOCIAL EXPERIMENTATION 9

Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study.

UNIT IV SAFETY, RESPONSIBILITIES AND RIGHTS 9 Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the three mile island and chernobyl case studies. Collegiality and loyalty - respect for authority - collective

bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination.

UNIT V GLOBAL ISSUES 9

Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers(India), Indian

Institute of Materials Management, Institution of electronics and telecommunication engineers(IETE),India, etc.

TOTAL : 45 PERIODS

TEXTBOOKS: 1. Mike Martin and Roland Schinzinger, "Ethics in Engineering", McGraw-Hill, New York,

1996.

2. Govindarajan M, Natarajan S, Senthil Kumar V. S, "Engineering Ethics", Prentice Hall of

India, New Delhi, 2004.

MKCE-CSE[R2012]

REFERENCES: 1. Charles D. Fleddermann, "Engineering Ethics", Pearson Education / Prentice Hall, New

Jersey, 2004 (Indian Reprint)

2. Charles E Harris, Michael S. Protchard and Michael J Rabins, "Engineering Ethics - Concepts

and Cases", Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now

available)

3. John R Boatright, "Ethics and the Conduct of Business", Pearson Education, New Delhi,

2003.

4. Edmund G Seebauer and Robert L Barry, "Fundamentals of Ethics for Scientists and

Engineers", Oxford University Press, Oxford, 2001.