MASTER OF COMPUTER

APPLICATIONS
(MCA)

(2nd SEMESTER)
ASSIGNMENTS
JANUARY, 2008

(MCS-021, MCS-022, MCS-023, MCS-024, MCSL-025)

SCHOOL OF COMPUTER AND INFORMATION SCIENCES

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

Course Code Assignment No. Maximum Last Date of Submission Page

Marks No.
MCS-021 MCA(2)/021/Assign/08 100 15th April, 2008 3
MCS-022 MCA(2)/022/Assign/08 100 15th April, 2008 5
MCS-023 MCA(2)/023/Assign/08 100 15th April, 2008 6
MCS-024 MCA(2)/024/Assign/08 100 30th April, 2008 9
MCSL-025 MCA(2)/025/Assign/08 100 30th April, 2008 11

Important Notes

1. Viva-voce worth 20 Marks is compulsory for each course.

2. Please follow the guidelines given in the MCA Programme Guide for solving,
presentation format and submission of the assignments.

2
Course Code : MCS-021
Course Title : Data and File Structures
Assignment Number : MCA(2)/021/Assign/08
Maximum Marks : 100
Weightage : 25%
Last Date of Submission : 15th April, 2008

This assignment has ten questions. Answer all questions. Rest 20 marks are for viva
voce. You may use illustrations and diagrams to enhance the explanations. Please
go through the guidelines regarding assignments given in the Programme Guide.
Ensure that you don’t copy the program from course material or any other source.
All the programs should be written using “C” language.

Question 1:

Define the term array. How are two-dimensional arrays represented in memory? Explain how
address of an element is calculated in a two dimensional array. (8 Marks)

Question 2:

What is a sparse matrix? How is it stored in the memory of a computer? Write a function to find
the transpose of a sparse matrix using this representation. (8 Marks)

Question 3:

What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster
than an algorithm whose running time is 2n on the same machine. (6 Marks)

Question 4:

Implement a Queue using a singly linked list L. The operations INSERT and DELETE should
still take O (1) time. (10 Marks)

Question 5:

Two Binary Trees are similar if they are both empty or if they are both non-empty and left and
right sub trees are similar. Write an algorithm to determine if two Binary Trees are similar.
(10
Marks)

Question 6:

What is the difference between Prims algorithm and Kruskals algorithm for finding the
minimum-spanning tree of a graph? Execute both Prims and Kruskals algorithms on the
following graph. (10 Marks)

Question 7:

3
Give an AVL tree for which the deletion of a node requires two double rotations. Draw the tree
and explain why two rotations are needed? (10 Marks)

Question 8:

Draw a B-tree of order 3 for the following sequence of keys:

2, 4, 9, 8, 7, 6, 3, 1, 5, 10 (6 Marks)

Question 9:

Explain the difference between depth first and breadth first traversing techniques of a graph.

(6 Marks)

Question 10:

What are priority Queues? How can priority queues be implemented? Explain. (6 Marks)

4
Course Code : MCS-022
Course Title : Operating System Concepts and Networking
Management
Assignment Number : MCA(2)/022/Assign/08
Maximum Marks : 100
Weightage : 25%
Last Date of Submission : 15th April, 2008

This assignment has five questions. Answer all questions. Rest 20 marks are for viva
voce. You may use illustrations and diagrams to enhance the explanations. Please
go through the guidelines regarding assignments given in the Programme Guide for
the format of presentation. Answer each part of the question should be confined to
about 300 words.

Question 1:
Describe the basic characteristics of modern operating systems with appropriate examples.
(10 Marks)
Question 2:
Examine the LAN set up at your study centre and answer the following questions:

(i) Sketch the diagram showing various components: Switch, Hub, Nodes, Cables,
Router and Bridges.
(ii) LAN topology.
(iii) Bandwidth of the channel.
(iv) What is the Networking O/S that is installed? (20 Marks)
Question 3:
(i) What is the difference between Network and O/S security? (5 Marks)
(ii) List and describe networking support in Windows 2000 O/S. (5 Marks)

Question 4:
(i) What is a networking management system? Explain. (5 Marks)
(ii) Briefly describe the Microsoft’s 2000 DNS management. (10 Marks)
(iii) Write the purpose of VPN and name the VPN technologies supported by
Windows 2000. (10 Marks)
Question 5:
Briefly describe the installation procedure of Linux OS. (15 Marks)

5
Course Code : MCS-023
Course Title : Introduction to Database Management Systems
Assignment Number : MCA(2)/023/Assign /08
Maximum Marks : 100
Weightage : 25%
Last Date of Submission : 15th April, 2008

This assignment has four questions. Answer all questions of total 80 marks. Rest 20
marks are for viva voce. 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: 20 Marks

