3RD YEAR SEMESTER 1 SUPPLEMENTARY JUNE 2010 JNTU B.TECH ENGINEERING QUESTION PAPER - OPERATING SYSTEM AND SYSTEMS PROGRAMMING

Code No:  RR311904                     RR           Set No.   2

III  B.Tech I Semester Supplementary Examinations,June 2010

OPERATING  SYSTEM AND SYSTEMS PROGRAMMING Electronics And Computer Engineering

Time: 3 hours                                                                                  Max Marks:  80

Answer any FIVE Questions

All  Questions carry equal marks

1.   (a)  What  are the different methods  for managing deadlocks?                              [6]

(b)  Explain how deadlocks are prevented.                                                             [10]

2.   (a)  Explain how logical address are mapped to physical in Paging and Segmenta-

tion concepts.                                                                                                      [10] (b)  Sketch the hardware  diagram  for Paging.                                                          [6]

3. Compare and contrast the file-directory implementation techniques-Tree-Structured,

and Acyclic Graph  Structured.                                                                          [16]

4.   (a)  Giving neat sketches compare the various OS environments.                      [12]

(b)  Explain the term Multitasking.                                                                      [4]

5. Considering a simple assembly language program, explain the process of assembler

in general.                                                                                                                    [16]

6.   (a)  What  does it mean by preemptive  CPU scheduling algorithms?                    [4] (b)  Explain the CPU scheduling mechanism in priority scheduling algorithms.  [12]

7. Explain the problem of critical section (CSP)  through  illustrative  example.      [16]

8. Compare  and contrast the following terminology:                                                  [16] (a)  Linker

(b)  Editor

(c)  Linkage Editor

(d)  Loader.

Code No:  RR311904                     RR           Set No.   4

III  B.Tech I Semester Supplementary Examinations,June 2010

OPERATING  SYSTEM AND SYSTEMS PROGRAMMING Electronics And Computer Engineering

Time: 3 hours                                                                                  Max Marks:  80

Answer any FIVE Questions

All  Questions carry equal marks

1. Explain the problem of critical section (CSP)  through  illustrative  example.      [16]

2. Compare and contrast the file-directory implementation techniques-Tree-Structured, and Acyclic Graph  Structured.                                                                          [16]

3.   (a)  Giving neat sketches compare the various OS environments.                      [12] (b)  Explain the term Multitasking.                                                                      [4]

4. Considering a simple assembly language program, explain the process of assembler in general.                                                                                                                    [16]

5.   (a)  Explain how logical address are mapped to physical in Paging and Segmenta-

tion concepts.                                                                                                      [10] (b)  Sketch the hardware  diagram  for Paging.                                                          [6]

6. Compare  and contrast the following terminology:                                                  [16]

(a)  Linker

(b)  Editor

(c)  Linkage Editor

(d)  Loader.

7.   (a)  What  are the different methods  for managing deadlocks?                              [6]

(b)  Explain how deadlocks are prevented.                                                             [10]

8.   (a)  What  does it mean by preemptive  CPU scheduling algorithms?                    [4] (b)  Explain the CPU scheduling mechanism in priority scheduling algorithms.  [12]

Code No:  RR311904                     RR           Set No.   1

III  B.Tech I Semester Supplementary Examinations,June 2010

OPERATING  SYSTEM AND SYSTEMS PROGRAMMING Electronics And Computer Engineering

Time: 3 hours                                                                                  Max Marks:  80

Answer any FIVE Questions

All  Questions carry equal marks

1.   (a)  Explain how logical address are mapped to physical in Paging and Segmenta- tion concepts.                                                                                                      [10]

(b)  Sketch the hardware  diagram  for Paging.                                                          [6]

2.   (a)  What  are the different methods  for managing deadlocks?                              [6] (b)  Explain how deadlocks are prevented.                                                             [10]

3.   (a)  Giving neat sketches compare the various OS environments.                      [12] (b)  Explain the term Multitasking.                                                                      [4]

4. Compare  and contrast the following terminology:                                                  [16]

(a)  Linker

(b)  Editor

(c)  Linkage Editor

(d)  Loader.

5. Considering a simple assembly language program, explain the process of assembler

in general.                                                                                                                    [16]

6.   (a)  What  does it mean by preemptive  CPU scheduling algorithms?                    [4] (b)  Explain the CPU scheduling mechanism in priority scheduling algorithms.  [12]

7. Explain the problem of critical section (CSP)  through  illustrative  example.      [16]

8. Compare and contrast the file-directory implementation techniques-Tree-Structured, and Acyclic Graph  Structured.                                                                         [16]

Code No:  RR311904                     RR           Set No.   3

III  B.Tech I Semester Supplementary Examinations,June 2010

OPERATING  SYSTEM AND SYSTEMS PROGRAMMING Electronics And Computer Engineering

Time: 3 hours                                                                                  Max Marks:  80

Answer any FIVE Questions

All  Questions carry equal marks

1. Compare  and contrast the following terminology:                                                  [16]

(a)  Linker

(b)  Editor

(c)  Linkage Editor

(d)  Loader.

2.   (a)  Explain how logical address are mapped to physical in Paging and Segmenta- tion concepts.                                                                                                      [10]

(b)  Sketch the hardware  diagram  for Paging.                                                          [6]

3. Explain the problem of critical section (CSP)  through  illustrative  example.      [16]

4. Considering a simple assembly language program, explain the process of assembler

in general.                                                                                                                    [16]

5.   (a)  Giving neat sketches compare the various OS environments.                      [12]

(b)  Explain the term Multitasking.                                                                      [4]

6.   (a)  What  are the different methods  for managing deadlocks?                              [6] (b)  Explain how deadlocks are prevented.                                                             [10]

7. Compare and contrast the file-directory implementation techniques-Tree-Structured,

and Acyclic Graph  Structured.                                                                          [16]

8.   (a)  What  does it mean by preemptive  CPU scheduling algorithms?                    [4] (b)  Explain the CPU scheduling mechanism in priority scheduling algorithms.  [12]