choice based credit system structure - …nmssvnc.edu.in/com sci(sf)/uploadsyllabus... · choice...

430

CHOICE BASED CREDIT SYSTEM – STRUCTURE

FOR THOSE WHO HAVE JOINED FROM THE ACADEMIC YEAR 2014–15 ONWARDS

M.Sc COMPUTER SCIENCE

Sem

Part Subject Hrs. Cr. Adl.

Cr.

Exam

(Hrs)

Marks

Allotted

Int. Ext.

I

01 Part– III

Core

Mathematical Foundations of

Computer Science 4 4 3 25 75

02 Core Data Structures with C 4 4 3 25 75

03 Core Computer Organization 4 4 3 25 75

04 Core Operating System 4 4 3 25 75

05 Core Java Programming 4 4 3 25 75

06 Core

Lab C and Data Structures Lab 5 3 3 40 60

07 Core

Lab Java Programming Lab 5 3 3 40 60

08 SLC In plant Training

*Report;@Viva – – 3 –

40

*[30:10]

60

*[50:10]

II

01 Part –III

Core Advanced Java Programming 4 4 3 25 75

02 Core Relational Database

Management System 4 4 3 25 75

03 Core Computer Graphics 4 4 3 25 75

04 Core Data Communication and

Computer Networks 4 4 3 25 75

05 Core

Lab

Advanced Java Programming

Lab 4 3 3 40 60

06 Core

Lab

Client Server Lab [VB with

Oracle (or) ASP with Oracle] 4 3 3 40 60

07 NME Web Designing 6 4 3 25 75

08 SLC Web Technology 3 3 – 100

431

Sem

Part Subject Hrs. Cr. Adl.

Cr. Exam (Hrs)

Marks

Allotted

Int. Ext.

III

01 Part – III

Core

Cryptography and Network

Security 4 4 3 25 75

02 Core .Net Technology 4 4 3 25 75

03 Core Software Engineering 4 4 3 25 75

04 Core Data Mining 4 4 3 25 75

05 Elective

Major

Multimedia and Its

Applications

4 4 3 25 75

06 Core

Lab Network Lab 5 4 3 40 60

07 Core

Lab .Net Programming Lab 5 4 3 40 60

08 Self

Learning

Course

Artificial Intelligence – – 3 3 – 100

IV

01 Elective

Major

Project and

Viva–Voce

Internal 5 – 100 –

External 5 – – 100

TOTAL 120 90 12

432

M.Sc COMPUTER SCIENCE: Those Who Have Joined From

The Academic Year 2014–15 Onwards Under CBCS System

Core Subject MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE SEMESTER I Code: 14254101

4 Hrs/Week Credits 4

Objective:

To provide basic mathematical foundation required for various

computer science courses to generate the mathematical knowledge

through tolerance for reason for adventure of ideas in mathematics.

UNIT – I: [12 Hrs]

Mathematical Logic – Statements and Notation – Connectives –

Normal forms.

UNIT – II: [12 Hrs]

The Theory of Inference for the Statement Calculus – The

Predicate Calculus – Inference Theory and Predicate Calculus.

UNIT – III: [12 Hrs]

Grammars and Languages – Polosh Expressions and their

Compilation – Lattices and Boolean Algebra – Lattice as Partially

Ordered Sets.

UNIT – IV: [12 Hrs]

Boolean Algebra – Boolean Functions – Representation and

Minimization of Boolean Functions.

UNIT – V: [12 Hrs]

Finite – State Machines. Graph Theory – Basic Concepts of

Graph Theory.

TEXT BOOK:

01. Tremblay J.P., and Manohar R., Discrete Mathematical

Structures with Applications to Computer Science, McGraw–Hill

Book Company, New York, 1997.

Chapters : 1, 3.3, 3.4, 4.1, 4.2, 4.3, 4.4, 4.6, 5.1.

REFERENCE:

01. Venkat Raghavan M.K., Discrete Mathematics, The National

Publishing Company, Chennai, 2000.

433

Core Subject DATA STRUCTURES WITH C Code: 14254102

SEMESTER I


Objective:

The objective of this course is to introduce students to the concepts

of programming in C and Data Structures. The course provides a

solid background by introducing the fundamentals of programming

in C and Data Structures.


