TEE JUNE 2000
Note : Question 1 is compulsory. Answer any three from
the rest.
1. (a) Write a shell program to find the square root
of a number.
(b) Write an algorithm/program to reverse and sum the
digits of a 4-digit integer.
(c) Write context free grammar for assignment statement
in C-language.
(d) Compare and contrast the disk space management
methods, the Linked list with Bitmap method.
2. (a) Discuss an assembler macro facility and its
implementation within an assembler with appropriate
example.
(b) Discuss the tasks performed during Lexical Analysis.
Also explain the relevance of regular expressions in
Lexical Analysis.
3. (a) Consider the following set of processes which
arrive in the ready queue at the same time:
Process CPU time
P1 8
P2 3
P3 2
P4 7
P5 3
Consider the following scheduling algorithms :
FCFS, SJF and Round Robin (quantum = 1)
(i) What is turnaround time of each process for each
of the above scheduling algorithms?
(ii) What is the waiting time of each process for each
of the above algorithms?
(b) Explain the need for interprocess synchronization.
Discuss how message passing allows interprocess communication
and synchronization.
4. (a) Discuss how the degree of multiprogramming and
CPU utilization is increased using virtual memory management
technique.
(b) Discuss the support for object orientation in MS-Windows
and Macintosh.
5. (a) Compare and contrast Coalescing and Compaction.
(b) Define fragmentation. How does it occur? Discuss
memory management schemes with respect to fragmentation.
6. (a) List the UNIX commands for the following :
(i) To search files for lines that match a particular
pattern given
(ii) To sort a given file in reverse numeric order
(iii) To print the last 10 lines of a file
(iv) To count lines for each file
(v) To print location of first difference
(b) Write a shell program to test whether the given
year is a leap year or not.
|