MASTER OF COMPUTER

APPLICATIONS
(MCA)

ASSIGNMENTS
(July-2008 & January-2009)

(6th SEMESTER)

CS-13 CS-14

CS-15

SCHOOL OF COMPUTER AND INFORMATION SCIENCES

INDIRA GANDHI NATIONAL OPEN UNIVERSITY
MAIDAN GARHI, NEW DELHI – 110 068
 CONTENTS

Course Assignment No. Assignment Type Page No.

Code

CS-13 MCA(6)-13/TMA/08 TMA 3

CS-13 MCA(6)-13/Project/08 Project 4

CS-14 MCA(6)-14/TMA/08 TMA 5

CS-14 MCA(6)-14/Project/08 Project 6

CS-15 MCA(6)-15/TMA/08 TMA 7

CS-15 MCA(6)-15/Project/08 Project 8

Important notes:

1. Viva voce is compulsory for the project evaluation of each course for which 6 marks are
allocated.
2. Project should contain the following:
• 3-4 pages write-up about the logic/algorithm and data structures used in the
programs implementation.
• Code-listing with necessary comments.

2
Course Code : CS-13
Course Title : Operating Systems
Assignment Number : MCA(6)-13/TMA/08
Maximum Marks : 10
Last Dates for Submission : 15th October, 2008 (for Jul’ 08 session)
15th April, 2009 (for Jan’09 Session)

This is a Tutor Marked Assignment. There are five questions in this Assignment.
Answer all the questions. Each question carries equal weightage. You may use
illustrations and diagrams to enhance explanations. Please go through the guidelines
regarding assignments.

Question 1: Operating systems perform resource preemption for the CPU and memory,
but not for I/O devices. Why is this so? Please discuss briefly.

Question 2: Compare the following page replacement policies on the basis of the
overhead:
(a) FIFO page replacement
(b) LRU page replacement
(c) Optimal page replacement

Question 3: Justify the statement:

“ It is possible to support multiprogramming without using time sharing.
However, it is impractical to support time sharing without using
multiprogramming”.

Question 4: Discuss why authentication is important for file protection.

Question 5: Discuss in detail the I/O Management, File Management, Security and
Protection mechanism in Windows Vista Operating System.

3
Course Code : CS-13
Course Title : Operating Systems
Assignment Number : MCA(6)-13/Project/08
Maximum Marks : 15
Last Dates for Submission : 15th October, 2008 (for Jul’ 08 session)
15th April, 2009 (for Jan’09 Session)

This is a Project assignment. There are three questions. Answer all the questions.
Each question carries equal weightage. You may use illustrations and diagrams to
enhance explanations. Please go through the guidelines regarding assignments.

Question 1: The Sleeping-Barber Problem:

A barbershop consists of a waiting room with n chairs, and the barber
room containing the barber chair. If there are no customers to be served,
the barber goes to sleep. If a customer enters the barbershop and all chairs
are occupied, then the customer leaves the shop. If the barber is busy, but
chairs are available, then the customer sits in one of the free chairs. If the
barber is asleep, the customer wakes up the barber. Write a program in C /
C++ to synchronize/coordinate the barber and the customers.

Question 2: Study and implement the following algorithms using C/C++ programming
language.
(i) RSA algorithm
(ii) Lamport’s Bakery Algorithm for Interprocess synchronization

Question 3: To build a robust distributed system, you must know what kinds of failures
can occur.
(i) List possible types of failure in a distributed system.
(ii) Specify which items in your list also are applicable to a centralized
system.

4
Course Code : CS-14
Course Title : Intelligent Systems
Assignment Number : MCA (6)-14/TMA/08
Maximum Marks : 10
Last Dates for Submission : 15th October, 2008 (for Jul’ 08 session)
15th April, 2009 (for Jan’09 Session)

This is a Tutor Marked Assignment. There are three questions in this assignment.
Answer all questions. You may use illustrations and diagrams to enhance
explanations. Please go through the guidelines given in the Starter Kit regarding
assignments.

Question 1: Express each of the following sentences as conceptual dependency

structure:
a) Shyam is a Professor in Delhi University.
b) Abdul ate salad with fork. (4 marks)

Question 2: Write an efficient algorithm that determines whether a string S2 consisting

of m characters, occurs as a substring somewhere in string S1 of n
characters, m ≤ n. (3 marks)

Question 3: For the sentence given below, develop Propositional Tree using the same
label links as those used in Human Associative Memory (HAM):

The boys are walking in the garden.

(3 marks)

5
Course Code : CS-14
Course Title : Intelligent Systems
Assignment Number : MCA (6)-14/Project/08
Maximum Marks : 15
Last Dates for Submission : 30th October, 2008 (for Jul’ 08 session)
30th April, 2009 (for Jan’09 Session)

This is a Project Assignment. There are five questions in this project assignment.
Answer all questions. You may use illustrations and diagrams to enhance the
explanation.

Question 1: Explain the following concepts from symbolic logic. If required, a

suitable example to illustrate a concept may be included.

(a) Analogical inference

(b) Completeness of a formal system
(c) Transposition inference rule
(d) Valid statement
(e) Syntax of FOPL (First Order Predicate Logic)
(f) Semantics of Prepositional Logic (3 marks)

