STUPIDSID
SPPU Electronics and Telecom Engineering (Semester 5)
System Programming and Operating System
June 2015
System Programming and Operating System
June 2015
Answer any one question from Q1 and Q2
1 (a)
Show parsing steps of +* according to the following grammar:
E::=TEn
E''::= +E|ε (epsilon)
T::=VT''
T''::= *T|ε (epsilon)
V::=
E::=TEn
E''::= +E|ε (epsilon)
T::=VT''
T''::= *T|ε (epsilon)
V::=
7 M
1 (b)
Explain design of direct linking loader. Also explain the required data structures.
7 M
1 (c)
Explain analysis phase of a compiler.
6 M
2 (a)
What is parsing. Explain the language processing tools.
7 M
2 (b)
Discuss the terminologies Translated origin, Link origin, Load origin Relocation factor.
7 M
2 (c)
Explain nested macros with example. Also explain expansion time variables with example.
6 M
Answer any one question from Q3 and Q4
3 (a)
Explain various states of a process with diagram.
6 M
3 (b)
List the categories of system calls and explain process system call with an example.
6 M
3 (c)
Find out the safe sequence for execution of 3 processes using Bankers algorithm.
Maximum Resources: R1 =4, R2=4
Maximum Resources: R1 =4, R2=4
| Allocation Matrix | Maximum Required Matrix | |||||
| R1 | R2 | R1 | R2 | |||
| P1 | 1 | 0 | P1 | 1 | 1 | |
| P2 | 1 | 1 | P2 | 2 | 3 | |
| P3 | 1 | 2 | P3 | 2 | 2 | |
6 M
4 (a)
Explain different models of threads.
6 M
4 (b)
Explain dining philosopher's problem and Readers-Writers problem with example.
6 M
4 (c)
Consider the following processes where Arrival and Burst time are as shown below.
Calculate the Average Waiting Time and Average Tum-around Time if the processes are scheduled using SJF.
| Process | Burst Time |
| P1 | 05 |
| P2 | 04 |
| P3 | 07 |
| P4 | 06 |
Calculate the Average Waiting Time and Average Tum-around Time if the processes are scheduled using SJF.
6 M
Answer any one question from Q5 and Q6
5 (a)
List the design issues for paging systems and explain any 2.
6 M
5 (b)
Consider the following Page reference string: 8,1,3,5,3,1,4,8,5,7,1,2.
The number of page frames = 3, calculate the page faults and the hit ratio for First In First Out Page replacement algorithm.
The number of page frames = 3, calculate the page faults and the hit ratio for First In First Out Page replacement algorithm.
6 M
5 (c)
Explain the types of fragmentation and ways to reduce them.
4 M
6 (a)
Write the difference between paging and segmentation.
6 M
6 (b)
Consider memory partitions as 100K, 500K, 200K, 300K and 600K in order. How would each of the First fit, Best fit and Worst fit algorithms place the processes of 212K, 417K, 112K and 426K are to be allocated (in order)? Which algorithm makes the most efficient use of memory.
6 M
6 (c)
Explain need of demand paging with advantages.
4 M
Answer any one question from Q7 and Q8
7 (a)
Explain file attributes and the file operations.
6 M
7 (b)
Explain Linux EXT 2 file system with diagram.
6 M
7 (c)
Explain I/O software layers.
4 M
8 (a)
Write short note on CD and DVD.
6 M
8 (b)
Explain the directory system with diagram and directory operations.
6 M
8 (c)
Explain the need of EXT 3 over EXT 2 file system of Linux.
4 M
More question papers from System Programming and Operating System