GULBARGA UNIVERSITY, KALABURAGI DEPARTMENT OF COMPUTER · PDF fileSCT 3.2 Computer Graphics 80 20 100 03 4 0 0 4 OPEN ELECTIVE [ANY ONE] ... Computer Graphics Lab. 40 10 50 1.1/2 0

MASTER OF SCIENCE (M.Sc.) IN COMPUTER SCIENCE SYLLABUS

( CBCS Scheme)

(With effect from the academic year 2017-18 and onwards)

GULBARGA UNIVERSITY, KALABURAGI

DEPARTMENT OF COMPUTER SCIENCE

SYLLABUS FOR MASTER OF SCIENCE (M.Sc.)

IN

COMPUTER SCIENCE

(CBCS SCHEME)

(REVISED SYLLABUS WITH EFFECT FROM ACADEMIC YEAR 2017-18 AND ONWARDS)

Approved by the BOS vide Resolution No. 4 dated 05-03-2017.

Approved by the BOS vide Resolution No. 4 dated 05-03-2017.

M.Sc. Syllabus Dept. of Computer Science, Gulbarga University, Kalaburagi

Page | 2

SCHEME OF STUDY AND EXAMINATION FOR MASTRER OF SCIENCE IN COMPUTER SCIENCE UNDER

CBCS SCHEME W.E.F. ACADEMIC YEAR 2017-2018 AND ONWARDS

Paper Code

Title of the Course Semester IA Total

Duration of

Theory / Practical

Exam. Hrs.

L T P Credits

First Semester HARD CORE

Marks

HCT 1.1 Digital Logic 80 20 100 03 4 0 0 4

HCT 1.2 Object Oriented Programming Using C++ 80 20 100 03 4 0 0 4

HCT 1.3 Programming in VB.NET 80 20 100 03 4 0 0 4

SOFT CORE [ANY ONE]

SCT 1.1 Operating System Principles 80 20 100 03 4 0 0 4

SCT 1.2 LINUX & SHELL Programming 80 20 100 03 4 0 0 4

PRACTICAL

HCP 1.1 Practical –I : Digital Logic Lab. 40 10 50 1.1/2 0 0 4 2

HCP 1.2 Practical – II : C++ Lab 40 10 50 1.1/2 0 0 4 2

HCP 1.3 Practical –III : VB.NET Lab 40 10 50 1.1/2 0 0 4 2

SOFT CORE [ANY ONE]

SCP 1.1 Practical – IV (a) : Operating System Lab. 40 10 50 1.1/2 0 0 4 2

SCP 1.2 Practical –IV (b) : Linux Lab 40 10 50 1.1/2 0 0 4 2

TOTAL FOR FIRST SEMESTER 480 120 600 24

Second Semester

HARD CORE

HCT 2.1 Data Structures using C++ 80 20 100 03 4 0 0 4

HCT 2.2 Relational Database Management System 80 20 100 03 4 0 0 4

SOFT CORE [ANY ONE]

SCT 2.1 Data Communications & Networks 80 20 100 03 4 0 0 4

SCT 2.2 Android Applications 80 20 100 03 4 0 0 4

OPEN ELECTIVE [ANY ONE]

OET 2.1 Libre Office 80 20 100 03 5 1 0 6

OET 2.2 Computer Fundamentals 80 20 100 03 5 1 0 6

PRACTICAL

HCP 2.1 Practical – I : Data Structures Lab. 40 10 50 1.1/2 0 0 4 2

HCP 2.2 Practical – II : RDBMS Lab. 40 10 50 1.1/2 0 0 4 2

SOFT CORE [ANY ONE]

SCP 2.1 Practical – III (a) : Networks Lab. 40 10 50 1.1/2 0 0 4 2

SCP 2.2 Practical – III (b) :Android Lab. 40 10 50 1.1/2 0 0 4 2

TOTAL FOR SECOND SEMESTER 440 110 550 24

Third Semester

HARD CORE

HCT 3.1 Advanced Java 80 20 100 03 4 0 0 4

HCT 3.2 Software Engineering 80 20 100 03 4 0 0 4

SOFT CORE [ANY ONE]

SCT 3.1 Data Science 80 20 100 03 4 0 0 4

SCT 3.2 Computer Graphics 80 20 100 03 4 0 0 4

OPEN ELECTIVE [ANY ONE]

OET 3.1 e-Commerce 80 20 100 03 5 1 0 6

OET 3.2 Information Security and Cyber Laws 80 20 100 03 5 1 0 6

PRACTICAL

HCP 3.1 Practical – I : Advanced Java Lab. 40 10 50 1.1/2 0 0 4 2

HCP 3.2 Practical - II : Software Engineering Lab. 40 10 50 1.1/2 0 0 4 2

SOFT CORE [ANY ONE]

SCP 3.1 Practical - III (a) : Data Science Lab. 40 10 50 1.1/2 0 0 4 2

SCP 3.2 Practical – III (b) : Computer Graphics Lab. 40 10 50 1.1/2 0 0 4 2

TOTAL FOR THIRD SEMESTER 440 110 550 24


Page | 3

Paper Code

Title of the Course Semester IA Total

Duration of

Theory / Practical

Exam. Hrs.

L T P Credits

Fourth Semester HARD CORE

HCT 4.1 Web Design 80 20 100 03 4 0 0 4

HCT 4.2 Problem Solving using Python 80 20 100 03 4 0 0 4

SOFT CORE [ANY ONE]

SCT 4.1 Digital Image Processing 80 20 100 03 4 0 0 4

SCT 4.2 Software Testing 80 20 100 03 4 0 0 4

SCT 4.3 Cloud Computing. 80 20 100 03 4 0 0 4

SCT 4.4 Cyber Security. 80 20 100 03 4 0 0 4

PRACTICAL

HCP 4.1 Practical – I : Web Design Lab. 40 10 50 1.1/2 0 0 4 2

HCP 4.2 Practical – II : Python Lab. 40 10 50 1.1/2 0 0 4 2

SOFT CORE [ANY ONE]

SCP 4.1 Practical – III (a) : DIP- Lab. 40 10 50 1.1/2 0 0 4 2

SCP 4.2 Practical – III (b) : Software Testing - Lab

40 10 50 1.1/2 0 0 4 2

SCP 4.3 Practical – III (c) : Cloud Computing- Lab.

40 10 50 1.1/2 0 0 4 2

SCP 4.4 Practical – III (d) : Cyber Security Lab.

40 10 50 1.1/2 0 0 4 2

HCMP 4.3 Major Project 90 for Project Evaluation (20 for Presentation + 10 for attending Conference/Seminar/Workshop + 60 for Project Report ),30 for Viva-voce Total 120 + IA 30 = 150 )

90+30=120 30 150 03 0 0 6 6

TOTAL FOR FOURTH SEMESTER

480 120 600 24

L – Lecture, T – Tutorials, P – Practical’s, 4 Credits of Theory = 4 Hours of Teaching Per Week, 2 Credits of Practical = 4hours Per Week


Page | 4

MASTER OF SCIENCE (M.Sc.) in COMPUTER SCIENCE SYLLABUS

( CBCS) Scheme) ( With effect from the academic year 2017-2018 and onwards)

I Semester: ( With effect from the academic year 2017-2018 and onwards )

Hard Core

HCT 1.1 : Digital Logic

HCT 1.2 : Object Oriented Programming with C++

HCT 1.3 : Programming in VB.NET

Soft Core ( Any One)

SCT 1.1 : Operating System Principles

SCT 1.2 : LINUX / SHELL Programming

Practical Hard Core

HCP 1.1 : Practical – I : Digital Logic Lab.

HCP 1.2 : Practical – II : C++ Lab.

HCP 1.3 : Practical – III : VB.NET Lab.

Practical Soft Core (Any One)

SCP 1.1 : Practical – IV (a) : O.S. Lab.

SCP 1.2 : Practical – IV (b) : Linux Lab.

II Semester: ( With effect from the academic year 2017-2018 and onwards )

Hard Core

HCT 2.1 : Data Structures using C++

HCT 2.2 : Relational Database Management System


SCT 2.1 : Data Communications & Networks

SCT 2.2 : Android Applications

Open Elective ( Any One)

OET 2.1 : Libre Office

OET 2.2 : Computer Fundamentals

Practical Hard Core

HCP 2.1 : Practical – I : Data Structures Lab.

HCP 2.2 : Practical – II: RDBMS Lab.

Practical Soft Core (Any One )

SCP 2.1 : Practical – III (a) : Networks Lab.

SCP 2.2 : Practical – III (b) : Android Lab.

III Semester: ( With effect from the academic year 2017-2018 and onwards )

Hard Core

HCT 3.1 : Advanced Java

HCT 3.2 : Software Engineering


SCT 3.1 : Data Science

SCT 3.2 : Computer Graphics

Open Elective ( Any One)

OET 3.1 : e-Commerce

OET 3.2 : Information Security and Cyber Law

Practical Hard Core

HCP 3.1 : Practical – I : Advanced Java Lab.

HCP 3.2 : Practical – II: Software Engineering Lab.


SCP 3.1 : Practical – III (a) : Data Science Lab.

SCP 3.2 : Practical – III (b) : Computer Graphics Lab.


Page | 5

IV Semester: ( With effect from the academic year 2017-2018 and onwards )

Hard Core

HCT 4.1 : Web Design

HCT 4.2 : Problem Solving using Python