Introductory Concepts:

Introduction to C – Some simple C programs.

Desirable Program Characteristics C Fundamentals:

The C character set – Identifiers and Keywords – Data Types –

Constants – Variables and Arrays – Declarations – Expressions –

Statements – Symbolic Constants Operators and Expressions:

Arithmetic Operators – Unary Operators – Relational and Logical

Operators – Assignment Operators – The Conditional Operators –

Library Functions.


Data Input and Output:

Preliminaries – Single Character Input – Single Character

Output – Entering Input Data – More about the scanf function –

Writing Output Data – More about the printf function – The gets and

puts functions.

Control Statements:

Preliminaries – The if-else Statement – The While Statement –

The do-while Statement – The For Statement – Nested Control

Structures – The Switch Statement – The Break Statement – The

Continue Statement – The Comma Statement – The GOTO Statement.

Functions:

A Brief Overview – Defining a function – Accessing a function –

Function Prototypes – Passing Arguments to a function – Recursion.


Arrays:

Defining an Array – Processing Array – Passing Arrays to

functions – Multidimensional Array – Array and Strings.

Pointers:

Fundamentals - Pointer Declarations – Passing Pointers to

Functions - Pointers and One-Dimensional Arrays – Dynamic Memory

Allocation – Operations on Pointers - Pointers and Multidimensional

Arrays – Arrays of Pointers – Passing function to other functions.

Structures and Union:

Defining a Structure – Processing a Structure – User – Defined

Data Types – Structures and Pointers – Passing Structures to

functions.

434


Stacks and Queues:

Fundamentals – A Mazing Poblem - Evaluation of Expressions –

Multiple Stacks and Queues.

Linked Lists:

Singe Linked Lists – Linked Stacks and Queues – Polynomial

Addition – More on Linked Lists – Equivalence Relations – Spare

Matrices – Doubly andCircular Linked Lists and Dynamic Storage

Management.

UNIT –V: [12 Hrs]

Trees:

Basic Terminology – Binary Trees –Binary Trees Representations

– Binary Tree Traversal – More or Binary Trees – Threaded Binary

Trees – Binary Tree Representation of Trees – Applications of Trees –

Counting Binary Trees.

TEXT BOOKS:

01. Byron S. Goftfried, Programmin with C, 2nd Edition, Tata McGraw-Hill, New Delhi, 1998.

UNIT – I : Chapters: 1,2,3 UNIT – II : Chapters: 4,6,7 UNIT – III : Chapters: 9,10,11

02. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures, Galgotia Book Source Pvt. Ltd., Gurgaon, Haryana,

March 1978. UNIT – IV : Chapters: 3,4 UNIT – V : Chapter: 5

REFERENCES: 01. Balagurusamy E., Programming in ANCI C, Tata McGraw-Hill,

New Delhi, 2002.

02. Seymour Lipschutz, Data Structures, Tata McGraw-Hill, New Delhi, 2006.

Core Subject COMPUTER ORGANIZATION Code: 14254103

SEMESTER I

4 Hrs/Week

Credits 4

Objective:

To teach Computer Fundamentals, Internal Working and Operations

of PC.


Basic Structure of Computer Hardware and Software.

Addressing Methods and Machine Program Sequencing:

Memory Locations, Addresses and Encoding of Information –

Main Memory Operations – Instructions and Instruction Sequencing –

Addressing Modes – Assembly Language – Basic Input / Output

Operations – Stacks and Queues – Subroutines.

http://www.indiastudychannel.com/resources/59074-DCA-Syllabus-COMPUTER-ORGANIZATION.aspx

http://www.indiastudychannel.com/resources/59074-DCA-Syllabus-COMPUTER-ORGANIZATION.aspx

435


The Processing Unit:

Fundamental Concepts – Execution of a Complete Instruction –

Hardwired Control – Performance Considerations – Micro Programmed

Control.

Input output Organization:

Accessing I/O Devices – Interrupts – Interrupts – Processor

Examples – Direct Memory Access – I/O Hardware – Standard I/O

Interfaces.


The Memory:

Basic Concepts – Semiconductor RAM Memories – Speed, Size

and Cost – Cache Memories – Performance Considerations – Virtual

Memories – Memory Management Requirements.

