IV Sem CourseInfo 2013

7/28/2019 IV Sem CourseInfo 2013

1/24

Course Outline Semester: IV Session: Feb-May 2013_____

Perseverance Excellence Service 1

P.E.S. INSTITUTE OF TECHNOLOGY - DEPT. OF MCA

GENERAL GUIDELINES

1. This book is to be brought to the classroom daily.2. Students should be in time for the first class and subsequent classes thereafter.3. Students should keep the classroom and Laboratories clean and tidy.4. Students are informed to clarify their doubts in the respective subjects with the faculty

by taking prior appointments.

5. Students are advised to show due respect to all faculties regardless of the departmentand maintain affable personality.

6. Students are to maintain absolute discipline and decorum, so as to promote the fairname of their college in all its activities.

7. Students having less than 85% attendance in any subject (both theory and practical)will not be allowed to take up the University Examination.

8. Students who fail to get minimum of 25 marks in internal assessment of any subject willfall in NSSR category and not eligible to take up that particular subject.

9. Parents are to follow the progress of their wards by being in touch with the collegeauthorities at regular intervals.

10.Writing on desks and walls is strictly prohibited, failing which the students will be fined aminimum of Rs.500. If the identity of the individual is not established the entire classwill be fined ranging from Rs.100 to Rs.500.

11.Attendance of the students will be displayed on the departmental notice board as well asavailable in the web site at the end of the 7th, 11th and 16th week of the semester (w.e.fAug 1, 2011) along with the list of the students having shortage in attendance.

12.Students should bring the observation book as well as the laboratory record bookcompleted in all respect to the laboratory.

13.Take the print outs of the source listing and output of the code after execution anddelete your files.

14.Students are not supposed to alter the configuration of the system / any software on thesystem.

15.Final examination is of 3 hrs. Duration.16.Students are supposed to fill in the columns in the LOG BOOK at the time of entering the

labs.17.Students should wear IDENTITY CARD all the time. Students without the same will not

be allowed to enter either the classroom or the lab.18.Those students who have less than 85% attendance should sign the undertaking given

by their class teachers.


2/24



Sl.No

Sub. Code SUBJECTMarks

Total PAGE#IA UE

1 10MCA41 Topics in Enterprise Architectures-I 50 100 150 3-5

2 10MCA42 Software Engineering 50 100 150 6-7

3 10MCA43 Web Programming 50 100 150 8-10

4 10MCA44 Design and Analysis of Algorithms 50 100 150 11-13

5

Elective -I

50 100 150

14-1610MCA452 Unix System Programming

10MCA455 Principles of User Interface Design 17-18

10MCA456 Advanced Computer Networks 19-20

6 10MCA46 J2EE Laboratory 50 50 100 21

7 10MCA47 Web Programming Laboratory 50 50 100 22-23

8 10MCA48 Algorithms Laboratory 50 50 100 24

Total 400 650 1050

TIME TABLE

Day/ Time 8.15-9.15 9.15-10.15

Tea

Break

10.1

5-10.

45

10.45-11.45 11.45-12.45

LunchB

reak

12.4

5

-1.3

0 1.30-2.30 2.30-3.30

Monday

Tuesday

Wednesday

Thursday

Friday

Class Teachers

IV A: Mrs. Rashmi R S

IV B: Mr. Siddegowda


3/24



TOPICS IN ENTERPRISE ARCHITECTURE 1

Subject code: 10MCA41 Hrs / Week: 04Faculty : G. Sree Rekha/ Vanashree Total Hrs : 52

Overview: Java is first and foremost programming language used for internet. This coursedescribes advanced concepts of Java programming language. It includes topics like JDBC which helpsa programmer to interact with all kinds of databases, types of drivers, JDBC API, JDBC Architecture,

Database connection, various objects used for establishing connection with database and interactingwith the databases. Servlets and Jsps which are used for server side programming are included inthe respective units. Student would learn topics right from Installing the servlets to life cycle, ServletAPI, Handling various requests, JSP lifecycle etc. This could help the students to develop their ownweb applications by the end of the course. In addition Students learn what is a basic Java Bean andalso EJB (Enterprise Java Beans) in detail.

ClassNo.

ChapterTitle/Reference

LiteratureTopics to be covered

% of portions to be covered

ReferenceChapter

Cumulative

1

Unit I

Working withJDBCR1: Page 124-160

(Chapter 6)T1: Page 466-560

(Chapter 13)

Course Overview

10% 10%

2 The Concept of JDBC, JDBC Driver Types,

JDBC Packages3 A Brief Overview of JDBC Process,Database Connection, Associating theJDBC/ODBC Bridge with the Database

4 Statement Objects, ResultSet

5 Transaction Processing, Metadata, DataTypes, Exceptions

6Unit II

Working withJDBC

R1: Page 184-261

(Chapter 6)T1: Page 466-560

(Chapter 13)

Model Programs, Tables, Indexing,Inserting Data into Tables

10% 20%

7 Selecting Data from a Table, Metadata,

