During online class we studied that, if the semaphore operations Wait and Signal are not executed atomically,then mutual exclusion may be violated. Assume that Wait and Signal are implemented as below: void Wait (Semaphore S) { while (S.count <- 0) (} s.count = s.count - 1; void signal (Semaphore s) { s.count = s.count + 1; Code: (a) a) Build a scenario of context switches that includes two threads and permit to enter a critical section secured by a single mutex semaphore as a result of a lack of atomicity. wait(S) = {while S < 0; S--; } signal(S) = {S++; }

During online class we studied that, if the semaphore operations Wait and Signal are not executed atomically,then mutual exclusion may be violated. Assume that Wait and Signal are implemented as below: void Wait (Semaphore S) { while (S.count <- 0) (} s.count = s.count - 1; void signal (Semaphore s) { s.count = s.count + 1; Code: (a) a) Build a scenario of context switches that includes two threads and permit to enter a critical section secured by a single mutex semaphore as a result of a lack of atomicity. wait(S) = {while S < 0; S--; } signal(S) = {S++; }

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

Suppose that you want to implement an algorithm that will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. DeepGreen does not use Minimax. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. What advantage would this algorithm have over Minimax? (if none, Justify).
Complete and submit LinkedStack2.java with following: Inherit LinkedStack.java, implement StackInterface2.java Add String toString()method as specified in page 153, problem 28(a) Add int size()method as specified in page 153, problem 28(b) Add void popSome(int count)method as specified in page 153, problem 28(c) Add boolean swapStart()method as specified in page 153, problem 28(d) Add T poptop() method as specified in page 153, problem 28(e)
NEED PSEUDOCODE FOR THIS CODING package disktower; import java.util.*; class MyComparator implements Comparator { public int compare(Object obj1,Object obj2) { Integer i1=(Integer)obj1; Integer i2=(Integer)obj2; return i2.compareTo(i1); } } public class DiskTower { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int max=n; Queue<Integer> queue=new PriorityQueue<Integer>(new MyComparator()); int disks[]=new int[n]; for(int i=0;i<n;i++) { disks[i]=sc.nextInt(); queue.add(disks[i]); while(!queue.isEmpty() && queue.peek()==max) { System.out.print(queue.poll() + " "); max--; } System.out.println(); } } }
In the famous dining philosophers problem, a bunch of philosophers aresitting around a circular table with one chopstick between each of them. A philosopher needsboth chopsticks to eat, and always picks up the left chopstick before the right one. A deadlockcould potentially occur if all the philosophers reached for the left chopstick at the same time. Usingthreads and locks, implement a simulation of the dining philosophers problem that prevents deadlocks.
Problem: The Eight Queens problem is to find a solution to place a queen in each row on a chessboard such that no two queens can attack each other. Code below package queenchees; import static java.lang.Byte.SIZE;import javafx.application.Application;import javafx.event.ActionEvent;import javafx.event.EventHandler;import javafx.scene.Scene;import javafx.scene.control.Button;import javafx.scene.layout.Pane;import javafx.stage.Stage;import javafx.scene.image.Image;import javafx.scene.image.ImageView;import javafx.scene.shape.Line; public class QueenChees extends Application { // Declare a variable private static final int SIZE = 8; // Declare an array private int[] queens = new int[SIZE]; // Override start method @Override // Start method public void start(Stage primaryStage) { // Call the function search(0); // Create a chess CB ChessBoard CB = new ChessBoard(); // Create a scene Scene scene = new Scene(CB,…
Provide a Java class named SortedPriorityQueue that implements a priority queue using a Java array of type int. The constructor of the class should be passed the size of the queue. Each time the add method is called, the value passed to it should be inserted into the array to ensure that the array remains in sorted order. If the array is full when addis called, a RuntimeException should be thrown. If the array is empty when remove is called, a RuntimeException should also be thrown Make the implementation as efficient as possible.
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory)
Modify the producer-consumer implementation code bellow, so that it uses monitors to handle race conditions instead of semaphores or mutexes. Use the pthread library implementation #include <pthread.h> #include <semaphore.h> #include <stdio.h> #include <stdlib.h> #define BUFFER_SIZE 20 pthread_mutex_t mutex; int count = 0; int buffer[BUFFER_SIZE]; pthread_t tid; int producers = 0, consumers = 0; void insert(int item) { while (count == BUFFER_SIZE); if (count < BUFFER_SIZE) { buffer[producers] = item; producers++; producers=producers%BUFFER_SIZE; sleep(1); } return; } int remove_item() { int item; while (count == 0); if (count > 0) { item = buffer[consumers]; buffer[consumers] = buffer[consumers - 1]; consumers++; consumers=consumers%BUFFER_SIZE; sleep(1); } return item; } void * producer(void *param) { int item; while (1) { item = rand() % BUFFER_SIZE; while (count >= BUFFER_SIZE);…
Discrete distribution. Write a program DiscreteDistribution.java that takes an integer command-line argument m, followed by a sequence of positive integer command-line arguments a1,a2,…,ana1,a2,…,an, and prints m random indices (separated by whitespace), choosing each index i with probability proportional to ai. example: input = 25 1 1 1 1 1 1 output = 4135236543212345634523453
Develop a java program to define an Symbol table class so that each symbol is associated with a numeric value. The two main methods are set() and get(): void set(String sym, int value); int get(String sym); The set() method associates the int value with the symbol sym, while the get() method performs the complement of retrieving the int value previously associated Define appropriate exceptions so that clients of the Symbol table may respond to conditions appropriately. For example, when they retrieve the value of a nonexist clients can either stop execution and display an error message or use a default value of 0 Symbol Numeric Value
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: 1) Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) 2) Delete any person details by a given phone number. 3) Update telephone number by providing person first name. 4) Display all details of persons from a phone directory. 5) Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) 6) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory) Project Outputs The output has to display a menu of choices. Then the user can select which operation want to perform.…
Suppose you have a signature scheme S (which is correct and existentially unforgeable), and S can be used to sign any t-bit message. And you have a hash function H which outputs t bits and is collision-resistant. Consider a modified signature scheme S’ which can sign messages of unlimited length, where: S’.Sign(sk, m) = S.sign(sk, H(m)) Prove that this scheme is existentially unforgeable as long as S is existentially unforgeable and H is collision-resistant.