Question 2: Transform the following sentence in clausal form:

((∀Z) ((∃Y) (∀ x ) P (f ( x ), y) → (R (g (z) ) ∧ (∃ u ) T (u ) )) (3 marks)
Question 3: Write the value of each of the following LISP expression:
a) ’(+ 5 8 7)
b) (member ’f ’(g f h j ) )
c) ( Lessp 3 9 12 )
d) ( cdr ’( (e f ) (g h j ) ) ) (2
marks)

Question 4: Write an iterative function named SUM-ALL using do construct that takes
an integer n as argument and returns the sum of all integers from 1 to n.
For example, (SUM-ALL 6) returns 21. (3 marks)

Question 5: Write a PROLOG program that answers questions about family members
and relationships. Include predicates and rules which define brother,
sister, father, mother, grandchild, grandfather, and uncle in terms of the
three basic relations, viz, child, male, female. The program should be able
to answer queries such as the following:

? – father (X, Ram)

? – grandson (X, Y)
? – uncle (Sam, Alice)
? – mother (Sita, X) (4 marks)

6
Course Code : CS-15
Course Title : Relational Database Management Systems
Assignment Number : MCA(6)-15/TMA/2008
Maximum Marks : 100 (Weightage – 10 marks)
Last Date of Submission : 15th October, 2008 (for Jul’08 session)
15th April, 2009 (for Jan’09 session)

This is a Tutor Marked Assignment. There are five questions (equal marks) in this
assignment. Answer all the questions. You may use illustrations and diagrams to
enhance explanations. Answer to each part of the question should be short not
exceeding 300 words unless specified and to the point. Please go through the
guidelines regarding assignment given in the Programme Guide for the format of
presentation.

Question 1:

“The algorithm to detect a deadlock is based on the detection of a circular chain in the
wait-for-graph.” With the help of an example, explain the deadlock detection algorithm.

Question 2:

What is the major disadvantage of Index-sequential organizations? Explain how this

disadvantage is overcome using Virtual storage access method (VSAM).

Question 3:

With the help of an example explain redundancy, update anomalies, insertion anomalies
and deletion anomalies.

Question 4:

List and explain the two integrity rules of relational model with the help of a suitable
example for each.

Question5:

Discuss how the two-phase locking protocol ensures serializability, but does not ensure a
deadlock-free situation.

7
Course Code : CS-15
Course Title : Relational Database Management Systems
Assignment Number : MCA (6)-15/Project/2008
Maximum Marks : 15
Last Dates for Submission : 30th October, 2008 (for Jul’ 08 session)
30th April, 2009 (for Jan’09 Session)

This is a Project Assignment. It consists of six questions. You may use illustrations
and diagrams to enhance the explanations. Please go through the guidelines
regarding assignment given in the Starter kit for the format of presentation.

Question 1:

Consider the following relations in the context of a BPO:

Customer (C_code, C_name, C_phone)

Product (P_code, P_desc, P_price)
Call (Ca_id, C_code, P_code, Ca_result, Ca_date)

(a) Write the appropriate SQL commands and relational algebraic query for the
following: (8 Marks)

(i) Find the name of customer to whom a call is not made.

(ii) Find the total number of calls to the customer whose name is ‘smith’.
(iii) List C_name and P_desc of the calls made today.
(iv) Find the product details of those products whose price is above average.

(b) Convert the algebraic queries into an optimized graph (10 Marks)

Question 2:

A University maintains database tables about the faculty and the students. (12 Marks)

FACULTY (f_id, f_name, subject_id)

STUDENT (S_id, S_name, S_course, S_dob)
MARKS (S_id, subject_id, marks)

Constraints: One faculty teaches only one subject.

(i) Identify suitable access rights for the faculty, students and database
administrator.
(ii) Create the access matrix for (i) above.
(iii) Write the query modification statement for the students.

8
Question 3:

A national bank and an international bank decide to merge. Assume that both the
organizations use almost similar E-R diagrams. (20 Marks)

(i) Prepare the E-R diagram for the merged bank showing all entities, relationship,
specialization, aggregation and generalization in the diagram.
(ii) Create tables and identify primary keys, foreign keys and all types of dependencies

Question 4:
Consider the following relations and the set of Function Dependencies(FDs):
SHIPMENT (ship_id, S_capacity, S_date, cargo, amount)
FDs are as follows:
Ship_id S_capacity
Ship_id, S_date cargo
Cargo, S_capacity amount

Now perform the following:

(i) Identify the key of the relation.
(ii) Find the non-redundant cover of the given FDs.
(iii) Normalize the relation into BCNF. Is the decomposition dependency
preserving? Give reason for your answer. (20 Marks)

Quesiton 5:
Check the conflict-serializability of the following schedule by drawing precedence –
graph: (15 Marks)

T1 T2
read-item(X) ;
X:= X-N; read-item(X);
X = X+ M;

write-item(X);
read-item(Y)
write-item(X);

Y: = Y+N;
write-item(Y);

Question 6:
What problems occur in the database system when transactions do not satisfy ACID
properties? Explain explicitly using suitable examples (wherever necessary)
(15 Marks)