CS-02 : INTRODUCTION TO
SOFTWARE JUNE 1999
| TIME : 2 HOURS |
MAX.MRK : 60 |
Note : Question 1 is compulsory. Answer any three from the rest.
| 1. | (a) | Write a grammar for an English language statement and draw a parse tree for the |
| statement "The short boy went to school". | ||
| (b) | Write a context-free grammar for an unsigned integer in C language. | |
| (c) | Write a shell program to print Fibonacci series. | |
| (d) | Design an slgorithm that accepts decimal number as input and converts to the binary | |
| coded decimal (bcd) representation. In the bcd scheme each digit is represented by 4-bit binary code. | ||
| (e) | Write a shell program to print the multiplication table of a given number. | |
| 2. | (a) | What are the two different ways to interact with operating system? Explain them by |
| taking any operating system into view. | ||
| (b) | Define the essential difference between spooling and Buffering. | |
| 3. | (a) | Describe semaphore as synchronization tool. Discuss the runtime behavior of |
| processes controlled by semaphore primitive operations. | ||
| (b) | Discuss the implementation of semaphore at hardware level. | |
| 4. | (a) | Discuss different types of translators. What are the main advantages of a translator in |
| the development of a software ? Why are linkers and loaders also called translators ? | ||
| 5. | (a) | discuss diagrammatically (through T-diagram) the usefulness of cross compiler in the |
| development of compiler design. | ||
| (b) | Design a context-free grammar for SWITCH statement in C-language. | |
| 6. | Explain the CPU scheduling and memory management in UNIX operating system. |