(i) What is DBMS? How is it different from RDBMS?

(ii) Is DBMS usage always advisable or some times we may depend on file base systems?
Comment on the statement by describing the situation where DBMS is not a better option
& file base systems is better.

(iii) Describe ANSI SPARC 3-level architecture of DBMS with details of languages
associated at different levels plus the level of data independence.

(iv) How logical architecture of DBMS differs from physical architecture?

(v) Create an E R diagram and relational schema to hold information about the situation in
many institutions affiliated to some University, many teachers of different disciplines are
teaching to many students enrolled in many courses offered by the university to the
students through the institutions. Use concept of keys, aggregation, generalisation,
cardinality etc. in a proper way.

(vi) Say the schema of respective entities is:

Teacher( T#, Tname, Tqual, Tsubject, Tcourse, Prog)

Student(Roll#., Sname, Sage, Saddress, Scourse.Prog , Smarks)
Teaches(T#, Roll# , Scourse, Prog ,University)

Performa following queries in SQL using the given schema:

a) Find details of Teachers who taught DBMS.

b) Find details of students who did MCA from IGNOU.
c) Find courses taught by T# 5078.
d) Find address of students whose marks are less than 50.

6
Question 2: 20 Marks

(i) What is the utility of relational algebra & relational calculus? Name some software’s
based on these concepts?

(ii) Comment on the statement “Set theory has contributed a lot to RDBMS” support it with
the help of suitable examples.

(iii) “Redundancy of data is many times beneficial” Justify the statement, also describe the
situation when redundancy will mess up the current data base status, at that instance of
time what actions you will prefer to take.

(iv) In Oracle we are having variety of versions Oracle 8, Oracle 9, etc, what does the
associated number mean. Again we are having Oracle 8i, Oracle 9i etc, what does this “i”
mean.

(v) Describe the various file organization techniques? How a binary tree is different from B-
tree and B+ tree? Under which situation we need to use B+ tree or B tree.

Question 3: 20 marks

(i) Prove “Any relation which is in BCNF is in 3NF,but converse is not true”
Consider the schema and functional dependency set of Empdept given below:

Empdept (emp# , Dept#, Manager#, Dept_Name , Dept_Loc)

Emp# Dept#  manager# manager#  Dept #

Viewing the given functional dependency set prove that the relation is in 3NF but not in
BCNF.

(ii) Which functional dependencies are to be removed to achieve respective normal form?
Discuss all the normal forms up to 4NF?

(iii) What is the mathematical basis of SQL? The SQL statement: select * from student will
perform like projection or selection? Give details in support of your answer.

(iv) Describe ‘ACID’ properties of transaction violation of which properly leads to lost up
date problem & suitable example.

(v) How 2-phase locking differs from 2-phase commit?

Question 4: 20 marks

(i) How serial schedule differs from serializable schedule? How can you defect that the
schedule is serializable?”A positively interleaved system can not be serialized“,
Comment on the statement and prove it with suitable example? In which type of
scheduling the problem of deadlock is prominent and in which type the problem of
starvation is prominent. Justify your answer?

(ii) Number of users in a concurrent system continuously grows and we find that respectively
one strategy of concurrency management flops and other is invoked. Describe various

7
 strategies of concurrency management in this scenario of development and handling of a
concurrent Data base environment.

(iii) How centralized DBMS differs from distributed DBMS? Can the network of any DBMS
afford to have bridges?

(iv) What is fragmentation? What are the various types of fragmentation? How you
implement respective fragmentation schemes.

(v) Compare MS-ACCESS and ORACLE (give at least 4 comparisons).

8
Course Code : MCS-024
Course Title : Object Oriented Technologies
and Java Programming
Assignment Number : MCA (2)/024/Assign/08
Assignment Marks : 100
Maximum Marks : 25%
Last Date of Submission : 30th April, 2008

There are eight questions in this assignment, which carries 80 marks. Rest 20 marks are for
viva-voce. Answer all the questions. Also in your programs give appropriate comments to
increase understandability. Please go through the guidelines regarding assignments given in
the Program Guide for the format of presentation.
Question 1:

(i) What is Object Oriented paradigm? Explain two differences between Object Oriented
paradigms of programming languages over Structured paradigm. (5 Marks)

(ii) What is message passing? Explain the advantages of message passing. (5 Marks)

Question 2:

(i) Explain the advantages of platform independence of Java. (2 Marks)

(ii) What is super in Java? Explain different use of super with the help of Java program.

(5 Marks)

(iii) Explain exception handling in java with the help of a programme. (3 Marks)

Question 3:

(i) Write a program in Java for matrix multiplication. (5 Marks)

(ii) What is static method? Explain why main method in Java is always static. (2 Marks)

(iii) What is Garbage Collection? Explain the use of finalize () method in Java programming
with example. (3 Marks)

Question 4:

(i) What is abstract class? Write a program in Java to explain the use of an abstract class.
(5 Marks)
(ii) Explain the need of interface. Also explain the advantage of interfaces in Java
programming with an example. (5
Marks)

9
Question 5:

(i) Write a Java program to create your own exception subclass. (5 Marks)

(ii) Differentiate between String and StringBuffer classes. Also write a program to append a
given string to another string. (5 Marks)

Question 6:

(i) What is multithreading? Write program to explain how implementing runnable interface
in Java creates a thread. (5 Marks)

(ii) What are the classes in Java available for file handling? Write a program in Java to create
a file and copy the content of an already existing file into it. (5 Marks)

Question 7:

(i) What is an Applet? Write a program to show how parameters are passed in an applet
program. (5 Marks)

(ii) Explain the different layout managers available in Java. Write a program to show how
a layout can be set in an applet. (5 Marks)

Question 8:

(i) What is a TCP/IP socket? Explain basic networking features of Java. (5 Marks)

(ii) Explain how databases are connected to Java programs? (3 Marks)

(iii) What is a session? What are the different ways of session tracking in servlet
programming? (2 Marks)

10
Course Code : MCSL-025
Course Title : Lab Course
Assignment Number : MCA(2)/025/Assign/08
Maximum Marks : 100
Weightage : 25%
Last Date of Submission : 30th April, 2008

This assignment has four parts. Answer all questions of each part. Each part is of 10
marks. Lab Records of each part will carry 10 Marks. Rest 20 marks are for viva
voce. You may use illustrations and diagrams to enhance the explanations. Please
go through the guidelines regarding assignments given in the Programme Guide for
the format of presentation.

PART-I: MCS-021

Question 1:
Modify the bubble sort algorithm in which the direction of bubbling changes in each iteration: in
one iteration, the smallest element is bubbled up; in the next, the largest is bubbled down; in the
next, the second smallest is bubbled up; and so forth. Write an algorithm in C to implement this
and find its time complexity. (6 Marks)

Question 2:
Write an algorithm in C to convert an infix expression to a postfix expression. Execute your
algorithm with the following infix expression as your input.

(m+n)*(k+p)/(g/h)↑ (a↑ b/c) (4 Marks)

Note: You must execute the program and submit the program logic, sample inputs and outputs
along with the necessary documentation for this question. Assumptions can be made wherever
necessary.

PART-II: MCS-022

Question 1:
Write a shell script that prints a list of every unique word (exceeding 4 characters in length) in a
file in reverse alphabetical order. (2
Marks)

Question 2:
(i) What is the output of ls-lm and ls-ml? Which option takes procedure? What is the result
of ls-d? (2
Marks)

(ii) How would you set the IP address of a LAN card in Linux? (2
Marks)

Question 3:

11
(i) Protect Data by using Encrypting File system (EFS) and Recover Encrypted Data with a
Data Recovery Agent. Show the result with the help of your own examples. (2
Marks)

(ii) Configure Window 2000 to have a remote access feature and show the result.
.
(2 Marks)

PART-III: MCS-023
Question 1:
There are many private colleges affiliated to a state University. The University wants to
computerize all its affiliated colleges to keep update information about students, faculty, generate
different types of reports and monitor performance of these colleges. After creating the database
you must perform the following tasks:

Produce a report showing number of students registered in each program of each college.
(i) Find out number of faculty positions vacant in computer science programme in all
colleges.
(ii) List the name of students with their enrolment numbers who have topped in their
respective program in their colleges.
(iii) Produce a report of faculties who are going to retire within 6 months.
(iv) List the name of the faculties with the highest number of research papers in international
journals. (10
Marks)

PART-IV: MCS-024

Question 1:
(i) Write a Java program to demonstrate the use of different bitwise operators. (1 Mark)

(ii) Write a Java program, which create variable size array in Java. This program also should
take two 3×3 matrices as input and display sum of these matrices. (2 Marks)

Question 2:
(i) Write a Java program that take your name as input and display the reverse of it. Also read
names of two of your friends and attend it to your name and display the final string.
(2 Marks)

(ii) Write a Java program to explain how a thread with higher priority will execute before a
thread of low priority. (1 Mark)

Question 3:
(i) Write a java program to create a file and copy the contents of an already existing file into
it. (2 Marks)

(ii) Create an Applet program, which takes your name, address, and a detailed description of
advantages of using java-programming language. After giving input when you press

12
 submit button your program display “ You are right, java is really a very good
programming language”. Use appropriate GUI components and layout in this program.
(2 Marks)

Note: You must execute the program and submit the program logic, sample inputs and outputs
along with the necessary documentation for this question. Assumptions can be made wherever
necessary.

13