SCT 4.1 : Digital Image Processing

SCT 4.2 : Software Testing

SCT 4.3 : Cloud Computing

SCT 4.4 : Cyber Security

Practical Hard Core

HCP 4.1 : Practical – I : Web Design Lab.

HCP 4.2 : Practical – II: Python Lab.


SCP 4.1 : Practical – III (a) : DIP Lab.

SCP 4.2 : Practical – III (b) : Software Testing Lab.

SCP 4.3 : Practical – III (c) : Cloud Computing Lab.

SCP 4.4 : Practical – III (d) : Cyber Security Lab.

HCMP 4.3 : Major Project ( 90 for Project Evaluation ( 20 for Presentation + 10 for attending

Conferences/Seminar/Workshop + 60 for Project Report ), 30 for Viva-voce Total 120 + IA 30 = 150 )

Note: Each Practical consists of two hours of Deskwork for program development and

Documentation and two hours of Computer work for implementation.


Page | 6

M.Sc. I SEMESTER

HARD CORE

HCT 1.1: DIGITAL LOGIC

Teaching: 4 Hrs./ Week Credits: 04

Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64

Preamble:

To undrestand the Number sysytem, Boolean algebra and Digital Logic Gates.

To describe, illustrate and analyze Combinational Logic circuits.

To understand the Simplification of Algebraic Equations.

To study and design Adders, Subtractors, Comarators, Decoders, Encoders, Multiplexers, Flip-

Flops, Counters, Registers and Computer.

UNIT I 16Hrs

Digital Computers and Digital Systems, Binary Number, Number Base Conversion, Octal and Hexadecimal

Number, Complements, Binary Codes, Binary Storage and Registers, Binary Logic and Integrated Circuits

,Definition of Boolean Algebra, Basic Theorems and Properties of Boolean Algebra ,Boolean Functions,

Canonical and Standard Forms, Digital Logic Gates.

UNIT II 16Hrs

Simplification of Boolean Function, Two ,Three and Four variable maps, Sum of Products and Product of

Sums Simplification, NAND and NOR implementation, Non degenerate forms, AND-OR-INVERT method

Determination and Selection of Prime- Implicants. Combinational Circuit, Design Procedure, Adders,

Subtractors, Code Conversion ,Analysis Procedure, Multilevel NAND and NOR circuits, Exclusive-OR and

Equivalence Functions.

UNIT III 16Hrs

Binary Parallel Adder, Decimal Adder ,Magnitude Comparators, Decoders, Multiplexers, Read-only memory

,Programmable Logic Array Sequential circuit. Flip –Flops , Analysis of Clocked Sequential Circuits , Flip-

Flop Excitation Tables, Design Procedure, Design of Counters, Design with State Equations.

UNIT IV 16Hrs

Registers, Shift Registers, Ripple Counters, Synchronous Counters, Timing Sequence, The Memory Unit ,

Example of Random Access Memory. Interregisters Transfer, Arithmetic logic and Shift Micro-operations,

Conditional Control Statement , Fixed –point binary data ,Overflow , Arithmetic Shifts, Decimal Data,

Floating-Point Data ,Non-numeric Data, Instruction Codes , Design of Simple Computer.

References:

1. Morris Mano M, Digital logic and computer design ,PHI.

2. Floyd and jain ,Digital Fundamentals,8/e , pearson education.

3. Alan N Marcovitz,Introduction to logic and computer design ,McGraw Hill.

4. Ronald J.Tocci,Digital Systems:Principal and applications,8/e ,pearson education.

5. Bartee J.C., Digital computer Fundamentals,6/e ,TMH.

6. Herbert Taub and Donald schilling , Digital intergrated electronics, McGraw Hill International Edition.

7. Ramesh S. Gaonkar, Microprocessor Architecture, Programming , and Application with the 8085,4/e Penram

International Publishers.


Page | 7

HCT 1.2 : OBJECT ORIENTED PROGRAMMING USING C++



Preamble:

To study the fundamentals of Object Oriented Programming concepts and techniques and

its benefits in object oriented design.

To learn the concept of Classes and Objects, Inheritance, File Handling and String

Handling.

To design object oriented solutions for small systems involving multiple objects.

Unit I 16 Hrs

Object Oriented Programming Paradigm, OOP Principles, Advantages of OOP, Salient features of C++

Language, The Structure of a C++ Program, Sample C++ Programs, Execution of a C++

program, Errors, Tokens, Keywords and Identifiers, Constants, Variables, Data types, Operators and

Expressions, Selection Statements, Iterative Statements, Functions, Arrays, Structures and Unions,

Pointers.

Unit II 16 Hrs

Classes and Objects: Class Definition and Access Specifiers Private. Public, Passing Objects as

Arguments, Returning Objects from Functions, Arrays of Objects , Arrays as Member Data, Static

Member Data, Static Member Functions, Friend Functions, Friend Class, Const Member Functions,

Const Objects, This pointer, Nesting of Member Functions Constructors and Destructors: Constructors

and their Characteristics, Types of Constructors, Default Constructor, Parameterized Constructors,

Copy Constructor, Dynamic Constructor, Destructor and its Characteristics Operator Overloading:

Syntax of Operator Overloading Function, Overloading Unary operators, Overloading Binary operators,

Overloading Array subscript operator [ ], Overloading Function call Operator ( ) , Overloading new

and delete Operators, Overloading operators using Friend Functions, Overloading >> and << operators,

Type Casting, Conversion from Basic type to Derived type and Vice-versa Conversion from one

Derived type to another Derived type and Vice-versa.

Unit III 16 Hrs

Inheritance: Single Level Inheritance, Multiple Inheritance, Multilevel Inheritance, Hierarchical

Inheritance, Hybrid Inheritance, Virtual Base Class, Pointer to Objects, Pointers to Derived Classes

and Virtual Functions, Pure Virtual Functions and Abstract Class, Constructors and Destructors in

Derived Classes, Constructors and Destructors in Multiple Inheritance, Virtual Destructor,

Private Inheritance, Protected Inheritance, Containers I/O Streams: Built-in Classes Supporting I/O,

Unformatted I/O Operations, Formatting of Outputs, IOS Class Functions and Flags, Manipulators,

Built-in Manipulators, User-Defined Manipulators. File Handling: Built-in Classes for File I/O

Operations, Types of Data Files (Text Files and Binary Files), Opening and Closing a File, Detecting

End of File, Text Files, Character I/O – put ( ), get( ) Member Functions, String I/O – The << operator

and the getline( ) Member Function, Mixed Data I/O – The << and >> Operators , Binary Files,

Objects I/O – write( ) and read( ) Member Functions, Random accessing of a Binary File (seekg( ),

seekp( ), tellg( ), tellp( ) Member Functions), Error Handling During File I/O Operations- fail( ), bad( ),

good( ), Command Line Arguments.


Page | 8

Unit IV 16Hrs

String Handling: String Class and its Constructors, The Assignment Operator, The Extraction Operator

>> and the Insertion Operator << , The Relational Operators, Concatenation , Member Functions of

String Class. Exception Handling: Exception Handling Mechanism, Throwing in one Function and

Catching in the other, Single Try Block -Multiple Catch Blocks, Catching all Exceptions in a single

catch block, Rethrowing an Exception, Specification of Exceptions. Templates: Class Templates, Class

Templates with Multiple Parameters, Function Templates, Function Templates with Multiple

Parameters, Member Function Templates, Overloading Template functions, Non-type Template

Arguments.

References:

1. M.T. Somashekara, Object Oriented Programming with C++ (2nd Edition), PHI Learning, 2012

2. E. Balagurusamy, Object Oriented Programming with C++, McGrawHill Publications,

3. Herbert Schildt, C++ The Complete Reference,Tata McGraw Hill Publication.

4. Al Stevens,C++ Programming, Wiely Publications.

5. S. B. Lippman& J. Lajoie, C++ Primer, 3rd Edition, Addison Wesley.

HCT 1.3: PROGRAMMING IN VB.NET



Preamble:

To learn the basics of Visual Programming.

To understand the Visual Programming Environment to develop interactive programs

using a Graphical User Interface (GUI).

To study database programming with ADO.NET.

UNIT I 16Hrs

Introduction to .NET Framework Features and Architecture, CLR, Common Type System, MSIL,

Assemblies and Class Libraries. Introduction to Visual Studio, Project Basics, Type of Project in .Net,

IDE of VB.NET-Menu bar, Toolbar, Solution Explorer, Toolbox, Properties Window, Form Designer,

Object Browser. The environment: Editor tab, Format tab, General tab, Docking tab. Visual

Development and Event Driven Programming- Methods and Events.

UNIT II 16Hrs

The VB.NET Language – Variables- Declaring variables, Data Type of variables, Forcing variables

declarations, Scope and lifetime of a variable, Constants, Arrays, Types of arrays, Control array,

Collections, Subroutines, Functions, Passing variable Number of Argument, Optional Argument,

Returning Value from Function. Control Flow Statements: Conditional Statement, Loop Statement,

Msgbox and Inputbox.


Page | 9

UNIT III 16Hrs

Working with Forms: Loading, Showing and Hiding Forms, Controlling One Form within Another.

GUI Programming with Windows Form: Textbox, Label, Button, Listbox, Combobox, PictureBox,

Radio Button, Panel, Scroll Bar, Timer, ListView, TreeView, Toolbar, StatusBar, Their Properties,

