MASTER OF COMPUTER

APPLICATIONS

(MCA OLD SYLLABUS)

ASSIGNMENTS
(July, 2008 & January, 2009)

(2nd SEMESTER)

CS-01 CS-03

CS-06

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-01 MCA(2)-01/TMA/08 TMA 3

CS-01 MCA(2)-01/Project/08 Project 5

CS-03 MCA(2)-03/TMA/08 TMA 7

CS-03 MCA(2)-03/Project/08 Project 8

CS-06 MCA(2)-06/TMA/08 TMA 10

CS-06 MCA(2)-06/Project/08 Project 11

Important notes:

1. Students are allowed to work in a group (but not more than 2) on projects.
2. Viva voce is compulsory for the project evaluation of each course for which 6 marks
are allocated.
3. 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-01
Course Title : Computer Fundamentals
Assignment Number : MCA(2)-01/TMA/08
Maximum Marks : 100 (Weightage - 10 Marks)
Last Dates for Submission : 15th October, 2008 (For July, 2008 session)
15th April, 2009 (For Jan, 2009 session)

This is a Tutor Marked Assignment. Answer all the 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. Answer to each part of the question should be confined to about 300
words.

Question 1:
Describe error detection and correction mechanism. What is the limitation of Hamming
Error correcting code? Explain through an example. (10
Marks)
Question 2:
What is the basic principle behind the Quine McKluskey method? Explain through an
example. (10
Marks)

Question 3:
Draw a 4-bit adder-substractor diagram and explain the operation of the circuit and also
explain the function of each component. (10
Marks)

Question 4:
Draw an associative memory block diagram and explain its operation through examples.
(10
Marks)

Question 5:
Design a 4 bit arithmetic circuit using 4 full adders and 4 multiplexers for carrying out
the following micro-operations:
• Add
• Add with carry
• Subtract
• Subtract with borrow
• Transfer
• Increment
(30 marks)

3
Question 6:
Explain the following along with their usage:

• Bus
• Micro programmed control Unit
• RISC architecture
• Cache Memory
• Device Drivers (20 Marks)

Question 7:
Draw and explain the logical organization of memory in Intel 8086 microprocessor.
(10 marks)

4
Course Code : CS-01
Course Title : Computer Fundamentals
Assignment Number : MCA(2)-01/Project /08
Maximum Marks : 100 Marks
Last Dates for Submission : 30th October, 2008 (For July, 2008 session)
30th April, 2009 (For Jan, 2009 session)

This is a project Assignment. Answer all the 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. Answer
to each part of the question should be confined to about 300 words.

Question 1:
Simplify the following expression using Karnaughs map in sum of the product form:

F (A, B, C, D) = ∑(3, 5, 7, 9, 10, 13)

(10
Marks)
Question 2:
(a) Express the following numbers in IEEE 64 bit floating number format:

– 1.234 × 10 –120
+ 0.0007 × 10 +120
(10
Marks)

(b) Draw a pipeline configuration to carryout the following tasks:

(Ai X Bi – Ci + Di ) (Ei × Fi )
List the contents of all registers in the pipeline for i = 1 to 5
(10
Marks)

Question 3:
Write an assembly language program to find out a smallest number in an array
(10
Marks)

Question 4:
Make a comparison between 8086 and 8088 microprocessors. (10 Marks)

Question 5:
(a) Convert decimal 65,535 to its hexadecimal, octal and binary equivalent

5
 (6Marks)
(b) Express – 19, 750 in 2′s complement representation. Then show how this number is
stored at address 2000 onwards. Use hexadecimal notation to compress the data.
(4
Marks)

Question 6:
(i) Explain the operation of a master-slave flip flop with the help of the diagram.
(10
Marks)
(ii) Draw a logic diagram and a truth table for a three JK flip flop ripple counter and
explain its operation.
(15
Marks)

(iii) Draw the logic diagram and truth table for 3 JK flip flop synchronous counter and
explain its operation.
(15
Marks)

6
Course Code : CS-03
Course Title : File Structure and Programming in COBOL
Assignment Number : MCA(2)-03/TMA /08
Maximum Marks : 10 Marks
Last Dates for Submission : 15th October, 2008 (For July, 2008 session)
15th April, 2009 (For Jan, 2009 session)

This is a Tutor Marked Assignment. There are two questions in this Assignment.
Answer both the questions. Each question carries equal weightage. You may use
illustrations and diagrams to enhance explanations. Please go through the guidelines
regarding assignments given in the Starter kit for the format of presentation.

Question 1:

Compare and contrast the features/advantages/disadvantages of various file organisations

in COBOL? Suggest an application for each file organisation. Create a Relative file for
the following input records (Write the Program. Make suitable assumptions, if needed).

Input File:

File Name : Client_details

Organisation : Relative
File Format:
1.10 Client Code
11-35 Client name
36-50 Client Phone
51.70 Business Volume
71.72Status (Project is On, Project is over, Negotiation for
project is on, Clients having bad track record etc.)
73-80 Not used

The created relative file should be used for the following searching:

• To ascertain the status of a client, prior to a project negotiation.

• To display the contact phone of a client.

7
Write the COBOL program for the above.

Question 2:

Write a program in COBOL that sorts the records in a student file (assume suitable
structure an organisation) on the alphabetical order of names. Make and state suitable
assumptions.

8
Course Code : CS-03
Course Title : File Structure and Programming in COBOL
Assignment Number : MCA(2)-03/Project/08
Maximum Marks : 15 Marks
Last Dates for Submission : 15th October, 2008 (For July, 2008 session)
15th April, 2009 (For Jan, 2009 session)

This is a Project Assignment. There are two questions in this Assignment. Answer
both the questions. Each question carries equal weightage. You must run the
resultant Program and submit the Program logic and sample input and output.
Please go through the guidelines regarding assignments given in the Starter kit for
the format of presentation.

Question 1:

A University stores following disk files for various transactions relating to fee deposit by
its students:

File 1: Student Master

Organisation: Index – Sequential on Student Number
Structure:
01-09 Student Number
10-30 Student Name
31-60 Address
61-66 Programme Code
67-74 Total of fee amount deposited so far
75-80 Unused

File 2: Programme Master

Organisation: Index – Sequential on Programme Code
Structure:
01-06 Programme code
07-51 Programme Name
52-54 Duration
55-57 Level (for example, PG, UG, etc.)
58-66 Total Fees
67-80 Entry Qualification

File 3: Transaction Table (Kept semester wise only)

Unsorted file
Structure:
1.9 Student Number
10-18 Date of Fee deposition
19-26 Amount deposited

9
Labels are standard. The first field of the records in each file represents the key field.

Write a COBOL program that updates the total of fee deposited by the student in Student
Master and prints each of the transaction (Reporting errors if any) in the following output
format:

OUTPUT
Structure:
1.10 Transaction Number (A new number is generated for each transaction)
10-18 Date of Transaction
19-20 Amount deposited
21-39 Student name
40-49 Total of fee deposited by student so far
50-55 Programme code of student
56-64 The remaining fee that will be deposited by student later (by subtracting
total of fee deposited by student from Total Programme fee).

The file should be sorted in the Order of Student Number.

Question 2:

A University has database of students at two different places: its administrative office and
College of the student. However, over a period of time it was found that the information
stored about the student in college database is most recent, but it does not store the
information about the students who have not paid the fee. As per the University policy the
data of such student should also be maintained along with other students, but indicating
proper status. The student information is stored in the following format:

01-09 Student code

10-35 Student name
36-50 Programme
51-70 Address

Write a Program in COBOL that combines the two files to create a single file. The
combined file will have same structure till 70th position and on 71st position a status
information code is added about the student. Please note that the latest student addresses
are available in College file and the status will be ascertained from the fact that the
student name does not appear in college file but exists in administrative office file.

10
Course Code : CS-06
Course Title : Introduction to DBMS
Assignment Number : MCA(2)-06/TMA/08
Maximum Marks : 10
Last Dates for Submission : 15th October, 2008 (For July, 2008 session)
15th April, 2009 (For Jan, 2009 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.

Question 1:
Discuss the advantages and disadvantages of object oriented database management
system in comparison with RDBMS. Discuss types of applications suitable for object
oriented DBMS and RDBMS.

Question 2:
Discuss the concept of data independence and explain its importance in a database
environment with the help of a suitable example.

Question 3:
Describe the problems that are associated with redundant data. Can data redundancies be
completely eliminated when the database approach is used? Why or why not?

Question 4:
Describe the concept of functional dependency. How is this associated with the process of
normalization?

Question 5:

Describe the rules for deriving relations that represent strong entity types, weak entity
types, one-to-one binary relationship types, one-to-many relationship types, multi-valued
attributes, and superclass / subclass relationships.

11
Course Code : CS-06
Course Title : Introduction to DBMS
Assignment Number : MCA(2)-06/Project/08
Maximum Marks : 15
Last Dates for Submission : 30th October, 2008 (For July, 2008 session)
30th April, 2009 (For Jan, 2009 session)

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

Question 1: Produce an E-R diagram, which documents the entities and relationships
involved in the Ticketing System of a Movie Theatre. Create a relational
schema to held information and perform normalization to the tables and
fully implement the code using MS-Access/ FOXPRO/DBASE or any
similar package. Provide necessary documentation for the project.

Note: Assumptions can be made wherever necessary.

12