PR-III-B-I: AUGUST 2004

NOTE:

1. All Question are Compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET I (BATCH –1)

Q1. What are the significant differences between a Capability Maturity Plan
written for a large project versus a small project? Develop CM plans for

• Bank automation project

• An information web-site of Delhi Tourism [25]

Q2. Perform the following:

Add user to your system
add group to your system
delete users from your system
modify profile of a user [30]

Q3. Issue a command to verify flash memory of router and then a command to
backup IOS image to tftp server. [25]
 PR-III-B-S3: AUG 2004

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET-III (Batch-3)

Q1. What are the major features of clean room software engineering? Explain with
an example case of banking transaction processing software. [25]

Q2. Implement any deadlock detection algorithm. (Note: make assumptions where
necessary). [30]

Q3. Configure Two VLANs ‘Marketing’ and ‘Sales’ on 1900Series Switch and
assign portel static membership of ‘Marketing’ VLAN and port e2 membership of
‘Sales’ VLAN. [25]
 PR-III-B-V: AUGUST 2004

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET V (BATCH –5)

Q1. Here is the basic flow of software called ‘Register for courses’ in a
University.

Register For Courses : Basic Flow

• Logon
This use case starts when a Student accesses the Wylie University Web site.
The system asks for, and the Student enters, the student ID and password.
• Select 'Create a Schedule'
The system displays the functions available to the student. The student
selects "Create a Schedule."
• Obtain Course Information
The system retrieves a list of available course offerings from the Course
Catalog System and displays the list to the Student.
• Select Courses
The Student selects four primary course offerings and two alternate course
offerings from the list of available course offerings.
• Submit Schedule
The student indicates that the schedule is complete. For each selected
course offering on the schedule, the system verifies that the Student has the
necessary prerequisites.
• Display Completed Schedule
The system displays the schedule containing the selected course offerings
for the Student and the confirmation number for the schedule.

Develop the alternate flows in the same format. [25]

Q2. Implement a Buddy system algorithm in C or C++. [30]

Q3. Configure Serial 0 for Cisco router IP encapsulation HDLC, IP address
172.16.65.12, mask /8. [25]
 PR-III-B-S6: AUG 2004

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET-VI (Batch-6)

Q1. List the major SCM activities. Check them against a list of SCM activities to
be followed for CM of banking ATM software. [25]

Q2. There are n jobs arrived at the same time. Each job has an estimated running
time of Ti. Assuming that each job would be run for s amount of time, and the
system is multi-programmed. Write a C/C++ program for displaying the
scheduling of the jobs using Round robin algorithm. [30]

Q3. Configure class C network for which has only one PC in one subnet, network
is 172.16.65.XX , make mask in your PC. [25]
 PR-III-B-S4: FEB 2005

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET-IV (Batch- 4)

Q1. Consider the following Euclid's GCD algorithm:

int compute_gcd (x, y)

int x, y;
{
while (x ! = y)
{
if (x >y) then
x= x-y;
else y= y-x;
}
return x;
}

Design a test suite for the function compute_gcd using the statement coverage and
the branch coverage - white box testing strategies. [30]

Q2. 5 processes are entering the ready queue at a certain point of time. The
serving time for each process is given. Each process is assigned a priority (0 shall
be the highest i.e. 0>1>2>3>4)

Process Arrival Serving priority Time Time

1 0 8 4
2 3 28 1
3 7 12 0
4 9 3 2
5 15 4 3
Using the above data, implement Shortest-Processing-Time-First (SPTF) without
preemption algorithm in C/C++/Java. Show the average turn-around time and
waiting time for each process. [25]

Q3. Write a WML program to accept your name from device and display the
result onto the next card as Hello, your name. [25]
 PR-III-B-S5: FEB 2005

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET-IX (Batch-9)

Q1. Draw the Control flow graph for the following function named find-
maximum. From the control flow graph, determine its cyclomatic complexity. [30]

int find_maximum ( 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);
}

Q2. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The devise is
currently serving a request at cylinder 143, and the previous request was at
cylinder 125. The queue of pending request 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 arm moves to satisfy all the pending
requests using LOOK disk scheduling algorithm. Write a program in C/C++/Java
to implement the above algorithm. [25]

Q3. Write a WML program to accept your name in the format:

i.e., first letter of the name should be in uppercase and the rest lowercase, and
display the result. [25]
 PR-III-B-S21: FEB 2005

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET-XXI (Batch-21)

1. Write a program to compute the intersection point of two straight lines and
display the result in C/C++/Java. It reads two integer pairs (m1, c1) and (m2, c2)
defining the two straight lines of the form, y = mx + c.

Design the black-box test suite for the above program. [30]

2. 5 processes are entering the ready queue at a certain point of time. The serving
time for each process is given. Each process is assigned a priority (0 shall be the
highest i.e. 0>1>2>3>4).

Process Arrival Serving priority Time Time

1 0 8 4
2 3 28 1
3 7 12 0
4 9 3 2
5 15 4 3

Using the above data, implement Highest-Priority-First with preemption algorithm

in C/C++/Java, and show the average turn-around time and waiting time for each
process. [25]

Q3. Write a program in WML to accept your name (Uppercase alphabets only)
and age (two digit any numeric character) and then display the result. [25]
 PR-III-B-23: FEB 2005

NOTE:

1. All the questions are compulsory.

2. Whenever values/data have not been given in the question papers, the examiner
has to assume the data.

Time: 3 Hours Total Marks: 100

(80 marks for practical exercise + 20 marks fro viva voce)

SET-XXIII (Batch-23)

Q1. Write a program in C/C++/Java to compute square root of an integer, which

can assume values between 0 and 2000. Design the black-box test suite for the
above program. [30]

Q2. Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The devise in
currently serving a request at cylinder 143, and the previous request was at
cylinder 125. The queue of pending request 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 arm moves to satisfy all the pending
requests using SSTF disk scheduling algorithm. Write a program in C/C++/Java to
implement the above algorithm. [25]

Q3. Write a program in WML to accept your name from device and display the
result onto the next card as Hello, your name. [25]