Methods and Events. OpenFileDailog, SaveFileDialog, Front Dialog, Color Dialog, Print Dialog. Link

Label. Designing Menus: ContextMenu, Access and Shortcut Keys.

UNIT IV 16Hrs

Database Programming with ADO.NET- Overview of ADO.NET, from ADO to ADO.NET,

Accessing Data using Server Explorer. Creating Connection, Command, Data Adapter and Data Set

with OLEDB and SQLDB. Display Data on Data Bound Controls, Display Data on Data Grid.

References:

1. Steven Holzer VB.NET Programming, Dreamtech Publications.

2. Evangelos Petroutsos, Mastering VB.NET, BPB Publications.

3. Introduction to .NET frame work, Wrox Publications.

4. David I. Scheinder, An Introduction to Programming Using Visual Basics .Net, 5/e, PHT

5. Shirish Chavan, Visual Basic .NET, Pearson education.

6. Schneider, An Introduction to Programming Using Visual Basic .NET , 5/e, PHI.

SOFT CORE (ANY ONE)

SCT 1.1 : OPERATING SYSTEM PRINCIPLES


Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64 Preamble:

To understand the basics of Operating Systems Structure and Operating system

services.

To describe, illustrate and analyze the concept of Process Management and Mutual

Execution, Deadlock and different approaches to memory management.

To understand the concepts of Security and Linux .

Unit I 16Hrs

Introduction To Operating System ,Mainframe Systems, Desktop System, Multiprocessor Systems,

Distributed Systems, Clustered Systems, Real - Time Systems, Handheld Systems. System Structures:

System Components, Operating – System Services, System Calls, System Programs, Virtual

Machines, System Design and Implementation, System Generation.

Unit II 16Hrs

Process, Process States, Process Description, Process Control, Execution of the Operating System,

Processes and Threads, Symmetric Multiprocessing (SMP), Micro kernels, CPU Scheduler and

Scheduling. Principles of Concurrency, Mutual Exclusion: Hardware Support, Semaphores, Monitors

Message Passing, Readers/Writes Problem.


Page | 10

Unit III 16Hrs

Definition of Deadlock, Principles of Deadlock, Deadlock Prevention, Deadlock Avoidance,

Deadlock Detection, Memory Management: Swapping, Contiguous Memory Allocation, Paging,

Segmentation, Segmentation with Paging, Demand Paging, Process Creation, Page Replacement,

Allocation of Frames, Thrashing.

Unit IV 16Hrs

File Concept, Access Methods, Directory Structure, File System Mounting, File Sharing, Protection,

File – System Structure, File – System Implementation, Directory Implementation, Allocation

Methods, Free–Space Management, Disk Structure, Disk Scheduling, Disk Management ,The Security

Problem, User Authentication, Program Threats, System Threats.

References:

1. Silberschatz, Galvin, Gagne, “Operating System Concepts” John Wiley, Sixth Edition, 2004

2. William Stallings, “Operating System Internals and Design Principles” Pearson, 6thedition, 2012

3. Dhananjay M. Dhamdhere, “Operating Systems – A Concept – Based Approach”, Tata McGraw – Hill,

3 rd Edition, 2012.

SCT 1.2 : LINUX AND SHELL PROGRAMMING



Preamble:

To understand and make effective use of Linux utilities and Shell scripting language

(bash) to solve Problems.

To implement in C some standard Linux utilities using system calls.

To develop the skills necessary for systems programming including file system

programming, process the signal management, and inter-process communication.

To develop the basic skills required to write network programs using Sockets.

UNIT I 16Hrs

Linux Utilities-File handling utilities, Security by file permissions, Process utilities, Disk utilities,

Networking commands, Filters, Text processing utilities and Backup utilities. Sed-Scripts, Operation,

Addresses, Commands, awk-Execution, Fields and Records, Scripts, Operation, Patterns, Actions,

Associative Arrays, String and Mathematical functions, System commands in awk, Applications. Shell

programming with Bourne again shell(bash)- Introduction, Shell responsibilities, Pipes and

Redirection, Documents, Running a Shell Script, The Shell as a Programming Language, Shell Meta

Characters, File Name Substitution, Shell Variables, Command Substitution, Shell Commands,

Arithmetic in Shell, Shell Script Examples, Interrupt Processing, Functions, Debugging Shell Scripts.


Page | 11

UNIT II 16Hrs

Files and Directories- File Concept, File types, File System Structure, File Metadata-Inodes, Kernel

support for files, System Calls for file I/O operations- open, create, read, write, close, lseek, dup2, file

status information-stat family, file and record locking- fcntl function, file permissions - chmod,

fchmod, file ownership-chown, lchown, links-soft and hard links - symlink, link, unlink. Directories-

Creating, removing and changing Directories-mkdir, rmdir, chdir, obtaining current working

directory-getcwd, Scanning Directories-opendir, readdir, closedir, rewinddir functions.

UNIT III 16Hrs

Process - Process concept, Layout of a C program image in main memory. Process environment-

environment list, environment variables, getenv, setenv, Kernel support for process, Process

Identification, Process Control - Process Creation, Replacing a Process image, waiting for a process,

Process Termination, Zombie process, Orphan process, System call interface for process management-

fork, vfork, exit, wait, waitpid, exec family. Interprocess Communication - Introduction to IPC, IPC

between processes on a single computer system, IPC between processes on different systems, pipes-

creation, IPC between related processes using unnamed pipes, FIFOs- creation, IPC between

unrelated processes using FIFOs(Named pipes), Differences between unnamed and named pipes,

popen and pclose library functions.

UNIT IV 16Hrs

Shared Memory- Kernel support for shared memory, APIs for shared memory, Shared memory

example. Sockets- Introduction to Berkeley Sockets, IPC over a network, Client-Server model, Socket

address structures (unix domain and Internet domain), Socket system calls for connection oriented

protocol and connectionless protocol, example-client/server programs-Single Server-Client

connection, Multiple simultaneous clients, Socket options-set socket and functional system calls,

Comparison of IPC mechanisms.

References:

1. Unix System Programming using C++, T. Chan, PHI.

2. Unix Concepts and Applications, 4th Edition, Sumitabha Das, TMH.

3. Unix Network Programming, W. R. Stevens, PHI.

4. Beginning Linux Programming, 4th Edition, N. Mathew, R. Stones, Wrox, Wiley India Edition.

5. Unix for programmers and users, 3rd Edition, Graham Glass, King Ables, Pearson.


Page | 12

PRACTICALS

HCP 1.1 PRACTICAL - I : DIGITAL LOGIC LAB

Practical: 4 hrs./ Week Credits: 02

Max Marks: 40, Cont. Assessments: 10

Lab Assignment shall be carried out based on the paper HCT 1.1 including the following

Realization of NOT, OR, AND, XOR, XNOR gates using universal gates

Gray to Binary conversion & vice-versa.

Code conversion between BCD and EXCESS-3

ODD and even parity generation and checking.

4-bit comparator circuit

Design of combinational circuit to drive seven-segment display

Design of combinational circuits using multiplexer

Adder/Subtractor circuits using Full-Adder using IC and OR logic gates.

BCD Adder circuit using IC and OR logic gates

Realization of RS, JK, and D flip flops using Universal logic gates

Realization of Asynchronous up/down counter

Realization of Synchronous Mod-N counter.

HCP 1.2 PRACTICAL-II : C++ LAB

Practical: 4 Hrs./ Week Credits: 02 Max Marks: 40, Cont. Assessments: 10

Assignment shall be carried out to include the following features of C++:

Classes

Objects

Constructors and Destructors

Function Overloading

Operator Overloading

Friend Functions

Inheritance

Virtual Functions

Abstract Classes

Exception Handling and Templates, STL.


Page | 13

HCP 1.3 Practical-III : VB.NET LAB

Practical: 4 hrs./ Week Credits: 02 Max Marks: 40, Cont. Assessments: 10

Assignment shall be carried out to include the following features:

Decision and iterative constructs

Procedures, functions and exceptional handling

Arrays, enumeration and structure

Working with forms, GUI interface with windows forms and designing menus

Objects and classes

Overloading, inheritance, over riding

Interfaces, namespaces and collections

Events and delegates

Multithreading and garbage collection

Database programming Components and assemblies

SOFT CORE (ANY ONE)

SCP 1.1 PRACTICAL-IV (a) : OPERATING SYSTEM LAB


Lab. Assignment shall be carried out to simulate the following OS features using c/c++

CPU scheduling algorithms

Memory management scheme, demand paging scheme

Disk scheduling algorithms

Inter-process communication

SCP 1.2 PRACTICAL-IV (b) : LINUX LAB



Basic LINUX commands.

Use of LINUX directories.

Use of Process management.

Use of Memory management.

Inter process communication.

APIs for shared memory


Page | 14

M.Sc. II SEMESTER

HARD CORE

HCT 2.1: DATA STRUCTURES USING C++



Preamble:

To explain the fundamentals of data structures and their applications essential for

programming/problem solving.

To Analyze and Evaluate the concept of recursion , sorting and searching algorithms.

To study and analyze the operations on Stack, Queues, Lists, Trees and Graphs.

Unit I 16 Hrs

Introduction to Data Structures: Definition of Data structure, overview of data structures, Arrays, Array

representation,operation on arrays, Searching techniques: Linear search , Binary search. Sorting:, Insertion

sort, Selection sort, Bubble sort, Quick sort, Merge Sort and Heap sort (Complexity, Advantages,

Disadvantages, Implementation).

