MASTER OF COMPUTER

APPLICATIONS
(MCA)

(4th SEMESTER)
FINAL SET OF ASSIGNMENTS
2009 & 2010

(CS-07, CS-10, CS-54)

SCHOOL OF COMPUTER AND INFORMATION SCIENCES

INDIRA GANDHI NATIONAL OPEN UNIVERSITY
MAIDAN GARHI, NEW DELHI – 110068

2
 CONTENTS

Course Code Assignment No. Maximum Marks Last Date of Page

Submission No.

15th October (for

MCA (4)-07/TMA/FINAL 10 Marks July session)
CS-07 15th April (for
January session)
31st October (for
MCA (4)-07/Project/FINAL 15 Marks July session)
30th April (for
January session)
15th October (for
MCA (4)-10/TMA/FINAL 10 Marks July session)
CS-10 15th April (for
January session)
31st October (for
MCA (4)-10/Project/FINAL 15 Marks July session)
30th April (for
January session)
15th October (For
MCA(4)-54/TMA/FINAL 10 Marks July session)
CS-54 15th April (for
January session)
31st October (for
MCA (4)-54/Project/FINAL 15 Marks July session)
30th April (for
January session)

3
Course Code : CS-07
Course Title : Discrete Mathematics
Assignment Number : MCA (4)-07/TMA/FINAL
Maximum Marks : 10
Last Date of Submission : 15th October (For July session)
15th April (for January 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 regarding assignments given in the Programme Guide for the format
of presentation.

Q1. (a) Apply Dijkstra’s Algorithm to find the shortest path from A to G in the graph given
below:

G (2 Marks)
B 30
8
12 2
E
A 5
16

C 3
11
4 F

6
D

(b) Translate the following into Propositional/Predicate Calculus:

i) Sum of two positive integers is greater than either of the integers.

ii) For some irrational numbers x and y, the number xy is a rational number.
iii) Americans will stop driving big cars only if there are comfortable small cars.
iv) Couple’s only surviving child is a male. (2 Marks)

Q2. Design the following circuits, clearly explaining the steps involved:

(a) A majority function is generated in a circuit when the output is equal to 1’s when
number of 1’s in the input is more than the number of 0’s. The output is 0 otherwise.
Design a three-input majority function using only NAND gates.

(2 Marks)
(b) Design a circuit that accepts a three-bit number and generates an output binary number
equal to the square of the input number.
(2 Marks)

4
Q3. Find the minimal Sum-of-products expression for the following Boolean expression:
F(x, y, z) = ∑(0, 1, 2, 4, 5, 6) (2 Marks)

Course Code : CS-07

Course Title : Discrete Mathematics
Assignment Number : MCA (4)-07/Project/FINAL
Maximum Marks : 15
Last Date of Submission : 31st October (For July session)
30th April (for January session)

This is a Project Assignment. Answer all the questions. You may use illustrations and
diagrams to enhance the explanation.

Question 1:

(a) Let S be a non-empty set and P(S) denote the set of all subsets of S. Then show that P(S)
alongwith the two operations, viz., ∧ (intersection) and ∨ (union) forms a distributive
lattice.

(b) If we define a tree as a finite, undirected graph with no cycles, then prove that a graph
with n vertices is a tree if and only it is connected and has exactly (n – 1) edges.

(c) Translate the following English arguments into propositional calculus (PC) and decide, in
PC, for each argument whether it is valid argument or not :

(i) Every event with finite probability eventually takes places.

(ii) If the world powers don’t get rid of their nuclear weapons, then there’s a finite
probability that humanity will eventually destroy the world.

(iii) If every event with finite probability eventually takes places and there’s a
finite probability that humanity will eventually destroy the world, then humanity
will eventually destroy the world.

Therefore we conclude:

Either the world powers will get rid of their nuclear weapons, or humanity will
eventually destroy the world.
(6 Marks)

Question 2:
(a) Prove that in a complemented and distributive lattice [ , ∪, ∩], the complement a of
an element a of  is unique.

(b) If we define a tree as a finite, undirected graph with no cycles, then prove that a graph
with n vertices is a tree if and only it is connected and has exactly (n – 1) edges.
(4 Marks)

5
Question 3:

(a) Find a minimal spanning tree for the connected weighted graph using

(i) Kruskal’s Method (ii) Prim’s Method:

Q
6
7 8 R
5
P
S 10 11
7

T V
9
(3 Marks)

(b) Apply Dijkstra’s algorithm to find shortest path from the vertex S to vertex T.

P
5 R

6 4

S 2
7 8 T
7
7
Q 4 M

(2 Marks)

6
Course Code : CS-10
Course Title : Software Engineering
Assignment Number : MCA (4)-10/TMA/FINAL
Maximum Marks : 10
Last Date of Submission : 15th October (For July session)
15th April (for January session)

This is a Tutor Marked Assignment. There are two questions in this assignment.
Answer all the questions. You may use illustrations and diagrams to enhance
explanations.

Question 1: Explain the process of estimating the cost of a project? In what phase of Software
Development Life Cycle is this activity performed. (5 Marks)

Question 2: Define the term “Quality “. How can it be ensured that the software developed
meets requisite quality standards? Explain with an example. (5 Marks)

7
Course Code : CS-10
Course Title : Software Engineering
Assignment Number : MCA (4)-10/Project/FINAL
Maximum Marks : 15
Last Date of Submission : 31st October (For July session)
30th April (for January session)

This is a project assignment. Answer the following question.

Question 1: Develop SRS for “Student Admission System”. The software is expected to
facilitate the entry of data from the applications submitted by students and then
output admission lists programme-wise.

Make assumptions, wherever necessary.

(15 Marks)

8
Course Code : CS-54
Course Title : Accounting and Finance on Computers
Assignment Number : MCA(4)-54/TMA/FINAL
Maximum Marks : 10
Last Date of Submission : 15th October (For July session)
15th April (for January 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 Programme Guide
regarding assignments.

Question 1: A firm’s current assets and current liabilities are 600 and 1500 respectively.
How much it can borrow from bank without reducing the current ratio below 1.5?
(3
Marks)

Question 2:
What do you understand by change in Net-Working capital? Given is the data of
Company X and Company Y. Find out the Net working capital of both the
companies and interpret the result.

Company X Company Y

Total current assets Rs. 1, 60,000/- Rs. 20,000

Total current liabilities Rs. 10,000
(5 Marks)

Question 3: What is the purpose of Working Capital? What is the operating cycle for
Working Capital? Describe various concepts and kinds of Working Capital.
(2 Marks)

9
Course Code : CS-54
Course Title : Accounting and Finance on Computers
Assignment No. : MCA (4)-54/Project/FINAL
Maximum Marks : 15
Last Date of Submission : 31st October (for July session)
30th April (for January session)

Question 1:
The shareholder funds of XYZ Co. for the year ending March 31 are as follows:

12% preference share capital Rs. 1, 00,000

Equity Share capital Rs. 4, 00,000
Share premium Rs. 40,000
Retained earnings Rs. 3, 00,000

The earnings available for equity shareholders are Rs. 1, 50, 000 which have been included as

part of the retained earnings.

Calculate the Maximum dividend per share (DPs) the firm can pay. (10 Marks)

Question 2:
Write a program in C/C++ to compute control ratios used in budgeting.
(5 Marks)

10