No.

of Printed Pages : 3

CS-02

PGDCA / MCA (I Year) / BCA

cV O O O

Term-End Examination June, 2010 CS-02 : INTRODUCTION TO SOFTWARE

Time : 2 hours questions from the rest.

Maximum Marks : 60

Note : Question number / is compulsory. Attempt

any three

1.

(a) Design an algorithm and draw a corresponding flow chart to convert binary number to hexadecimal number. Write a shell program to find Greatest Common Divisor (GCD) for the two given numbers. Compare and contrast the disk space management methods, the linked list with Bitmap method. Construct context-free grammar for conditional expression in "C" language. (Example : x = (y < z) ? y : z;) Explain the differences between internal and external fragmentation.

CS-02

P.T.O.

2.

(a) Explain the differences between the following : Third generation and fourth generation languages. Function and subroutine. (iii) Compiler and Interpreter. functionality and (b) Discuss the implementation of two pass assemble:. (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 ?

3.

5 5

4.

(a) Define UNIX command for the following : 1x5=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. (v) To terminate the particular process. (b) List the major activities performed in the 5 development of a software product. Also mention the limitations of the development cycle. 2

CS-02

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 3 processes and 3 resources.

5 5

CS-02