Exam Details
Subject | operating system | |
Paper | ||
Exam / Course | mca(integrated) | |
Department | ||
Organization | Gujarat Technological University | |
Position | ||
Exam Date | May, 2017 | |
City, State | gujarat, ahmedabad |
Question Paper
1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER IV EXAMINATION SUMMER 2017
Subject Code: 4440603 Date: 11-05-2017
Subject Name: Operating System
Time: 10:30 to 1:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1
Define any 7 terms
1. Data Integrity
2. Dispatcher
3. Thread
4. Critical Section
5. Race Condition
6. No Preemption
7. Segment in Memory Management
8. Turnaround time
9. Granularity
10. Middelware
What is Operating system? Explain in brief objectives and functions of OS.
Q.2
Define Multithreading with example.
ii) Write four differences between process and thread.
What is process? Explain the process state transition diagram with suspend state.
OR
What is multithreading? Explain in brief KLT and ULT with its advantages and disadvantages.
Q.3
State Producer/Consumer problem. How it is different from Readers/Writer problem.
Discuss 4 necessary conditions for deadlock.
ii) Explain in brief Deadlock avoidance with its advantages and disadvantages
OR
Q.3
What is semaphore? Give and explain the algorithm of producer/consumer problem with bounded using general semaphore.
Give examples of reusable and consumable resources.
ii) List two ways in which the No-preemption condition can be prevented.
Q,4
What is segmentation? How it differs with paging? Explain address translation in segmentation with paging.
Describe FCFS, RR, SPN, SRT, HRRN, Feedback and Fair-share scheduling methods briefly
OR
Q,4
Define virtual memory. Compare LRU, FIFO and Clock page replacement policies with suitable example.
Write short note:
Gang Scheduling
ii) SCAN and FIFO Disk Scheduling algorithm
Q.5
How do you classify the different approaches for Real-time scheduling? State various Real-time scheduling techniques available and discuss any one in detail.
2
Name the File allocation methods available in File Management. Explain in detail all methods.
OR
Q.5
Explain RAID and its level 0-6 in detail.
Define client server computing and explain the classes of client server applications and compare it with three tire architecture.
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER IV EXAMINATION SUMMER 2017
Subject Code: 4440603 Date: 11-05-2017
Subject Name: Operating System
Time: 10:30 to 1:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1
Define any 7 terms
1. Data Integrity
2. Dispatcher
3. Thread
4. Critical Section
5. Race Condition
6. No Preemption
7. Segment in Memory Management
8. Turnaround time
9. Granularity
10. Middelware
What is Operating system? Explain in brief objectives and functions of OS.
Q.2
Define Multithreading with example.
ii) Write four differences between process and thread.
What is process? Explain the process state transition diagram with suspend state.
OR
What is multithreading? Explain in brief KLT and ULT with its advantages and disadvantages.
Q.3
State Producer/Consumer problem. How it is different from Readers/Writer problem.
Discuss 4 necessary conditions for deadlock.
ii) Explain in brief Deadlock avoidance with its advantages and disadvantages
OR
Q.3
What is semaphore? Give and explain the algorithm of producer/consumer problem with bounded using general semaphore.
Give examples of reusable and consumable resources.
ii) List two ways in which the No-preemption condition can be prevented.
Q,4
What is segmentation? How it differs with paging? Explain address translation in segmentation with paging.
Describe FCFS, RR, SPN, SRT, HRRN, Feedback and Fair-share scheduling methods briefly
OR
Q,4
Define virtual memory. Compare LRU, FIFO and Clock page replacement policies with suitable example.
Write short note:
Gang Scheduling
ii) SCAN and FIFO Disk Scheduling algorithm
Q.5
How do you classify the different approaches for Real-time scheduling? State various Real-time scheduling techniques available and discuss any one in detail.
2
Name the File allocation methods available in File Management. Explain in detail all methods.
OR
Q.5
Explain RAID and its level 0-6 in detail.
Define client server computing and explain the classes of client server applications and compare it with three tire architecture.
Other Question Papers
Subjects
- advanced c programming (adv – c)
- advanced python
- basic mathematics for it
- big data
- c++ with class libraries (cpp)
- communication skills - ii
- communication skills-1
- cyber security and forensics (csf)
- data analytics with r
- data structure
- database management systems
- discrete mathematics for computer science (dmcs)
- environmental studies
- fundamentals of computer
- fundamentals of database management systems
- fundamentals of networking
- fundamentals of programming – i
- fundamentals of web
- information security
- java programming
- machine learning
- management information systems (mis)
- mobile programming
- network security
- operating system
- operations research
- python (py)
- software engineering
- software testing
- statistical methods
- uml & object oriented modeling
- web development tools