Code No: RR311904 Set No.

1
III B.Tech I Semester Supplementary Examinations, February 2007
OPERATING SYSTEMS AND SYSTEMS PROGRAMMING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Distinguish the term multiprocessing from multiprogramming. [8]

(b) Explain the importance of timesharing w.r.t. the above terms. [8]

2. (a) Stating the optimization criteria, explain the criteria for CPU scheduling al-
gorithms. [6]
(b) With Gantt-chart illustration, write about Round Robin (RR) CPU scheduling
algorithm. [10]

3. (a) State and brief the specification means of concurrent programs.

(b) List the advantages and disadvantages of the above methods. [8+8]

4. (a) What is a deadlock? [6]

(b) State and compare the various deadlock handling methods. [6]
(c) What is a resource allocation graph? [4]

5. (a) Explain the logical memory concept used in paging. [6]

(b) With a neat hardware diagram, explain the paging concept. [10]

6. (a) Explain the problem of Compaction. Mention a means for its elimination.
(b) What are the various options for accommodating a file in free segments using
Contiguous disk file-allocation method. [8+8]

7. (a) What is meant by a 2-pass assembler?

(b) Explain the various data structures used in the 2-pass assembling in detail.
[4+12]

8. (a) Explain the terms- macro and macro processor.

(b) List and brief the advanced macro features. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR311904 Set No. 2
III B.Tech I Semester Supplementary Examinations, February 2007
OPERATING SYSTEMS AND SYSTEMS PROGRAMMING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain the components of a computing system through a diagram.

(b) Brief the functions of an operating system. [10+6]

2. With Gantt-chart illustration, compare the CPU scheduling in non-preemptive SJF

from preemptive counterpart. [16]

3. Giving syntax and implementation details, write in detail about fork-join construct.
[16]

4. (a) What is a deadlock? [6]

(b) State and compare the various deadlock handling methods. [6]
(c) What is a resource allocation graph? [4]

5. (a) Explain the partitioning-based memory management schemes.

(b) Compare the memory management in Windows 2000 with that of Linux.
[10+6]

6. (a) Compare the tape-based, and disk-based models for file systems. [6]
(b) What are the operations on directories. [4]
(c) Brief the physical directory implementation methods. [6]

7. Explain the design of a single pass assembler in detail, giving format of all the data
structures used. [16]

8. (a) Explain the terms- macro and macro processor.

(b) List and brief the advanced macro features. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR311904 Set No. 3
III B.Tech I Semester Supplementary Examinations, February 2007
OPERATING SYSTEMS AND SYSTEMS PROGRAMMING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Position the operating system in the diagram indicating the components of a
computing system. [6]
(b) Brief the functions of an operating system. [6]
(c) State the goals of an operating system succinctly. [4]

2. (a) State the criteria for evaluating CPU scheduling algorithms. Also state whether
the criteria is to be optimized for minimal or maximal value.
(b) What is meant by ‘convoy effect’ in the context of FCFS scheduling algorithm.
[10+6]

3. (a) Distinguish a thread from a process. [6]

(b) Write in detail about symmetric multiprocessin. [10]

4. (a) What is a deadlock? [6]

(b) State and compare the various deadlock handling methods. [6]
(c) What is a resource allocation graph? [4]

5. Write about paging, a memory management scheme, giving example, hardware

diagram, and page table implementation. [16]

6. (a) Write about tree-structured file-directory structure. [10]

(b) Explain the (disk) free-space management techniques. [6]

7. (a) Name the various data structures used in the first pass of the 2-pass assembler.
(b) Draw the flowchart (only) for second pass of the 2-pass assembling. [6+10]

8. Explain the design of a macro processor in detail giving flowcharts. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR311904 Set No. 4
III B.Tech I Semester Supplementary Examinations, February 2007
OPERATING SYSTEMS AND SYSTEMS PROGRAMMING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain the components of a computing system through a diagram.

(b) Brief the functions of an operating system. [10+6]

2. (a) State the criteria for evaluation of CPU scheduling algorithms.

(b) Compare and contrast multi-queue CPU scheduling algorithms (with and
without feedback). [12+4]

3. Compare and contrast the concurrency specification constructs- fork-join and con-
current statement, with examples. [16]

4. (a) Write the algorithm for avoiding deadlocks, with safety module. [12]
(b) Analyze the above algorithm for its computational complexity. [4]

5. Write about segmentation, a memory management scheme, giving example, hard-

ware diagram, and segment table implementation. [16]

6. (a) Compare the tape-based, and disk-based models for file systems. [6]
(b) What are the operations on directories. [4]
(c) Brief the physical directory implementation methods. [6]

7. What is meant by assembling? Explain the various elements of assembly language

programming through a simple assembly program. [16]

8. (a) What is meant by a macro and macro processor?

(b) Distinguish the terminology: Macro definition, Macro call, Macro expansion.
[8+8]

⋆⋆⋆⋆⋆

1 of 1