III and+IV+Semester MCA 2010 11

8/3/2019 III and+IV+Semester MCA 2010 11

1/22

NIE, Mysore 8. Department of PG Studies in CE&A

III Semester

Sl. NoSubjectCode

SubjectTeaching

Dept.

Contact Hrs./Week No. ofCredits

L T P

1 10MCA631 Systems Programming PGStudies

3 0 2 4

2 10MCA632Analysis and Design ofAlgorithms

PGStudies

4 0 0 4

3 10MCA633Database ManagementSystems

PGStudies

4 0 0 4

4 10MCA634 Operating systemsPG

Studies4 0 0 4

5 10MCA67_ Elective-IPG

Studies4 0 0 4

6 10MCA635 Algorithms LabPG

Studies

0 0 3 1.5

7 10MCA636 Database LabPG

Studies0 0 3 1.5

TOTAL (Total Contact Hrs./Week: 29) 19 2 8 23

1


2/22


IV Semester

Sl. NoSubjectCode

SubjectTeaching

Dept.

Contact Hrs./Week No. ofCredits

L T P

1 10MCA641 Java & J2EE PG Studies 4 0 0 4

2 10MCA642 Software Engineering PG Studies 3 0 2 4

3 10MCA643 Web Programming PG Studies 4 0 0 4

4 10MCA644 Computer networks PG Studies 4 0 0 4

5 10MCA67_ Elective-II PG Studies 4 0 0 4

6 10MCA645 Java & J2EE Lab PG Studies 0 0 3 1.5

7 10MCA646 Web Programming PG Studies 0 0 3 1.5

8 10MCA647 Mini Project PG Studies 0 0 2 1

9 10MCA648 Seminar PG Studies 0 0 2 1

TOTAL (Total Contact Hrs./Week: 31) 19 0 12 25

2


3/22


III SEMESTER

Systems Programming (3:0:2)

Sub Code : 10MCA631 CIE : 50%

Hrs/Week : 04 SEE : 50%

SEE Hours : 3 Hrs Max Marks : 100

Part-A1. Machine Architecture 6 Hrs

Introduction, System Software and Machine Architecture, Simplified Instructional Computer

(SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples,Traditional (CISC) Machines - VAX Architecture, Pentium Pro Architecture, RISC Machines -

Ultra SPARC Architecture, Cray T3E Architecture.

2. Assemblers -1 6 HrsBasic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures,

Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program

Relocation.

3. Assemblers- 2 6 Hrs

Machine Independent Assembler Features Literals, Symbol-Definition Statements, Expression,

Program Blocks, Control Sections and Programming Linking, Assembler Design Operations -

One-Pass Assembler, Multi-Pass Assembler, Implementation Examples - MASM Assembler,

SPARC Assembler.

4. Loaders and Linkers 8 Hrs

Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features Relocation, Program Linking, Algorithm and Data Structures for a

Linking Loader; Machine-Independent Loader Features - Automatic Library Search, LoaderOptions, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders,

Implementation Examples - MS-DOS Linker, Sun OS Linker, Cray MPP Linker.

Part-B5. Editors and Debugging Systems 6 Hrs

Text Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive

Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts OfThe System, User-Interface Criteria.

6. Macro Processor 8 HrsBasic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor

Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation

of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword

Macro Parameters, Macro Processor Design Options Recursive Macro Expansion, General-

Purpose Macro Processors, Macro Processing Within Language Translators, Implementation

Examples - MASM Macro Processor, ANSI C Macro Processor.

3


4/22


7. Lex and Yacc-1 6 Hrs

Lex and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables,Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The

Rules Section, Running LEX and YACC, LEX and Hand- Written Lexers, Using LEX - RegularExpression, Examples of Regular Expressions, A Word Counting Program, Parsing a Command

Line.

8. Lex And Yacc - 2 6 Hrs

Using YACC Grammars, Recursive Rules, Shift/Reduce Parsing, What YACC Cannot Parse, A

YACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The

LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity,

Variables and Typed Tokens.

Text Books:

1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.

(Chapters 1 (except 1.5.2), 2 (except 2.5.3), 3, 4, 5 (except 5.5), 7.2, 7.3)

2. John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1999. (Chapters

1, 2 (Page 27-42), 3 (Page 51-65))

Reference Books:

1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition,

Tata McGraw - Hill, 1999.

4


5/22


Analysis and Design of Algorithms (4:0:0)




Part-A

1. Introduction 6 Hrs

Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types,

Fundamental data Structures

2. Fundamentals of the Analysis of Algorithm Efficiency 6 Hrs

Analysis Framework, Asymptotic Notations and Basic efficiency classes, Mathematical analysis

of Recursive and Nonrecursive algorithms, Examples

3. Brute Force 3 Hrs

Selection Sort and Bubble Sort, Sequential Search and String Matching, Exhaustive Search

4. Divide-and-Conquer 5 Hrs

Merge sort, Quick sort, Binary Search, Binary tree Traversals and related properties,

Multiplication of large integers, Stressens Matrix Multiplication

5. Decrease-and-Conquer 5 Hrs

Insertion Sort, Depth First and Breadth First Search, Topological sorting, Algorithms for

Generating Combinatorial Objects.

6. Transform-and-Conquer 5 HrsPresorting, Balanced Search Trees, Heaps and Heapsort, Problem Reduction

Part-B

7. Space and Time Tradeoffs 4 Hrs

Sorting by Counting, Input Enhancement in String Matching, Hashing

8. Dynamic Programming 4 Hrs

Computing a binomial coefficient, Warshalls and Floyds Algorithms, The Knapsack Problem

and Memory Functions

9. Greedy Technique 5 HrsPrims Algorithm, Kruskals Algorithm, Dijkstras Algorithm, Huffman Trees

10. Limitations of Algorithm Power 4 Hrs

Lower-Bound Arguments, Decision Trees, P, NP and NP-Complete Problems

11. Coping with the Limitations of Algorithm Power 5 Hrs

Backtracking, Branch-and-Bound, Approximation Algorithm for NPHard problems.

5


6/22


Text Books:

1. Anany Levitin: Introduction to the Design and Analysis of Algorithms, Pearson Education,2003. (Chapters 1.1-1.4, 2.1-2.5, 3.1, 3.2, 3.4, 4.1-4.5, 5.1-5.4, 6.1, 6.3, 6.4, 6.6, 7.1-7.3, 8.1, 8.2,

8.4, 9.1-9.4, 10.1-10.3, 11.1-11.3)

Reference Books:

1. Coremen T.H., Leiserson C.E., and Rivest R.L.: Introduction to Algorithms, PHI, 1998.

2. Horowitz E., Sahani S., Rajasekharan S.: Computer Algorithms, Galgotia Publications, 2001.

6


7/22


Database Management Systems (4:0:0)




Part-A

1. Introduction 6 Hrs

Introduction; An example; Characteristics of Database approach; Actors on the screen; Workers

behind the scene; Advantages of using DBMS approach; A brief history of database applications;

when not to use a DBMS. Data models, schemas and instances; Three-schema architecture anddata independence; Database languages and interfaces; The database system environment;

Centralized and client-server architectures; Classification of Database Management systems.

2. Entity-Relationship Model 6 HrsUsing High-Level Conceptual Data Models for Database Design; An Example Database

Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship

Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design; ER

Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.

3. Relational Model and Relational Algebra 8 Hrs

Relational Model Concepts; Relational Model Constraints and Relational Database Schemas;

Update Operations, Transactions and dealing with constraint violations; Unary Relational

Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary

Relational Operations : JOIN and DIVISION; Additional Relational Operations; Examples ofQueries in Relational Algebra; Relational Database Design Using ER- to-Relational Mapping.

Part-B

4. SQL 12 Hrs

SQL Data Definition and Data Types; Specifying basic constraints in SQL; Schema change

statements in SQL; Basic queries in SQL; More complex SQL Queries. Insert, Delete and Update

statements in SQL; Specifying constraints as

Assertion and Trigger; Views (Virtual Tables) in SQL; Additional features of SQL; Database

programming issues and techniques; Embedded SQL, Dynamic SQL; Database stored procedures

and SQL / PSM.

5. Database Design 12 HrsInformal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms

Based on Primary Keys; General Definitions of Second and Third

Normal Forms; Boyce-Codd Normal Form. Properties of Relational Decompositions; Algorithms

for Relational Database Schema Design; Multivalued Dependencies and Fourth Normal Form;Join Dependencies and Fifth Normal Form; Inclusion Dependencies; Other Dependencies and

Normal Forms.

7


8/22


6. Transaction Management 8 Hrs

The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions; Lock-Based Concurrency Control; Performance of locking; Transaction support in SQL; Introduction

to crash recovery; 2PL,Serializability and Recoverability; Lock Management; Introduction toARIES; The log; Other recovery-related structures; The write-ahead log protocol; Checkpointing;

Recovering from a System Crash; Media Recovery; Other approaches and interaction with

concurrency control.

Text Books:

1. Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition, Addison- Wesley, 2007

(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except SQLJ, 9.4, 10, 11)

2. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3 rd Edition,

McGraw-Hill, 2003. (Chapters 16, 17.1, 17.2, 18)

Reference Books:1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 5th Edition, Mc-GrawHill,

2006.

2. C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 8th Edition,

Pearson education, 2006.

8


9/22


Operating Systems (4:0:0)




Part-A

1. Introduction to Operating Systems, System structures 6 Hrs

What operating systems do; Computer System organization; Computer System architecture;

Operating System structure; Operating System operations; Process management; Memory

management; Storage management; Protection and security; Distributed system; Special-purposesystems; Computing environments.

Operating System Services; User - Operating System interface; System calls; Types of system

calls; System programs; Operating System design and implementation; Operating System

structure; Virtual machines; Operating System generation; System boot.

2. Process Management 7 Hrs

Process concept; Process scheduling; Operations on processes; Inter-process communication.

Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; Threading

issues. Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-

Processor scheduling; Thread scheduling.

3. Process Synchronization 7 Hrs

Synchronization: The Critical section problem; Petersons solution; Synchronization hardware;

Semaphores; Classical problems of synchronization; Monitors.

4. Deadlocks 6 Hrs

Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlockprevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Part-B

5. Memory Management 7 Hrs

Memory Management Strategies: Background; Swapping; Contiguous memory allocation;

Paging; Structure of page table; Segmentation. Virtual Memory Management: Background;

Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing.

6. File System, Implementation of File System 7 HrsFile System: File concept; Access methods; Directory structure; File system mounting; File

sharing; Protection. Implementing File System: File system structure; File system

implementation; Directory implementation; Allocation methods; Free space management.

7. Secondary Storage Structures, Protection 6 Hrs

Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk

9


10/22


management; Swap space management. Protection: Goals of protection, Principles of protection,

Domain of protection, Access matrix , Implementation of access matrix, Access control,

Revocation of access rights, Capability-Based systems.

8. Case Study: The Linux Operating System 6 Hrs

Linux history; Design principles; Kernel modules; Process management; Scheduling; Memory

management; File systems, Input and output; Inter-process communication.

Text Books:

1. Abraham Silberschatz, Peter Baer Galvin , Greg Gagne: Operating System Principles, 7 th

edition, Wiley-India, 2006. (Chapters: 1, 2, 3.1 to 3.4 , 4.1 to 4.4, 5.1 to 5.5, 6.1 to 6.7, 7, 8.1 to

8.6, 9.1 to 9.6, 10, 11.1 to 11.5, 12.1 to 12.6, 17.1 to 17.8, 21.1 to 21.9)

Reference Books:

1. D.M Dhamdhere: Operating systems - A concept based Approach, 2 nd Edition, Tata McGraw-

Hill, 2002.

2. P.C.P. Bhatt: Operating Systems, 2nd Edition, PHI, 2006.

3. Harvey M Deital: Operating systems, 3rd Edition, Addison Wesley, 1990.

10


11/22


UNIX Systems Programming(4:0:0)




Part-A

1. Introduction - 6 Hrs

UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference

between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open

Standards. UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development

Environment, API Common Characteristics.

2. UNIX Files - 6 Hrs

File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in

UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files,Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic

Links.

3. UNIX File APIs - 7 Hrs

General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File

APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class

for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing

Program.

4. UNIX Processes 7 Hrs

The Environment of a UNIX Process: Introduction, main function, Process Termination,

Command-Line Arguments, Environment List, Memory Layout of a C Program, SharedLibraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit,

setrlimit Functions, UNIX Kernel Support for Processes.

Part-B

5. Process Control 7 Hrs

Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, waited, wait3, wait4 Functions,

Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system

Function, Process Accounting, User Identification, Process Times. Process Relationships:

Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal,

tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell Execution of Programs, Orphaned

Process Groups.

6. Signals and Daemon Processes 7 Hrs

Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD

Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, IntervalTimers, POSIX.lb Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding

Rules, Error Logging, Single instance daemons; Daemon conventions; Client-Server Model.

11


12/22


7. Interprocess Communication - 16 Hrs

Introduction; Pipes, popen, pclose Functions; Coprocesses; FIFOs; XSI IPC; Message Queues;

Semaphores.

8. Network IPC: Sockets 6 Hrs

Introduction; Socket Descriptors; Addressing; Connection establishment; Data transfer; Socket

options; Out-of-band data; Nonblocking and asynchronous I/O.

Text Books:

1 Terrence Chan: Unix System Programming Using C++, Prentice-Hall of India / Pearson

Education, 1999.. (Chapters 1, 5, 6, 7, 8, 9)

2 W.Richard Stevens, Stephen A. Rago: Advanced Programming in the UNIX Environment, 2nd

Edition, Pearson Education / Prentice-Hall of India, 2005. (Chapters 7, 8, 9, 13, 15, 16)

Reference Books:

1. Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson Education, 2005.

2. Maurice.J.Bach: The Design of the UNIX Operating System, Pearson Education / PHI, 1987.

3. Uresh Vahalia: UNIX Internals, Pearson Education, 2001.

12


13/22


Algorithms Laboratory (0:0:3)

Sub Code : 10MCA635 Hrs/Week : 03

Max Marks : 50

Implement the following using C/C++ Language.

Searching algoritms, sorting algorithms, topological ordering, Dijkstras algorithm,

kruskals algorithm, prims algorithm, floyds algorithm, Back tracking algorithms

DBMS Laboratory(0:0:3)


Max Marks : 50

Programs on Data Definition, Table Creation, Constraints, Insert, Select Commands, Update &Delete Commands, Nested Queries & Join Queries, Views,Triggers, Database Design andimplementation (Simple mini Project)

Front end : VB / VC ++ / JAVA (Preferably on .NET Platform) (Only for Simple mini Project)Back end: DB2 / Oracle / mySQLPlatform: linux / Windows 2000 Professional/XPOracle server could be loaded and can be connected from individual PCs.

13


14/22


IV SEMESTER

Java & J2EE (4:0:0)




Part-A

1. Introduction to Java 6 Hrs

Java and Java applications; Java Development Kit (JDK); Java is interpreted, Byte Code, JVM;

Object-oriented programming; Simple Java programs. Data types and other tokens: Booleanvariables, int, long, char, operators, arrays, white spaces, literals, assigning values; Creating and

destroying objects; Access specifiers. Operators and Expressions: Arithmetic Operators, Bitwise

operators, Relational operators, The Assignment Operator, The ? Operator; Operator Precedence;

Logical expression; Type casting; Strings. Control Statements: Selection statements, iterationstatements, Jump Statements.

2. Classes, Inheritance, Exceptions, Applets 6 Hrs

Classes: Classes in Java; Declaring a class; Class name; Super classes; Constructors; Creating

instances of class; Inner classes. Inheritance: Simple, multiple, and multilevel inheritance;

Overriding, overloading. Exception handling: Exception handling in Java. The Applet Class: Two

types of Applets; Applet basics; Applet Architecture; An Applet skeleton; Simple Applet display

methods; Requesting repainting; Using the Status Window; The HTML APPLET tag; Passing

parameters to Applets; getDocumentbase() and getCodebase(); ApletContext and

showDocument(); The AudioClip Interface; The AppletStub Interface; Output to the Console.

3. Multi Threaded Programming, Event Handling 7 HrsMulti Threaded Programming: What are threads? How to make the classes threadable; Extending

threads; Implementing runnable; Synchronization; Changing state of the thread; Bounded buffer problems, read-write problem, producer-consumer problems. Event Handling: Two event

handling mechanisms; The delegation event model; Event classes; Sources of events; Event

listener interfaces; Using the delegation event model; Adapter classes; Inner classes.

4. Swings 7 Hrs

Swings: The origins of Swing; Two key Swing features; Components and Containers; The Swing

Packages; A simple Swing Application; Create a Swing Applet; Jlabel and ImageIcon;

JTextField;The Swing Buttons; JTabbedpane; JScrollPane; JList; JComboBox; JTable.

Part-B

5. Java 2 Enterprise Edition Overview, Database Access 6 Hrs

Overview of J2EE and J2SE. The Concept of JDBC; JDBC Driver Types; JDBC Packages; A

Brief Overview of the JDBC process; Database Connection; Associating the JDBC/ODBC Bridgewith the Database; Statement Objects; ResultSet; Transaction Processing; Metadata, Data types;

Exceptions.

14


15/22


6. Servlets 7 Hrs

Background; The Life Cycle of a Servlet; Using Tomcat for Servlet Development; A simple

Servlet; The Servlet API; The Javax.servlet Package; Reading Servlet Parameter; The

Javax.servlet.http package; Handling HTTP Requests and Responses; Using Cookies; SessionTracking.

7. JSP, RMI 6 Hrs

Java Server Pages (JSP): JSP, JSP Tags, Tomcat, Request String, User Sessions, Cookies, Session

Objects. Java Remote Method Invocation: Remote Method Invocation concept; Server side,

Client side.

8. Enterprise Java Beans 7 Hrs

Enterprise java Beans; Deployment Descriptors; Session Java Bean, Entity Java Bean; Message-

Driven Bean; The JAR File.

Text Books:

1. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007.(Chapters 1, 2, 3, 4, 5, 6, 8, 10, 11, 21, 22, 29, 30, 31)

2. Jim Keogh: J2EE The Complete Reference, Tata McGraw Hill, 2007. (Chapters 5, 6, 11, 12,

15)

Reference Books:

1. Y. Daniel Liang: Introduction to JAVA Programming, 6th Edition, Pearson Education, 2007.

2. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education, 2004.

15


16/22


Software Engineering (4:0:0)




Part-A

1. Overview 6 Hrs

Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-

Technical systems: Emergent system properties; Systems engineering; Organizations, people and

computer systems; Legacy systems.

2. Critical Systems, Software Processes 6 Hrs

Critical Systems: A simple safety-critical system; System dependability; Availability and

reliability. Software Processes: Models, Process iteration, Process activities; The Rational Unified

Process; Computer Aided Software Engineering.

3. Requirements 7 Hrs

Software Requirements: Functional and Non-functional requirements; User requirements; System

requirements; Interface specification; The software requirements document. Requirements

Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements

validation; Requirements management.

4. System models, Project Management 7 Hrs

System Models: Context models; Behavioral models; Data models; Object models; Structured

methods. Project Management: Management activities; Project planning; Project scheduling; Riskmanagement.

Part-B

5. Software Design 7 Hrs

Architectural Design: Architectural design decisions; System organization; Modular

decomposition styles; Control styles. Object-Oriented design: Objects and Object Classes; An

Object-Oriented design process; Design evolution.

6. Development 6 Hrs

Rapid Software Development: Agile methods; Extreme programming; Rapid application

development. Software Evolution: Program evolution dynamics; Software maintenance;

Evolution processes; Legacy system evolution.

7. Verification and Validation 7 Hrs

Verification and Validation: Planning; Software inspections; automated static analysis;

Verification and formal methods. Software testing: System testing; Component testing; Test case

design; Test automation.

16


17/22


8. Management 6 Hrs

Managing People: Selecting staff; Motivating people; Managing people; The People Capability

Maturity Model. Software Cost Estimation: Productivity; Estimation techniques; Algorithmic

cost modeling, Project duration and staffing.

Text Books:

1. Ian Sommerville: Software Engineering, 8th Edition, Person Education Ltd., 2007. (Chapters-:1, 2, 3, 4, 5, 6, 7, 8, 11, 14, 17, 21, 22, 23, 25, 26)

Reference Books:

1. Roger.S.Pressman: Software Engineering-A Practitioners approach, 7th Edition,McGraw-Hill,

2007.

2. Shari Lawrence Pfleeger, Joanne M. Atlee : Software Engineering Theory and Practice, 3rd

Edition, Pearson Education, 2006.

3. Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw Hill, 2004.

17


18/22


Web Programming (4:0:0)




Part-A

1. Fundamentals of Web, XHTML 12 Hrs

Internet, WWW, Web Browsers, and Web Servers; URLs; MIME;HTTP; Security; The Web

Programmers Toolbox. XHTML: Origins and evolution of HTML and XHTML; Basic syntax;

Standard XHTML document structure; Basic text markup; Images; Hypertext Links; Lists;Tables; Forms; Frames; Syntactic differences between HTML and XHTML.

2. CSS 6 Hrs

Introduction; Levels of style sheets; Style specification formats; Selector forms; Property valueforms; Font properties; List properties; Color; Alignment of text; The Box model; Background

images; The and tags; Conflict resolution.

3. Javascript 8 Hrs

Overview of Javascript; Object orientation and Javascript; General syntactic characteristics;

Primitives, operations, and expressions; Screen output and keyboard input; Control statements;

Object creation and modification; Arrays; Functions; Constructor; Pattern matching using regular

expressions; Errors in scripts; Examples.

Part-B

4. Javascript and HTML Documents, Dynamic Documents with Javascript 10 HrsThe Javascript execution environment; The Document Object Model; Element access in

Javascript; Events and event handling; Handling events from the Body elements, Button

elements, Text box and Password elements; The DOM 2 event model; The navigator object;

DOM tree traversal and modification. Introduction to dynamic documents; Positioning elements;

Moving elements; Element visibility; Changing colors and fonts; Dynamic content; Stacking

elements; Locating the mouse cursor; Reacting to a mouse click; Slow movement of elements;

Dragging and dropping elements.

5. XML 6 Hrs

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.

6. Perl, CGI Programming 10 Hrs

Origins and uses of Perl; Scalars and their operations; Assignment statements and simple inputand output; Control statements; Fundamentals of arrays; Hashes; References; Functions; Pattern

matching; File input and output; Examples. The Common Gateway Interface; CGI linkage; Query

string format; CGI.pm module; A survey example; Cookies.

18


19/22


Text Books:

1. Robert W. Sebesta: Programming the World Wide Web, 4th Edition, Pearson Education, 2008.

(Chapters 1 to 9)

Reference Books:

1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to H program, 3rd

Edition, Pearson Education / PHI, 2004.2. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley India, 2006.

3. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.

19


20/22


Computer Networks (4:0:0)




Part-A1. Foundation 8 H

Building a Network; Applications; Requirements; Network Architecture; Implementing Network

software; Performance.

2. Direct Link Networks 12H

Physically connecting hosts; Hardware building blocks; Encoding; Framing; Error

detection; Reliable transmission; Ethernet (802.3); Ring; (802.5, FDDI, 802.17); Wireless

(802.15.1, 802.11, 802.16, Cell Phone Technologies).

3. Packet Switching 7 HSwitching and forwarding; Bridges and LAN Switches.

Part-B4. Internetworking 12 H

Simple internetworking (IP); Routing; Global Internet.

5. End to-End Protocols; Resource Allocation Issues 7 H

Simple demultiplexer (UDP); Reliable byte stream (TCP); Issues in resource allocation.

6. Applications 6 H

Traditional applications; Web services

Text Books:

1. Larry L. Peterson and Bruce S. David: Computer Networks A Systems Approach, 4 th Edition,

Elsevier, 2007.

(Chapters 1, 2, 3.1, 3.2, 4.1, 4.2, 4.3, 5.1, 5.2, 6.1, 9.1, 9.2, 9.3)

References:

1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata

McGraw-Hill, 2006.

2. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.

3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks Fundamental Concepts

and Key architectures, 2nd

Edition Tata McGraw-Hill, 2004.

20


21/22


Java and J2EE Laboratory (0:0:3)


Max Marks : 50

JAVA programs on constructor overloading, method overloading, inner class and access

protection, Inheritance, Exception handling, creation of interfaces,

JAVA programs on applets, JDBC design, Clint server implementation, RMI, Servlets

and JSP.

Web Programming Laboratory (0:0:2)


Max Marks : 50

Program on XHTML tables and tags, Programs on Javascripts,, Programs on XML documents

Programs on XML style sheets , Programs on PHP and MySql

Mini Project (0:0:2)


Max Marks : 50

A team of TWO students must develop the mini project. However, during the final

presentation, each student must demonstrate the project individually.

The team may implement a mini project of their choice.

The team must submit a Brief Project Report (25 to 30 Pages) that must include the

following:

Introduction

Requirements

Software Development Process Model Adopted

Analysis and Design Models

Implementation

Testing

The Report must be valuated for 10 marks, Demonstration for 30 marks and Vivafor 10 marks.

21


22/22


Seminar (0:0:2)


Max Marks : 50

A Seminar on the current topic should be identified, prepared and presented. A report on thisseminar with 15-20 pages should also be prepared.

Date post:	06-Apr-2018
Category:	Documents
Upload:	dharanisathyan
View:	218 times
Download:	0 times