8Updating Tables, Deleting Data from aTable

9 Joining Tables

10Calculating Data, Grouping and OrderingData,

11 Subqueries, VIEW.

12

Unit IIIWorking with

ServletPrograming

T1: Page 318-385(Chapter 11)

Introduction, Advantages of Servlets overCGI

15% 35%

13 Installing Servlets

14 The Servlets Life Cycle

15 Servlet API

16 Handling HTTP GET Request

17 Handling HTTP POST Request

18 Servlet Context

19 Revision

20Unit IV

Working withServlet

ProgrammingT1: Page 318-385

(Chapter 11)

Cookies,

10% 45%

21 Session Tracking

22 Filter API

23Multi-tier Applications Using DatabaseConnectivity

24Multi-tier Applications Using DatabaseConnectivity


4/24



25

Unit VWorking with

JSP


Introduction, Advantages of JSP

18% 63%

26 Developing First JSP,

27 JSP Scripting Elements

28JSP Scripting Elements (Directives,Declaratives, Scriplets, Expressions,Implicit Variables)

29 Page Directives

30 JSTL, Standard Action

31 Custom Tags (all)



34 Revision

35

Unit VIWorking withJava Beans


What is a Java Bean?

16% 79%

36 Advantages of Java Beans

37 The Java Beans API Introspector

38 property Descriptor

39 Event Descriptor, Method Descriptor40 A Bean Example

41 JSP with Java Beans

42 Revision

43

Unit VIIwww.roseindia.

net/ejb

Deployment Descriptors

27% 96%

44 Session Java Bean

45 Session Java Bean

46 Entity Java Bean

47 Entity Java Bean

48 Message-Driven Bean

49 Message-Driven Bean50 The JAR File.

51Review Review Summary 04% 100%

52


5/24



Literature:

Text Book NameBookCode

AuthorEdition/

Publication

Web Technologies: Html, Javascript, Php, Java,Jsp, ASP. Net, Xml and Ajax, Black Book

T1

KogentLearningSolutions

Inc

Wiley India, 2008

http://www.roseindia.net/ejb/http://www.roseindia.net/strutstutorial/introduction.shtml

T2 Web URL Web Reference

http://java.sun.com/j2ee/tutorial/1_3-fcs/doc/EJBConcepts.html

T3 Web URL Web Reference

The J2EE Complete Reference R1 Jim Keogh Tata McGraw Hill

Test 1: JDBC & ServletsTest 2: Servlets and JSPsTest 3: EJBs


6/24



SOFTWARE ENGINEERING

Subject: Code: 10MCA42 No of hours : 52Faculty : Dr. Neelam Bawane/Mr. Siddegowda No of hours/week: 04

OverviewSoftware Development is a multidimensional and complex process. Inherent complexity of a large

system calls for a systematic approach to software development. This course covers thefundamentals of Software Engineering containing eight major units representing the complete lifecycle of a software product.

ClassNo.

ChapterTitle/Reference Literature

Topics to be covered


ReferenceChapter

Cumulative

1

Chapter1

OverviewT1:Page 27-66

Introduction: FAQ's about softwareengineering

12% 12%

2 FAQ's about software engineering

3 Professional and ethical responsibility

4Socio-Technical systems: Emergent

system properties5 Systems engineering

6Organizations, people and computersystems; Legacy systems

7Chapter 2

SoftwareProcesses

T1:Page 87-115

Software Processes: Models

8% 20%

8 Software Process Models

9 Process iteration

10Process activities; The Rational UnifiedProcess

11 Computer-Aided Software Engineering.

12

Chapter 3

RequirementsT1: Page141-192

Software Requirements: Functional andNon-functional requirements

15% 35%

13User requirements; Systemrequirements

14Interface specification; The softwarerequirements document

15Requirements Engineering Processes:Feasibility studies

16 Requirements elicitation and analysis

17 Requirements validation

18 Requirements management

19 Chapter 4

System models

T1: Page 193-21

System Models: Context models

8% 43%20 Behavioral models

21 Data models

22 Object models; Structured methods23

Chapter 5

SoftwareDesign

T1: Page265-289;337-362

Architectural Design: Architecturaldesign decisions

13% 56%

24 System organization

25 Modular decomposition styles

26 Control styles

27Object-Oriented design: Objects andObject Classes

28 An Object-Oriented design process

29 Design evolution


7/24



30 Chapter 6Development

1: Page 415-438

Rapid Software Development: Agilemethods

6% 62%31 Extreme programming

32 Rapid application development

33Chapter 7

Verificationand

Validation

T1: Page 539-58

Verification and Validation: Planning

13% 75%

34 Software inspections

35 Automated static analysis

36 Verification and formal methods37 Software testing: System testing

38 Component testing; Test case design

39 Test automation

40Chapter 4

ProjectManagement

(contd..)T1: Page 116-137

Project Management: Managementactivities

7% 82%41 Project planning

42 Project scheduling

43 Risk management

44Chapter 6:

Development(contd..)

1: Page 512-535

