STUPIDSID
SPPU Electronics and Telecom Engineering (Semester 5)
System Programming and Operating System
May 2017
System Programming and Operating System
May 2017
Solve any one question from Q.1(a,b,c) &Q.2(a,b,c)
1(a)
Explain in brief imperative statements, declaration statements and assembler directives with example for assembly lanuguage programming.
9 M
1(b)
Explain advanced macros facilities with examples.
6 M
1(c)
Explain phases of compiler with examples.
5 M
2(a)
Explain translated origin, link origin, and load origin.
6 M
2(b)
Explain lexical analysis, syntax analysis, and semantic analysis for Language processor.
9 M
2(c)
What is difference between compiler an Interpreter?
5 M
Solve any one question from Q.3(a,b,c) &Q.4(a,b,c)
3(a)
Explain following CPU scheduling techniques with examples.
i) FCFS ii) SJF
i) FCFS ii) SJF
6 M
3(b)
What is difference between starvation and deadlock? Explain it with the help of 'Dining Philosophers Problem'.
6 M
3(c)
What is Bankers algorithm? Explain it with suitable examples.
6 M
4(a)
What is Producer-Consumer Problem? How to solve it using SemaPhore and Mutex?
6 M
4(b)
What are the various states of a processes and how it is managed by operating system?
6 M
4(c)
Consider the following processes where Arrival and Burst time (in seconds) are as shown below.
Calculate the Average Waiting Time and Average turn-around Time if the processes are scheduled using SJF.
| Process | Burst Time | Arrival Time |
| P1 | 13 | 3 |
| P2 | 15 | 3 |
| P3 | 08 | 1 |
| P4 | 12 | 1 |
Calculate the Average Waiting Time and Average turn-around Time if the processes are scheduled using SJF.
6 M
Solve any one question from Q.5(a,b,c) &Q.6(a,b,c)
5(a)
Explain memory management with Bit Map method and with Linked Lists method.
5 M
5(b)
What do you mean by page replacement algorithm? Enlist different page replacement algorithms.
5 M
5(c)
Consider the following page reference string: 7, 1, 2, 1, 2, 5, 4, 5, 9, 4, 9, 8, 1, 3. The number of page frames = 3, calculate the page faults and the hit ratio for First In First Out Page replacement algortihm.
6 M
6(a)
How logical address is converted into physical address by memory management unit? Explain it with example.
5 M
6(b)
What is structure of typical page table entry? What is significance of modified bit, referenced bit, protection bits, and present / absent bit in page table entry?
6 M
6(c)
Explain how LRU page replacement algorithm is simulated in software?
5 M
Solve any one question from Q.7(a,b,c) &Q.8(a,b)
7(a)
What are different file types and how to access it.
6 M
7(b)
What is difference between programmed I/O and I/O mapped I/O.
4 M
7(c)
Explain input output software layers.
6 M
8(a)
Explain Programmed I/O, Interrupt driven I/O, and I/O using DMA with examples.
9 M
8(b)
Explain in detail file systems and its implementation
7 M
More question papers from System Programming and Operating System