Unit II 16 Hrs

Introduction to Linked list: Linked List concepts, Single linked list , Representation of single linked list,

Operations on linked list-insertion into a linked list, deletion of a linked list, Circular linked list, Double

linked list, Linked list applications.

Unit III 16Hrs

Stack: definition and examples, Stack operations–PUSH, POP, STATUS, Representation of stacks on

Arrays and Linked list, Applications of Stacks, definition of Expression (Infix, postfix, prefix),

Conversion of Expression, Evaluation of Expression. Recursion: Definition of recursion and its examples,

Designing recursive algorithms, Implementation of Factorial function, Implementation of Fibonacci

sequence and Towers of Hanoi Problem. Queues: Definition of queue, Operations of queues, Types of

queues, Representation of queues, Applications of queues.

Unit IV 16 Hrs

Trees: Basic Terminology, Binary tree, Operations of Binary tress(Insertion, Deletion, Travarsal,

Merging), Binary Tree Travarsal(Inorder, postorder, preorder), Expression trees, Applications of binary

tree. Graph: Terminology, Operations on graphs, graph traversal (BFS, DFS) , Applications of graphs,

Search trees in BST, AVL trees.

References:

1. Samanta. D., Classic Data Structures, PHI.

2. R. F. Gilberg and B. A. Forouzan, Data Structures-A Pseudocode Approach with C++, Thomson Learning.

3. Mark A. Weiss, Data Structures and Algorithm Analysis in C++, 2/e, Pearson Education.

4. Paul S. Wang, Standard C++ with Object Oriented Programming, Thomson Learning.

5. B. A. Forouzon, R. F. Gilberge, Computer Science: A Structured Approach Using C++, Thomson Learning.

6. Herbert Schildt, C++-The Complete Reference, TMH.

7. Langsam Yedidyah, Augenstein Moshe J., Tenenbaum Aaron M., Data Structures Using C C++,

2/e,PHI/Pearson Education.


Page | 15

HCT 2.2: RELATIONAL DATABASE MANAGEMENT SYSTEM



Preamble:

To understand the basic concepts and the applications of database systems.

To learn the basics of SQL and construct queries using SQL.

To understand the relational database design principles.

To become familiar with the basic concepts of Relational Database Management System,

Relational Database design, System Implementation Techniques and Client-Server

communication.

UNIT I 16Hrs

Database, Characteristics of Database approach, Database users, Advantages of Database systems,

Database system Concepts and Architecture, Data models, Schemas and Instances, the 3-schema

Architecture, Data Independence, DBMS languages and Interfaces, DBMS component modules and

Database system utilities. Overview of Relational Data Base Management System, Data modelling

using Entity-Relationship Model, Relational Data Model.

UNIT II 16Hrs

Relational Model Concepts, Relational Constraints and Relational Database Schemas, Update

operations dealing with constraint violations, Relational algebra, Relational calculas, and Relational

database design by ER to relational mapping, Relational Database Manipulation in SQL, Data

Definition in SQL, Basic Data retrieval, Condition Specification, Arithmetic and Aggregate operators,

SQL join, set, manipulation, categorization, updates, views and updates.

UNIT III 16Hrs

Relational Database Design, Anomalies in a database-a consequence of bad design, Functional

dependences, Normal forms based on primary keys, General definitions of Second and Third Normal

Forms, Boyce Codd Normal Form, Multivalued dependencies and Fourth Normal Form, join

dependencies and Fifth Normal Form, other dependencies, Database design and implementation

process, query processing and optimization, Transaction processing concepts, concurrency control

techniques, Database recovery techniques, Database security and authorization.

UNIT IV 16Hrs

Advanced Database concepts, Concept of Object oriented database systems, Relational database

systems, Distributed database concepts, Types of Distributed database systems, and an Overview of

client-server architecture. Client and server communication, SQL, Data Definition Language(DDL)-

creating, altering and dropping tables, Data Manipulation Language(DML)-select insert, update, delete

commands, Transaction control using SQL-Commit, Rollback, savepoint command, Error handling

built in PL/SQL Exceptions, User defined exceptions.


Page | 16

References:

1. Elmasri and Navathe, Fundamentals of Database Systems, Pearson Education.

2. Bipin C Desai, An Introduction to Database systems, Galgotia Publication.

3. Kroenke David M, Database Processing:Fundamentals,Design and Implementation,PHI.

4. Henry F Korth, Database System Concepts, Pearson Education.

SOFT CORE (ANY ONE)

SCT 2.1: DATA COMMUNICATIONS AND NETWORKS



Preamble:

To learn the transmission technique of digital data between two or more computers.

To understand the basics of data communication and various types of computer

networks

To analyse and Compare various Network architectures.

To study details about ISO/OSI model layer, its functions, type of data transmission and

speed of data transmission.

UNIT I 16Hrs

Data Communications: Components, Direction of data flow, Networks, Components and Categories,

Types of connections, Topologies-protocols and standards, ISO/OSI model, Transmission media,

Coaxial cable, Fiber optics, Line coding, Modems.

UNIT II 16Hrs

Data Link Layer: Error detection and correction, Parity, LRC, CRC, Hamming code, low control and

error control, stop and wait, go back-N ARQ, selective repeat ARQ-sliding window, HDLC, LAN.

UNIT III 16Hrs

Network Layer: Internetworks, Packet Switching and Datagram approach, IP addressing methods,

Subnetting, Routing, Distance Vector Routing, Link State Routing.

UNIT IV 16Hrs

Transport Layer: Duties of Transport layer, Multiplexing, Demultiplexing, Sockets, User Datagram

Protocol(UDP),Transmission Control Protocol(TCP),Congestion Control, Quality of

services(QOS),Integrated Services. Application Layer: Domain Name Space(DNS), SMTP FTP,

HTTP-WWW.


Page | 17

References:

1. Behrouz A Forouzan, Data Communications and Networking, Tata McGraw Hill.

2. William A Shay, Understanding Communications and Networks, Thomson Learning.

3. William Stallings, Data and Computer Communications,7/e, Pearson Education.

4. Stevens et Al, Unix Network Programming-The sockets and networking API,Vol.1/3/e, PHI.

5. Stevens et Al, Unix Network Programming-Interprocess Communication,Vol.2,2/e, PHI.

6. Ames Chellis Charles Perkins, Matthew Strebe, Networking Essentials: Study Guide MCSE,

Second Edition.

SCT 2.2: ANDROID APPLICATIONS



Preamble:

To learn the basic concepts of Android Programming.

To study the history of Android and anatomy of Android Application.

To understand and implement Android Applications like working with Notifications,

working with Services, and to manage User account and synchronization of data.

Unit I 16Hrs

Introducing Android, History of Mobile Software Development, The Open Handset Alliance, Android

Platform Differences, The Android Platform, Setting Up Android Development Environment,

Configuring Development Environment, Exploring the Android SDK. Writing sample Android

Application, Testing Development Environment and Building the Android Application.

Unit II 16Hrs

Understanding the Anatomy of an Android Application, Defining the Application Using the Android

Manifest File, Managing Application Resources: What Are Resources? Setting Simple Resource

Values Using Eclipse and Working with Resources.

Unit III 16Hrs

Exploring User Interface Screen Elements, Designing User Interfaces with Layouts, Drawing and

Working with Animation.

Unit IV 16Hrs

Using Android Data and Storage APIs, Sharing Data between Applications with Content Providers,

Android Application Design Principles: Working with Notifications, Working with Services,

Managing User Accounts and Synchronizing User Data.


Page | 18

References:

1. Lauren Darcey and Shane Conder, “Android Wireless Application Development”, Pearson

Education, 2nd Edition, 2011.

2. W. Frank Ableson, Robi Sen, Chris King, “Android in Action”, 2nd Edition, Manning

Publications, 2011.

3. Chris Haseman, “Android Essentials”, Apress Publications, 2008

OPEN ELECTIVE (ANY ONE)

OET 2.1: LIBRE OFFICE



Preamble :

To understand the principles of Office Automation Techniques.

To explore the concept of Open Source Software’s.

Unit I 16Hrs

Introducing Writer, Setting up Writer, Working with Text, Formatting Pages, Digital signing of

documents. Introducing to Styles, Working with Styles, Working with Graphics, Working with Tables,

Working with Templates, Using mail Merge, Tables of Contents Indexes, Working with Master

Documents, Working with Fields.

Unit II 16Hrs

Introducing to Calc, Entering Editing & Formatting Data, Creating Charts and Graphs, Using Styles

and Templates in Calc, Using Graphics in Calc, Using Formulas and functions.

Unit III 16Hrs

Using Pivot Tables, Data Analysis, linking calc data, Sharing and reviewing documents, Calc macros,

Calc as simple database, Setting up and customizing Calc.

Unit IV 16Hrs

Introducing to Impress, Using Slide Masters, Styles and Templates, Adding and Formatting Text,

Adding and Formatting Pictures, Managing Graphic Object. Formatting Graphic Objects, Including

Spreadsheets Charts & Other Objects, Adding and Formatting Slides Notes and Handouts, Slide

Shows, Printing E-mailing Exporting and Saving Slide Shows, Setting Up and Customizing Impress.

References:

1. “ Writer Guide “, IIT Bombay Spoken Tutorial, Shroff Publishers,2014

2. “ Calc Guide “, IIT Bombay Spoken Tutorial, Shroff Publishers,2014