Software Evolution: Program Evolutiondynamics

6% 88%45

Software Maintenance; Evolution

Processes

46 Legacy system evolution

47

Chapter 8

Management

T1: Page 615-66

Managing People: Selecting staff

12% 100%

48 Motivating people; Managing people

49 The People Capability Maturity Model

50Software Cost Estimation: Productivity;Estimation techniques

51 Algorithmic cost modeling

52 Project duration and staffing

Literature:

Test 1: 01-18 Classes

Test 2: 19-36 ClassesTest 3: 37-52 Classes

BookType

BookCode

Title & Author Publication InfoEdition Publisher Year

Text Book T1Software Engineering IanSommerville 8

thPearson

Education2007

ReferenceBook

R1Software Engineering-A Practitionersapproach - Roger. S. Pressman

7th McGraw Hill 2007

R2

An Integrated Approach to SoftwareEngineeringTheory and Practice - Shari LawrencePfleeger, Joanne M. Atlee

-- Wiley, India 2009


8/24



WEB PROGRAMMING

Subject Code: 10MCA43 Hours/Week : 04Faculty : Mr. P. Sreenivas / Mr. Tamal Dey Total hours : 52Overview: It is difficult to overestimate the effect of World Wide Web has had on the day-to-daylives of people, at least those in the developed countries, in just a few years; we have learned to usethe Web for a myriad of disparate tasks. This course describes basic fundamentals of Web likeInternet, Web browsers, Web servers, XHTML origins and evolutions, basic syntax of XHTML,Hypertext, Links, Forms, Frames etc. It gives information of CSS, i.e. cascading style sheets,Introduction of JavaScript, DHTML with Java Script, General characteristics of Java Script, Arrays,functions and Pattern Matching, Dynamic documents with Javascript etc. It also gives briefintroduction about XML, DTP definitions, Namespaces and XML Schemas, XSLT style sheets etc. Italso describes the need of programming in Perl, CGI scripting etc. The course attempts at teachinghow toformat web pages, write dynamic interfaces by using java script, write CGI scripts in Perl, linkdatabases to websites and incorporate latest ideas in web usability also to design various Web siteswith attractive information and content in the web pages by applying all the above said.

ClassNo.




ReferenceChapter

Cumulative

1

Chapter: 1

Fundamentals ofWeb, XHTML,

CSS

T1:Page 19-112T1:Page 113-150

Internet, World Wide Web, WebBrowsers

25% 25%

2 Web Servers, URLs, MIME

3 HTTP, Security, The Web ProgrammersTool Box

4 XHTML: Origins and evolutions of HTMLand XHTML

5 Basic syntax, Standard XHTMLdocument structure, Basic text markup

6 Images, Hypertext, Links, Lists, Tables

7 Forms, Frames, Demonstration of basictags in HTML and designing of Webpage

8 Revision of Chapter1, Introduction:Levels of Style sheets, Stylespecification formats

9 Selector forms, Property value forms,Font Properties

10 List properties, Color Alignment of text

11 The box model, background images,


9/24



13

Chapter: 2

JavascriptT1: Page151-206

Overview of Javascript, Object orientationand Javascript

12% 35%

14 General syntactic characteristics,Primitives

15 operations and expressions, Screen outputand Keyboard Input, Control statements

16 Object creation and modification, Arrays,Functions

17 Constructor, Pattern Matching usingregular expressions

18 Errors in scripts, discussion of examples injava script based on above concepts

19

Chapter: 3

Javascript andHTML

Documents,Dynamic

documents withJavascript

T1 : Page 207-246T1 : Page 247-282

The Javascript execution environment,The document object model

14% 49%

20 Element access in Javascript, Events andHandling

21 Handling events from body elements,Button elements, Handling events fromtextbox and password elements

22 The DOM2 event model, Navigator Object,DOM Tree traversal and modification

23 Introduction to dynamic documents,positioning elements, moving elements

24 Element visibility, Changing of color andfonts, Dynamic content

25 Stacking elements, Locating the mousecursor, Reacting to mouse click, Slowmovement of elements

26 Dragging and dropping of elements anddemo of all above functionalities usingWeb page

27

Chapter: 4

XMLT1 : Page 283-328

Introduction: Syntax, Document Structure

12% 61%

28 Document type definitions

29 Name Spaces, XML SchemaDisplaying raw XML documents

30 Displaying XML documents with CSS

31 XSLT style sheets, XML processors, WebServices, Demo of all above functionalities

32

Chapter : 5

Perl, CGI

ProgrammingT1 : Page 329-366T1 : Page 367-403

Origins and uses of Perl, Scalars and theiroperations, Assignment statements andsimple input and output

13% 74%

33 Control statements, Fundamentals ofarrays, Hashes and references

34 Functions, Pattern Matching

35 File Input and output, Examples

36 The Common Gateway Interface (CGI)37 CGI Linkage, Query String format, CGI.pm

module, A survey example

38 Cookies, Demonstration of various Perland CGI programs, Database access withPerl and MySQL, Discussion of examples inPerl


