|
Cloud Computing (CC) Semester 8
(Revised Course) (3 Hours) May 2013 |
|||
|
GS-3685
[Total Marks : 100] |
|||
| N.B: | (1) | Question No. 1 is compulsory. | |
| (2) | Attempt any four questions from remaining six questions. | ||
| 1. | (a) | What is trusted Cloud Computing? | 05 |
| (b) | Explain risks from multi-tenancy environment. How IDS can be used in cloud environment? | 10 | |
| (c) | Differentiate between Normal Web Hosting V/s Passed based Web Hosting. | 05 | |
| 2. | (a) | Explain the life cycle and Azure Services . | 10 |
| (b) | Explain the Naming Services in Apps Fabric Services bus. | 05 | |
| (c) | Explain REST Operations and Storage Client API for Azure Tables and Azure blocks. | 05 | |
| 3. | (a) | Write a note on HIPAA. | 05 |
| (b) | Explain Auxilliary Services in Azure. | 05 | |
| (c) | Explain "elastic" behavior of cloud. | 05 | |
| (d) | Write a note on Internet Services Bus. | 05 | |
| 4. | (a) | Differentiate between REST and SOA Web Services. | 05 |
| (b) | How virtualization Employed in Azure? | 05 | |
| (c) | Explain basic SOA architecture. | 05 | |
| (d) | Explain SSL/TLS and it significance in windows Azure. | 05 | |
| 5. | (a) | Explain windows Azure Architecture in detail. | 10 |
| (b) | Explain in detail, development facilities in Azure. | 10 | |
| 6. | (a) | Design private cloud for the college (Hint :* aaS with college environment) | 15 |
| (b) | Explain in detail, development facilities in Azure. | 05 | |
| 7. | (a) | Enlist and explain various services model and deployment models of cloud computing. | 10 |
| (b) | What is secure execution environment and communication in cloud? Explain different threaty and Vulnerablity Specific to virtual machines. | 10 | |
Monday, May 12, 2014
Cloud Computing (CC) Semester 8 (Revised Course) (3 Hours) May 2013
Wednesday, April 16, 2014
Operating Systems For Computational Devices Semester 5 (December 2013)
|
Operating Systems For Computational
Devices Semester 5
(Revised Course) (3 Hours) December 2013 |
|||||||||||||||||||||||||||
|
LJ-11275
[Total Marks : 100] |
|||||||||||||||||||||||||||
| N.B: | (1) | Questions No. 1 is compulsory. | |||||||||||||||||||||||||
| (2) | Answers any four questions form remaining six questions. | ||||||||||||||||||||||||||
| 1. | (a) | What is Kernel? Describe briefly the approaches of designing kernel. | 05 | ||||||||||||||||||||||||
| (b) | What is real time operating system? Write the characteristics of real time operating system. | 05 | |||||||||||||||||||||||||
| (c) | In typical process state
transition diagrams. Clearly state under what condition the
following state transitions occurs? (i) Running to ready (ii) Running to waiting (iii) Waiting to ready |
05 | |||||||||||||||||||||||||
| (d) | What is Programmed I/O? Describe in brief. | 05 | |||||||||||||||||||||||||
| 2. | (a) |
Consider a system running 10 I/O bound
tasks and one CPU bound task. Assume that I/O bound task issues an
I/O operation once for every millisecond of CPU computing and that
each I/O operation takes 10 millisecond and that all processes are
long running tasks. What is the CPU utilization for round Robin
Schedular when: (i) The time quantum is 1 Millisecond (ii) The time quantum is 10 millisecond |
10 | ||||||||||||||||||||||||
| (b) | Describe the implementation of file allocation techniques. | 10 | |||||||||||||||||||||||||
| 3. | (a) | What is meant by interposes communication? Explain shared memory and message passing. | 10 | ||||||||||||||||||||||||
| (b) | Consider the following page traces in demand paging
system with 4 page frames:- 2, 3, 1, 2, 4, 3, 2, 5, 3, 6, 7, 9, 3, 7. Determine the number of page faults and hit ratio using FIFO and LRU page replacement algorithms. |
10 | |||||||||||||||||||||||||
| 4. | (a) | Consider the following system snapshot
using data structure in the Banker's algorithm.
(i) How many resources to type A, B, C and D are there? (ii) What are the contents of need matrix? (iii) Is the system is in safe state? Find the sate sequence if it is. |
10 | ||||||||||||||||||||||||
| (b) | Draw and explain architecture of RTOs. | 10 | |||||||||||||||||||||||||
| 5. | (a) | Suggest the implementation of binary semaphore that avoids the busy waiting. | 10 | ||||||||||||||||||||||||
| (b) | A 16 bit computer has page size of 1024
bytes. The page table of process is as follows:
(i) 3720 (ii) 1125 |
10 | |||||||||||||||||||||||||
| 6. | (a) | On a disk with 1000 cylinders, number 0
to 999, compute the number of tracks the disk arm must move to
satisfy all request in the disk queue. Assume the last request
serviced was at track 345 and the head is moving towards track 0,
the queue in FIFO order contains request for the following tracks : 123, 874, 692, 475, 105, 376 perform the computation for the following scheduling algorithms :- (i) FIFO (ii) SSTF (iii) SCAN. |
10 | ||||||||||||||||||||||||
| (b) | What is thread? Explain user level threads and kernes level threads. | 10 | |||||||||||||||||||||||||
| 7. | Write short note on the following :- | 20 | |||||||||||||||||||||||||
| (a) | Nos. | ||||||||||||||||||||||||||
| (b) | Different types of dchedular. | ||||||||||||||||||||||||||
| (c) | Distributed O.S. | ||||||||||||||||||||||||||
| (d) | |||||||||||||||||||||||||||
Tuesday, April 15, 2014
Operating Systems For Computational Devices Semester 5 (May 2013)
|
Operating Systems For Computational
Devices Semester 5
(Revised Course) (3 Hours) May 2013 |
|||
|
GS-8796
[Total Marks : 100] |
|||
| N.B: | (1) | Question No. 1 is compulsory. | |
| (2) | Attempt any four questions from the remaining questions. | ||
| (3) | Assume suitable data whenever necessary. | ||
| 1. | (a) | What is disk scheduling? Explain various disk scheduling algorithms. | 10 |
| (b) | Explain various system calls with appropriate sytaxes. | 10 | |
| 2. | (a) | Explain necessary and sufficient
conditions for deadlock, also explain how a resource allocation
graph determines a deadlock. |
12 |
| (b) | What is Kernel? Describe briefly the approaches of designing Kernel. | 10 | |
| 3. | (a) | Draw and explain architecture of RTOs. | 10 |
| (b) | Explain programmed I/o and DMA. | 10 | |
| 4. | (a) | What is semaphore? Explain different types of semaphore. | 10 |
| (b) | Write a short note on File Access Methods. | 10 | |
| 5. | (a) | What is mutual exclusion? Explain Peterson's algorithm for mutual exclusion. | 10 |
| (b) | What are the characteristics if real time systems? | 10 | |
| 6. | (a) | What are preemptive and non-preemptive algorithms? Explain any two with the help of example. | 10 |
| (b) | Write a short note on buffering techniques. | 10 | |
| 7. | Write short note on :- | 20 | |
| (a) | User Threads and Kernel threads | ||
| (b) | Race Conditions | ||
| (c) | Demand paging | ||
| (d) | Monitor. | ||
Operating Systems For Computational Devices Semester 5 (December 2012)
|
Operating Systems For Computational
Devices Semester 5
(Revised Course) (3 Hours) December 2012 |
|||||||||||||||||||||
|
KR-5012
[Total Marks : 100] |
|||||||||||||||||||||
| N.B: | (1) | Question No. 1 is compulsory. | |||||||||||||||||||
| (2) | Attempt any four questions out of the remaining six questions. | ||||||||||||||||||||
| 1. | (a) | What is the critical section problem? Discuss Dekkar's solution and show how it satisfies all three requirements of the critical section problem. | 10 | ||||||||||||||||||
| (b) | Compare and contract short term, term and medium term scheduling. | 10 | |||||||||||||||||||
| 2. | (a) | Consider the following set of process
with length of CPU bursts given in millisecounds.
(i) Draw Gnatt Charts illustrating execution of these processes using FCFS, SJF (non-preemptive) and RR (quantum=I) algorithms. (ii) Calculate the turnaround time and waiting time for each process and state which algorithm results in minimum waiting time. |
12 | ||||||||||||||||||
| (b) | What is mutual exclusion? Discuss different ways in which it can be achieved. | 8 | |||||||||||||||||||
| 3. | (a) | Assume that the disk head is initially positioned over track 100. For the disk space request of 27, 129, 110, 186, 147, 41, 10, 64 and 120 show how disk scheduling is done for (i) SSTF (ii) C-SCAN (iii) C-LOOK. Calculate the average seek length and show the tracing of the requests. | 10 | ||||||||||||||||||
| (b) | Discuss the different file allocation methods. | 10 | |||||||||||||||||||
| 4. | (a) | What are the different methods of free space management to keep track of free disk space? | 10 | ||||||||||||||||||
| (b) | Discuss the different approaches of I/O buffering provided by the O.S. | 10 | |||||||||||||||||||
| 5. | (a) | Consider the following
sequence of page reference -- 1,0,,2,2,1,7,6,7,0,1,2,0,3,0,4,5,1,5,2. How many page fault would occur for LRU. FIFO and optimal algorithms assuming a page frame of 4? |
10 | ||||||||||||||||||
| (b) | Explain the necessary and sufficient conditions for a deadlock. Explain how a resource allocation graph determines a deadlock. | 10 | |||||||||||||||||||
| 6. | (a) | What are the characteristics of real-time systems? | 10 | ||||||||||||||||||
| (b) | Compare and contract deadline scheduling and rate monotonic scheduling algorithms. | 10 | |||||||||||||||||||
| 7. | Write short note on (any two) :- | 20 | |||||||||||||||||||
| (a) | System Calls | ||||||||||||||||||||
| (b) | Semaphores | ||||||||||||||||||||
| (c) | User Threads and Kernel Threads. | ||||||||||||||||||||
| (d) | Applications of RTOS. | ||||||||||||||||||||
Operating Systems For Computational Devices Semester 5 (May 2012)
|
Operating Systems For Computational
Devices Semester 5
(Revised Course) (3 Hours) May 2012 |
|||||||||||||||||||||||||||||||||||
|
GN-7049
[Total Marks : 100] |
|||||||||||||||||||||||||||||||||||
| N.B: | (1) | Question No. 1 is compulsory. | |||||||||||||||||||||||||||||||||
| (2) | Attempt any four questions out of remaining six
questions. |
||||||||||||||||||||||||||||||||||
| 1. | (a) | What are the main advantages for an operating system designer of using virtual machine architecture? what is the main advantages for a user. | 10 | ||||||||||||||||||||||||||||||||
| (b) | Consider the following snapshot of the system.
(i) Determine the total amount of resource of each type. (ii) What is the content of need matrix? (iii) Determine if the system is in safe state using safety algorithm. (iv) If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted immediately. |
10 | |||||||||||||||||||||||||||||||||
| 2. | (a) | On a disk with 1000 cylinders, numbers 0 to 999,
compute the number of tracks the disk arm must move to satisfy all
the requests in the disk queue. Assume that the last request
serviced was at track 345 and head is moving towards track 0. Th
queue in FIFO order contains requests for the following tracks : 123, 874, 692, 475, 105, 376. Perform the computation for the following disk scheduling algorithms. i) FIFO ii) SSTF iii) SCAN |
10 | ||||||||||||||||||||||||||||||||
| (b) | What is RTOS? Give the classification of RTOS and comparison of any two RTOS. | 10 | |||||||||||||||||||||||||||||||||
| 3. | (a) | Consider the following snapshot of the
process to be executed. Draw the Gantt chart and determine the
average waiting time and averages turnaround time for FCFS, SJF
(preemptive), SJF (nonpreemptive) and round robin (quantum=2)
scheduling algorithm.
|
10 | ||||||||||||||||||||||||||||||||
| (b) | Describe Incode and FAT Structure. | 10 | |||||||||||||||||||||||||||||||||
| 4. | (a) | On a simple paging system with 224 bytes
of physical memory 256 pages of logical address space and page size
of 210 bytes. i) Determine the no of bits in physical address. Specify the page frame? ii) How many entries are presenter in page-table? iii) How many bits are in logical address space? |
10 | ||||||||||||||||||||||||||||||||
| (b) | Suggest an implementation of binary semaphores that avoids busy waiting. | 10 | |||||||||||||||||||||||||||||||||
| 5. | (a) | What is kernel? Describe briefly the approaches of designing kernel. | 10 | ||||||||||||||||||||||||||||||||
| (b) | Consider the following page traces in a
demand paging system with 3 page frames. 2,3,1,1,2,3,4,6,2,3,4,3,1,2,3. Determine the number of page faults and hit ratio using FIFO and LRU page replacement algorithm. |
10 | |||||||||||||||||||||||||||||||||
| 6. | (a) | Describe Programmed IO and DMA. | 10 | ||||||||||||||||||||||||||||||||
| (b) | Consider a disk having 8 surface. Each surfaces having an outer diameter of 16cm and inner of 6cm and inner track track space in 0.2mm. There are 32 sectors in each track. If disk address for reading a byte or sector on any surface track of disk is 27 bits. What is sector size in bytes if disk rotates at 3600rpm. What is effective data transfer rates in bytes/sec? | 10 | |||||||||||||||||||||||||||||||||
| 7. | Write short note on the following :- | 20 | |||||||||||||||||||||||||||||||||
| (a) | Monitor | ||||||||||||||||||||||||||||||||||
| (b) | Distributor O.S | ||||||||||||||||||||||||||||||||||
| (c) | Network O.S | ||||||||||||||||||||||||||||||||||
| (d) | Symbian O.S | ||||||||||||||||||||||||||||||||||
Also see Operating systems for computational devices question papers for
December 2011
Monday, April 14, 2014
Operating Systems For Computational Devices Semester 5 (December 2011)
|
Operating Systems For Computational
Devices Semester 5 |
|||||||||||||||||||||||||||||||
|
|
|||||||||||||||||||||||||||||||
| 1. | (a) | Explain various system calls with appropriate syntaxes. | 10 | ||||||||||||||||||||||||||||
| (b) | Explain mutual exclusion. Also write a note on Peterson's Algorithm. | 10 | |||||||||||||||||||||||||||||
| 2. | (a) | Explain demand paging. | 10 | ||||||||||||||||||||||||||||
| (b) | What are various disk scheduling algorithms? Explain each one in brief. | 10 | |||||||||||||||||||||||||||||
| 3. | (a) | Explain the page replacement policies
implement LRU, OPT, FIFO for the following sequence :- 0, 1, 2, 4, 3, 7, 1, 4, 2, 3. Also calculate hits and faults. |
10 | ||||||||||||||||||||||||||||
| (b) | Write a note on Buffering Techniques. | 10 | |||||||||||||||||||||||||||||
| 4. | (a) | What are pre emptive and non-premptive algorithms. | 10 | ||||||||||||||||||||||||||||
| (b) | Explain DMA in terms of system concurrency. What is it implication on hardware design? | 10 | |||||||||||||||||||||||||||||
| 5. | (a) | Write a note on file Access Methods. | 10 | ||||||||||||||||||||||||||||
| (b) | Consider the following snapshot :-
Answer the following questions:- |
10 | |||||||||||||||||||||||||||||
| 6. | (a) | Draw and explain architecture of RTOS. | 10 | ||||||||||||||||||||||||||||
| (b) | What is semaphore? Explain in detail the usages of semaphore and resource acquisition and release. | 10 | |||||||||||||||||||||||||||||
| 7. | Write short note on any four of the following :- | 20 | |||||||||||||||||||||||||||||
| (a) | Race condition | ||||||||||||||||||||||||||||||
| (b) | VM Ware | ||||||||||||||||||||||||||||||
| (c) | Monolithic Vs Micro Kernels | ||||||||||||||||||||||||||||||
| (d) | Shared OS Configuration for multi Processor System. | ||||||||||||||||||||||||||||||
| (e) | d | ||||||||||||||||||||||||||||||
Operating Systems For Computational Devices Semester 5 (December 2010)
|
Operating Systems For Computational
Devices Semester 5 |
|||||||||||||||||||||||||||||||
|
GT- 6786 |
|||||||||||||||||||||||||||||||
| N.B.: | (1) | Questions No.1 is compulsory. | |||||||||||||||||||||||||||||
| (2) | Attempt any four questions out of remaining six
questions. |
||||||||||||||||||||||||||||||
| 1. | (a) | What is operating system? Explain multiprogramming and time sharing operating system. | 10 | ||||||||||||||||||||||||||||
| (b) | What is disk scheduling? What are various disk scheduling algorithms? Explain the criteria for selecting the best disk scheduling algorithm. | 10 | |||||||||||||||||||||||||||||
| 2. | (a) | What is RTOs? Give the classification of RTOs and comparison of any two RTOs. | 10 | ||||||||||||||||||||||||||||
| (b) | Calculate Hit and faults using FIFO, OPT
and LRU page replacement policies for the following page sequences:-
2, 3, 5, 4, 2, 5, 7, 3, 8, 7 Assume page frame size is 3. |
10 | |||||||||||||||||||||||||||||
| 3. | (a) | What are the various buffering techniques? Explain each one in detail. | 10 | ||||||||||||||||||||||||||||
| (b) | Give five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order) how would the first-fit, best-fit and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)? Which algorithm makes the most efficient use on memory? | 10 | |||||||||||||||||||||||||||||
| 4. | (a) | Explain various file allocation methods. | 10 | ||||||||||||||||||||||||||||
| (b) | Consider the following Snapshot of a
system:-
Answer the following questions using the banker's algorithm. |
10 | |||||||||||||||||||||||||||||
| 5. | (a) | What is semaphore? Explain different types of semaphore. | 10 | ||||||||||||||||||||||||||||
| (b) | Explain files in relation with following
points :- (i) File structure (ii) File operation (iii) File Access (iv) File Types. |
10 | |||||||||||||||||||||||||||||
| 6. | (a) | Explain message based IPC an example. | 10 | ||||||||||||||||||||||||||||
| (b) | Describe the difference among short term, medium term and long term schedulers. | 10 | |||||||||||||||||||||||||||||
| 7. | Write short note on any four of the following :- | 20 | |||||||||||||||||||||||||||||
| (a) | Race condition | ||||||||||||||||||||||||||||||
| (b) | Threads | ||||||||||||||||||||||||||||||
| (c) | Network O.S Vs. Distributed O.S | ||||||||||||||||||||||||||||||
| (d) | Symbian O.S | ||||||||||||||||||||||||||||||
| (e) | Incode. | ||||||||||||||||||||||||||||||
Also see Operating systems for computational devices question papers for
May 2010
Saturday, April 12, 2014
Operating Systems For Computational Devices Semester 5 (May 2010)
|
Operating Systems For Computational
Devices Semester 5
(Revised Course) (3 Hours) May 2010 |
|||||||||
|
AN- 4309
[Total Marks : 100] |
|||||||||
| N.B.: | (1) | Questions No.1 is compulsory. | |||||||
| (2) | Attempt any four questions out of remaining six questions. | ||||||||
| (3) | Assume suitable data wherever required but justify the same. | ||||||||
| (4) | All questions carry equal marks. | ||||||||
| (5) | Answer to each new questions to be started on a fresh page. | ||||||||
| (6) | Figures to the right in brackets
indicate full marks. |
||||||||
| 1. | (a) | What are the various real-time CPU scheduling algorithms. Explain each one in brief. | 10 | ||||||
| (b) | What are requirements of mutual exclusion? Explain Peterson's algorithm for mutual exclusion. | 10 | |||||||
| 2. | (a) | What are two difference between user-level threads and kernel-level threads? Under what circumstances is one type better than the other? | 10 | ||||||
| (b) | Consider the following page reference
string:- 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 How many page fault would occur for the following replacement algorithms assuming one, two, three, four, five, six or seven frames? -- LRU Replacement -- FIFO Replacement -- Optimal Replacement. |
||||||||
| 3. | (a) | How does DMA increase system concurrency? How does it complicate hardware design? | 10 | ||||||
| (b) | How do caches help improve performance? Why do systems not use more or larger caches if they are so useful. | 10 | |||||||
| 4. | (a) | What are the various disk-scheduling algorithms. Explain each one in brief. | 10 | ||||||
| (b) | Consider the following segment table:-
(i) 0,430, (ii) 1, 10, (iii) 2,500, (iv) 3,400, (v) 4, 112. |
||||||||
| 5. | (a) | What are the four conditions that create deadlock? Explain deadlock prevention and avoidance techniques. | 10 | ||||||
| (b) | Given five memory partitions of 100 KB, 200 KB, 300 KB, and 600 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory? | 10 | |||||||
| 6. | (a) | What are the various buffering techniques? Explain each one in detail. | 10 | ||||||
| (b) | Explain file allocation methods in details. | 10 | |||||||
| 7. | Write short note on any four of the following :- | 20 | |||||||
| (a) | Monolithic Vs. Micro Kernels | ||||||||
| (b) | Comparison of any two RTOS | ||||||||
| (c) | Vx works 5.X | ||||||||
| (d) | NOS Vs. DOS | ||||||||
| (e) | Race Condition | ||||||||
| (f) | Inodes. | ||||||||
Also see Operating systems for computational devices question papers for
December 2009
Operating Systems For Computational Devices Semester 5 (December 2009)
|
Operating Systems For Computational
Devices Semester 5 |
|||
|
SP- 8645 |
|||
| N.B.: | (1) | Questions No.1 is compulsory. | |
| (2) | Out of remaining questions, attempt any four questions. | ||
| (3) | Assume suitable data wherever required but justify the same. | ||
| (4) | All questions carry equal marks. | ||
| (5) | Answer to each new questions to be started on a fresh page. | ||
| (6) | Figures to the right in brackets
indicate full marks. |
||
| 1. | (a) | Draw the architecture of RTOS and explain the function of each block the same. | 10 |
| (b) | What are the various system calls for Process Management? Explain each one with their synatex. | 10 | |
| 2. | (a) | What is process and threads? How and where we can use them? | 10 |
| (b) | Explain various page replacement
policies. Implement LRU, OPT, FIFO for the page frame sequence 0, 1,
2, 1, 4, 2, 3, 7, 2, 1, 3, where page frame size is 3. Also
calculate the hit ratio. |
||
| 3. | (a) | What is DMA? What are the different ways in which DMA is performed? Explain each one of them briefly. | 10 |
| (b) | What are the various file structure?
Explain each one in detail. |
10 | |
| 4. | (a) | Explain the Shortest Seek first disk scheduling algorithm with an example. What are the drawbacks of this algorithm? What are the techniques used to alleviate these drawbacks. | 10 |
| (b) | What is the virtual memory? Explain with neat diagram the translation of virtual address into physical address in a segmentation/paging system. | 10 | |
| 5. | (a) | What are the four conditions that create deadlock? Explain deadlock prevention and avoidance techniques. | 10 |
| (b) | Why there is need for communication between two processes? Explain various modes of communication. | 10 | |
| 6. | (a) | What is buffering? Why there is a need of Buffering while performing I/O? Explain Double Buffering with an example. | 10 |
| (b) | Explain how file-systems store files in a linked-list-fashion. What are the limitations and advantages of this approach? | 05 | |
| (c) | Explain the shared OS configuration for multiprocessor systems. Give an example of a real-world kernal which uses this configuration. | 05 | |
| 7. | Write short note on (any four). | 20 | |
| (a) | Application of RTOS | ||
| (b) | Comparison of any two RTOS | ||
| (c) | Monolithic Vs Micro Kernels | ||
| (d) | System calls for Directory Handling | ||
| (e) | Resource Graph Models. | ||
| (f) | Inode or FAT structure. | ||