Consider the following program:const int n=10;int s; //shared variable between two processes (threads)void P1( ){int i=0;for (i=0;i

In function P1 the loop will run 10 times for the values 0 to 9.

Answered: Consider the following program: const…

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

#include <pthread.h>#include <stdio.h>#include <unistd.h>#include <stdlib.h> int count = 0; void *threadfunc(void *arg){ cout<<"Thread Complete\n"; count++; return NULL; } int main(){ count = 0; pthread_t A,B,C;pthread_create(&A, NULL, threadfunc, NULL); pthread_create(&B, NULL, threadfunc, NULL); pthread_create(&C, NULL, threadfunc, NULL); while(count<50) {pthread_join(A, NULL); if(count<50) pthread_join(B, NULL); if(count<50) pthread_join(C, NULL); } return 0; } What is wrong?
Insert locks into the following two functions for stack operations assuming the two functions are executed in two threads. int Push(int stack[ ], int *top, int new_element){ stack[top]= new_element; top++; return 0; } int Pop(int stack[ ], int *top, int *top_element){ if (top>0) { top_element= stack[top]; top--; return 0; } else return -1; \\ empty stack }
What are the pid values?
In an assembly language program, local variables are kept in a stack. True or false: this assertion
Draw the run-time stack after the execution for each line using "call by need" and "call by name". Assume dynamic scoping
Debug this code in C so it runs. Here it is. Code: #include <stdlib.h> #include <stdio.h> #include <unistd.h> #include <pthread.h> void multiThreads(); void* threadFunction(void* vargp); void main(){ multiThreads(); return 0; } void multiThreads(){ int SIZE = 5; int i; int error; pthread_t tid[SIZE]; while(i < SIZE){ error = pthread_create(&(tid[i]), NULL, &threadFunction, (void*)&(tid[i])); if(error != 0){ printf("\nThread can't be created : [%s] \n Press 'Enter’ to continue...", strerror(error)); } i++; }//end while while(i < SIZE){ pthread_join(tid[i], NULL); i++; } } void* threadFunction(void* vargp){ int LOOP = 5; int i; int* myid = (int*)vargp; printf("\n-----------------------------\n"); printf("\nThread %i has started\n", myid); printf("\n-----------------------------\n"); for(i = 0; i <= LOOP; i++){ printf("\nThread ID %i is printing…
10.13 For loop - 2 - Java Write a for loop in Java that will display (each on a separate line) a series of numbers based on the input. The first input value represents the lower value in the range, the second input represents the upper value in the range, the 3rd input represents the "step" value. For example if the input is -5 25 5, the output would look like this: -5 0 5 10 15 20 25
using c# 5.0 Create a program that allows the user to fill a vending machine and purchase items from it. The program should use a Stack to implement last-in-first-out (LIFO) behavior. The vending machine always vends the item that was most recently added to it. The user should be able to stock an item in the machine or buy an item from the machine. The program should inform the user if the machine is empty when they attempt a purchase. Sample Program Run After your program runs, the console should look similar to the following example. The exact output will vary depending on what the user inputs. Vending Machine Do you want to (A - Add Item, B - Buy Item, E - End): A Coke Do you want to (A - Add Item, B - Buy Item, E - End): A Coke Do you want to (A - Add Item, B - Buy Item, E - End): A Sprite Do you want to (A - Add Item, B - Buy Item, E - End): B You bought a Sprite Do you want to (A - Add Item, B - Buy Item, E - End): B You bought a Coke Do you want to (A - Add Item, B -…
CPU Priority Scheduling-preemptive: Write a Java program to implement a priority scheduling algorithm that uses low number to represent high priority. Your program should first prompts the user to input a list of process ID, arrival time, burst time, and priority for each process to be run on the CPU. The list is terminated by 0 0 0 0 for the process ID, arrival time, burst time, and priority. The program output should draw a Gantt chart (as text) that shows the scheduling order of the processes using the Priority scheduling algorithm. Also print the turnaround time, response time, and waiting time for each process along with their average for all processes. Make sure to display very helpful messages to the user for input and output.
complete TODO's using Java
Complete the following code. The goal is to implement the producer-consumer problem. You are expected to extend the provided C code to synchronize the thread operations consumer() and producer() such that an underflow and overflow of the queue is prevented. You are not allowed to change the code for implementing the queue operations, that is the code between lines 25 and 126 as shown in the screenshot. You must complete the missing parts as shown in the screenshot as well as complete the missing codes of producer and consumer. #include <stdio.h> #include <stdlib.h> #include <unistd.h> #include <time.h> #include <pthread.h> #include <semaphore.h> #include <errno.h> #include <fcntl.h> #define MAX_LENGTH_CAP 100 #define INIT -127 #define UNDERFLOW (0x80 + 0x02) #define OVERFLOW 0x80 + 0x01 #define BADPTR (0x80 + 0x03) #define CONSUMER_TERMINATION_PROBABILITY 40 #define PRODUCER_TERMINATION_PROBABILITY 30 // ============= LOCKED…
whats wrong in code #include int counter; static void * thread_func(void * _tn) { int i; for (i = 0; i < 100; i++) counter++; return NULL; } int main( ) { int i, N = 5; pthread_t t[N]; for (i = 0; i < N; i++) pthread_create(&t[i], NULL,thread_func, NULL); for (i = 0; i < N; i++) pthread_join(t[i], NULL); printf("%d\n", counter); return 0; }

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

Consider the following program: const int n=10; int s; //shared variable between two processes (threads) void P1( ) { int i=0; for (i=0;i