3. “ Impress Guide “, IIT Bombay Spoken Tutorial, Shroff Publishers,2014


Page | 19

OET 2.2 : COMPUTER FUNDAMENTALS



Preamble:

To explore of basics of Computer Science, including evolution of computers, basic

anatomy of computers, applications of computers.

To understand the need and purpose of software’s.

UNIT I 16Hrs

Evolution of Computers - Generations, Types of computers, Computer system characteristics, Basic

components of a Digital Computer - Control unit, ALU, Input/Output functions and memory, Memory

addressing capability of a CPU, Word length of a computer,processing speed of a computer, Computer

Classification.

UNIT II 16Hrs

Input/Output Units-: Keyboard, Mouse, Trackball, Joystick, Digitizing tablet, Scanners, Digital

Camera, MICR, CR, OMR, Bar-code Reader, Voice Recognition, Light pen, Touch Screen, Monitors

and types of monitor -Digital, Analog, Size, Resolution, Refresh Rate, Dot Pitch, Video Standard -

VGA, SVGA, XGA etc, Printers and types - Daisy wheel, Dot Matrix, Inkjet, Laser, Line Printer,

Plotter, Sound Card and Speakers.

UNIT III 16Hrs

Memory - RAM, ROM, EPROM, PROM and other types of memory, Storage fundamentals - Primary

Vs Secondary Data Storage, Various Storage Devices - Magnetic Tape, Magnetic Disks, Cartridge

Tape, Hard Disk Drives, Floppy Disks (Winchester Disk), Optical Disks, CD, VCD, CD-R, CD-RW,

Zip Drive, flash drives Video Disk , Blue Ray Disc, SD/MMC Memory cards, Physical structure of

floppy & hard disk, drive naming conventions in PC.DVD, DVD-RW, USB Pen drive.

UNIT IV 16Hrs

Software and its Need, Types of Software - System software, Application software, System Software -

Operating System, Utility Program, Algorithms , Flow Charts - Symbols, Rules for making Flow

chart, Programming languages, Assemblers, Compilers and Interpreter, Computer Applications in

Business. Introduction to Internet, Connecting to the Internet Hardware , Software and ISPs, Search

Engines, Web Portals, Online Shopping, Email – Types of email, Compose and send a message. Reply

to a message, Working with emails.

References:

1. Computer Fundamentals – B. Ram – New Age International Publishers

2. S.K.Basandra, “Computers Today “, Galgotia Publications.

3. Computer Fundamentals – P. K. Sinha – BPB Publication.

4. PC Software – Shree Sai Prakashan, Meerut.


Page | 20

PRACTICALS

HCP 2.1 PRACTICAL-I : DATA STRUCTURES LAB


Data Structure algorithms shall be implemented using C++.

Linked lists: inserting, deleting, inverting a linked list

Stacks and Queues: adding, deleting elements

Circular Queue: Adding & deleting elements

Evaluation of Arithmetic expressions

Polynomial addition, Polynomial multiplication

Sparse Matrices: Multiplication, addition.

Recursive and Nonrecursive traversal of Trees

Threaded binary tree traversal. AVL tree implementation

Application of Trees.

Application of sorting and searching algorithms

HCP 2.2 Practical-II : RDBMS LAB



SQL : Data definition in SQL, basic data retrieval, condition specification, arithmetic and

Aggregate operators, SQL join, set manipulation, categorization, updates, views, views and

updates.

To develop a logical and physical database design for the given problem.

The logical design performs the following tasks:

1) Map the ER/EER diagrams to a relational schema.

2) Identify primary keys, include all necessary foreign keys and indicate referential integrity

constraints.

3)Identify the functional dependencies in each relation,

4) Normalize to the highest normal form possible.


Page | 21

SOFT CORE (ANY ONE)

SCP 2.1 PRACTICAL-III(a) : NETWORKS LAB



For error detecting code using CRC-CCITT (16-bits).

Simple RSA algorithm to encrypt and decrypt the data.

Hamming Code generation for error detection and correction.

Congestion control using Leaky bucket algorithm

A simple form with input fields for a name and an email address

Using an understanding and assignment submission on the following commands: If con fig,

net stat, ping, arp, telnet, fttp, ftp, finger

To find and print the address of a local machine

To download a web page

Simple web browser

A client / server program where in when the client makes a connection to the server, the

server sends

the system details of the server machine along with date and time

Construct datagram packet to receive data

By using LAN trainer kit for LAN protocols

SCP 2.2 PRACTICAL-III(b) : ANDROID LAB

Practical: 4 hrs./ Week Credits: 02

Max Marks: 40, Cont. Assessments: 10


To add and create Android Projects in Eclipse.

To create Android Virtual Device.

Adding Logging support, media support, and location based services to Android

applications.

Creating instances with Action and Data.

Configuration of Android Manifest File.

Working with External Libraries, Permissions, Storing Graphics, Animation, Menus and

Files.

Working with String Arrays, Boolean Resources, Integer Resources, Colors, Images and

Layouts.

Using Buttons, Check Boxes and Radio Groups.

Creating a simple Text Notification with an Icon.

Working with the Notification Queue and updating Notification.

Creating a service, controlling a service, Choosing a remote backup service and registering

the backup agent.

../../../Documents%20and%20Settings/ggr/Desktop/examples/03/3-1.html


Page | 22

M.Sc. III SEMESTER

HARD CORE

HCT 3.1 : ADVANCED JAVA



Preamble :

To introduce the concepts and principles of Java Programming language and to design

and implement object oriented solutions to simple and complex problems.

To give students experience in Java Programming and program development within an

integrated development environment.

To introduce the concepts of Advanced Java Programming.

UNIT I 16Hrs

History and design features of JAVA, How java works, Basics of JAVA. Classes, Objects and

Methods Defining a class, Adding variables and Methods, Creating objects constructors, class

inheritance, Basics types, Using super, Multi level hierarchy, Abstract and Final classes, Object class,

Packages and Interfaces, Access protection, Extending interfaces, Packages. Exception Handling,

Fundamentals exception types, Uncaught exceptions, Throws, Throw, try -catch, Final, Built in

exceptions, Creating your own exceptions.

UNIT II 16Hrs

Applet Programming - Creating and executing Java applets, inserting applets in a web page, Java

security. Multithreading Fundamentals, Java Thread model: priorities, synchronization, messaging,

thread class, Runnable interface, Interthread communication, suspending, resuming and stopping

threads. Input/Output -Basics, Streams, Byte and Character streams, predefined streams, reading and

writing from console and files .Using standard Java Packages (lang,util,io) Networking - Basics,

networking classes and interfaces, using java.net package, doing TCP/IP and Datagram programming.

UNIT III 16Hrs

AWT Classes, Event Handling and Swing classes, AWT Programming, Working with windows,

Graphics and Text, using AWT controls, Layout managers and menus, Handling image, animation,

sound and video. Event Handling-Different mechanism, the Delegation Event Model, Event Classes,

Event Listener interfaces, Adapter and Inner Classes. Java Swing –Java applet, Icons and Labels, Text

fields, Buttons, Combo Boxes, Tabbed and Scroll Panes, Trees, Tables. JDBC-Setting the JDBC

connectivity with a backend database.

UNIT IV 16Hrs

Advanced Java Basic Review: Data Structures - Collection classes - Event handling-Multithreading -

Byte code Interpretation - Customizing application -Java streaming-Networking. Distributed

Computing : Lookup Services –JDBC Technology Servlets. Java Bean and Swing: concepts - Events

in bean box – Bean customization - Persistence - Application - deployment using swing - Advanced

swing techniques - JAR file handling.


Page | 23

References:

1. M.T.Somshekara et al. “ Object Oriented Programming with Java “, PHI Learning, New Delhi, 2017

2. Patrick Naughton And Herbert Schildt, Java The Complete Reference, TMH Publication

3. Cay S. Horstmann and Gary Cornell, Core JAVA 2, Volume-I, 7/e, Pearson Education

4. Bruce Eckel, Thinking in Java, 3/e, Prentice Hall.

5. C. Muthu, Programming with JAVA, Thomson-Vijay Nicole.

6. Partrick Naughton, Herbert Schidlt, JAVA 2 -The Complete Reference, 4/e, Tata

7. Calvin Austin and Monica Pawlan, Advanced Programming for the Java 2 Platform 2000.

HCT 3.2: SOFTWARE ENGINEERING



Preamble:

To understand the concept of software process models, software requirements and SRS

document.

To understand the importance, limitations and challenges of testing process.

To learn software testing approaches and to differentiate different testing methodologies.

Unit I 16 Hrs

Introduction Software and Software Engineering, The Software Process, Software Engineering

Practice. Software Process Models- The Waterfall Model, Incremental Process Model, Evolutionary

Process Model, Concurrent Model. Requirements Engineering, Establishing the Groundwork, Eliciting

Requirements, Developing Use Cases, Building the Requirements Model, Negotiating Requirements,

Validating Requirements. Requirements Modeling- Scenario-Based Modeling, UML Models that

supplement the Use Case.

Unit II 16Hrs

Software Design: Introduction, Objectives of Design, Modularity-Module Coupling, Module

Cohesion, Relationship between Cohesion and Coupling, Strategy of Design, Functional oriented

design, IEEE recommended practice for software design descriptions, Introduction to Object Oriented

Design. Case study of library management system. Software testing strategies: Concepts, Verification

and Validation, Unit Testing, Integration Testing-Top down and bottom up Integration, Regression

