Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
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?
Consider a set of process <p1,p2,p3,p4,p5> with length of the cpu burst <10,1,2,1,5> and they enter in the same order at time 0. Determine the turn around and waiting time for each proce
Explain the TEST–AND-SET mechanism for synchronization of processes in detail.
Describe briefly the use of hierarchical file in UNIX operating system?
What do you mean by race condition? What do you mean by starvation? What do you mean by dynamic linking?
What is the use of ‘make‘ facility of UNIX? Write down the use of the ‘fork ‘system call in Unix?
What do you mean by semaphore? Explain in detail with suitable example. How an external fragmentation can be solved?
What do you mean by Round Robin Method? Explain in detail with suitable example. Write down two page Removal Algorithms.
Write down the difference between Raster and Vector Graphics Method. When do we prefer what?
Describe the following forms of parametric curves-Hermite, Bezier, Uniform B-spline, and Non uniform B-spline.
Write down different spatial partitioning representation methods. Briefly describe Octree.
What are the merits and demerits of Top-Down Approach and Bottom-Up Approach for the data warehouse design?