BIT204-2079 ✡

Tribhuvan University
Institute of Science and Technology
2079
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 204) Pass Marks: 24
(Operating Systems) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]

1. What are the different types of operating system? Differentiate between Real time and Batch OS.
(5+5)
2. What is kernel? Explain the process of system call with suitable diagram. (2+8)

3. What is Resource Allocation Graph (RAG)? What are the necessary conditions for deadlock?
Explain. Determine if the system is safe from deadlock or not using Banker's Algorithm for given
condition. (1 +4+5)
[Note: Consider process sequence as: P1, P2, P3, P4, P5]

Need Matrix Allocation Matrix

Process A B C Process A B C MAX Resource

P1 11 6 4 P1 3 1 1 Matrix

P2 3 4 1 P2 3 1 0 A B C

P3 8 2 3 P3 4 1 1 17 8 10

P4 3 2 4 P4 1 0 1

P5 5 2 3 P5 2 0 1

Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]

4. What is an OS? Explain 3-state model of process with neat and clean diagram. (1+4)
5. What is race condition? Explain critical problem solution using lock variable. (2+3)
6. What is memory compaction? Explain best fit memory allocation with suitable example. (1+4)

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

7. What is RAID? Explain Level-2 and Level-3 RAID. (1+4)

8. How threads differ from processes? Explain user level thread and kernel level thread. (2+3)

9. Consider the following page reference string: 3,2,1,3,4,2,8,9,7,4,2,9,8,3. Calculate the total
number of page faults for Optimal and LRU page replacement algorithms using 4 page frame
(5)

10. Explain the working mechanism of DMA. (5)

11. What is TLB? Explain the importance of TLB in conversion of logical address to physical
address. (2+3)

12. Consider 500 GB hard drive with 5 KB block size. Calculate the size of file allocation table if
entry for each block needs 4 bytes. (5)

Tribhuvan University
Institute of Science and Technology
2079
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 101) Pass Marks: 24
(Principles of Management) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]

1. Define Management. Explain the major functions of IT officer while discharging managerial roles
in an organization. (2+8)

2. What is motivation? Discuss the contemporary approaches to motivation. (2+8)

3. Define communication. Explain the styles of men and women communication. (2+8)

Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]

4. Briefly introduce the matrix organizational structure. (5)

5. Discuss the term certainty, risk and uncertainly in decision making. (5)
6. Discuss the factors to be considered for motivating employees of IT Organization. (5)
7. Compare between autocratic and democratic leadership styles. (5)
8. State and explain the contemporary issues in leadership. (5)
9. State and explain the various decision making styles. (5)
10. Discuss the required skills to be a successful IT manager. (5)
IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

11. Discuss the method of information control. (5)

12. Write short notes on: (2×2.5=5)
a. Manager VS. leader.
b. Management by objectives (MBO)
Tribhuvan University
Institute of Science and Technology
2078
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 203) Pass Marks: 24
(Numerical Methods) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]
​ Derive the formula for integration using simpsons 3/8 rule. Use Secant Method to estimate the
2
root of equation 𝑥 − 4𝑥 − 10 = 0, with initial estimate x1 = 4 and x2 = 2. [5+5]

​ What do you mean by boundary value problem? Use shootuing method, solve the equation:
y’’ = 6x2, with y(0) = 1 and y(1) = 2 in the interval (0, 1) for y(0.5) taking h = 0.5 [2+8]

​ Write an algorithm and program to compute the interpolation using Lagrange Interpolation.
[10]
Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]
​ Show that the rate of convergence of Newtons Raphson method is quadratic. [5]

​ The temperature of a metal strip was measured at various time intervals during heating and the
values are given in the table below.

Time(‘t’ min) 1 2 3 4

Temp(‘T’ ℃) 70 83 100 124

If the relation between the time ‘t’ and temperature ‘T’ is of the form: T = bet/4 + a. Estimate the
temperature at t = 6 minute. [5]

​ Given the following set of data points. Obtain the table of divided difference and use that table to
estimate the value of f(1.5). [5]

