You are on page 1of 21

BTS (C) — VI — 10 — 006 — N

B. Tech Degree VI Semester Examination, April 2010

IT 602 INTERNET PROGRAMMING

Time : 3 Hours

(2006 Scheme)

PART - A (Answer ALL questions)

Maximum Marks : 100

 

(8 x 5 = 40)

I.

  • (a) Differentiate between internal DTD and external DTD with example.

  • (b) Identify whether the following usage of elements are valid or invalid. < ! ELEMENT drink EMPTY > < ? Xml version = "1.0" ? > < drink > tea < / drink > < ! ELEMENT academy (subject, * course, + school ? ) > <? X ml version = "1.0" > <subject > I P </ subject > <? X ml version = "1.0" > <course > I T < / course > < ? X ml version = "1.0" > < c school > SHSS < / school >

  • (c) How to create a Link to a CGI script? Give suitable eg. Which function in Perl allows to display formatted data? Give suitable eg? Explain JApplet Life Cycle. Explain scripting elements used in JSP. Which are the three types of arrays used in PHP?

  • (h) Describe four methods to manage program flow in PHP.

PART — B

 

(4 x 15 = 60)

Create a well formed and valid XML document for your resume. Include elements containing personal identification, educational qualification, former employer details and special skills.

OR

Differentiate between default name space and explicit name space with necessary

example.

Generate a CGI script for interest calculation, from the following form to generate the given output :

Input

 

Interest Calculator

 

Principle

:

Rate

Year

 

SUBMIT

RESET

OR

Output

Interest Calculator

Your Interest is Rs

(Turn Over)

2

How to send a item and multiple item of data to a CGI script? Explain with suitable example. Describe various Javabean Scope.

OR

Create a table "Product" with fields data, quantity, price, manufactor using JSP and

display those items with price > 12,000

ID

QTY

PRICE

MFR

  • 1000 12,000

10

IBS

50

  • 1400 100,000

ABC

20

  • 1500 14,000

IGM

40

  • 1700 3000

BIS

Generate a PHP script to create a page that allows the user to select a record then edit the record and update the database.

IX.

OR

Generate a PHP script for following form and then submit button is clicked add data to

the "student table

Internet Explorer

X

STUDENT DETAILS

ID

Name

Course

Duration

Institution

ICI

SUBMIT

***

BTS (C) — VI — 10 — 009 — J

B. Tech Degree VI Semester Examination, April 2010

IT 605 OBJECT ORIENTED MODELLING AND DESIGN

Time : 3 Hours

 

(e)

II.

(a)

(b)

III.

 

(a)

( 3)

(c)

VI.

(a)

(b)

VII.

VIII.

(a)

(b)

DC.

(2006 Scheme)

Maximum Marks : 100

PART - A (Answer ALL questions)

With a suitable example explain an Actor and a Usecase. Briefly explain the various kinds of relationships in 00M. Explain how a usecase can be realized. Give an example. Describe about Activity, event of State.

What are template classes? Explain. Distinguish a composite state with a submachine state. Give examples. Explain a deployment diagram and its purpose. Write a note on ADL.

PART — B

Briefly explain about UP architecture.

With a suitable example give the necessary steps in usecase modelling.

Write notes on :

(iii)

OR

Usecase generalization Actor generalization Packages.

Explain the different interaction diagrams with suitable examples.

OR

Comment on activity partitions. With a suitable example explain a sequence diagram.

What is a life line?

Briefly explain design workflow.

Explain interfaces and components. Give examples.

OR

Explain a well formed design class and its characteristics.

Briefly explain the usage of OCL.

Explain any four types of OCL expressions. Give examples.

OR

What is Software Architecture? Explain the common Architectural Styles.

***

(8 x 5 = 40)

(4 x 15

60)

(5)

(10)

(7)

(4)

(4)

(15)

(6)

(7)

(2)

(5)

(10)

(15)

(5)

(10)

(15)

BTS(C) — V1-10 — 007 J

B. Tech Degree VI Semester Examination, April 2010

Time : 3 Hours

CS/IT 603 OPERATING SYSTEMS

(2006 Scheme)

Maximum Marks : 100

I.

PART - A (Answer ALL questions)

(8 x 5 = 40)

  • a. Is busy waiting always less efficient (in terms of using processor time) than a blocking wait? Explain. What advantage is there in having different time-quantum sizes on different levels of a multilevel queuing system? What is external fragmentation? Describe a method for overcoming external fragmentation? What is Translation Look aside Buffer? Explain the steps involved in the page replacement after a TLB miss? Compare Tree Structured Directories with Acyclic Graph Directories? Explain the steps in DMA transfer? Is it possible to have a deadlock involving only one process? Explain you answer.

  • h. Can a system detect that some of its processes are starving? If you answer "yes", explain how it can? If you answer "no", how the system can deal with starvation problem?

PART - B

 

(4 x 15 = 60)

II.

Explain the concept of 'process'. With suitable diagrams explain five states of process and process control block (PCB/TCB).

(15)

 

OR

III.

Consider the following set of processes, with the length of the CPU burst time given in

milliseconds

 

Process

Burst Time

Priority

PI

10

3

P2

1

1

P3

2

3

P4

1

4

P5

5

2

 

The processes are assumed to have arrived in the order PI, P2, P3, P4, P5 all at time 0 and smaller priority number implies a higher priority.

Illustrate the execution of these processes using FCFS, SJF, a non preemptive priority scheduling? What is the turnaround time of each process for each of the scheduling algorithms discussed above?

(15)

 

OF SChc.

(Turn over)

2

 

Explain the concept of paging. Consider a logical address space of eight pages of 1024 words each mapped on to a physical memory of 32 frames. Draw and explain paging architecture.

 

(15)

 

OR

 

Under what circumstances do page faults occur. With suitable diagram describe the actions taken by the operating system when a page fault occurs.

 

(15)

VI.

Multi programming environment demands shared directories, explain a directory structure which supports shared directories. Explain how this directory structure deals with Files with Multiple absolute path names. Dangling pointers to the non existing file, after a file deletion.

(15)

 

OR

VII.

Suppose a disk drive has 5000 cylinders, numbered 0 to 4999, the Drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests in FIFO order is 86, 1470, 913, 1774, 1509, 1022, 1750, 130. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request for each of the following disk scheduling algorithm (a) FCFS (b) SSTF (c) SCAN (d) C - SCAN

(15)

VIII.

Consider the following snapshot of a system

 
 

Allocation

 

Max

 

Available

 

ABCD

ABCD

ABCD

 

PO

0

0

1

2

0

0

1

2

1

5

2 0

PI

1

0

0

0

1

7

5

0

P2

I

3

5

4

2

3

5

6

P3

0

6

3

2

0

6

5

2

P4

0

0

1

4

0

6

5

6

 

Answer the following questions using banker's algorithm

 

What is the content of the matrix need? Is the system is in safe state?

 

c.

If a request from process PI arrives for (0,4 , 2, 0), can the request be granted immediately.

(15)

 

OR

IX.

When a detection algorithm determines that deadlock exists, what are the possibilities to deal with the deadlocked system? Explain in detail.

(15)

***