10/24



39

Chapter : 6

PHPT1 : Page 449-495

Origins and uses of PHP, Overview of PHP,General Syntactic characteristics

12% 86%

40 Primitives, Operations, expressions,output, control statements

41 Arrays, functions, pattern matching

42 Form Handling, Files,

43 Cookies, Session tracking

44 Database Access with PHP and MySQL,

Examples45

Chapter : 7

Ruby, RailsT1 : Page 579-621T1 : Page 623-655

Origins and uses of Ruby, Scalar types andtheir operations

14% 100%

46 Simple Input and Output, Controlstatements

47 Arrays, Hashes, Methods

48 Classes, Code blocks and iterators

49 Pattern Matching, Overview of Rails,Document Request

50 Processing forms, Rails Applications withdatabases, Layouts

51 Revision with Examples

52 Solving Question paper examplesLiterature:

Test 1: Chapter 1 & 2Test 2: Chapter 3 &, 4Test 3: Chapter 5,6& 7

Book Type Code Title& AuthorPublication info

Edition Publisher Year

Text Book T1

Programming the World WideWeb- Robert.W.Sebesta(Chapter 1-9, 11-15)

4th Pearson Education 2008

ReferenceBook R1

Internet and World Wide WebHow to Program- M.Dietel,P.J.Dietel, A.B.Goldberg

4th Pearson Education 2004

ReferenceBook R2

Web Programming BuildingInternet Applications- ChrisBates

3rd Wiley , India 2007

ReferenceBook R3

The Web Warrior Guide to WebProgramming-Xue Bai et al; -- Cenegage Learning 2003


11/24



DESIGN AND ANALYSIS OF ALGORITHMS

Subject Code : 10MCA44 Hours/week : 04

Faculty : A Lekha/Rashmi R S Total Hours : 52

Class

No.




ReferenceChapter

Cumulative

1

Chapter : 1

Introduction*T1: Page 9-21,

39-72

Notion of Algorithm, Fundamentals ofAlgorithmic Problem Solving

9.61 9.61

2Important Problem Types, AnalysisFramework

3Review of Asymptotic Notations,Mathematical Analysis of Recursive andNon-Recursive Algorithms

4Mathematical Analysis of Recursive andNon-Recursive Algorithms

5Mathematical Analysis of Recursive andNon-Recursive Algorithms

6 Chapter : 2

Divide andConquer

T1: Page 117-131T2: Page 136-152,

159-177

Divide and Conquer : General Method

11.53 21.14

7 Defective Chessboard

8 Binary Search

9 Merge Sort, Quick Sort and its Analysis



12Chapter : 1

Introduction Brute Force

T1: Page 93-101,

242-251

Brute Force Approaches: Introduction,Selection Sort and Bubble sort

3.84 24.98

13Sequential Search and Brute Force stringMatching

14Chapter : 3

The GreedyMethod

T1: Page 117-131T2: Page 210-213,218-221, 227-248,

260-267

The Greedy Method: General Method

13.46 38.44

15 Knapsack Problem

16 Job Sequencing with Deadlines

17Minimum cost Spanning Trees Primsand Kruskals