x 1 2 3 4 5

f(x)=x3-1 0 7 26 63 124

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

​ Solve the following system of linear equation by Gauss Elimination with Pivoting [5]
2x + 2y + z = 6
4x + 2y + 3z =4
x-y+1=0

​ Determine the Eigen Values and corresponding Eigen Vectors for the matrix.

​ The table below gives the values of distance travelled by a car at various time intervals during the
initial running.

Time(‘t’ sec) 5 6 7 8 9

Temp(‘T’ ℃) 10.0 14.5 19.5 25.5 32.0

Estimate the velocity and acceleration at time t = 7sec. [5]

​ Solve the following integral using trapezoidal rule form = 8. [5]

4
l = ∫(x4 + 1)dx
2
2
​ Given the equation y’ = 3x + 1 with y(1) = 2, estimate y(2) by Euler’s Method using
h = 0.2. [5]

​ Solve the Poison’s Equation 2 f = 2x2y2 over the square domain 0 ≤ x ≤ 3 and 0 y ≤ 3
with f = 0 on the boundary and h = 1.
[5]
Tribhuvan University
Institute of Science and Technology
2078
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 204) Pass Marks: 24
(Operating Systems) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

1. Suppose that a disk has 100 cylinders, numbered 0 to 99. The drive is currently serving a request
at cylinder 45. The queue of pending request, in FIFO order is: 88, 72, 13, 74, 48, 9, 22, 50, 35
and 30. What is the total distance (in cylinders) that the disk arm moves to satisfy all pending
request for each of the following disk scheduling algorithms?
a) FCFS
b) SCAN
c) SSTF

2. Why virtual memory technique is used in the computer system? What is logical address? Explain
the process of conversion of logical address to physical address in single level paging scheme.

3. What is critical section? What are the operations that can be performed on the semaphore?
Explain the solution to producer consumer problem using semaphore.

Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]

4. Draw and describe the 5-state process model.

5. What is kernel? Differentiate between monolithic and microkernel structure.
6. What is DMA? Explain how it works in brief with suitable diagram.
7. What are different types of file? Describe the sequential and random access of files.
8. What is deadlock? What ate necessary conditions for deadlock? Explain.
9. What is thread? Explain user level thread and kernel level thread.
10. A 2 GB hard disk has 2 KB block size, calculate the size of bitmap for bitmap based free space
management.
11. What is an operating system? Differentiate between time sharing and real time operating system.

12. Consider the following set of processes, with the length of CPU brust time given in milli seconds.

Process CPU Brust Priority

A 8 3
B 9 1 (Lowest)
C 10 2
D 6 4 (Highest)

The processed are assumed to have arrived in the order A, B, C and D all at time 0.
What is the turnaround time and waiting time for the scheduling algorithms, RR
(quantum = 3) and Priority Algorithm.

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

Tribhuvan University
Institute of Science and Technology
2079
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 101) Pass Marks: 24
(Principles of Management) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]

1. Define Management. Explain the major functions of IT officer while discharging managerial roles
in an organization. (2+8)

2. What is motivation? Discuss the contemporary approaches to motivation. (2+8)

3. Define communication. Explain the styles of men and women communication. (2+8)

Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]

4. Briefly introduce the matrix organizational structure. (5)

5. Discuss the term certainty, risk and uncertainly in decision making. (5)
6. Discuss the factors to be considered for motivating employees of IT Organization. (5)
7. Compare between autocratic and democratic leadership styles. (5)
8. State and explain the contemporary issues in leadership. (5)
9. State and explain the various decision making styles. (5)
10. Discuss the required skills to be a successful IT manager. (5)
11. Discuss the method of information control. (5)
12. Write short notes on: (2×2.5=5)
a. Manager VS. leader.
b. Management by objectives (MBO)
Tribhuvan University
Institute of Science and Technology
2078
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 203) Pass Marks: 24
(Numerical Methods) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

Long Answer Questions

