IGNOU MCA CS-02 Question Paper 2010
No. of Printed Pages : 3 CS-02
PGDCA / MCA (I Year) / BCA
CS-02 : INTRODUCTION TO SOFTWARE
Time : 2 hours Maximum Marks : 60
Note : Question number / is compulsory. Attempt any three
questions from the rest.
1. (a) Design an algorithm and draw a corresponding flow chart to convert binary
number to hexadecimal number.
b. Write a shell program to find Greatest Common Divisor (GCD) for the two given
c. Compare and contrast the disk space management methods, the linked list with Bitmap method.
d. Construct context-free grammar for conditional expression in “C” language.
(Example : x = (y < z) ? y : z;)
e. Explain the differences between internal and external fragmentation.
2. (a) Explain the differences between the following :
i. Third generation and fourth generation languages.
ii. Function and subroutine.
iii. Compiler and Interpreter.
(b) Discuss the functionality and 4 implementation of two pass assemble:.
3. (a) Discuss the similarities and differences between paging and segmentation.
(b) What is the basic philosophy of X-Windows ? How is it different from the rest of GUIs ?
4. (a) Define UNIX command for the following : 1×5=5
To count the number of users who are currently logged in.
To change the password.
To shut down the system at a particular time.
To print the file names and their file sizes in the current directory.
To terminate the particular process.
(b) List the major activities performed in the development of a software product. Also mention the limitations of the development cycle.
5. (a) Explain the important features of CASE tools.
(b) What are conditions that characterize deadlock ? Explain the occurrence and avoidance of deadlock graphically among processes and resources.