Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
Illustrate the difference between logical data independence and physical data independence? Which one is harder to accomplish? Explain why?
Design the state diagram of a process and label different transitions. Describe the need of process suspension.
By using MIT public key cryptosystem with a = 1, b = 2, c = 3 and so on. Determine e and encrypt the string “abcdefghij” for p = 5, q = 11 and d = 27.
Explain Dijkstra shortest path algorithm. Also illustrate the working process of Dijkstra algorithm with the help of an illustration.
In a digital system, 8-input links are multiplexed by using STDM. Each of the input sources is making 1024 bits per second.
Write down the principal difference between the synchronous and asynchronous communication?
Illustrate the time stamping scheme of the distributed system for mutual exclusion? Describe the functioning of the scheme via a diagram.
What do you mean by the term Virtual File Systems? How is it implemented?
Give an illustration of classical problem of concurrent programming and illustrate how it leads to the deadlock?
Illustrate the two main functions of the operating systems?
Describe about how logical address is mapped to physical address during execution time.
Describe in detail about Bakery Algorithm for Critical Section Problem with suitable example.
Describe User-Level Thread and Kernel-Level Thread. What do you mean by Process? Write down the difference between a process and a program.
In brief explain and distinguish between the first-fit and best-fit memory allocation strategy.
Write down an algorithm to search a key in a B-tree. Illustrate the worst case of searching in a B-tree? List all the possible conditions which can take place while inserting a key in a B-tree?
Write down a program which makes a linked list comprising of nodes of the given struct type and searches the record of a student whose roll number is given by user.
There are few classical problems of synchronization and these problems are examples of a large class of concurrency–control problems. One of the problems is Dining-Philosophers problem. Descri
Use a stack to assess the given postfix arithmetic expression. Show the changing status of stack in a tabular form:
Write down the demerits of linear representation of the binary tree.
Consider the following page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults will occur for the given replacement algorithms: LRU, FIFO, and Optimal
Describe the different strategies for dealing with the deadlocks namely prevention, avoidance and recovery?
Describe the differences in the degree to which FCFS, RR and Non-pre-emptive SJF scheduling algorithms discriminate in favour of short processes. State and demonstrate banker’s algorithm.
Describe how semaphore can be used to solve readers and writers problem?
Describe Two-Phase Locking. Describe Dynamic Memory Allocation Strategy.
Write down the essential conditions for a deadlock situation to arise? Explain them in detail with suitable example. Compare paging and segmentation?