Attempt any TWO questions. [2×10=20]
​ Derive the formula for integration using simpsons 3/8 rule. Use Secant Method to estimate the
2
root of equation 𝑥 − 4𝑥 − 10 = 0, with initial estimate x1 = 4 and x2 = 2. [5+5]

​ What do you mean by boundary value problem? Use shootuing method, solve the equation:
y’’ = 6x2, with y(0) = 1 and y(1) = 2 in the interval (0, 1) for y(0.5) taking h = 0.5 [2+8]

​ Write an algorithm and program to compute the interpolation using Lagrange Interpolation.
[10]
Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]
​ Show that the rate of convergence of Newtons Raphson method is quadratic. [5]

​ The temperature of a metal strip was measured at various time intervals during heating and the
values are given in the table below.

Time(‘t’ min) 1 2 3 4

Temp(‘T’ ℃) 70 83 100 124

If the relation between the time ‘t’ and temperature ‘T’ is of the form: T = bet/4 + a. Estimate the
temperature at t = 6 minute. [5]

​ Given the following set of data points. Obtain the table of divided difference and use that table to
estimate the value of f(1.5). [5]

x 1 2 3 4 5

f(x)=x3-1 0 7 26 63 124

​ Solve the following system of linear equation by Gauss Elimination with Pivoting [5]
2x + 2y + z = 6
4x + 2y + 3z =4
x-y+1=0

​ Determine the Eigen Values and corresponding Eigen Vectors for the matrix.

​ The table below gives the values of distance travelled by a car at various time intervals during the
initial running.

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

Time(‘t’ sec) 5 6 7 8 9

Temp(‘T’ ℃) 10.0 14.5 19.5 25.5 32.0

Estimate the velocity and acceleration at time t = 7sec. [5]

​ Solve the following integral using trapezoidal rule form = 8. [5]

4
l = ∫(x4 + 1)dx
2
2
​ Given the equation y’ = 3x + 1 with y(1) = 2, estimate y(2) by Euler’s Method using
h = 0.2. [5]

​ Solve the Poison’s Equation 2 f = 2x2y2 over the square domain 0 ≤ x ≤ 3 and 0 y ≤ 3
with f = 0 on the boundary and h = 1.
[5]
Tribhuvan University
Institute of Science and Technology
2078
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 204) Pass Marks: 24
(Operating Systems) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]

13. Suppose that a disk has 100 cylinders, numbered 0 to 99. The drive is currently serving a request
at cylinder 45. The queue of pending request, in FIFO order is: 88, 72, 13, 74, 48, 9, 22, 50, 35
and 30. What is the total distance (in cylinders) that the disk arm moves to satisfy all pending
request for each of the following disk scheduling algorithms?
d) FCFS
e) SCAN
f) SSTF

14. Why virtual memory technique is used in the computer system? What is logical address? Explain
the process of conversion of logical address to physical address in single level paging scheme.

15. What is critical section? What are the operations that can be performed on the semaphore?
Explain the solution to producer consumer problem using semaphore.

Section B
IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079
BIT204-2079 ✡

Short Answer Questions

Attempt any EIGHT questions. [8×5=40]

16. Draw and describe the 5-state process model.

17. What is kernel? Differentiate between monolithic and microkernel structure.
18. What is DMA? Explain how it works in brief with suitable diagram.
19. What are different types of file? Describe the sequential and random access of files.
20. What is deadlock? What ate necessary conditions for deadlock? Explain.
21. What is thread? Explain user level thread and kernel level thread.
22. A 2 GB hard disk has 2 KB block size, calculate the size of bitmap for bitmap based free space
management.
23. What is an operating system? Differentiate between time sharing and real time operating system.

24. Consider the following set of processes, with the length of CPU brust time given in milli seconds.

Process CPU Brust Priority

A 8 3
B 9 1 (Lowest)
C 10 2
D 6 4 (Highest)

The processed are assumed to have arrived in the order A, B, C and D all at time 0.
What is the turnaround time and waiting time for the scheduling algorithms, RR
(quantum = 3) and Priority Algorithm.

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2079