Arithmetic:

Number Representations – Addition of Positive Numbers – Logic

Design for Fast Adders – Addition and Subtraction – Arithmetic and

Branching Conditions – Multiplication of Positive Numbers – Signed

Multiplication – Fast Multiplication – Integer Division – Floating Point

Numbers and Operations.


Pipelining:

Basic Concepts – Instruction Queue – Branching – Data

Dependency –Influence of Pipelining of Instruction Set Design –

Multiple Execution Units – Performance Considerations – The Intel

80X86 Family.


Computer Peripherals – Large Computer Systems.

TEXT BOOK: 01. Hamacher V.C., Vranesic Z.G., and Zaky S.G., Computer

Organization, McGraw–Hill International Book Company,

New York, 1996. Chapters : 1, 2.1 – 2.8, 3 – 7, 8.2, 9, 10.

REFERENCES: 01. Morris Mano M., Computer System Architecture, PHI Ltd, New

Delhi 1994.

02. Thomas Bartee, Computer Architecture and Logic Design, McGraw–Hill, New Delhi, 1991.

436

Core Subject OPERATING SYSTEM SEMESTER I Code: 14254104

4 Hrs/Week

Credits 4 Objective:

To learn the evolution of Operating systems.

To study the operations performed by Operating System as resource

manager.


Introduction:

Computer System Structures – Computer System Operation –

I/O Structures – Storage Structure – Storage Hierarchy – Hardware

Protection – Network Structure.

Operating System Structure:

System Components – Operating System Services – System

Calls.


Process Management:

Process Concept – Process Scheduling – Operations on Processes

– Cooperating Processes – Interposes Communication – Threads –

Overview – Multithreading Models.

CPU-Scheduling:

Basic Concepts – Scheduling Criteria – Scheduling Algorithms –

Multiple Processor Scheduling – Real Time Scheduling – Algorithm

Evaluation.


Process Synchronization:

The Critical Section Problem – Synchronization Hardware –

Semaphores – Classical Problems of Synchronization – Critical

Regions.

Deadlocks:

Deadlock Characterization – Methods For Handling Deadlocks –

Deadlock Prevention – Deadlock Avoidance – Deadlock Detection –

Recovery From Deadlock.


Storage Management:

Memory Management – Swapping – Contiguous Memory

Allocation – Paging – Segmentation – Segmentation With Paging.

Virtual Memory – Demand Paging – Page Replacement – Allocation of

Frames.

437


File System Interface:

File System Concepts – Access Methods – Directory Structure.

File Systems Implementation:

File System Structure – File System Implementation - Directory

Implementation – Allocation Methods – Free Space Management – Case

Studies – The Linux System.

TEXT BOOKS:

01. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne,

Operating System Concepts, 6th Edition, John Wiley and Sons, Inc, 2002.

UNIT – I : Chapter 1: 1.1-1.10

Chapter 2: 2.2-2.6 Chapter 3: 3.1-3.3

UNIT – II : Chapter 4: 4.1-4.5 Chapter 5: 5.1-5.2 Chapter 6: 6.1-6.6

UNIT – III : Chapter 7: 7.2-7.6 Chapter 8: 8.2-8.7 UNIT – IV : Chapter 9: 9.2-9.6

Chapter 10: 10.2, 10.4, 10.5 UNIT – V : Chapter 11: 11.1-11.3

Chapter 12: 12.1-12.5 Chapter 20: 20.1-20.12

REFERENCE:

01. Achyut S. Godbole, Operating Systems, 2nd Edition, Tata McGraw-Hill, New Delhi, 2008.

Core Subject JAVA PROGRAMMING Code: 14254105

SEMESTER I

4 Hrs/Week


To train the students with basic OOPS concepts in JAVA.


The Genesis of JAVA:

The JAVA Buzzwords – An overview of JAVA – Object Oriented

Programming – A First Simple Program – Data Types, Variables and

Arrays – The Simple Types – Integers – Floating–Pint Types –

Characters – Booleans – A closes look at literals – Variables – Type

Conversion and Casting – Arrays – Strings.


Control Statements:

Java’s Selection Statements – Java’s Selection Statements –

Iteration Statements – Jump Statements.

438

Introducing Classes:

Class Fundamentals – Declaring Objects – Assigning Object

Reference – Variables – Introducing Methods – Constructors – This

Keyword – Garbage Collection – The Finalized Method.


A Closer look at Methods and Classes:

Overloading Methods – Recursion – Introducing Access Control –

Understanding Static – Introducing Final – Introducing Nested and

Inner Classes.

Inheritance:

Inheritance basics using super class – Creating a Multilevel

Hierarchy Method Overriding – Using Abstract Classes – Using final

with inheritance.

Packages and Interfaces:

Packages – Importing Packages – Interfaces.


Exception Handling:

Exception Handling Fundamentals – Exception Types –

Uncaught Exceptions – Using Try and Catch – Multiple Catch Clauses

– Nested TRY Statements – Throw – Throws – Finally – Java’s Built-in

Exceptions.

Multi-threaded Programming:

The Java Thread Model – The Main Thread – Creating a Thread –

Creating Multiple Threads – Thread Priorities – Synchronization –

Interthread Communication – Suspending, Resuming and Stopping

Threads – Using Multithreading.


I/O, Applets:

I/O Basics – Reading Console Input – Writing Console Output –

The Printwriter Class – Reading and Writing Files.

The Java I/O Classes and Interfaces – File – The Stream Classes

– The Byte Streams – The Character Streams.

The Applet Basics – Applet Architecture – An Applet Skeleton –

Simple Applet Display Methods – Requesting Repainting – Using the

Status Window – The HTML APPLET Tag.

TEXT BOOK: 01. Patrick Naughton and Herbert Schildt, Java 2 – The Complete

Reference, TMH, New Delhi, 2006.

UNITS: 1-3,5-12,17,19

439

REFERENCES: 01. Balagurusamy E., Programming with Java, 3rd Edition, Tata

McGraw-Hill, New Delhi, 2007.

Core Lab C AND DATA STRUCTURES LAB Code: 14254106

SEMESTER I

5 Hrs/Week Credits 3 Objective:

The exercises teach students how to apply the material learned in

C, How to Program and prepare them for writing C Programs.

01. Simple C Program Using Conditional and Looping

Statements.

02. Searching (linear, binary) Program Using C.

03. Sorting (name, number) Program Using C.

04. String Processing Using Pointers.

05. Illustrate the Use of Function and Recursive Function.

06. Write a program to Implement Student Mark List Using

Structure in C.

07. Write a program Using Call by Value and Call by

Reference.

08. Write a Program to Implement EB-Bill Using Structure

in C.

09. Linked List Implementation Through Pointers.

10. Doubly Linked List.

11. Circular Linked List.

12. Polynomial Addition.

13. Stack Implementation, Arrays and Linked List.

14. Queue Implementation, Arrays and Linked List.

15. Binary Tree and Tree Traversal.

REFERENCES:

01. Balagurusamy E., Programming in ANCI C, Tata McGraw-Hill,

New Delhi, 2002. 02. Seymour Lipschutz, Data Structures, Tata McGraw-Hill, New

Delhi, 2006.

Core Lab JAVA PROGRAMMING LAB Code: 14254107

SEMESTER I


To make the students to understand the concept of Java

Programming Language and to develop the programs using various

concepts.

01. A simple java program using class.

02. Java program with multiple classes.

03. Illustrate the use of command line arguments.

440

04. Vector manipulations.

05. String manipulations.

06. Illustrate the use of constructors.

07. Methods Overloading.

08. Implementation of inheritance – single, multilevel,

hierarchical and hybrid Inheritance.

09. Illustration of method overwriting.

10. Implementation of Interface – multiple inheritance.

11. Implementation of package.

12. Multithreading.

13. Implementation of exception handling.

14. Alphabetical ordering of strings.

15. Illustrate the use of static members.

APPLET PROGRAM:

16. Simple Applet Program for drawing and filling of

different shapes. 17. Simple applet program for getting inputs and

displaying output. 18. Applet program to design a home 19. Applet program to design a national flag.

FILE PROGRAM 20. Copying characters from one file to another. 21. Writing bytes to a file.

22. Reading bytes from a file. 23. Concatenation of two files using sequence input

stream. REFERENCES:

01. Balagurusamy E., Programming with Java, 3rd Edition, Tata