Testing, Smoke Testing, Alpha and Beta Testing. System testing: Recovery Testing, Security Testing,

Stress Testing, Performance Testing, Deployment Testing.

Unit III 16Hrs

Testing Conventional Applications: Testability, Test characteristics, White Box Testing, Basis path

Testing, Flow graph notation, Independent program paths, cyclomatic complexity, Deriving test cases,

Graph matrices, control structure testing. Black box testing: Equivalence Partitioning, Boundary

Value Analysis, Orthogonal array testing. Testing web applications: Testing concepts for web

applications, Content testing, User interface testing, Configuration testing, Security testing,

Performance testing-Load and Stress testing.


Page | 24

Unit IV 16Hrs

Estimation For Software Projects: Observation and Estimation, The Project Planning Process,

Software Scope and Feasibility, Resources, Software Project Estimation, Decomposition Techniques,

The COCOMO II Model, Specialized Estimation Techniques. Software Process Improvement:

Capability Maturity Model Integration (CMMI), other Software Improvement Frameworks.

References:

1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill /7e

2. K.K. Aggarwal , Yogesh Singh, Software Engineering –New Age International Publishers/3rd

Edition.

3. K.V.K.K. Prasad, “Software Testing Tools”, Dreamtech Press.

4. Ian Sommerville, Software engineering, Pearson education Asia, 9th edition.

5. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.

SOFT CORE (ANY ONE)

SCT 3.1: DATA SCIENCE

Teaching: 4 Hrs. / Week Credits: 04


Preamble:

To study the Data mining principles, techniques and mining methods.

To learn the concept of cluster analysis, evaluation of clusters.

To describe and analyze clustering techniques in details for better organization and retrieval of

data.

Unit I 16Hrs

Fundamentals of Data mining, Data Mining Functionalities, Classification of Data Mining systems,

Data Mining Task Primitives, Integration of a Data Mining System with a Database or a Data

Warehouse System, Major issues in Data Mining. Data Preprocessing: Need for Preprocessing the

Data, Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and

Concept Hierarchy Generation.

Unit II 16Hrs

Mining Frequent Patterns, Associations and Correlations: Basic Concepts, Efficient and Scalable

Frequent Itemset Mining Methods, Mining various kinds of Association Rules, From Association

Mining to Correlation Analysis, Constraint-Based Association Mining.

Unit III 16Hrs

Classification: Basic Concepts, Decision tree induction, Bays Classification Methods, Rule-Based

classification, Model evaluation and selection, Techniques to improve classification accuracy.


Page | 25

Unit IV 16Hrs

Cluster Analysis: Basic concepts and methods: Cluster Analysis, Partitioning methods, Hierarchical

Methods, Density-based methods, Grid-Based Methods, Evaluation of clustering. Data mining trends

and research frontiers: Mining complex data types, other methodologies of data mining, Data mining

applications.

References:

1. “Data Mining Techniques”, Arun K Pujari, 2nd edition, Universities Press.

2. “Data Warehousing in the Real World”, Sam Aanhory & Dennis Murray Pearson Edn Asia.

3. “Insight into Data Mining”, K.P.Soman, S.Diwakar, V.Ajay, PHI, 2008.

4. “Data Warehousing Fundamentals”, Paulraj Ponnaiah Wiley, student Edition

5. “Data Mining Concepts and Techniques”, Jiawei Han, Micheline Kamber, Jian Pei ELSEVIER(MK)

3rd edition 2012.

SCT 3.2: COMPUTER GRAPHICS

Teaching: 4 Hrs/ Week Credits: 04


Preamble:

To understand the key concepts of Computer Graphics.

To introduce the Basic Transformations, Computer Animation and Applications.

Unit I 16Hrs

A Survey of Computer Graphics, Overview of Graphics systems: Video Display Devices, Raster-Scan

System, Random-Scan Systems, Graphics Monitors and Workstations, Input Devices, Graphics

Software.

Unit II 16Hrs

Points and Lines, Line-Drawing Algorithms, Circle-Generating Algorithms, Ellipse-Generating

Algorithms, Parallel Curve Algorithms, Pixel Addressing, Filled-Area Primitives, Line Attributes,

Curve Attributes, Colour and Grayscale Levels, Area-Fill Attributes,

Unit III 16Hrs

Two Dimensional Geometric Transformation, Basic Transformations, Matrix Representations and

Homogeneous Coordinates, Composite Transformations, Transformation Function, Raster Methods

for Transformation, Three-Dimensional Concepts, Three-Dimensional Display Methods, Three-

Dimensional Graphics Packages.


Page | 26

Unit IV 16Hrs

Colour Models and Colour Applications: Intuitive Colour Concepts, RGB Colour Model, YIQ Colour

Model, Conversion Between HSV and RGB Models, Colour Selection and Applications, Computer

Animation, Design of Animation Sequences, General Computer-Animation Functions, Raster

Animations, Computer-Animation Languages, Key-Frame Systems, Morphing, Simulating

Accelerations, Motion Specifications, Direct Motion Specification.

References:

1. Donald Hearn and M. Pauline Baker, Computer Graphics-C version, 2/e, Pearson Education.

2. James D. Foley, Andres Van Dam, Steven K. Feiner, and John F. Hughies, Computer Graphics- Principles

and Practice, 2/e, Pearson Education(2006).

3. Francis S. Hill Jr, Computer Graphics using open GL, 2/e. Pearson Education.

4. Roy A. Plastock and Zhigarg Xiang, Schaum's Outline of Computer Graphics, 2/e, TMH.

OPEN ELECTIVE(ANY ONE)

OET 3.1: e-COMMERCE Teaching: 4 Hrs/ Week Credits: 04

Max Marks: 80, Cont. Assessments: 20 Total Teaching Hrs: 64 Preamble :

To understand the process of e-Commerce and Business strategy involved in it

To acquaint the students with modern business practices and to provide an overview of the

role of technology in business transactions. Unit I 16Hrs

Introduction to e-Commerce: Introduction, An Overview of e-Commerce - Cutting edge, e-Commerce

Framework, Evolution of e-Commerce: History of e-Commerce, Advantages and Disadvantage of e-

Commerce, Roadmap of e-Commerce in India.

Unit II 16Hrs

Network Infrastructure: Introduction, Network Infrastructure- An Overview, The Internet Hierarchy,

Basic Blocks of e-Commerce, Networks layers and TCP/IP protocols, The Advantages of Internet,

World Wide Web, e-Commerce Infrastructure: Introduction, e-commerce Infrastructure-An

Overview, Hardware, Server Operating System, Software, Network Website.

Unit III 16Hrs

Managing the e-Enterprise: Introduction to e-Enterprise, Managing the e-Enterprise, e-business

Enterprise, Comparison between Conventional Design and e-organisation, Organisation of Business in

an e-Enterprise e-Commerce Process Models: Introduction, Business Models, e-business Models

Based on the Relationship of Transaction Parties, e-commerce Sales Life Cycle (ESLC) Model.


Page | 27

Unit IV 16Hrs

Electronic Payment Systems: Electronic Payment Systems, Electronic Cash, Smart Cards and

Electronic Payment Systems, Credit Card Based Electronic Payment Systems, Risks and Electronic

Payment Systems, Electronic Data Interchange(EDI): The Meaning of EDI, History of EDI, EDI

Working Concept, Implementation difficulties of EDI, Financial EDI, EDI and Internet, e-Marketing:

The scope of e-Marketing, Internet Marketing Techniques

References:

1. Kenneth Laudon and Carol Traver, E-Commerce 2015, Business, technology, society, Global Edition

(Kindle Edition), Pearson,

2. P T Joseph, E-Commerce: An Indian Perspective , PHI

3. Devid Whiteley, E-Commerce: Strategy, Technologies and Applications, 1st Edition, Tata Mcgraw Hill

Education

4. Dave Chaffey, E - Business and E - Commerce Management: Strategy Implementation and Practice, PHI

5. P. Rizwan Ahmed, E-Business & E-Commerce, Margham Publications, Chennai,600017

6. Piyush Sukhija, E- commerce: Opportunities and Challenges, Global India Publications Pvt. Ltd. New

Delhi.

OET 3.2: INFORMATION SECURITY AND CYBER LAWS

Teaching: 4 Hrs/ Week Credits: 04


Preamble:

To study the purpose and need of providing security to the user information.

To study key principles, policies, assurance of security.

To get the knowledge about the Cyber Law related with internet.

Unit I 16Hrs

Introduction: Computer network as a threat, Hardware vulnerability, Software vulnerability,

Importance of data security. Digital Crime: Overview of digital crime, Criminology of computer

crime.

Unit II 16Hrs

Information Gathering Techniques: Tools of the attacker, Information and cyber warfare, Scanning

and Spoofing, Password Cracking, Malicious Software, Session hijacking. Risk Analysis and Threat:

Risk analysis, Process, Key principles of conventional computer security, Security policies,

Authentication, Data protection, Access control, and internal vs external threat, Security assurance,

Passwords, Authentication and access control, Computer forensics and Incident response.


Page | 28

Unit III 16Hrs

Introduction to Cryptography and Applications : Important terms, Threat, Flaw, Vulnerability, Exploit,

Attack, Ciphers, Codes, Substitution Cipher (Caeser), Transposition Cipher (Rail-Fence), Public key

cryptography (Definitions only), Private key cryptography (Definition and Example), Cyber forensics,

