B. E.

IV Computer Engineering (Eight Semester) Internet Technology & Applications

Total Marks: 100 Time duration: 3 Hours

Instructions: Answer to each section in a separate answer book and attempt all questions. Answer the question in brief with clarity and avoid unnecessary lengthy description.

Section I

Q.l Answer any three questions. [18]

(a) Describe Scalar. Array and Hash variables with respect to Perl using a script to calculate percentage of total marks obtained by a student. Assume that subject wise separate file is maintained to store the mark of each student using a name and the mark of the respective subject which is separated by':'.

(b) Describe pattern binding operator using a Perl script to count number of http andftp links in a. given html page.

(c) Explain the issues related with the design and management of large web-sites (give suitable examples).

(d) Discuss web-site dynamics and associated key parameters (give suitable examples).

Q.2 Answer any four questions. [16]

(a) Describe HTTPprotocol in brief along with the basic web server configuration

with respect to its directory structure to store documents and cgi scripts.

(b) Describe the different request headers and write a Perl script to extract the data using these headers.

(c) Compare XML and HTML in brief and describe the DID for a web based email server (e.g various elements of email DTD can be To, From. message body etc.),

(d) Describe Document Object Module (DOM) and write an XML processor using DOM. to display the list of incoming mails having fields To, From and Subject only.

(e) Give an example of style sheet using classes and import style sheet feature.

Q.3 (a) What is Web Engineering? Enlist the features of Web Engineering which [8]

makes it different than Software Engineering and Information Science streams.

(b) Compare the different techniques (i) Perl-CGI (ii) Java Server Pages and (iii) [8]

Active Server Pages for a dynamic html page in terms of system performance

and its stability.

Section n

Q.4 Answer any three questions. [18]

(a) Discuss Call centre - setup and management.

(b) With suitable block diagram explain various scalable web server cluster architectures.

(c) Describe coding for the display of number of currently active users and number of visitors who have visited the site.

(d) Write JSP code for extracting the fields (Name, Address linel, Address line2, City. Country. Pincode and Email-id) from a. given. form and display the filled entries for confirmation.

Q.5 Answer any four questions. [16]

(a) Explain the cookies. Describe the steps or a script for the following: If user is visiting first time then display only default message, otherwise display visitor's

name with the default message.

(b) Write JavaScript or VBScript which takes input string and the character to be

replaced with new character (i.e. find and replace). (c) Describe the different implicit JSP objects in brief.

(d) Explain the servlet life cycle and the JSP processing phase.

(e) Explain the page refreshment with any one technology (JSP or ASP).

Q.6 (a) Describe an application object, server object and session object with respect to [4]

ASP.

(b) . Write an application that populates the list box from a. database with anyone [4]

technology (ISP or ASP).

(c) Discuss the architecture of2-tier and 3-tier application in brief. For an applica- [8]

tion like search engine which one is better and why? And also describe block diagrams for a search engine application for both the techniques.

- -

Sardar Vallbhbhai National Institute of Technology, Surat

BE IV(Computer .Engg) - 8th Semester EXaminations, April. May 2005

Software Engineering

Time; 14;30 hrs to 17:30 hrs Date: 29" April 2005. Instruction, .

+ Answers to the two sections must be written in separate answer books.

+ Figures to the extreme right indicate the maximum marks of the respective question.

+ All the notations have theit usual meanings.

+ Assume any necessary relevant data but giving proper justifications.

. SECTlON-l

Max Marks; 100

I

(a) Distinguish between the software process and the software process model. Enlist the three [6] most important advantages of following a software process model to design and implement an application.

(b) The Software Engineering practice advocates that the faults should be found out and corrected [6] as early as possible in the entire SDLC. Is it reasonable to expect such early detection offaults

- especially even before the product has been implemented; e.g. how can one expect to find design fault if the fault in question is the coding fault? Justify and argue the above statement.

(c) Complete the partial diagraph shown below by drawing appropriate edges from LHS vertices [6] to RHS vertices - depicting the remaining causal relationships between the software external qualities (LHS) and the internal attributes (RHS)

Maintainability

Number of procedure parameters

Reliability

Cyclomatic complexity

Portability

Program size in lines of code

Usability_____ ~ Number of error messages

~ Length of user manual

2.

(a) An organization proclaims in its advertisement that it is at a SEI CMM level 3. Enlist. the [8] current quality practices at this organization. How can this organization reach the CMM level

4?