18Minimum cost Spanning Trees Primsand Kruskals (

19 Single source shortest paths Dijkstras

20 Single source shortest paths Dijkstras


12/24



21Chapter : 4

DynamicProgramming

T1: Page 270-277T2: Page 272-275,

288-292, 305-

314, 318-320

The General Method

11.53 49.96

22Warshalls and Floyds Method for All pairs

shortest path

23Warshalls and Floyds Method for All pairs

shortest path

24 Single source shortest path

25 0/1 Knapsack Problem26 Travelling Salesperson Problem

27Chapter: 5

Decrease andConquer

Approaches,Space-Time

tradeoffsT1: Page 149-167,

237-252

Decrease and Conquer Approaches:Introduction, Insertion sort

13.46 63.42

28 Depth First Search, Breadth First Search

29 Topological Sorting

30 Space and Time tradeoffs, Sorting by counting

31 Space and Time tradeoffs, Sorting by counting

32 Input Enhancement in string matching

33Input Enhancement in string matching

34 Chapter: 6

SortingLimitations of

Algorithmicpower and

Coping withthem

T1: Page359-392

Lower bound arguments

13.46 76.88

35 Lower bound arguments

36 Decision trees

37 Decision trees

38 P, NP, NP-complete problems

39 P, NP, NP-complete problems

40Challenges of numerical algorithms

41 Chapter: 7

Coping withLimitations ofAlgorithmic

PowerT1: Page (393-428)

Backtracking

11.53 88.41

42 Backtracking

43 Branch and Bound

44 Branch and Bound

45 Approximation Algorithms

46 Approximation Algorithms47 Chapter: 8

PRAM AlgorithmsT2: Page (623-243,

667-670)

Introduction

11.53 99.94

48 Computational Model

49 Prefix computation

50 List Ranking

51 Graph Problems

52 Graph Problems


13/24



Literature:

Test Syllabus

Test1: Portions covered till Test 1

Test2: portions covered after Test1 till Test2

Test3: portions covered after Test2 till Test3

Book Type Code Title and AuthorPublication Information


Text Book T1

Introduction to the design and

analysis of algorithms, 2ndedition, Pearson Education,2007. By Anany Levitin

2nd Pearson EducationAsia

2007

Text Book T2Fundamentals of ComputerAlgorithms. By Ellis Horowitz,Sartaj Sahni, S. Rajasekaran

2nd Universities Press 2007

ReferenceBook

R1Introduction to Algorithms. ByThomas Cormen, C. E.Leiserson, R. L. Rivest, C. Stein

3rd PHI 2010

Reference

BookR2

Introduction to Design andAnalysis of Algorithms Astrategic approach. R C T Lee,S. S. Tseng, R. C. Chang & Y.T. Tsai

-- Tata McGraw Hill 2005


14/24



UNIX SYSTEM PROGRAMMING

Subject Code : 10MCA452Faculty : Meena L

Hours/week : 04No of Hrs : 50

Overview: The objectives of the courses were to teach students advanced programmingtechniques using UNIX system calls and the ANSI C &C++ programming languages.

The ANSI C library function & C++ standard classes and how to use them to reduce developmenttime and to maximize portability of their applications. Familiarity with the UNIX kernel structure &the system calls. These allow users to write sophisticated applications to manipulate systemresources & to design new Operating Systems. Students will learn to create network-based,multitasking, client/server applications which run on heterogenous UNIX platforms.

ClassNo

Chapter # Topics to be covered% of portions to be covered

ReferenceChapter

ReferenceChapter

1.Chapter: 1

IntroductionT1: Page 2 to18 & 125-128

The ANSI C standard, The ANSI/ISO C++standard,

10% 10%

2. Differences between ANSI C and C++,ThePOSIX standards

3. The POSIX standards4. The POSIX.1 FIPS standard ,The X/OPEN

standards

5. The POSIX APIs, The UNIX and POSIXdevelopment Environment, API commoncharacteristic

6.Chapter: 2

Unix FilesT1: Page No

129 to 146

File Types, UNIX and POSIX file system

10% 20%

7. The UNIX and POSIX file attributes, Inodesin UNIX system V,

8. Application program interface to files9. UNIX Kernal support for files10. Relationship of C stream pointers and filedescriptors, Directory files, Hard and

symbolic links

11.

Chapter: 3

Unix File APIsT1: page 147 to

205

General file APIs-read

12. Creat, read, write, close13. Fcntl, lseek14. Link, unlink

24% 44%

15. Stat , fstat16. Access, chmod, fchmod17. Chown, fchown, lchown, utime18. File and record locking19. directory file APIs20. Device file APIs21. FIFO file APIs, Symbolic link file APIs22.

Chapter : 4 & 5

Introduction to environment of a UNIXprocess, main function, processtermination

23. Environment list, Memory layout of a Cprogram,

24. Shared libraries, Memory allocation


15/24



ClassNo

Chapter # Topics to be covered% of portions to be covered

ReferenceChapter

ReferenceChapter

25.Unix Processes

&Process control

T2: Page No

179 to 259

Environment variables, setjmp andlongjmp functions getrlimit and setrlimitfunctions

24% 68%

26. UNIX kernel support for processes27. process identifiers, fork28. vfork, exit29. Wait, waitpid, wait3, wait4 functions,30. Race conditions31. Exec functions32. changing user IDs and group Ids,

interpreter files, System function

33. process accounting, Use identification,process times

34. terminal login, Network logins35. Process groups, sessions, controlling

terminal, Tcgetgrp and tcsetpgrp functions

36. job control37. Shell execution of programs, Orphaned

process groups

38.Chapter: 6

Signals AndDaemonProcess

T1: Page 261 to282

T2: Page423 to

439

The UNIX kernel support for signals

14% 82%

39. Signal, signal mask40. Sigaction, the SIGCHLD signal and the

waitpid function

41. Sigsetjmp, siglongjmp functions, kill42. Alarm, Interval timers, POSIX.1b Timers43. Introduction to daemon processes,

Daemon characterstics, Coding rules

44.Error logging

Single-instance daemons, daemonconventions, client server model

45. Chapter: 7 & 8Interprocess

Communication

AndNetwork IPC -

Sockets

T2: Page 495 to582

Pipes

18% 100%

46. Popen and pclose functions47. Coprocesses, FIFOsXSI IPC, Message Queues

Semaphores

48. Socket descriptors, addressing49. Addressing50. Connection establishment51. Data transfer52. Socket options: out of band data;

nonblocking and asynchronous I/O


16/24



Literature:

Test syllabus

Test1 : chapter 1,2,3 (upto Class No. 15)Test2 : chapter 3,4,5Test3 : chapter 6,7,8



Text Books T1UNIX System Programmingusing C++ (chapters1,5,6,7,8,9)- Terrance Chan

Prentice Hall India 1999

Text Books T2

Advanced Programming in the

UNIX Environment (chapters7,8,9,13,15,16)- W RichardStevens

Pearson education

2005

ReferenceBook

T1Advanced UNIX SystemProgramming,2nd ed- Marc J.ROchkind

2005

ReferenceBook

T2The design of the UNIXoperating system- Maurice.J.bach

1987

ReferenceBook

T3 UNIX internals- Uresh vahalia 2001


17/24



PRINCIPLES OF USER INTERFACE DESIGN

Subject Code : 10MCA455 No. of hours : 52Faculty : Mr. Chengappa B S (BSC) No. of hours/week : 04

OverviewThis subject deals with development of Universal, standard attractive, interactive and user friendly

software The software development requires many features of the standard specification since it isused by world wide users. Smooth flow of the interface is one of the major factors in it. If theinteraction is not up to the reach of all kinds of users, the software assessed to be not up to themark. This subject gives the procedures and guidelines to maintain high degree of interactionrequired by the system to the user.

ClassNo.




ReferenceChapter

Cumulative

1 Chapter: 1

Usability of

Interactivesystems,Guideline,

principles andTheories

Introduction

12% 12%

2 Usability Requirements,

3 Usability measures,

4 Usability motivations, usability and Goals.

5 Guide lines Principles.

6Theories OAI Models

7

Chapter: 2

DevelopmentProcess

Introduction, organization design tosupport usability, the three pillars of design

12% 24%

8Development of methodology,ethnographic observation.

9 Participatory design, scenario development

10Social impact statement for early designreview, legal issues, expert reviews

11

Usability testing and laboratories, surveys,

acceptance test, evaluation during activeuse

12

Control psychologically orientedexperiments, Introduction, specification,methods interface building tools,Evaluation and Critiquing tools

13

Chapter :3

Interaction

Styles

Introduction

13% 37%

14Examples of direct manipulation systems,explanation of direct manipulation.

15 3D interfaces, Teleoperation

16 Virtual Reality

17 Augmented Reality

18 Introduction to Menu

19 Forms

20Menu selection,Form fillin and

Dialog Box

Task related organization, itempresentation sequence

14% 51%21Response time and display rate, fastmovement through menus

22 Menu layout, form filling, dialog boxes

23 functionality to support users tasks,


18/24



24Menu

selection,Form fillin and

Dialog Box

Command organization strategies, thebenefit of structure.

14% 51%25

naming and abbreviation , commandmenus,

26 Natural language in computing

27

Interactiondevices

Interaction devices, introduction, keyboardand function keys

12% 63%

28Pointing devices, speech recognition,

digitization and generation29 Speech interfaces

30 Auditory interfaces

31 Display small printer

32 Display Large printer

33 Conclusion

34

Chapter: 4

Design Issues

Introduction to QOS

12% 75%

35 Response time Impacts

36 Expectations

37 Altitudes

38 User productivity

39 Frustrating Experiences

40

Balancingfunction and

Fashions

Introduction to error messages

13% 88%

41 Nonanthrographic Design

42 Display Design ,

43 Window Design

44 Color

45 Introduction to User manual and displays

46Online process and tutorial andDevelopment Process

47

Information

Search andVisualizations

Introduction

12% 100%

48 Search in Textual documenting

49 Database querryig

50 Multimedia Document searches51 Filtering and search interface

52 Information Visualization

Literature:

Test Portions:

Test 1: Chapter 1,2Test 2: Chapter 3Test 3: Chapter 4

Book Type Code Title & Author Publication Info


Text Book T1Designing the user interface- BenShneideraman

4thAddisonWesley

1998

ReferenceBook

R1 Human computer interaction Alan j dixet 2nd Prentice Hall 1998

ReferenceBook

R2 User interface design- Eberts -- Prentice Hall 1994

ReferenceBook

R3The essential guide to user interfacedesign- Wilber O Galitz

--Wiley Dreamtech India Pvt

ltd1998


19/24



ADVANCED COMPUTER NETWORKS

Subject Code: 07MCA456 Hours / Week : 04Faculty : Mrs. VEENA.S/Mrs. JAYANTHILADEVI Total Hours : 52

Overview:Data Communication and Networking is one of the fastest growing Technology in todays world. I

changes the way we do business and the way we live. This course covers the topics which are nocovered in Computer Networks course and gives the complete knowledge about this ubiquitoustechnology. This course deals with the widely used technology SONET. Working of Virtual CircuiSwitching Networks like Frame Relays and ATM Networks were discussed here. Recent Concepts andprotocols like Multicasting. SCTP, RTP, RTCP and VoIP will be discussed. It also covers Congestion Controand Quality of Service Issues. Finally a detailed survey on Mobile Ad-Hoc Networks and Wireless SensoNetworks will be there which is the current trend in Networking Research and Development.

Class#



% of portion covered

ReferenceChapter

Cumulative

1 Chapter: 1

Review ofNetwork ModelsT 1: Page 27-50

Overview of the subject, Layered tasks

10% 10%

2 The OSI Model

3 Layers in the OSI Model

4 TCP / IP Protocol Suite

5 Addressing

6Chapter: 2

Sonet / SDHT 1: Page 491-513

Architecture

10% 20%

7 SONET Layers

8 SONET Frames

9 STS Multiplexing

10 SONET Networks, Virtual Tributaries

11 * Chapter :3

Frame Relayand ATM

T 1:Page 517-540

Frame Relay

8% 28%12 ATM

13 ATM

14 ATM LANs

15

Chapter: 4

IPv6, AddressMapping and

Error ReportingT 1: Page

596-605,611-630

IPv6: Advantages, Packet Format

11% 39%

16 Extension Headers, Transition from IPv4to IPv6

17 Dual Stack, Tunneing and HeaderTranslation

18 Address Mapping: ARP

19 RARP,BOOTP and DHCP

20 Error Reporting : ICMP

21 Chapter:5

Multicast RoutingProtocols

T 1: Page 678 -693

Unicast Multicast and Broadcast

8% 47%

22 Applications

23 Multicast Routing

24 Routing Protocols


20/24



25Chapter: 6

SCTPT 1:Page736-753

SCTP Services, SCTP Features

8% 55%26 Packet Format, An SCTP Association

27 Flow Control

28 Error Control, Congestion Control

29

Chapter: 7

Congestion

Control andQuality ofService

T1: Page761790

Data Traffic: Congestion and CongestionControl

11 % 66%

30 Congestion Control in TCP

31 Congestion Control in Frame Relay

32 Quality of Service: Techniques to improveQoS

33 Integrated Services

34 Differentiated Services

35

Chapter: 8

MultimediaT1: Page 901-925

Digitizing Audio and Video: Audio andVideo Compression

11% 77%

36 Streaming stored audio / video

37 Streaming live audio / video, Real timeinteractive audio / video

38 RTP

39 RTCP

40 VoIP41

* Chapter: 9Mobile Ad-Hoc

Networks,Wireless Sensor

Networks

T2: Page 511-531, 535- 557,

559-561

Overview of Wireless Ad-Hoc Networks

23% 100%

42 Routing in ad-hoc Networks

43 Routing Protocols for ad-hoc Networks

44 Routing protocols for ad-hoc Networks

45 Security of ad-hoc Networks

46 Sensor Networks and Protocol Structures

47 Sensor Networks and Protocol Structures

48 Communication Energy Model

49 Clustering Protocols

50 Routing Protocols

51 Zigbee Technology

52 IEEE 802.15.4

Literature:



Text Book T1Data Communication and Networking- Behrouz A. Forouzan

IV Tata McGraw-Hill 2006

Text Book T2Computer and CommunicationNetworks Nader F. Mir

Pearson education 2007

ReferenceBook

R1Data and Computer Communication William Stallings

VIII Prentice Hall India 2007

ReferenceBook

R2 Understanding Data Communicationsand Networks William A.Shay. III

Thomson 2003

* Chapters taken by AJTest SyllabusTest 1: Chapters 1,2,3Test 2: Chapters 4,5,6Test 3: Chapters 7,8,9


21/24



JAVA AND J2EE LABORATORY

Subject Code: 10MCA46 Hours/Week: 03Faculty : Mrs. Sreerekha

1. Write a JAVA Program to insert data into Student DATA BASE and retrieve info base onparticular queries (queries can be given which covers all the topics of 2nd unit).

2. Write a JAVA Servlet Program to implement a dynamic HTML using Servlet (user nameand password should be accepted using HTML and displayed using a Servlet).

3. Write a JAVA Servlet Program to Download a file and display it on the screen (A link hasto be provided in HTML, when the link is clicked corresponding file has to be displayedon Screen.

4. Write a JAVA Servlet Program to implement Request Dispatcher object (use include ()and forward () methods.

5. Write a JAVA Servlet Program to implement and demonstrate get () and Postmethods (Using HTTP Servlet Class).

6. Write a JAVA Servlet Program to implement send Redirect() method(using HTTP ServletClass.

7. Write a JAVA Servlet Program to implement sessions (Using HTTP SessionInterface).

8. a) Write a JAVA JSP Program to print 10 even and 10 odd numbers.b) Write a JAVA JSP Program to implement verification of a particular user loginand display a welcome page.

9. Write a JAVA JSP Program to get student information through a HTML and create aJAVA Bean Class, populate Bean and display the same information through anotherJSP.

10.Write Java JSP Program which uses tag to run a applet.11.Write a Java JSP Program which implements nested tags and also uses

TagSupportClass.

12.An EJB Application that demonstrates Session Bean.13.An EJB Application that demonstrates Entity Bean.14.An EJB Application that demonstrates MDB.


22/24



WEB PROGRAMMING LABORATORY

Subject Code: 10MCA47 Hours/Week: 03

Faculty : Mr.P. Sreenivas /Mr. Tamal Dey IA Marks : 50

Note: One exercise must be asked in the examination.

The assignment of the exercise must be based on lots.

1. Develop and demonstrate a XHTML file that includes Javascript script for the followingproblems:a. Input: A number n obtained using prompt.

Output: The first n Fibonacci numbers.b. Input: A number n obtained using prompt.

Output: A table of numbers from 1 to n and their squares using Alert.2. a. Develop and demonstrate, using Javascript script, a XHTML document that collects

the USN ( the valid format is: A digit from 1 to 4 followed by two upper-casecharacters followed by two digits followed by three upper-case characters followedby two digits; no embedded spaces allowed of the user. Event handler must beincluded for the form element that collects this information to validate the input.

Messages in the alert windows must be produced when errors are detected.b. Modify the above program to get the current semester also (restricted to be a

number from 1 to 6).3. a. Develop and demonstrate, using Javascript script, a XHTML document that contains

three short paragraphs of text, stacked on top of each other, with only enough ofeach showing so that the mouse cursor can be placed over some part of them.When the cursor is placed over the exposed part of any paragraph, it should rise tothe top to become completely visible.

b. Modify the above document so that when a paragraph is moved from the topstacking position, it returns to its original position rather than to the bottom.

4. a. Design an XML document to store information about a student in an engineeringcollege affiliated to VTU. The information must include USN, Name, and Name of

the College, Branch, Year of Joining, and e-mail id. Make up sample data for 3students. Create a CSS style sheet and use it to display the document.b. Create an XSLT style sheet for one student element of the above document and use

it to create a display of that element.5. a. Write a Perl program to display various Server Information like Server Name,

Server Software, Server protocol, CGI Revision etc.b. Write a Perl program to accept UNIX command from a HTML form and to display

the output of the command executed.6. a. Write a Perl program to accept the User Name and display a greeting message

randomly chosen from a list of 4 greeting messages.b. Write a Perl program to keep track of the number of visitors visiting the web page

and to display this count of visitors, with proper headings.7. Write a Perl program to display a digital clock which displays the current time of the

server.

8. Write a Perl program to insert name and age information entered by the user into atable created using MySQL and to display the current contents of this table.

9. Write a PHP program to store current date-time in a COOKIE and display the Lastvisited on date-time on the web page upon reopening of the same page and toincrement count on each refresh and to show the count on web page

10. Write a PHP program to read a student data from XML file, and store into the MySQLdatabase, retrieve and display.


23/24



11. Create a XHTML form with Name, Address Line 1, Address Line 2, and E-mail text fields.On submitting, store the values in MySQL table. Retrieve and display the data based onName.

12. Build a Rails Application to accept book information viz. Accession number, title,authors, edition and publisher from a web page and store the information in a databaseand to search for a book with the title specified by the user and to display the searchresults with proper headings.

Note: Apart from the above exercises some open end problems may also be given in the Labduring lab sessions


24/24


ALGORITHMS LABORATORY

Subject Code : 10MCA48 Hours/Week: 03Faculty : A Lekha/Rashmi R S

Implement the following programs using C/C++ Language.

1. Sort a given set elements using Quick sort method and determine the timerequired to sort the elements. Repeat the experiment for different values on N, the

number of elements in the list to be sorted and plot a graph of the time taken

versus N. The elements can be read from a file or can be generated using random

number generator.

2. a. Print all the nodes reachable from a given node in a digraph using BFS method.b.Check whether a given graph is connected or not using DFS method.

3. Using OpenMP tool, implement a parallelized Merge Sort Algorithm to sort a givenset of elements and determine the time required to sort the elements. Repeat the

experiment for different values of N, the number of elements in the list to be

sorted and plot a graph of the time taken versus N. The elements can be read from

a file or can be generated using the random number generator.

4. Find Minimum Cost Spanning Tree of a given undirected graph using Primsalgorithm.

5. Find Minimum cost Spanning Tree of a given undirected graph using Kruskalsalgorithm.

6. From a given vertex in a weighted connected graph, find the shortest paths toother vertices using Dijkstras algorithm.

7. Find a subset of a given set S = {s1,s2,.....,sn} of N positive integers whose sum isequal to a given positive integer d. For example, if S= {1,2, 5, 6, 8} and d = 9there are two solutions sets {1,2,6} and {1,8}.A suitable message is to be displayed if the given problem instance doesn't have a

solution.

8. a. Obtain the Topological ordering of vertices in a given digraph.b. Compute the transitive closure of a given directed graph using Warshalls

algorithm.

9. Implement 0/1 Knapsack Problem using Dynamic Programming.10. Implement any scheme to find the optimal solution for the Travelling Salesman

Problem and then solve the same problem instance using any approximation

algorithm and determine the error in the approximation.

11. Implement All-Pairs shortest paths problem using Floyds algorithm. Parallelize thisalgorithm implementation using OpenMP and determine the speed achieved.

12. Implement N-Queen's problem using Back Tracking Method.

IV Sem CourseInfo 2013

Documents

Transcript of IV Sem CourseInfo 2013