STUPIDSID
SPPU Electronics and Telecom Engineering (Semester 5)
System Programming and Operating System
June 2014
System Programming and Operating System
June 2014
Answer any one question from Q1 and Q2
1 (a)
Describe the language processor in detail with various language processing activities.
8 M
1 (b)
Design and explain assembler pass-II of two pass assembler in detail.
8 M
1 (c)
What is a LTORG Statement?
2 M
2 (a)
Explain different development tools used to develop language processor.
6 M
2 (b)
Explain different data structures used for language processing.
8 M
2 (c)
Explain ORIGIN and EQU statement.
4 M
Answer any one question from Q3 and Q4
3 (a)
What are different phases of complier and explain each with example.
8 M
3 (b)
Explain the terms:
1) Macro definition
2) Macro calls
3) Macro expansion
4) Nested macro calls
1) Macro definition
2) Macro calls
3) Macro expansion
4) Nested macro calls
8 M
4 (a)
Explain design of two pass MACRO processor in detail.
8 M
4 (b)
Explain parameter passing mechanisms:
1) Call by value
2) Call by reference
3) Call by result
4) Call by name.
1) Call by value
2) Call by reference
3) Call by result
4) Call by name.
8 M
Answer any one question from Q5 and Q6
5 (a)
What is loader ? List basic functions and features of a loader.
8 M
5 (b)
Explain different software tools used for program development.
8 M
6 (a)
List and explain the different loader scheme in brief.
8 M
6 (b)
What is linker ? Explain MS-DOS linker in detail.
8 M
Answer any one question from Q7 and Q8
7 (a)
What is an operating system ? List the various types of the O.S. with their basic functions.
8 M
7 (b)
What are deadlocks ? Explain deadlock prevention and avoidance methods.
8 M
8 (a)
Explain scheduling criteria ? Explain different types of scheduling algorithms in brief.
8 M
8 (b)
Explain inter process communication with their problems and solution.
8 M
Answer any one question from Q9 and Q10
9 (a)
What is virtual memory ? Explain different techniques used for virtual memory.
8 M
9 (b)
Given the memory partitions of size 100k, 500k, 200k, 300k and 600k (in order). How would each of the first fit, best fit, worst fit algorithms place the process of 212k, 417k, 112k and 426k (in order) ? Which algorithms makes the most efficient use of memory ?
8 M
9 (c)
Note on : second chance page replacement algorithm.
2 M
10 (a)
Short note on:
1) Swapping 2) Fragmentation.
1) Swapping 2) Fragmentation.
8 M
10 (b)
Consider the page -reference string 2, 3, 2, 1 5, 2, 4, 5, 3, 2, 5, 2
Calculate page-fault for:
i) FIFO ii) LRU iii) Optimal.
If number of page frames : 3
Calculate page-fault for:
i) FIFO ii) LRU iii) Optimal.
If number of page frames : 3
8 M
Answer any one question from Q11 and Q12
11 (a)
Explain the different Disk-arm scheduling algorithms.
8 M
11 (b)
Short note on:
1) I/O software layers 2) Power management
1) I/O software layers 2) Power management
8 M
Short note on:
12 (a)
File structure
4 M
12 (b)
Directory structure
4 M
12 (c)
Graphical user interface
4 M
12 (d)
File operations.
4 M
More question papers from System Programming and Operating System