BTS (C) VI 10 006 N

B. Tech Degree VI Semester Examination, April 2010

IT 602 INTERNET PROGRAMMING
(2006 Scheme) Time : 3 Hours PART - A (Answer ALL questions) (8 x 5 = 40) I. (a) (b) Differentiate between internal DTD and external DTD with example. 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 > 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? 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 : Output Input Interest Calculator Principle : Rate Year SUBMIT RESET Your Interest is Rs Interest Calculator Maximum Marks : 100

(c)

(h)

OR (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 1000 1400 1500 1700 QTY 10 50 20 40 PRICE 12,000 100,000 14,000 3000 MFR IBS ABC IGM BIS

IX.

Generate a PHP script to create a page that allows the user to select a record then edit the record and update the database. 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
(2006 Scheme) Time : 3 Hours PART - A (Answer ALL questions) (8 x 5 = 40) 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 (4 x 15 II. III. (a) (b) Briefly explain about UP architecture. With a suitable example give the necessary steps in usecase modelling. OR Write notes on : Usecase generalization Actor generalization Packages. (iii) 60) (5) (10) Maximum Marks : 100

(e)

(7) (4) (4)

(a) ( 3) (c)

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?

(15) (6) (7) (2)

VI.

(a) (b)

VII. VIII. (a) (b)

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. ***

(5) (10) (15)

(5) (10) (15)

DC.

 BTS(C) V1-10 007 J

B. Tech Degree VI Semester Examination, April 2010

CS/IT 603 OPERATING SYSTEMS
(2006 Scheme) Time :

3 Hours PART - A (Answer ALL questions)

Maximum Marks : 100

(8 x 5 = 40) I. 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. 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?

h.

PART - B (4 x 15 = 60)
II.

III.

Explain the concept of 'process'. With suitable diagrams explain five states of process and process control block (PCB/TCB). OR Consider the following set of processes, with the length of the CPU burst time given in milliseconds

(15)

Process PI P2 P3 P4 P5

Burst Time 10 1 2 1 5

Priority 3 1 3 4 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.
OR

(15) (15)

Under what circumstances do page faults occur. With suitable diagram describe the actions taken by the operating system when a page fault occurs. 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.
OR

(15)

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 Consider the following snapshot of a system Allocation ABCD PO PI P2 P3 P4 0 1 I 0 0 0 0 3 6 0 1 0 5 3 1 2 0 4 2 4 Max ABCD 0 1 2 0 0 0 7 3 6 6 1 5 5 5 5 2 0 6 2 6 Available ABCD 1 5 2 0

(15)

VIII.

Answer the following questions using banker's algorithm What is the content of the matrix need? Is the system is in safe state? If a request from process PI arrives for (0,4 , 2, 0), can the request be granted immediately.
OR

c. IX.

(15) (15)

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