Steganography. Safety Tools and Issues : Firewalls, logging and intrusion detection systems, Windows

and windows XP /NT security, Unix/Linux security, ethics of hacking and cracking.

Unit IV 16Hrs

Cyber laws to be covered as per IT 2008: Definitions, Digital Signature and Electronic Signature,

[Section 43] Penalty and Compensation for damage to computer, computer system, etc.[Section 65]

Tampering with Computer Source Documents, [Section 66 A] Punishment for sending offensive

messages through communication service, [Section 66 B] Punishments for dishonestly receiving stolen

computer resource or communication device.

References: 1. M. Merkow, J. Breithaupt, Information Security Principles and Practices, Pearson Education, 2005.

2. G.R.F. Snyder, T. Pardoe, Network Security, Cengage Learning, 2010

3. A. Basta, W.Halton, Computer Security: Concepts, Issues and Implementation, Cengage Learning India,

2008

4. Anderson, Ross. Security engineering. John Wiley & Sons, 2008.

PRACTICALS

HCP 3.1 PRACTICAL-I : ADVANCED JAVA LAB


Lab assignments shall be carried out to include the following:

Classes, objects, constructors and destructor

Packages, Inheritance, Event Handlers

Applets

Exceptions and debugging

Threads, multithreading

Database connectivity

File handling

AWT Programming

Java Beans

Java Swing


Page | 29

HCP 3.2 PRACTICAL-II : SOFTWARE ENGINEERING LAB



Software Process Models

Project Metrics

Analysis Modeling

Design Concepts

Object Oriented Design Using UML

SOFT CORE (ANY ONE)

SCP 3.1 PRACTICAL-III( a) : DATA SCIENCE LAB



Data Generalization

Analytical Characterization

Descriptive Statistics in Large Data bases

Association Rules

Classification and Prediction

Cluster Analysis

SCP 3.2 PRACTICAL-III( b) : COMPUTER GRAPHICS LAB


Lab Assignments shall be carried out using C/C++ programming language to include the following

features of computer graphics:

Scan converting lines, circles and ellipses

Filling rectangles, polygons and ellipse arcs

Line and curve attributes

Clipping lines, circles, ellipse and polygons

2D and 3D transformations

Spline representations, Bezier curve and surfaces; B-Spline curves and surfaces

Hidden surfaces

Intuitive colour concepts

Raster Animation


Page | 30

M.Sc. IV SEMESTER

HARD CORE

HCT 4.1 : WEB DESIGN



Preamble:

To study the use of HTML in web design environment

To learn and implement HTML, XML Language and CSS.

To understand the JAVA Script programming language and Basics, Origins, uses of

Perl.

Unit I 16Hrs

Variables in the Web Design Environment: HTML and XML Languages, Web Browsers, Coding for

multiple screen resolutions, Bandwidth concerns. Web Site Design Principles: Design for the medium,

Design the whole website, Design for the user, Design for the screen, Planning the Site, Planning site

navigation, Creating page templates, web typography- type design principles, controlling typography

with the <FONT> element and Cascading Style Sheets, styling with CSS, Graphics and Color, HTML

frames, publishing and maintaining websites.

Unit II 16Hrs

Client-Server interaction, web document transport and HTTP, Browser architecture, CGI technology

for dynamic web documents, Java technology for active web documents.

Introduction to XML: Introduction, Syntax, Document structure, Document type definitions,

Namespaces, XML schemas, Displaying raw XML documents, Displaying XML documents with

CSS, XSLT style sheets, XML processors, Web services.

Unit III 16Hrs

JAVA Script: The JAVA Script programming language, Creating JavaScript source file, Hiding Java

Script from incompatible browsers, variables, functions, objects and events, data types and operators,

decision making with control structures and statements, windows and frames, working with forms in

JavaScript, using JavaScript with CSS styles, cookies and security. Introduction to document object

model, debugging JavaScript, server side JavaScript. Database connectivity, working with Java

Applets and embedded data.

Unit IV 16Hrs

The Basics of Perl, Origins and uses of Perl, Scalars and their operations, Assignment statements and

simple input and output, Control statements, Fundamentals of arrays, Hashes, References, Functions,

Pattern matching, File input and output.

References:

1. Douglas E Comer, Computer Networks and Internet, Pearson Education.

2. Joel Sklar,. Principles of Web Design, Web Warrior series, Thomson Learning.

3. Deitel, Deitel, and Nieto, Internet & World Wide Web-How to Program, PHI.

4. Don Gosselin, JavaScript, Web Warrior Series,3/e, Thomson Learning.

5. Douglas E. Comer, Internetworking With TCP/IP, Vol. II: Design, Implementation, And Internals, 3/E, PHI.

6. Kate Kalata, Internet Programming with VBScript and JavaScript, Thomson Learning.


Page | 31

HCT 4.2 : PROBLEM SOLVING USING PYTHON



Preamble:

To learn the fundamentals of python scripting.

To understand the system, modules, packages and regular expressions.

To acquire the knowledge on Classes , Objects, Inheritance and GUI Programming.

UNIT I 16Hrs

Introduction ,program structure, output function, variables, constants, data types, type operators and

expressions, control structures, input function . Data structures – str, list, tuple, dict, set.

UNIT II 16Hrs

List, dict, set and generator-comprehensions. User defined functions - variable number of arguments, default parameters, key value pairs as arguments, Data Storage, Data formatting. UNIT III 16Hrs

Modules, Packages and Programs, Systems, Regular Expressions, File Handling, Errors and Exception

Handling.

UNIT IV 16Hrs

Classes , Objects, Inheritance, Testing and debugging, GUI Programming, Relational databases, Web

Untangled, Concurrency and Networks. References: 1. Bill Lubanovic, Introducing Python- Modern Computing in Simple Packages, O‘Reilly Publication

2. Allen Downey, Jeffrey Elkner, Chris Meyers, How to Think Like a Scientist –Learning with Python, Green

Tea Press, 2002, First Edition.

3. Charles Dierbach, Introduction to Computer Science Using Python, Wiley Publication.

4. Magnus Lie Hetland, Beginning Python, From Novice to Professional, - Second Edition, APress Publication

5. Allen B. Downey, Think Python-How to think like a computer scientist, first Edition, O‘Reilly Publication.


Page | 32

SOFT CORE(ANY ONE)

SCT 4.1 : DIGITAL IMAGE PROCESSING



Preamble:

To develop a theoretical foundation of fundamental Digital Image Processing concepts.

To explore the image processing techniques. UNIT I 16Hrs

Elements of Digital Image Processing systems, Vidicon and Digital Camera working principles,

Elements of visual perception, Brightness, Contrast, Hue, Saturation, Mach band effect, Color

image fundamentals - RGB,HSI models, Image sampling, Quantization, dither, Two dimensional

mathematical preliminaries, 2D transforms - DFT, DCT, KLT, SVD.

UNIT II 16Hrs

Histogram equalization and specification techniques, Noise distributions, Spatial averaging,

Directional Smoothing, Median, Geometric mean, Harmonic mean, Contra harmonic mean

filters, Homomorphic filtering, Color image enhancement.

UNIT III 16Hrs

Image Restoration degradation model, Unconstrained restoration Lagrange multiplier and

Constrained restoration, Inverse filteringremoval of blur caused by uniform linear motion,

Wiener filtering, Geometric transformations-spatial transformations.

UNIT IV 16Hrs Edge detection, Edge linking via Hough transform, Thresholding, Region based segmentation

Region growing Region splitting and Merging Segmentation by morphological watersheds basic

concepts, Dam construction, Watershed , segmentation algorithm,

Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic

coding, VectorQuantization, Transform coding, JPEG standard, MPEG.

References:

1. Rafael C. Gonzalez, Richard E. Woods, , Digital Image Processing', Pearson, Second Edition,2004

2. Anil K. Jain, , Fundamentals of Digital Image Processing', Pearson 2002.

3. Kenneth R. Castleman, Digital Image Processing, Pearson, 2006.

4. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins,' Digital Image Processing using MATLAB',

Pearson Education, Inc., 2004.

5. D,E. Dudgeon and RM. Mersereau, , Multidimensional Digital Signal Processing', Prentice Hall

Professional Technical Reference, 1990.

6. William K. Pratt, , Digital Image Processing' , John Wiley, New York, 2002

7. Milan Sonka et aI, 'IMAGE PROCESSING, ANALYSIS AND MACHINE VISION',

Brookes/Cole, VikasPublishing House, 2nd edition, 1999.


Page | 33

SCT 4.2: SOFTWARE TESTING



Preamble :

To study the testing fundamentals and testing design strategies.

To expose the criteria for test cases.

To learn the levels of testing and test planning concepts.

UNIT I 16Hrs

Testing Fundamentals: Introduction, Basic Definitions of Errors, Defects, Failures, Test Cases, Test,

Test Oracle, Test Bed, Software Quality, Software Quality Assurance Group, Reviews and Software

Testing Principles, Software Development Life cycle Models, The Tester’s Role in a Software

Development Organization. Introduction to Testing Design Strategies, Test Case Design Strategies,

Using the Black Box Approach to Test Case Design, Equivalence Class Partitioning, Other Black Box

Test Design Approaches Cause-and-Effect Graphing, State Transition Testing, Error Guessing, Black

Box Testing and Commercial Off-the-Shelf Components (COTS).

UNIT II 16Hrs