(b) Prescribe the probable life cycle development model for the follewingapplicatlons and justify [8J your answer with appropriate reasoning:

- for developing a compiler for a new language

- an extremely large software that would provide, monitor and control cellular communication

among its subscribers, using a set of revolving satellites. - the GUI of a large software product ..

OR

2.

(a) A software development project is to be undertaken for a customer who is (1) not sure of his [8] requirements, initially and (2) is likely to change his requirements frequently. Prescribe the SDLC model to be followed for this application. Justify your answer.

(b) Consider the campus area network of SVNITwith the main switch at the CCC and [6] interconnecting various departments/sections with the fibre optic cable and end switches at the terminals. In terms of cohesion and coupling, state whether this system is having high/I aMi cohesion and coupl ing. Explain some of the causes of IOMi cohesion in a software module.

(c) Which model does a simple, single one turn spiral (spiral model) fall back to? [2]

3.

(a) Identify the necessary functional modules and propose a suitable modular (design) [8) architecture for a computer controlled video conferencing system which allows video, audio

and computer data (distributed on different machines) to be visible to several participants at

the same time.

(b) For the juice plant control system illustrated in the class, design an activity diagram, [8] identifying the activities and the flows between the activities.

OR.

3.

(a) Propose a suitable object oriented design for an application for HP petrol/diesel pumps [10] (station) to be set up for fully automated operation. Drivers swipe their credit card through a

reader connected to the pump, the card is verified by communication with the ICIC[ Bank and

a fuel limit is established. The driver may then take the fuel required. When fuel delivery is complete and the pump is returned to the holster, the driver's credit card account with the

lCICI bank is debited with the cost of the fuel taken. The credit card is then returned after debiting. If the card is invalid, it is returned by the pump before the fuel is dispensed.

(b) Differentiate between the CASE tool and the CASE environment. Name some of the CASE [6] tools that are known to you.

4.

(a) Consider the typical behavior of a washing machine: [12] The machine waits for the start switch to be pressed. After the user presses the start switch, the machine fills the wash tub with either hot or cold water depending upon the setting

of the HotWash switch. The water filling oontinues until the high level is sensed. The machine starts the agitation motor and continues agitating the wash tub until either the preset

timer expires or the user presses the s top switch. After the agitation stops, the machine waits

for the user to press the startdrying switch. After the user presses the startdrying switch, the machine starts the hot air blower and continues blowing hot air into the drying chamber until either the user presses the stop switch or the preset timer expires.

SECTION ·11

[S it possible to model these requirements using theFSM model studied in the class? If yes, specify the above requirements and ifnot reasoning why not, do so using a Petrinet.

(b) Consider the PN shown in Fig 1 at the end of this paper. Does this PN suffer from deadlock? [6]

Can the activity modeled by the transitions t2 and t4 go into starvation. Is this starvation due

to tire inherent nature (hidden scheduling policy) of-the Petrinet or due to' the faulty model?

5.

(a) Draw the control flow graph (using the notations, explained in the class) for the following [10] function named find-maximum. Determine only the cyclomatic complexity from the control

flow graph drawn:

int find-rnaximurn(int .i , int j, int k )

int max:

if (i>j) then

if (i>k) then max ~ i:

else max ~ k; else if (j>k) max = j else max =. k:

return (max);

(b) Should the title of a document, be used to identify the document in a configuration [6) management system? Design and propose a typical standard which can be used to identify a document (a document identification scheme) that may be used for all the projects in an organization.

OR

5.

(a) A program reads three integer values. The three values are interpreted as representing the [I 0] lengths of the sides of a triangle. The program prints a message that states whether the triangle is scalene, isoceles or equilateral. Develop aset of test cases using the basis path testing, to guarantee that an the statements in the program have been tested.

(b) Distinguish between the static and dynamic analysis of a program. How are static and [6] dynamic program analysis results useful?

6. Answer any tltru briefly: [16]

I. Can reusability of the software product affect its reliability? How?

2. Can construction of a prototype always increase the overall cost of software development?

3 Explain the basic operation of the model checker SPIN.

4. Enlist some of the communication specification and function specification techniques.

5. Explain the concept of a baseline and show with the help of a diagram how SCM can be implemented.

6. Explain the use of rendezvous channels in PROMELA.

Fig 1 : Question 4(b)

Seat No. __ S.V.NATIONAL INSTITUTE. OF TECHNOLOGY, SURAT

D.E. IV Semester - VIII (Computer Engg.) Examination

April-2005

INFORMATION TECHNOLOGY AND MANAGEMENT

[Time: 3 Hours] .'fotal Marks: 100]

Instructions:

I. Answers to the two sections must be written in separate answer books

2. Figures to the extreme right indicate the maximum marks of the respective question.

3. Write your answers as concisely as possible and to-the-point.

4. All the symbols carry their usual meanings.

SECTION -I

I.

(a) The SVNIT has a 'Credit Co-operative Society' for the benefit of employees. The [10] society offers financial assistance by way of loan. towards house building, purchase of

white goods, payment of education fees and festival advance, etc.

The repayment of loan is through the salary paid to the employees every month. Develop an application for I,oan management and build an interface to the paytoll system for loan instalment deductions. In this regard. give a system overview on the following lines:

(i) System scope (ii) System objectives (iii) Output of the system (iv) Inputs to bring out the outputs (v) Process design (vi) Interface mechanism

What care would you take in both systems, l.e., the loan management system and the payroll system, so that the employee is not overburdened with the loan instalment deduction and every month after the instalment deductions, seventy per cent of the normal take home pay is maintained.

(b) Explain the kind of protection offered by copyright, trade secrecy, and patents. What [06] are the advantages-and disadvantages of each for developers of computer software?

2.

(a) Explain the following decision situation in intelligence, design and choice phase as [06] developed in the Simon model.

(i) Marketing a new product (ii) Selection of'a new packing (iii) Reducing the price by a certain percentage.

Which of the decisions in the Question 2(a) are strategic?

(b) Answer to following: (any three) [12]

I. Compare and contrast between MISs and TPSs.

2. What is reengineering? What are the potential benefits of performing a process redesign? What is the difference between reengineering and continuous improvement?

3. Define SCM and Enlist Seven Principles of SCM.

4. What is the TeO model? What are the disadvantages ofthe TCO approach?

5. What are the four basic issues of Computer Ethics?

3.

(a)

List and define the four basic organizational structures.

[06]

(b)

Answer to following: (any two)

I. Explain three basic components ofa successful E - Commerce model.

2. Explain various reports provided by MISs with its importance.

3. Define CRM and enlist the benefits ofCRM.

I

[10]

SECTION -II

4.

(a) A gift shop prepares gift boxes for sale at the time of New Year, Diwali Festival, [10] Christmas and for marriages. The shop has over 1000 gift articles, which are uniquely identified by a bar code.

A customer places an order for a gift box packed with the assorted gift articles. A box may contain one or more item but not exceeding four. Since, the business is 'a seasonal one, a quick response to the enquiry and order processing is necessary. An order of less than 100 boxes is not accepted.

Draw an application system now chart starting from enquiry processing to the order processing, including packing, delivery and billing. All the orders are accepted with 70 per cent advance from the customers. The gift shop has a standard price list and a standard list of the gift items. The shop has a small packaging unit in the same town from where the delivery and billing takes place. The warehouse and packaging is at the same location.

Identify in the system the following:

(a) Masters (b) Transactions (c) Relations (d) Processes (e) Outputs (f) MI.S reports. Design the system in such a way that minimum paper work is necessary. the communication is faster and the execution of the customer order is efficient. Break the application in two parts-front end and back end support.

(b) What is the concept of ERP (Enterprise Resource Planning)? Enlist the benefits of [08] ERP.

OR

Compare and contrast between Waterfall and Spiral model for System Development.

5. (a)

Draw and explain complete logical block diagram for the Manufacturing MIS.

OR

Draw and explain complete logical block diagram for the Financial MIS.

[08]

(b)

Explain in detail: (anyone)

[09]

1. Quick - Response Retailing.

2. rrr Purchasing.

6. Answer to following: (any three) [15]

1. What is an EDI? Derive the benefits of EDt

2. Draw and explain complete logical block diagram for the Purchasing Transaction Processing System.

3. Define the terms:(a) Cyber stalking (b) Spamming (c) Data Mining (d) Intellectual Property.

4. Compare the characteristics of an MIS and a DSS. Why are decision support systems more suited for executive decision-making?

D.E. IV Computer Engineering (Eight Semester) Image Processing T~-"'_ 'y\\~c-~ and~ ~,\t_o...h~

Total Marks: 100 Time duration: 3 Hours

Instructions: Answer to each section in a separate answer book and attempt all questions.

Section I

Q.l Answer any six questions [18]

(a) Calculate the amount of memory required to store an image of size 256 x 256

with 12 bits per pixel.

(b) Define bright. light vision and dim light vision. (c) Describe an image formation model in brief.

(d) Name and explain the two processes to obtain an digital image from a continuous image.

(e) Define m-adjacency relationship between pixels.

(f) A common measure of transmission for digital data is the baud rate, defined as the number of bits transmitted per second Generally, transmission is accomplished in packets consisting of a start bit, a byte (8 bits) of Information, and a stop bit, Using these facts, answer the following:

(1) How many minutes would it take to transmit a 1024 x 1024 image with 256 gray levels using a 56K baud modem?

(2) What would the time be at 750K baud. a representative speed of a phone DSL (digital subscriber line) connection?

(g) Consider the image-segment shown.

Let V = {O, I} and compute the lengths of the shortest 4-path and 8-path between p and q. If a particular path does not exist between-these two points, explain. why ..

3 1 2 l(q) 2 2 0 2 121 1

(P)1 0 1 2

Q.2 (a) Describe histogram equalization method. [10]

(b) Propose a set of gray-level-slicing transformations capable of producing all the [6]

individual bit planes of an 8-bit monochrome image. (For example. a transformation function with the property T(r) = 0 for r in the range [0.127], and

T(r) = 255 for r in the range [128,255] produces an image of the 7th bit plane

in an 8-bit image.)

OR

_ (b) Describe Rolkrts cross gradient operators and Laplacian mask for edge detec- [6]

tion.

Q.3 (a) An image has the gray level PDF p,.(r) shown in the following diagram. It [10] is desired to transform the gray leve~ of this image so that they will have the specified p~ (z) shown. Assume continuous quantities and find the transfonna-

tion (in terms of r and z) that will accomplish this.

L. liz

I 1

(b) Derive an output if Laplacian mask is applied to an image segment shown in [6]

Q.l (g). To process comer pixels pad an image segment with zeros.

SectiOD n

Q.4 (a) Write the segment of code (preferably using C programming language) for two [10] dimensional Fourier transform in the separable form. (i.e. Two dimensional Fourier transform can be obtained \by applying I-D Fourier transform along

rows which is foUowedby I-DFourier transform. along columns. Note: Write

an routine for I-D Fourier transform andcal1 this routine for 2-D Fourier transform.)

(b) Write the segment of code for the convolution. [6]

Q.5 (a) Derive a mathematical model for a blurring function for the case in which an [10] image has been blurred by uniform linear motion between the image and the sensor during image acquisition.

(b) Oive color transformation between (1) CMY and. ROB and (2) HST and ROB [6]

for color image processing.

OR

(b) Describe the different types of redundancy used for an image compression. [6]

Q.6 Answer any three questions. [18]

(a) Describe general block diagram of encoder and decoder used for an image compression.

(b) Derive an output if discrete cosine transform is applied to an image segment shown in Q.l (g). i.e. obtain an output image

T(u, v) = E~l E::Ol lex, y)h(x, y, u, v) where, !(x, y) is an given image, N x N is the size of an image block (take here N = 2), and

hex, v. u, v)= cr(u)cr(v) cos (2:I;~~)U1l" cos (2v:;)mr

cr(U) = { 1/..J(ii) u = 0

J(2/N) u = 1,2, ... , N - 1

(c) Explain bi~ morphological operations dilation and erosion.

(d) Derive an optimal threshold for an image segmentation with two regions (i.e. background and foreground only).

2

S. V. National Institute of Technology, Surat

B.E. IV COMPUTER ENGINEERING (8th semester) Examination (May 2005) Information Security & Applications (Elective)

Max. Marks: 100 Time: 3 Hours

Instructions:

1. Answers to each section in separate answer book.

2. Support your answer with necessary block diagram wherever possible.

3. Figures to the right indicate maximwn marks.

SECTION-I

Q.l. A.

B.

Q.2
1.
2.
3.
Q.3. A.
B. With suitable diagram discuss Feistel structure and DES algorithm. Encrypt the following text:

IBM SELLS SECRET TO HP

1. using playfair cipher with key "who lets the dog out"

2. using transposition cipher - i. Rail fence with depth 3

ii. Permutation key (6 4 I 3 52)

Answer the following. (Any two) (16)

Discuss how Public Key Cryptography provides confidentiality, origin authentication, and non-repudiation. What are the limitations of public key methods?

List essential properties of a Cryptographic Hash function. Define MDC and MAC. Design a Hash 'function from Symmetric block cipher.

i. With suitable example discuss Hill cipher

11. Explain Digital signature

(12) (8)

Discuss RSA algorithm. Answer the following.

i. Power and Timing cryptanalysis

11. Challenge Response protocols

OR

Q.3. Design an Online Network based Voting Scheme defending general issues (14) related with democratic election procedure

Q.4. A.
B.
C.
Q.5
1.
2.
3.
Q.6. (7) (7)

SECTION IT

Discuss Biometrics Security and various BioIDs' characteristics. (6)

I. Cryptographic codes (6)

ii. One time pad and perfect secrecy

Explain Diffie-Hellman key exchange and its use. (6)

Answer the fol1owing in detail with necessary block diagram. (Any two) (16)

IPSEC, tunnel mode and transport mode.

SSL Handshake protocol.

Kerberos

Discuss the following. (Any four) (16)

1. Steganography and its 4. x,:.509 digital certificate

applications 5. Various phases of virus life

2. Secure Electronic Transactions cycle

3. Circuit level gateways and 6. Rotor machines

Packet Filtering Router

********** ••

Sardar Vallbhbhai National Institute of Technology, Surat

B E IV(Computer Engg) - 8- Semester ExaminatioDS, May 2005 Elective n: Distributed Programming EDviroDment

Date: May 2005 Time: 2:30 pm to 5;30 pm Max Marks; 100

Instructions:

• Answers to the two sections must be written in separate answer books.

• Figures to the extreme rigllt indicate the maximum marks of the respective question.

• Assume any necessary relevant data bUI giving proper justifications.

• The usc of the System Calls Prototype List is permitted on request- only oJJicifll copy oflhe same may be used. however.

• The programming exercises should be properly commented & due \0 credit will be given to the same as well as to the overall clarity of the lmplementation, For I:8Ch routine, Vel)' clearly specify the sample input as well as the sample output

• For implementation, use either of C. c++ or JAVA; if nOI specified.

I

(a) Write a program to implement who I sort I we -1 » temp. c & without using popen ( ) /pclose ( ) [6] and system functions.

(b) Enlist the features that a reliable distributed system is supposed to exhibit and explain them. [6]

(c) Explain the Dining-philosopher problem. Implement its solution using System V semaphores. Your program [6] would create five philosopher processes via fork () system call.

2

(a) Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a [8) cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients viz. tobacco,

paper and matches. One of the smoker processes has paper; another has tobacco and third has matches. An

agent has infinite supply of all the three ingredients. Agent places two of the ingredients on the table. The smoker who has remaining ingredients, then makes and smokes the cigarette, signaling the agent on a completion, The agent then puts out another two of the three ingredients, and cycle repeats. Write a program to synchronize the agent and smokers using System V semaphores.

(b) Write a C program that makes use of the synchronous 1/0 multiplexer call viz. select () (int [8] select (int .0, fd_set *readfds, fd _set *wri tefds, fd_set "exceptfds, st ruct timeval *timeout) and continuously monitors two file descriptors pipel and pipe2 for input. It prints the message "input arrived on pipel" or "input arrived on pipe2", whenever input arrives on

either file descriptors.

SECT.(ON-I

OR

2

(a) Design and implement a concurrent client-server application using message queues, in which the client reads [8] pathname of a file from the standard input and sends it to the server. Upon receipt of the filename, the server

sends the contents of me file, if the file is a regular file, the list of files and subdirectories under the file if it is

a directory or an error otherwise, to the client. If client reads, "qui til command, it exits without sending

"qui t" to server.

(b) Write a minimal ftp server program viz. myftp which responds with the appropriate actions when it receives [8] the commands get, put and 1s over the socket connection from any client A user may type in get filename, put filename and ls commands on the myftp prompt of any client, which lire then sent to

the myftp server. The server program then should respond with the desired action. The server program need

not authenticate the user or check for anonymous ftp. The client code need not be implemented.

3.

(a) Consider a set of two distributed producer consumer processes which collaborate to generate the specified [12] number of random numbers. The consumer process takes from the user two data items viz. long seed_val-

a seed value and int i ters - the number of iterations (the number of times, random numbers are to be generated) through the keyboard and requests the producer (running on a non-local host with IPA 53.162.164.181, port number 9989) 10 generate the i ters numbers of random numbers with seed value

seed val.

. I

The producer process which runs on another host uses the linux functions srand48 (prototype - void

srand48 (long int seed"al» and drand48 (prototype - double drand48 (vo i dj ) to generate the random numbers as many times, as is requested by the consumer and writes these random numbers back to the consumer. The communication between the two is required to be sequenced, non-duplicated, non-corrupted, bi-directional delivery of byte stream data.

Design a suitable client server program to implement the above functionality using sockets.

(b) Normally known servers bind to well known ports. In which Cases do they bind to ephemeral ports? [4J

OR

3.

(a) Explain the concept of the five tuple association between the client and the server, stating each socket call on [6] the client and the server both, which completes the five tuple association on both - the client and the server.

side.

(b) For the echo client server programs explained in the class, if the server child process were explicitly killed; [6] explain stepwise, how would the client process react to this? Will client rep send any data which are typed

on the client standard input. to the server rcp, after the server child has been terminated? How would the server TCP respond to this?

(c) In case ofa concurrent server, the parent process is expected to close the connected socket descriptor while the child process is expected to close the listening socket descriptor. Reason why is it so. Enlist, specifically the errors that would be raised if these are not closed.

4.

(a) Explain Byzantine generals problem. Explain an algorithm to solve this problem with a sui.table example. [6]

(b) Explain Two-Phase Commit (2PC) protocols with suitable diagrams. If any of th.e participating sites fail, [6] explain how 2PC ensures the atomicity of the distributed transaction.

(c) Consider a Web browser that returns an outdated cached page instead of a more recent one that had been [6] updated at the server. Is this a failure, and if so, what kind of failure 'l

5.

(a) Are the limitations of the ordinary message passing model overcome by the RPC'! Explain in light of the [6] objectives of the RPC.

(b) There are severe restrictions on collaboration between the RPC client and servers through parameter passing. [6J Explain how.

(c) Distinguish between the location transparency and location independence in a distributed file system, [4]

OR 5.

(a) Explain general object architecture of CORBA with brief functional description of each component"

(b) Suppose in a typical distributed file system, the files are globally identified by prefixing the machine IPA to [4] the local filename i.e, a file is named globally as I PA.localfilename. Does this scheme guarantee unique

file names? Can this scheme be considered network transparent ? Is it location independent?

(c) Draw a diagram showing how portrollpper daemon and the RPC client collaborate with each other. [4]

SECTION - II

6. Ans",e, the joUolfling flllestiolls In short: (4IIIY Ihne) (16)

I . True di stributed systems are neither the ones based on a distributed operating system nor the ones using a

network operating system. Comment on the validity of the statement.

2. Explain the characteristic ofa distributed system using Leslie Lamport's definition ofa DS.

3. Expla.in the role of the middleware in a distributed system.

4. Differentiate between the synchronous and the callback RPC with the help of an example.

5. The naming scheme followed by NFS wherein remote directories are mounted to local namespaces has severe restrictions/llmhatlons, Enlist and explain how.

Marks: 100

S. V. NATIONAL INSTITUTE OF TECHNOLOGY, SURA T BE(IV) , 71h Sem (ATKT) , Exam: AprillMay 200S, DataBase Management Systems

Time: 3 Hours

Instruction;

• There is no section in the question paper, Use single main supplementary.

• Answer each question with proper data. example whenever needed.

• Answer as per instruction, avoid unnecessary long answers.

Numbers on the right indicates marks

0.1 Design Problem: 16

Design a generalization-specialization hierarchy for a motor-vehicle sales company. The company

sells motor-cycles, passenger cars, vans and buses. Justify your placement of attributes at each level

of hierarchy. Explain why they (attributes) should not be placed at higher or lower level? Convert

the E-R Diagram to 3NF relation scheme.

OR

An international bank has many branch offices spread access allover the world. The head office of the bank is located in New Delhi. Each branch office controls the branches in that country. The bank opens saving/current/deposit accounts. Design a specialization-generalization hierarchy for the bank. Justify the placement of various attributes in the hierarchy. Create 3NF tables from thisE-R diagram of the bank.

0.2 Answer the following questions in Short(Any Six) 18

I. Explain the pitfalls in Relational Database design.

2. Define 4Nfand BCNF. Why 4NF is more desirable then BCNF?

3. When is it preferable to use dense index then sparse index? Explain.

4. How does the concept of object differs from the concept of an entity in the entity relat ionship model?

S. Explain the distinction between the close and open hashing. Explain the merits and demerits of both.

6. What is query optimization? Describe with example.

7. "Redundancy is the backbone of reliability, therefore. a reliable database system should not attempt normalization beyond 3NF." Comment on the above statement.

Q.3 Solve following Design Problems:

A. I.

Answer Any two

Suppose you have a relation

Home_work_result(Student_id, Exam no.marks.max jnarks) And the following two functional dependencies.

Student_id, Exam_no -;) marks

Exam_no ~ max_marks

Is the relation in BCNF? Please give a short explanation.

10

1..1 4

2. Suppose Hotel has the following table to store reservation for its rooms:

Reservationtkoom No, From date, To_date. Guestname, NUIn_of_Nights) They have discovered that the following functional dependencies hold:

• Room no, From Date ~ To date

• Room=no, To_Date ~ From=date

• Room No, From_date ~ Guest_name

• From Date. To_Date ~ Num_of_NighlS From Date, Num_of_Nights ~ To_Dale

• To Date, Num_of_Nights~ From_Date

a. Determine All possible keys for this relation. Only mention minimal keys. i.e, sets of attributes which together uniquely identify tuples. but of which no strict subnet has the unique identification property,

b. Is this relation in BCNF? Explain your answer.

3 Describe lossless decomposition.

Consider the relation R(A,B,C,D,E) and the FDs A~E

C~D

A~F

Is the decomposition of R into (ABC) • (BCD), (CDE) lossless? Explain your answer.

B. Decompose the following relations in to losssiess and dependency preserved normal form.

I. For the Relation R(A,B.C,D,E,F) with the Fds and MVDs as:

A~CE B~D C~ADE BD~F

Decompose the relation in the normal form.

10

2. Decompose the relation R(A.B.C.D,E.F,G) with the following set ofFDs in 3NF relations:

AD~ BCD CD~E B~D BCD~BE E~A

IS the decomposition lossless and dependency preserving?

Q.4 Solve following problems(Any three) 10

I. Suppose that join of two relations R(A.B.C _ and S(B.C.O) is to be calculated. Assume that Relation R has 5000 tuples with blocking factor of 50 tuples per block. whereas S has 10,000 tuples with a blocking factor of 40 tuples per block. Also assume that there are 3 main memory buffers allocated for relation Rand 5 buffer for relation S. Calculate the number of disk access if the relations are joined using nested loop method.

2. A company has increased the basic salary of its employee by Rs. 2000. The salary was further upgraded by giving an additional increment of 10%. The company also has a concurrent transaction which evaluates average salary of its employee. Write the necessary transactions which can run concurrently to give appropriate results. Use appropriate schemes to avoid undesidable result.

/

IocJ ::>

3. One computer company has a contact with !I shop called "Pittsburgh Computers". This shop also inputs orders into the database and gets 25% of the total price for each order this shop has acquired. Such orders are distinguished in the table "Orders" by an order number greater than 90000.

!I. Please define a view pgh_Orders with the same columns as orders which only shows orders with a number greater than (or equal to) 90000

b. Please give the database user pghshop read access to the view and the right to insert tuples.

Make sure that only tuples can be inserted which have an order number which marks them as orders acquired by the shop.

c. Suppose we would give the shop also the right to delete tuples. How would

DELETE FROM pgh _ Orders WHERE name = 'So Brass be translated to the base table? If it is not possible then explain the why this view is not updateable.

4. Assume the following relations:

R(a,b.c) with FDs a-7 band a7 c. The size of relation "" 1000 tuples. Records per block of secondary storage = 10. Storage sequence in the order of attribute 'a'

R2(c.d) with FD c7d. The size of relation 2000 tuples. Record per block 20 Storage in sequence of attribute 'c'.

What will be size of natural join of R I and R2? How many block transfer may be needed to compute the join. You may assume that total 5 buffers are available for calculating the join. Make available assumption if any.

0.5 Answer as instructed: (Any Four)

I. Discuss the process of buffer management in the context of recovery.

2. What are multiversion techniques used for concurrency control? Describe with the help of example.

3. How is deadlock detected by DBMS? Describe the Wait_Die and Wound_ Wait schemes for deadlock prevention.

4. What is a log in the context of DBMS.? How does checkpointing eliminate some of the problems associated with log based recovery?

5. Describe Two Phase Commit protocol

6. Explain Serializability and Serializability test.

, 0.6 Implementation Issues (Any Four)

L 2. 3. 4.

Describe Open Database Connectivity (ODBC) and its need. Triggers and their usage with example.

Explain Updation problems with views.

What are the steps one must take with its database management system inorder to ensure disaster recovery? Define the process of recovery in case of disaster.

Suppose you are asked to design a university database system. what are the security measures that may be proposed by you for the database security.(Hint: You must d:fine various security levels for physical security. database access and external scheme)

5.

16

I::!

~ Samar Vallbhbhai N~Jional institute of Technology, Surat

B E IV(Computer Engg) _7th Semester Examinations, April·May 2005

Dur4tion : 3 hrs

Operating Systems

. Max Marks. : 100

Instructions :

• Answers to the two sections must be written in separate answer books.

• Figures to the extreme right indicate the maximum marks of the respective question.

• Due credit mar be given to the overall c1arity;brevity, neatness and lucidity of the answers,

• All the notations have their usual. meanings. You may assume any necessary relevant data, giving proper justificaticrrs.

I.

(a) Explain the main difference.between a batchjob and an interactivejob from the point of [6]

view ofan,ppeli8tihg system. .

(b) Explain how withaut some support from the underlying hardware, it is not possible to [6)

implement the dual mode of operation in the operating systems

(c) Enumerate the five most important tasks performed by the operating systems. [6]

2.

(a) Explain the Preemptive and non-preemptive shortest job firstsche4uUng a1gpri:thmS with [8] examples.

(b) Enlist and explain some of the important components: of the process control. block [8]

OR

SECT10N -I

2.

(a) SUPP9se the following jobs arnve for processing at the time ·indicated and run the [10] specified amount oftime. Calculate the average; turnaround time fet,theCPU sch~l1ling algorithms viz: FCFS'.arrd RRsch'edmling policies ..

lob No Arrival time in time Priority CPU burst required

units in time units

I 0.0 6 6

2 0.5 4 6

3 0.8 3 8

4 1.2 2 2

5 1.4 1 4

(b) Explain the concept ofthreads and show how they are more effident. [6]

3.

(a) Enlist the four conditions that must exist fpt deadlock to occur in the system. Is itpossihle [8] for the deadlock to o~cur in the. sys1em with only three. or less of'the four conditIons being true ?, E~lain your anSwed6gicaUy ..

(b) Reason whether the. ,solution below showing, the structure of a. p.lll1icular process P;, [8] wanting to enter the critical section is successful in implementing mutual exclusion or not

repeat

. flag [iJ = true; turn = j;

while flag[jj and turn =j) do no-op; critical section

flag [iJ = f'a.l se ,

remainder sed-ibn

until false:i

OR

3.

(a) Implement the producer consumer problem using a bounded buffer using the.ssmaphores. [10] Explain its limitations.

(b) . Implement the data acquisition system discussed in the class (with the processes collect, [6J stat, log and report) using mail boxes as a means of interprocess communication as well

as signaling.

4. [18J

(a) With the belp of a neat diagram, enlist and explain the steps taken bythe operating system

in handling a page fault.

(b) Given memory partitions of lOOK, 500K, 200K, 300K and 600K, (in order), how would each of the First-fit, Best-fit and Worst-fit algorithms place processes of 212K, 4l7K. 112K, and 426K (in order) ? Which algorithm makes the most efficient use of memory ?

(c) Which of the following programming techniques and structures are "good" for a demandpaged environment? Which are "not good" ? Explainyour answers, briefly,

SECTION-D

- Stack Hashed; - Symbol table; - Sequential search; - Binary search;

code Vector operations; - Indirection,

-Pure

5.

(a) Directories can be implemented either as special files that can only be accessed in limited [8]

ways or as ordinary data files. Which approach do you think, out of these two does LINUX follow? Also comment on the advantages and disadvantages of each.

(b) Explain how disk drivers use track-at-a-time caching to improve the disk performance. [4]

(c) Briefly, discuss advantages of the second chance-algorithm over the FIFO algorithm. [4]

Describe its operation if the reference bits of all.pages of a program are 1.

OR

5.

(a) As a result of the command entered by the user viz. "$ ca t [8] /home/sachin/papers/acml.ps". explain categorically the steps which would

be taken by the Linux operating system to find and access the disk blocks containing the above file. Depict the steps following the starting step viz. finding the inode number associated with the directory I.

(b) Consider a Winchester-style hard disc. with 100 cylinders, 4 double-sided platters and 25 [8]

sectors per track. The following is the (time-ordered) sequence of requests for disc sectors:

{35l8, 1846,8924,6672,1590,4126,107,9750,158,6621,446, II }

The disc arm is currently at cylinder 10, moving towards 100. For each of SSTF, SCAN and C-SCAN, give the order in-which the above requests would be serviced,

6.

Answer any four of the following, briefly:

[16]

(a) Explain the use of the mount call in linux.

(b) Enlist and explain the various process states in llnux,

(d) Explain how is process context switching achieved in Linux,

(e) Explain how password protection mechanism is supported in Linux.

(t) What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate it?

(g) Enlist in tabular form the strengths and weaknesses of the different memory management techniques.

SARDAR VALLABHBHAI NATIONAL INSTITUTE OF TECHNOLOGY B. E.IV CO (Sem -7) Nov-2005

User Interfaces

Time: 3 Hrs. Total Marks: 100

Instructions: (1) Attempt all questions. (2) Figures to the right indicate maximum marks.

SECTION-I

Q. 1 Answer the following:

1. Explain the steps of ideal user interface design process. [4]

2. Discuss the following with respect to usability engineering. [6]

a. Human Errors and False Memories

b. Regional and Cultural Issues

3. Discuss key issues in designing user support (help) systems. [3J

4. Differentiate Form vIs Menu. [5]

Q.2 Answer the following: (Any Fou~ [16J

1. Explain difference between compareToO and equalst) methods for string class.

2. Differentiate between Java Swing Vs. AWT.

3. Can the reference to interface be created? Explain your answer with example.

4. Explain terms: (i) Container component (ii) Non-container component (iii) Canvas

5. Discuss Applet life cycle.

Q.3 Answer the following: (Any Two) [16]

1. Implement java applet which contains four Radio boxes and a Choice box with four items whose labels are same as labels of Radio boxes. If a Radio button is clicked, corresponding item should be selected in Choice box.

2. Write a program which calculates the summation of all the selected items from a List box (of numeric items). Result should be displayed in text field.

3. Write a program to create a menu topmenu that contains first four items labeled with A 1 .... A4 respectively, then separator, and one submenu labeled with AA whose items are AA 1,AA2 respectively. If a menu-item is clicked corresponding label should be displayed in the textbox.

4. Explain JOSC with example.

SECTION-II

Q.4 Answer the following: (Any Fou~

1. -What is meant by Message Driven Architecture? Explain Message map loop.

2. Explain following terms in context of Multithreading Applications In Windows

OnldleO, Kernel Mode Stack, Primary Thread. .

3. Explain document-view architecture and its usages.

4. What is serialization? Explain the steps to make the data serialized.

5. Enlist different types of collection shapes and their features.

[20]

Q. 5 Answer the following:

1. Explain the role of Jet Database Engine.

2. Differentiate between ADO,RDO and DAO.

3. Explain RecordSet object and its types.

[15]

Q.6 Answer the following: (Any Three) [15)

1. What is OLL file? How is it useful in Windows Programming?

2. Explain the use of following functions: OnDraw(), OnPaintO, Updatetiatat).

3. Enlist the components that WIN32 stores into the memory while process is in execution.

4. Explain Client area and Non-Client area Mouse messages.

* * *

S. V. National Institute of Technology, Surat B.E.(IV)- CO, 7tb Sem. Exam: Nov-2005 Database Management Systems

Time: 3 Hours

Marks: 100

Instruction:

1. Numbers on right indicate marks.

2. Write new answers on new page.

3. Use separate answer books for each section.

4. Algorithm must be written in the proper manner with appropriate comments with every step without unnecessary lengthy description.

5. Appropriate figures and examples are appreciated.

SECTION-I

Q.l Answer The following in brief (Any Five) 20

1. Define Clouser, Cover and Minimal Cover.

2. Consider two sets of FDs with the set of attributes A,B,C,D,E. Check weather F is a Cover of G?

F = (B7CD, AD7E, B7 A) And

G = (B7CDE, B7 ABC.AD7E)

3. Construct the minimal cover M for the set Fof FDs.

F= ABC7AC, C7BE, AD7BF, B7E

4. Write algorithm to find closer Set of attributes X under given set F of FDs.

s. Information stored in the Data Dictionary Storage and its qsage.

6. Explain advantages of using B+tree in the index file. .

Q.2 The company has created the table Emp with the following schema and done data entry for. 12

A. 1000 employees.

Emp = (Emp_id,Emp_name,emp_phone,dept_name, dept_phone, dept jnanager, skill_id,skill_ name, skill_ date, skill_level)

After doing the data entry, the company found some anomalies and decided to design some FDs as follows: .

Emp _id7emp_name,emp _phone,dept_ name Dept name 7 dept-sphone, dept_manager Skill_id7skill_name

Emp _id,skill_ iS7skill_ date,skill_level

The FDs already forms a minimal set. Perform normalization till minimal normal form. List carefully all keys for each table and the FDs that lie in each table for every normal form. Write related SQL statements for every normal form with appropriate constraints. (For implementation of constraints any PL-SQL statements can be used)

B. Name the system table in Oracle to get the information 0 f: 3

1. Objects accessible by current users

2. Current errors on user defined objects.

3. List of roles of the current user.

4. List of privileges on the role.

Q.3 Answer following.(Any three) 15

1. What is trigger? What are its three parts? Explain the difference between row-level trigger and

statement level trigger.

2. What is cursor? Explain the properties the cursor can have.

3. Explain the term stored procedure. Give example why stored procedures are useful?

4. Explain password management policies, cursor security policies.

5. Justify "Client/Server system reduces cost of operating system and improve adaptability"

SECTION -II

Q.4 ADatabaseis to contain information concemingsales representatives, sales areas and products. 12

A. Each representative is responsible for sales in one or more areas. Each area has one or more representatives. Similarly each representative is responsible for sales of one or more products, and each product has one or more responsible representatives. Finally each product is sold in one or more areas, and each area has one or more products sold in it. Moreover if representative R is responsible for area A and for product P sold in area A and representative R is responsible for product P then R sales P in A. Design suitable set of tables with relative FDs for the given data such that they are in final normal form.

B. Answer following short questions (Any Five) 10

1. What is Force writing?

2. Define Explicit writing.

3. What is partial undo?

4. Define Dirty Bit.

5. What is Non repeatable read?

6. What are Phantom records?

Q.5 Answer the questions (Any two) 16

1. Two tables ASSIGN_TO and PROJECT have following information.

ASSIGN TO:

50,000 rows and blocking factor = 100

PROJECT:

250 rows with blocking factor = 50

Block size is same for both tables. The common column to join the tables is project_name. The query:

SELECT project_name,emp_id from

PROJECT as P, ASSIGN_TO as A where P.project_name = A.project_name; Answer the following questions.

1. Specify the outer table for efficient nested loop join.

2. specify query cost for merge join: is

a. Both PROJECT and ASSIGN_TO are already ordered by project_name " .b. Only PROJECT is ordered by project_name

c. Neither of the table is ordered by project_name

2. Consider the following actions taken by transaction TI on database objects X and Y;

····-R(X);W(X), R(y),W(Y)

Answer the following questions

1. Give an example of another transaction T2 that "if run concurrently to transaction T without some form of concurrency control, could interfere with TI

2. Explain how the use of strict two phase locking would prevent interference between the two transactions.

3. How does timestamp Ordering protocol works? Use suitable example.

Q.5 Answer the following. (Any Three)

1. Discuss concurrency control in distributed systems.

2. Discuss Query processing in distributed systems.

3. Justify" Transaction can not be nested inside one another"

4. What is the difference between system crash and media failure?

5. Explain differed update recovery system.

12

SeatNo: _

Sardar Vallabhbhai National Institute of Technology, Surat B. E. IV ( Computer Engineering - 7th semester) Year: November _ 05 Unix Programming

Marks: 100

Time: 3 hrs

• Attempt all questions.

• Assume appropriate data wherever necessary.

• Numbers to the right indicate marks.

• Only official copy of the system calls will be allowed to use.

SECTION -I

1 a list and explain various divisions of UNIX File System. Can one create UNIX File 8

System with user level utility program?

b Can a normal user create a directory? Why or Why not? c Implement your own raise () and abort 0 functions.

2 Attempt any two

a Write a program that implements tree command of UNIX.

b Write a program that checks the access time of file every minute and prints a message if file had been accessed. Do not use sleepOfunction to implement this program,.

'c Write a program to implement Is - I xyz I we - I without using system() function or without invoking any of in-built shells via exec() system call.

3 Attempt any three

a Suppose there are 13 disk block pointers in Linux ext2 inode. First 10 pointers are

", ".1

direct pdigters, 1.1th pointer is single indirect, 12th pointer is double indirect and 13th

pointer is t\ip~ inQire.ct. Find the range ,of the,~data blocks corresponding to each

'[

4 4 16

18

level. of indirection if block size is b. Assume file starts with logical block O.

b Draw the table of open file descriptors, file table entries and in-core inode table entries for the following code at point P.

maint)

{ int fd1,fd2.fd3.fd4.fd5;

FILE *fp;

fp=fopen("abc.txt","r"); fd1=open("abc.txt",O_RDONLY); fd2=open("abc.txt", O_WRONL V); fd3=open("abc.txt",O_RDONL V); dup2(fd1,fd4);

if(forkO==O} {

close(fd2);fd5=dup(fd1) ; }

P: }

c (i) Give the name of file system in UNIX which contains a directory for each PID

except PID=O? What is its file size? Why?

(ii) What is the link count of the directory that contains n subdirectories and m selfsymbolic links?

(iii) Give the command to create a character special file with minor number 0 and major number 224.

d When does kernel sends SIGHUP signal? Can some background processes continue even after logout? If yes, how? If not, Why?

SECTION-II

4 Answer the following questions (Any four)

a Did UNIX face Y2K problem? Justify your answer.

b'l:l'st,.;{:ftfferenfdatafHe·s and system files you know with suitable structure names and functions to access details of those files.

c Write a program to display list of usernames belonging to particular group name passed as command line argument.

d Explain with example the effect of setjmp () Ilongjmp () on automatic register and volatile variables.

e Where does kernel store environment variables and command line arguments? How wilt it store in case sufficient space is available and not available?

16

5 a Enlist and; describe various functions that set the different user IDs with appropriate 8

diagram.

b Write a program to display exit status of terminated child. 6

OR

5 a What are interpreter files? Are interpreter files really required? 6

b What are exit handlers? Give the prototype of system call to register the exit handlers. 6

Write small program that demonstrates how and when exit handlers are invoked.

c List the properties that any child inherits from its parents. Also list the properties that 4

child does not inherits from its parent.

6 a With single call to wait () system call, how parent process waits for all child process to 2

terminate when number of child processes are more than one.

b ,Write your own system () function without signal handling. Why it is not desirable to 8

call system function from Set-UID program?

c Write a program to print real time, user CPU time and system CPU time for the execution of commands passed as command line arguments.

8

S V NATIONAL INSTITUTE OF TECHNOLOGY, SURAT

BE IV COMPUTER ENGG.

VII Semester Examination (November 2005)

COMPUTER NETWORKS -II

Time:. Instructions:

3 Hrs 1. Answer the two sections in separate answer books.

2. Support your answer with necessary block diagram.

3. Figures to the right indicate maximum marks.

4. Assume necessary data wherever required.

Max. Marks 100

SECTION I

Q.1. Answer the following in brief. (Any Twelve) 30

1. What is a multi-homed system?

2. List information/ network security attacks.

3. What is the Management Information Base?

4. Define multicast and broadcast. .

5. Discuss physical/MAC address and IP address.

6. How UDP differs from TCP?

7. Discuss ICMP error reporting messages.

8. What is Bluetooth?

9. Explain source quench,

10. Explain timestamp request and reply and its applications.

11. Discuss IGMP encapsulation.

12. Discuss ARP and RARP .

. 13. List responsibilities of Network layer.

14. Discuss wireless LAN standards.

15. Discuss proxy ARP and Gratuitous ARP.

16. For an IP address 202.141.85.15 with 4-bits used for subnet ID and 'remaining for host ID, what is the subnet mask, network ID, and subnetlD?

Q.2. Discuss the following. (Any Four)

1. SNMP details and its versions

2. With suitable example diagram discuss loose source routing and strict

source routing.

3. Compare IPv4 and IPv6

4. Discuss Symmetric key cryptography v / s Public key cryptography

5. Wireless Application Protocol

20

SECTlONll

Q.3.

(a) Describe the routing mechanism in steps. Explain the routing table entries (8) with examples.

(b) When and how is the routing table modified by ICMP message? [4]

(c) Explain Open Shortest Path First (OSPF) routing protocol. [4)

Q.4.

(a) What is a domain name? Why isthe domain narneserVicerequired? [8] Describe the hierarchical organization ofDNS.

OR

Describe the connection termination and establishment protocol for TCP.

(b) 1. What is meant by packet fragmentation andMrUt Why should the [4] packet fragmentation be avoided?

2. What is a pointer query? Explain it with an exan;tple. [4]

Q.S. . Answer any three. [18]

(a) Describe the flow chart showing exchange of packets to start-up

rlogin between client application and server?

(b) Describe the following terms with respect to TCPprorocol. (1) MSL Wait state (2) URG flag (3) PSH flag (4) SYN

(c) What is a socket? How is a TCP client and Server designed using sockets and related system calls?

(d) What is a.RPC? Describe NFS mount protocol execution:

Sardar Vallabbbhai National Institute of Technology, Surat

B E IV(Computer Engg) - 7th Semester Examinations, Nov Dec 2005 Operating Systems

Dated: 17th November 2005.

Time: 14:30 hours to 17:30 hrs Instructions:

• Answers to the two sections must be written in separate answer books.

• Figures to the extreme right indicate the maximum marks of the respective question.

• Due credit may be given to the overall clarity, brevity, neatness and lucidity of the answers.

+ All the notations have their usual meanings. You may assume any necessary relevant data, giving proper justifications.

SECTION-I 1.

(a) An application program is being designed and developed for a microprocessor based controller for an automobile. [6] The application is required to perform the following functions:

- monitor and display the speed of the automobile

- monitor the fuel level and raise an alarm if necessary

- display the fuel efficiency

- monitor the engine condition and raise an alarm ifunusual condition is detected

- periodically record some auxiliary information like speed, fuel level etc.

(a) is this a real time application. Justify your answer (b) It is proposed to create multiple processes to reduce the response time of the application. Enlist the processes that should be in it. Specify their priorities.

(b) Enlisting the purpose of system calls, explain how do they relate to the concept of dual mode operation of the [6] operating systems.

(c) Which types of processes - CPU bound or I/O bound - should be given the higher priority in (a) time sharing [6] systems (b) real time systems.

2.

(a) When threads are implemented in user space, if one thread of a process executes blocking system call, entire [6J process goes to block state. Mention different solutions to avoid this problem.

(b) A soft real time system has four periodic events with periods of 50,100,200 and 250 msecs each. Suppose that the [6] four events require 35, 210, 10 and x msecs CPU time respectively. What is the largest value of x for which the system is schedulable ? Reason your answer.

(c) Can a process executing in the kernel be preempted? Enlist the strategies used by the Linux operating system to [4] handle such a situation.

Max Marks: 100

OR

2. (a)

Consider the following schedule of a typical job mix in a multiprogramming system: [10]

I

Process Name Arrival Time Service Time .

pI 0 3

p2 2 3

p3 3 2

p4 5 5

pS 8 3

Calculate the average turnaround time for the CPU scheduling algorithms viz: FCFS, HRRN, and SPN algorithms.

Prove that the Shortest Job First algorithm is the optimal algorithm. [6]

(b) 3. (a)

A system has five processes (PO to P4) and four allocatable resources (RI to R4). The current allocation and [8] maximum needs of the processes are as follows:

Processes Maximum Allocated
PO 3 2 I J 2 0 I I
PI I 2 0 2 J I 0 0
P2 I I 2 0 I I 0 0
P3 3 2 I 0 I 0 1 0
P4 2 1 0 1 0 I 0 I (b)

The extisting resources are R I-R4 = 6442. Is this safe state. Justify your answer with appropriate reasoning.

For the data acquisition system explained in class. reason how are the priorities of the processes decided? With the [6] help of the precedence graph, explain how using concurrent execution of processes can improve the performance. Is

the same kind of performace improvement possible when using double input and double output buffers as compared

to the previous case.

Explain how deadlocks can be prevented by negating circular wait condition. [2]

OR

(c)

3.

(a) A fast food restaurant has four kinds of employees viz. (1) Waiters, who wait on the customers for orders [8] from them (2) Cooks, who do the obvious job (3) Packaging Specialists, who stuff the food in the bags

for to-be-parceled items and (4) Cashiers, who hand our the bags to the customers and receive the money

due from them. Regarding each employee as a communicating sequential process, explain what form of interprocess communication mechanism can be employed amongst them? Write a concurrent pseudocode

to explain your answer.

(b) Reason whether the solution below showing the structure ofa particular process Pi, wanting to enter the [6] critical section is successful in implementing mutual exclusion or not:

repeat

flag[iJ = true; turn = j;

while flag [j J and turn =j.) do no-op; critical section

flag[iJ = false;

remainder section

until false;

(c) Is busy waiting less efficient (in terms of using processor time) than a blocking wait? Explain your [2]

answer. SECT 10 N - II

4. a. Explain the following terms: [4]

1. RAID 2. kswapdt) 3. circular buffer 4. device independence

b. Explain INTEL 80386 address translation scheme. [4]

c. Explain in brief kernel memory allocation, slab allocator w.r.t. Linux 2.2 virtual memory

~ ~

d. Draw a graph of degree of multiprogramming vs. CPU utilization. Explain the nature of

~~. ~

5. a. Disk head scheduling, interleaving, and track buffering (in the disk controlJer)are three [6]

techniques for improving the performance of the disk.

(i) Which, if any, of these three techniques can reduce (or eliminate) seek times? Explain briefly.

(ii) Which, if any, of these three techniques can reduce (or eliminate ) rotational latency? Explain briefly. (iii) Which, if any, of these three techniques can reduce (or eliminate) transfer times? Explain briefly

b. Answer to following: (any three)

(i) Explain in detail the C-SCAN disk scheduling policy (ii) Why page buffering is required? Explain in detail. (iii)Exphiin inverted page table organization.

(iv) Draw and explain the INTEL Pentium Paging Architecture.

[12]

6. a. Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a [6] 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,948,1509,1022,1750, 130.Starting from the current head position, what is the total distance (in cylinders) that the disk ann moves to satisfy all the pending requests for

each of the following disk-scheduling algorithms? .,

I. SSTF 2. SCAN 3.C-LOOK

b. Answer to following: (any three)

(i) Describe the operation of a working set memory allocator. Explain the reasons for page faults during the operation of a system using a working set memory allocator.

(ii) With the help of a diagram, explain the relationships that linux maintains about the process, its parent, its siblings, and its children.

(iii) Explain free disk space management.

(iv) Suppose we have a computer system with a 38-bit virtual address, 16K pages, and 4 bytes per page

table entry.

(I) How many pages are in the virtual address space?

(2) Suppose we use two-level paging and arrange for all page tables to fit into a single page frame.

How will the bits of the address be divided up?

Suppose we have a 32 Mbyte program such that the entire program and .all necessary pag_e tables (using two-level paging as in part 2) are in memory. How much memory (10 page frames) IS used by the program, including its page tables?

[12]

Sardar VaDabhbhai National Institute of Technology-Surat B. E. IV Computer Engineering (Eight Semester) Image Processing Techniques and Architecture November 2005 ExamiDation

Total Marks: 100

Time duration: 3 Hours

Instructions: Answer to each section in a separate answer book and attempt all questions.

Section I

Q.l [16]

(a) Describe the electromagnetic energy spectrum and their application in the filed

of image processing.

(b) How is the digital image represented? What is the amount of memory required to store an image of size 860 x 680 for (i) gray color image with 256 gray shades and (ii) color image with 24 bits/pixel.

Q.2 [16]

(a) Explain the following terms with respect to an image pixel: (i) Adjacency (ii)

. Connectivity.

(b) Write a code to output the negative image of a given color image.

Q.3 ExpIaln the following with respect to gray level transfonnations: (a) Log-transfonnation

(b) Power-law transformation

(c) Piecewiselinear transformation

[18]

Section n

Q.4 [16]

(a) Describe the spatial domain mask and applications of smoothing and sharpen-

ing filters.

(b) Describe the above filters in frequency domain.

Q.5 [16]

(a) Describe the translation and rotation properties of 2D Fourier transform.

(b) Discuss an image compression model in brief.

Q.6 Answer the following. [18]

(a) Advantages of transform coding with block diagram

(b) ocr transform coding

(c) Edge detector operators