McGraw-Hill, New Delhi, 2007.

Self–Learning Course IN PLANT TRAINING Code: 14804125

[Common for all PG Courses except MBA and M.Com (CA)]

SEMESTER I Addl. Credits 3

Objectives of Training: To apply creative skills

To develop critical thinking skills

Working model for the solution of a real time problem

To improve practical working skills

To develop life long learning skills

Short term in plant industrial training of 15 days.

Students must select their own industrial unit of their choice for

training.

The training includes process, product and viva–voce or class

room presentation.

Process must include working file.

Working file includes draft copies of work, a working log, work

schedule and resources used.

441

Product includes actual design and development of training.

Components required in the viva–voce or class room

presentation.

Information about the topic

Personal relevance

Presentation skills

Power point presentation (must)

Findings

Conclusions

Evaluation:

Total Internal External

Project 80 30 50 Viva 20 10 10 Total 100 40 60

Core Subject ADVANCED JAVA PROGRAMMING Code: 14254201

SEMESTER II


To train the students in Advanced JAVA Programming Concepts

such as J2EE Architecture, Servlets – JDBC – RMI and JAVA Beans.


Java 2 Enterprise Edition Overview:

Why J2EE – J2EE Multi-Tier Architecture – Distribute Systems –

The Tier – J2EE Multi-Tier Architecture – Client Tier Implementation –

Web Tier Implementation – Enterprise Java Beans Tier Implementation

– Enterprise Information Systems Tier Implementation.

J2EE Best Practices:

The Enterprise Application – Clients – Sessions Management –

Web Tier and Java Server Pages – Enterprise Java Bean Tier.


J2EE Database Concepts:

Data – Database – Database 4Scheme – JDBC Objects – The

Concept of JDBC – JDBC Driver Types – JDBC Packages – A Brief

Overview of the JDBC Process – Database Connection – Associating

the JDBC/ODBC Bridge with the Database – Statement Objects –

Result set.


Java and XML – Generating an XML Document – Passing XML.

Java Servlets:

Java Servlets and Common Gateway Interface Programming – A

Simple Java Servlet – Anatomy of a Java Servlet – Reading Data from a

442

client – Reading HTTP Request Headers – Sending Data to a Client

Card Writing the HTTP Response Header – Working with Cookies –

Tracking Sessions.


Java Server Pages:

JSP Tags – Tomcat – Request String – User Sessions – Cookies –

Session Objects.

Enterprise Java Beans:

Deployment Descriptors – Session Java Bean – Entity Java Bean

– Message – Driven Bean – The JAR File.


Java Remote Method Invocation:

Remote Method Invocation Concept – Server Side – Client Side.

Java Message Service:

Java Messaging Service – JMS Fundamentals – Components of

JMS Program – Messages.

TEXT BOOKS: 01. Jim Keogh, The Complete Reference J2EE, Tata McGraw–Hill,

New Delhi, 2002. UNITS : 1-3, 5-6, 9-12, 15-16

REFERENCES:

01. Dan Brookheir, Java Beans: Developer’s Reference, New Riders, New Delhi, 1997.

02. Luke Cassadt–Dorion, et al., Industrial Strength Java,

Techmedia, New Delhi, 1997.

Core Subject RELATIONAL DATABASE MANAGEMENT SYSTEM SEMESTER II Code: 14254202


The course provides insights into fundamental concepts of database

systems theory and design, along with representative

implementation examples. All major data models are dealt

extensively with emphasis on practical knowledge.


Basic Concepts:

Introduction – An Example – Characteristics of the Database

Approach – Actors on the Scene – Workers behind the scene. Data

Models, Schemas, and Instances – DBMS Architecture and Data

Independence – Database Languages and Interfaces. High–Level

Conceptual Data Models for Database Design – ER Model Concepts –

ER diagrams.

443


Record Storage and Primary File Organizations:

Introduction – Secondary Storage Devices – Buffering of Blocks –

Placing File Records on Disk – Operations on Files – Files of Unordered

Records – Files of Ordered Records – Hashing Techniques.

Index Structures for Files:

Types of Single – Level ordered Indices – Multilevel Indexes –

Dynamic Multilevel Indexes using B–trees and B+ Trees.


Relational Data Model and Relational Algebra:

Relational Model concepts – Relational Model Constraints – The

Relational Algebra – Additional Relational Operations – SQL – Queries

in SQL – Update Statements in SQL – Views in SQL.


Relational Calculus:

Relational database Management Systems – Architecture of DB2

– Data Definition in DB2, Data Manipulation in DB2.

UNIT –V: [12 Hrs]

Database Design:

Functional Dependencies and Normalization for Relational

Databases – Internal Design Guidelines for Relation Schemas –

Functional Dependencies – Normal Forms based on Primary Keys –

General Definitions of 1st and 2nd Normal Forms – BCNF – Algorithms

for Relational Database Schema Design – Multivalued Dependencies

and 4th Normal Form – Role of Information Systems in organizations –

The database Design Process.

TEXT BOOK:

01. Ramez Elmasrl and Shamkant Navathe B., Fundamentals of Database Systems, 2nd Edition, Addison Wesley, New York, 1997.

Chapters: UNIT – I : 1.1–1.5, 2.1–2.3, 3.1–3.4 UNIT – II : 4.1–4.8, 5.1–5.3

UNIT – III : 6.1, 6.2, 6.5, 6.6, 7.1–7.4 UNIT – IV : 8.1, 9.1 – 9.4 UNIT – V : 12.1 – 12.4, 13.1, 13.2,

14.1, 14.2 REFERENCES:

01. Abraham Silberschatz and Henry Korth F., Sudarshan Databases System Concepts, The McGraw–Hill Company, 3rd Edition, New Delhi, 1999.

02. Alexis Leon and Mathews Leon, Database Management Systems, Leon Vikas Publishing Company, New Delhi, 1999.

444

Core Subject COMPUTER GRAPHICS Code: 14254203

SEMESTER II


This course introduces you to computer graphics, its powerful

capabilities, a history of its technologies as well as up–to–date

developments, to its far–reaching potentials across the consumer,

industrial, and military domains, and how to achieve these

potentials. To comprehend the fundamentals of Computer Graphics.

To comprehend the working of computer graphic devices. To

enumerate the principle of 2D and 3D Graphics theory and

algorithm.


Introduction to Computer Graphics Applications of Computer

Graphics – CAD/CAM – Image Processing – Video Display Devices –

Frame Buffer – Raster Scan and Random Scan Systems – Display

Processor – Display Controller – Other Display Devices.


Graphical Output Primitives and their Attributes – 2D

Transformations and Viewing – Clipping Lines and Polygons.


Basic Modeling Concepts – Hierarchical Modeling – Graphical

User Interfaces and Interactive Input Devices – Logical Classification of

Input Devices.


Input Functions – Interactive Picture Construction Techniques –

Virtual Reality Environments – 3D Concepts and Representations – 3D

Transformation – 3D Viewing and Clipping.


Visible Surface Detection Methods – Color Models and

Applications – Computer Animation – Segmented Display Files –

Display File Compilation.

TEXT BOOK:

01. Donald Hearn and Pauline Baker M., Computer Graphics, PHI, 2nd Edition, New Delhi, 2006.

REFERENCES:

01. Asthana R.G.S., and Sinha N.K., Computer Graphics for Scientists and Engineers, New Age International Pvt. Ltd.,

New Delhi, 2005. 02. Steven Harrington, Computer Graphics Programming Approach,

TMH, New Delhi, 1987.

03. William Newman M., and Rolvert F. Sproull, Principles of Interactive Computer Graphics, TMH, New Delhi, 1986.

445

Core Subject DATA COMMUNICATION AND COMPUTER NETWORKS SEMESTER II Code: 14254204

4 Hrs/Week


The aim of this course is to provide a unified overview in the basic

principles of data communications and computer networks. The

lecture seires emphasize basic principles and topics of fundamental

importance concerning the technology and architecture of this

field, as well as providing the state of the art topics. Basic

objectives are as the followings:

o to provide a conceptual foundation for the study of data

communications using the open systems interconnect (OSI)

model for layered architecture.

o to develop an understanding in basic hardware and software

environments for data communications and computer

networks.


Introduction:

Uses of computer networks – Network Hardware – Network

Software – The OSI Reference models – Example Networks.

Physical Layer:

Transmission media – Wireless Transmission – The Telephone

System –ISDN.


Data Link Layer:

Data Link Layer Design Issues – Framing Methods – Error

Detection and Correction – An Unrestricted Simplex Protocols – A

Simplex Stop and Wait Protocol – A Simplex Protocol for a Noisy

Channel – Sliding Window Protocol.


Network Layer:

Network layer Design Issues – Routing – Congestion Control –

Routing Algorithms – Congestion Control Algorithms – Internet

Working.


Transport Layer:

Transport Layer Design Issues – Connection Management –

Addressing –Establishing a Connection – Releasing a Connection –

Flow Control and Buffering – Multiplexing – Crash Recovery.


Application Layer:

Application Layer Design Issues – File Transfer, Access and

Management – E–mail – WWW – Multimedia – Other Applications.

446

TEXT BOOK: 01. Andrew Tanenbaum, Computer Networks, 3rd Edition, Prentice

Hall of India, New Delhi, 1997. REFERENCES:

01. Forouzan, Data Communication and Networking, TMH, New Delhi, 2007.

02. Stallings W., Data and Computer Communication, Prentice Hall

of India New Delhi, 4th Edition, New Delhi, 1996.

Core Lab ADVANCED JAVA PROGRAMMING LAB Code: 14254205

SEMESTER II


Objective:

To familiarize students how to program in JAVA language from an

advanced perspective and use certain object oriented programming

concepts.

01. Design a registration form using Java Server Page.

02. Design a form using XML Validation.

03. Design of Simple Chat Program

04. Working with Multimedia Data–Image and Audio Files.

05. Accessing Remote Object Methods using RMI for

Simple Application.

06. Design of Component based Application with Beans.

07. Design of a Sales Order Entry form with Servlets.

08. Order Processing using JDBC.

09. Payroll Application using JDBC.

10. Inventory Application using JDBC.

REFERENCES:

01. Dan Brookheir, Java Beans: Developer’s Reference, New Riders,

New Delhi, 1997. 02. Luke Cassadt–Dorion, et al., Industrial Strength Java,

Techmedia, New Delhi, 1997.

Core Lab CLIENT/SERVER LAB Code: 14254206

(VB with Oracle (or) ASP with Oracle)

SEMESTER II

4 Hrs/Week


To understand the basics of Client/Server technology such as LAN,

WAN, MAN, Internet, Intranet etc., through lab exercises.

01. Process Students Mark List using Data Control.

02. Library Management using Data Control.

03. Stock Inventory using Data Control.

04. Program using DAO to create Simple Hotel Reservation

form Software (reservation, check in and logout)

05. Program using DAO to create an Address Book.

447

06. Develop a Library Management System using ADO.

07. Develop an Inventory Control System using ADO.

08. Program for Super Market Billing using Sequential File.

09. Design a Data Report for students Marks Details.

10. Design a Data Report for Employee Pay Bill.

REFERENCE:

01. Evangelos petroutsos, Mastering Visual Basics, BPB

Publications, New Delhi, 1988.

02. Ivan Bayross, SQL and Pvt. Ltd.,/SQL using Oracle 8i and 9i wih

SQLJ, BPB Publications, New Delhi, 2003.

Non–Major Elective WEB DESIGNING Code: 14464225

SEMESTER II


This course demonstrate an in–depth understanding of the tools

and Web technologies necessary for business application design

and development. The course covers client side scripting like HTML,

JavaScript and server side scripting like servlets, JSPs.


Internet:

Introduction – Internet Access – Internet Addressing – World

Wide Web Introduction – Web Browsers.

Electronic Mail:

Introduction – Name and Addressing – Mailing Basics –

Advantages and Disadvantages – Email Services.


Introduction to HTML:

HTML Tags – Paired Tags – Commonly used HTML Commands –

Titles and Footers – Text Formatting – Emphasizing Material in a Web

Page – Text Styles – Other Text Effects – Spacing.


Lists:

Types of Lists – Adding Graphics to HTML Documents – Using

the BORDER, WIDTH, ALIGN, ALT Attributes.

Tables:

Introduction – Using the WIDTH, BORDER Attributes – Using

the CELLPADING, CELLSPACING, BGCOLOR, COLSPAN, ROWSPAN

Attributes.