The Need for Levels of Testing, Levels of Testing and Software Development Paradigms, Unit Test:

Functions, Procedures, Classes, and Methods as Units, Unit Test: The Need for Preparation, Unit Test

Planning, Testing and Debugging Goals and Policies, Test Planning, Test Plan Components, Test Plan

Attachments.

UNIT III 16Hrs

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 Object Oriented Systems.

UNIT IV 16Hrs

Usability & Accessibility Testing, Configuration testing, Compatibility testing, Testing the

Documentation, Website testing, Automated testing & Test tools, Bug bashes & Beta testing, Career

as a Software Tester.

References:

1. Illene Burnstein, “Practical Software Testing”, Springer Internal Edition.

2. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing-Principles and Practices”, Pearson

Education, 2006.

3. Ron Patton, “Software Testing”, Sams Publishing, Pearson Education.

4. Roger S.Pressman, Software Engineering-A Practitioners Apporach, McGraw-Hill /7e

6. Ian Sommerville, Software engineering, Pearson education Asia, 9th edition.

7. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997

8. K.V.K. K. Prasad, “Software Testing Tools”, Dreamtech Press.


Page | 34

SCT 4.3: CLOUD COMPUTING



Preamble:

To learn the basics of cloud computing, its models and Services.

To compare and contrast programming for cloud and their applications

To explain Cloud Resource Virtualization and Task Scheduling algorithms.

Unit I 16Hrs

Introduction, Cloud Infrastructure: Cloud computing, Cloud computing delivery models and services,

Ethical issues, Cloud vulnerabilities, Cloud computing at Amazon, Cloud computing the Google

perspective, Microsoft Windows Azure and online services, Open-source software platforms for

private clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological impact, Service

level agreements, User experience and software licensing.

Unit II 16Hrs

Cloud Computing: Application Paradigms, Challenges of cloud computing, Architectural styles of

cloud computing, Workflows: Coordination of multiple activities, Coordination based on a state

machine model: The Zookeeper, The Map Reduce programming model, A case study: The Grep, The

Web application, Cloud for science and engineering, High-performance computing on a cloud, Cloud

computing for Biology research, Social computing, digital content and cloud computing.

Unit III 16Hrs

Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual machine monitors,

Virtual Machines, Performance and Security Isolation, Full virtualization and paravirtualization,

Hardware support for virtualization, Case Study: Xen a VMM based paravirtualization, Optimization

of network virtualization, vBlades, Performance comparison of virtual machines, The dark side of

virtualization.

Unit IV 16Hrs

Cloud Resource Management and Scheduling: Policies and mechanisms for resource management,

Application of control theory to task scheduling on a cloud, Stability of a two-level resource allocation

architecture, Feedback control based on dynamic thresholds, Coordination of specialized autonomic

performance managers, A utilitybased model for cloud-based Web services, Resourcing bundling:

Combinatorial auctions for cloud resources, Scheduling algorithms for computing clouds, Fair

queuing, Start-time fair queuing, Borrowed virtual time, Cloud scheduling subject to deadlines,

Scheduling MapReduce applications subject to deadlines, Resource management and dynamic scaling.

References:

1. Dan C Marinescu: Cloud Computing Theory and Practice. Elsevier(MK) 2013.

2. Rajkumar Buyya , James Broberg, Andrzej Goscinski: Cloud Computing Principles and Paradigms,

Willey 2014.

3. John W Rittinghouse, James F Ransome:Cloud Computing Implementation, Management and

Security, CRC Press 2013


Page | 35

SCT 4.4: CYBER SECURITY



Preamble:

To study the need and purpose of cyber security

To understand the issues those are specific to amendment rights.

To have knowledge on copy right issues of software’s.

To understand ethical laws of computer for different countries.

UNIT I 16Hrs

Introduction-Cyber Security and its problem-Intervention Strategies: Redundancy, Diversity and

Autarchy, Private ordering solutions, Regulation and Jurisdiction for global Cyber security, Copy

Right-source of risks, Pirates, Internet Infringement, Fair Use, postings, criminal liability, First

Amendments, Data Loss.

UNIT II 16Hrs Copy Right-Source of risks, Pirates, Internet Infringement, Fair Use, postings, Criminal Liability, First

Amendments, Losing Data, Trademarks, Defamation, Privacy-Common Law Privacy, Constitutional

law, Federal Statutes, Anonymity, Technology expanding privacy rights. UNIT III 16Hrs

Duty of Care, Criminal Liability, Procedural issues, Electronic Contracts and Digital Signatures,

Misappropriation of information, Civil Rights, Tax, Evidence.

UNIT IV 16Hrs

Ethics, Legal Developments, Late 1990 to 2000,Cyber security in Society, Security in cyber laws case.

Studies, General Law and Cyber Law-A Swift Analysis.

References: 1. Jonathan Rosenoer, “Cyber Law: The law of the Internet”, Springer-Verlag, 1997.

2. Mark F Grady, Fransesco Parisi, “The Law and Economics of Cyber Security”, Cambridge University

Press, 2006.

3. Michael T. Goodrich, Roberto Tamassia, “Introduction to Computer Security” Pearson Education.


Page | 36

PRACTICALS

HCP 4.1 PRACTICAL-I :WEB DEESIGN LAB


Assignments related to web design studied in HCT 4.1: Web Design shall be implemented.

HTML tags, Creating page templates, CSS, graphics and Color, HTML frames, DHTML.

Use of HTTP.

Client-Server Interaction.

JavaScript control structures, functions, events, windows and frames, JavaScript frames and

CSS, database connectivity.

Basic perl programming.

HCP 4.2 PRACTICAL-II :PYTHON LAB



Basic python programming

User defined functions

Use of modules

Use of classes, objects and inheritance

GUI programming

SCP 4.1 PRACTICAL-III(a) :DIP LAB


Lab. Assignments shall be carried out to implement the techniques/methods studied using

MATLAB / SCILAB studied in SCT4.1.

SCP 4.2 PRACTICAL-III(b) :SOFTWARE TESTING LAB


Lab. Assignments shall be carried out to implement the techniques/methods studied in

Paper SCT 4.2.


Page | 37

SCP 4.3 PRACTICAL-III(c) :CLOUD COMPUTING LAB


Lab. Assignments shall be carried out to implement the techniques/methods studied in Paper SCT 4.3.

SCP 4.4 Practical-III(d) :CYBER SECURITY LAB


Lab. Assignments shall be carried out to implement the techniques/methods studied in Paper SCT 4.4.

HCMP4.3: MAJOR PROJECT

Practical: 6 Hrs./Week Credits: 06

Max Marks: 150

HCMP4.3: Major Project ( 90 for Project Evaluation( 20 for Presentation + 10 for attending Conferences/ Workshop/Seminar + 60 for Project Report), 30 for Viva-voce Total 120 + IA 30 = 150 )

Each student shall carry out an individual project in the Lab.

The Guide shall be concerned teacher in the department.

The Project topic should be chosen in consultation with the guide.

Student shall carry out the analysis and design work for the chosen problem statement and develop

the s/w in the Lab.

The student shall submit two copies of the dissertation documenting the project work carried out

by him/her to the Chairman/Head of the Department at the end of the semester term.

Refer Annexure-I for Project documentation details.


Page | 38

ANNEXURE-I

FORMAT OF THE PROJECT REPORT

1. Cover page as per format

2. Certificate of the project

3. Conference/Seminar/Workshop Attended Certificate

4. Acknowledgement

5. Index

6. Abstract of the project

7. Main Report

7.1 Introduction

7.2 Problem statement

7.3 Literature survey

7.4 System analysis & design

7.5 Hardware & software Requirements

7.6 ERD, DFD

7.7 System Planning(Charts)

7.8 Implementation

7.9 Integration

7.10 Testing

7.10.1 Unit Testing

7.10.2 Integration Testing

7.10.3 Functional Testing

7.11 Results & Discussion

7.12 Advantages & Disadvantages

7.13 Applications

7.14 Future Scope

7.15 Conclusion

7.16 References

7.17 Soft copy of the project on CD/Floppy


Page | 39

GUIDE CERTIFICATE

Guide Name:

Full Address:

CERTIFICATE

This is to certify that this project entitled “ ________________________________”

submitted in partial fulfillment of the Degree of Master of Science (Computer Science) to the

Department of Computer Science, ____________________ (University/College Name), carried out

by Mr./Ms._______________________, Reg. No. ________________ is a bonafide work carried out

by him/her under my supervision. The matter embodied in this project work has not been submitted

earlier for award of any degree or diploma to this or any other University/Institution to the best of my

knowledge and belief.

Signature of the Guide


Page | 40

COVER PAGE

Title of the thesis/report

(Times New Roman, Italic, Font size = 24 )

Submitted in partial fulfillment of the requirements

for the award of the degree of M.Sc. in Computer Science

(Bookman Old Style, 16 point, centre)

Submitted by:

(Student name)

Reg. No.:

Submitted to

GULBARGA UNIVERSITY, KALABURAGI

College/Department

College Name and City


Page | 41

DECLARATION

This is to certify that the dissertation/project report entitled

“___________________________________________________” is carried out by me

under the supervision of_____________________________, for the partial fulfillment

of the requirements for the award of the Degree of M.Sc. in Computer Science. The

contents embodied in this project work, in part or whole, has not been submitted earlier

for award of any degree or diploma to this or any other University/Institution.

Signature of the student

( Name of the Student )

Reg. No.