ENGINEERING • COMPUTER-SCIENCE MCQS: Shared data Issues is involved for multiprocessor or real-time systems in CPU-bound programs tend to have a few CPU bursts. * are necessary for the utilization of multiprocessor architectures * To reduce the Pure Overheads of Context Switch ---- is introduced * To control the degree of multiprogramming scheduler is used for swapping processes in and out of memory *

ENGINEERING • COMPUTER-SCIENCE MCQS: Shared data Issues is involved for multiprocessor or real-time systems in CPU-bound programs tend to have a few CPU bursts. * are necessary for the utilization of multiprocessor architectures * To reduce the Pure Overheads of Context Switch ---- is introduced * To control the degree of multiprogramming scheduler is used for swapping processes in and out of memory *

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Write an ALGORITHM to calculate the address of any element A [I, J] of a two-dimensional array A [1: M, 1: N]. Assume the array is stored in column-major order, B is the base address of the array and w is the size of each element in the array. 2. A two-dimensional array A with n rows time and m columns can be represented in either row-major or column-major form. Establish the address translation functions to locate any element from the one-dimensional array. The element is specified by two-dimensional parameters along with the data type. 3. Write an ALGORITHM to find the transpose of a sparse matrix.
Lab Task: You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm Write a C program to simulate the MVT and MFT memory management techniques. Write a C program to simulate the following contiguous memory allocation techniques Worst-fit Best-fit First-fit TASK1: DESCRIPTION MFT (Multiprogramming with a Fixed number of Tasks) is one of the old memory management techniques in which the memory is partitioned into fixed size partitions and each job is assigned to a partition. The memory assigned to a partition does not change. MVT (Multiprogramming with a Variable number of Tasks) is the memory management technique in which each job gets just the amount of memory it needs. That is, the partitioning of memory is dynamic and changes as jobs enter and leave the system. MVT is a more ``efficient'' user of resources. MFT suffers with the problem of internal fragmentation and MVT suffers with…
Write a C code to perform vector arithmetic: Define 3 vectors A[100], B[100], C[100]. Get n from as a command line argument. Example if n=10, then (./vector 10), and create n processes. (n will be one of Divisors of 100). Get operation from user: add, sub. Each process will create a number of threads. Number of threads per process = 100/(10 number of processes). Perform the operation on a chunk of the vector, for example, if n = 10, each process will create (100/10*10=1) 1 thread to add\sub 10 elements. Use execl to run the add or sub programs Parent should print A.B.C in a file. (yourname.txt) For example, n=5, operation sub Partition work equally to each process: PO create (100/10*5=2) 2 threads → Thread00 will executes A[0:9] B[0:9]-C [0:9] = Thread01 will executes A[10:19] B[10:19]-C[10:19] = PI create (100/10*5=2) 2 threads → Thread 10 will executes A[20:29] = B[20:29]-C [20:29] Thread11 will executes A[30:39] B[30:39]- C[30:39] = and so on. no…
In layman's terms, here's how dynamic memory allocation works.
A. What is dynamic memory allocation, why is it needed, and how it is realized? B. If there is more than one type of dynamic memory allocation/allocators, identify and describe each.
Please provide correct solution. Task1: Solve the producer and consumer problem with inter thread communication (join(), wait(), sleep() etc.) modifying the given C code. #include <pthread.h> #include <stdio.h> #include <string.h> #define MAX 10 //producers and consumers can produce and consume upto MAX #define BUFLEN 6 #define NUMTHREAD 2 /* number of threads */ void * consumer(int *id); void * producer(int *id); char buffer[BUFLEN]; char source[BUFLEN]; //from this array producer will store it's production into buffer int pCount = 0; int cCount = 0; int buflen; //initializing pthread mutex and condition variables pthread_mutex_t count_mutex = PTHREAD_MUTEX_INITIALIZER; pthread_cond_t nonEmpty = PTHREAD_COND_INITIALIZER; pthread_cond_t full = PTHREAD_COND_INITIALIZER; int thread_id[NUMTHREAD] = {0,1}; int i = 0; int j = 0; main() { int i; /* define the type to be pthread */ pthread_t thread[NUMTHREAD];…
Fill in the blanks:5. The ( 6 ) is used to implement mutual exclusion where it can be decremented by aprocess and incremented by another, but the value must either be 0 or 1.6. If deadlock prevention approach is used to deal with deadlocks in a system, the ( 7 )condition can be prevented using the direct method.7. Two threads may share the memory space, but they cannot share the same ( 8 )8. Consider round-robin (RR) scheduling algorithm is implemented with 2 seconds timeslice and it is now selecting a new process; if we have 3 blocked processes (A, B, and C),and A has been waiting the longest, then A would need to wait a period of ( 9 ) secondsto be selected.9. In real-time systems, if a task appears at random times, then it is considered ( 10 ).
Rspected Sir, please chek my qustioin 1. Calculate the sum of series of even numbers from the list of numbers. The length of the list is in ML 2200H and series itself begins from ML 2201H. Assume the sum to be greater than FFH. Store the results in ML 2300H and 2301H. 2. Discuss the working of CALL instruction in 8085 microprocessor by taking the suitable example. Also, mention various conditional CALL instructions of 8085 microprocessor.
Assume we have a free space management system as described in the book, for example one used to provide us with virtual addresses on the heap (with physical addresses handled by a much simpler system since we assume paging). Assume the system uses the following very simple rules; A memory request traverses the free list, and finds the first block large enough to handle the request (i.e., the first fit algorithm from the book). It then: Splits the block into 2 pieces: The first piece will be the requested size + 1k (for a header). The second will be the remaining The first piece will be returned to the caller, but the address returned will be the address of the memory for the user, that is the header + 1k The second will be put back into the linked list If there's insufficient contiguous memory, the allocation will fail (return 0) Free memory is stored as a linked list in address order Assume we start with a single contiguous block of FREE memory of size 64k starting at location…
18.9 A VSOS (very simple operating system) uses a very simple approach to scheduling. Scheduling is done on a straight round-robin basis, where each job is given a time quantum sufficient to complete very short jobs. Upon completion by a job, another job is admitted to the system and immediately given one quantum. Thereafter, it enters the round-robin queue. Consider the scheduling objectives given in the text. Discuss the VSOS scheduling approach in terms of these objectives.
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
CA_6 We study the properties of cache memory, and for reasons of easier design and efficient circuits, we assume that the cache capacity is 2i Bytes, and cache line size is 2j Bytes, with i and j being natural numbers: (a) How many bits should the tag field have? And can the tag field contain 0 bit (i.e., be empty)? Elaborate (b) Repeat the above for the index field. (c) Repeat the above for the byte-offset field. (d) Finally, depict a figure showing a cache line, indicate what fields it possibly has, state the possible sizes of these fields, and explain the uses of these fields.