Linking Documents:

Links – Images as Hyperlinks.

448

Frames:

Introduction to Frames.


Introduction to JavaScript:

Advantages of JavaScript – Writing JavaScript into HTML

Building up JavaScript syntax – Basic Programming Techniques –

Operators and Expressions – JavaScript Programming Constructs –

Conditional Checking –Functions in JavaScript – Placing Text in a

Browser – Dialog Boxes.

TEXT BOOKS: 01. Alexis Leon and Mathews Leon, Fundamentals of Information

Technology, Leon Tech World, Chennai, 1999. 02. Ivan Bayross, Web Enabled Commercial Applications

Development Using HTML, DHTML, JavaScript, Perl CGI, 2nd Revised Edition, BPB Publications, New Delhi, 2000.

REFERENCES:

01. James Jaworski, Mastering Java Script and Jscript, BPB Publications, New Delhi, 1999.

02. Thomas A. Powell, The Complete Reference HTML, Tata

McGraw–Hill, 3nd Edition, New Delhi, 2001.

Self-Learning Course WEB TECHNOLOGY Code: 14804225

SEMESTER II

Addl. Credits 3 Objective:

Students will get an introduction about various Scripting

Languages.

Students will be provided with an up–to–date survey of departments

in Web Technologies.

Enable the students to know techniques involved to support real

time Software Development.

UNIT – I:

Introduction:

History of the Internet and World Wide Web – HTML 4 Protocols –

HTTP, SMTP, POP3, MIME, IMAP, Introduction to JAVA Scripts – Object

Based Scripting for the Web.

UNIT – II:

Dynamic HTML:

Introduction – Object Refers, Collectors all and Children. Dynamic

Style, Dynamic Position, Frames, Navigator, Event Model – On Check –

On Load – Onenor – Mouse Rel – Form Process – Event Bubblers –

Filers – Transport with the Filter – Crating Images – Adding Shadows –

Creating Gradients – Creating Motion with Blur – Data Binding – Simple

449

Data Binding – Moving with Record Set – Sorting Table Data – Binding of

an Image and Table.

UNIT – III:

Multimedia:

Audio and Video Speech Synthesis and Recognition – Electronic

Commerce – E–business Model – E–marketing – Online Payments and

Security – Web Servers – HTTP Request Types – System Architecture –

Client Side Scripting and Server Side Scripting – Accessing Web Servers

– IIS – Apache Web Server.

UNIT – IV:

Database – ASP – XML:

Database, Relational Database Model – Overview, SQL – ASP –

Working of ASP – Objects – File System Objects – Session Tracking and

Cookies – Ado – Access a Database From ASP – Server Side Active –

X Components Web Resources – XML Structure in Data – Name

Spaces – DTD – Vocabularies – DOM Methods.

UNIT – V:

Servlets and JSP:

Introduction – Servlet Overview Architecture – Handling HTTP

Request – Get and Post Request – Redirecting Request – Multi–Tier

Applications – JSP – Overview – Objects – Scripting – Standard Actions

– Directives.

TEXT BOOKS:

01. Deitel and Deitel and Glodberg, Internet and World Wide Web – How to Porgram, Pearson Education, Asia, 2001.

REFERENCES:

01. Aferganatel, Web Proramming: Desktop Management, PHI, New Delhi, 2004.

02. Eric Ladd and Jim O’ Donnel, Using HTML 4, XML and JAVA, Prentice Hall of India – QUE, New Delhi, 1999.

03. Rajkamal, Web Technology, Tata McGraw–Hill, New Delhi, 2001.

450

M.Sc COMPUTER SCIENCE: Those who have joined from the

academic year 2014–15 onwards under CBCS System

EVALUATION PATTERN

Internal : 25 Marks

External : 75 Marks

INTERNAL:

Test – 15 (average of the better two of the three tests conducted)

Assignment – 5

Seminar – 5

Question Paper Pattern:

INTERNAL EXTERNAL

Part – A : 5/7*2 = 10

Part – B : 2/3*5 = 10

Part – C : 1/2*10 = 10

*30

Part – A : 5/7*2 = 10

Part – B : 5/7*7 = 35

Part – C : 3/5*10 = 30

75

* Internal test mark 30 will be converted to 15.