The program shown in Figure 4.22 uses the Pthreads API. What would be the output from the program at LINE C and LINE P? #include #include int value - 0; void *runner(void *param); /* the thread */ int main(int argc, char *argv []) { pid_t pid; pthread_t tid; pthread attr_t attr; pid - fork(); if (pid -- 0) { /* child process */ pthread attr_init(&attr); pthread_create (&tid,&attr,runner,NULL); pthread_join(tid,NULL); printf("CHILD: value = %d",value); /* LINE C */ else if (pid > 0) { /* parent process */ wait(NÜLL); printf("PARENT: value = %d",value); /* LINE P */ } void runner (void *param) { value - 5; pthread exit (0); } Figure 4.22 C program for Exercise 4.19.

The program shown in Figure 4.22 uses the Pthreads API. What would be the output from the program at LINE C and LINE P? #include #include int value - 0; void runner(void param); /* the thread / int main(int argc, char argv []) { pid_t pid; pthread_t tid; pthread attr_t attr; pid - fork(); if (pid -- 0) { /* child process / pthread attr_init(&attr); pthread_create (&tid,&attr,runner,NULL); pthread_join(tid,NULL); printf("CHILD: value = %d",value); / LINE C / else if (pid > 0) { / parent process / wait(NÜLL); printf("PARENT: value = %d",value); / LINE P / } void runner (void param) { value - 5; pthread exit (0); } Figure 4.22 C program for Exercise 4.19.

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

PP 13.3 Create a new version of the LinkedStack class that makes use of a dummy record at the head of the list. PP 13.4 Create a simple graphical application that will allow a user to perform push, pop, and peek operations on a stack, and display the resulting stack (using toString) in a text area.
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
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 Figure below. You must complete the missing parts between lines 226-261 as shown in the screenshot.
Solution question number 2
2. After calling the Top() function of Stack Class it throws an exception. What can be the possible reason to throw the exception?
Answer the given question with a proper explanation and step-by-step solution. Consider the following source code, where k,l and m are constants declared with #define. The struct lnode is as defined as: struct lnode { char *str; // points to 32-character string struct lnode *next; // points to next node address struct lnode *prev; // points to prev node address }; You will need to determine the values for k, l and m, which are the dimensions of a 3-D array named A. struct lnode A[k][l][m]; int store_ele(int h, int i, int j, struct lnode dest) { A[h][i][j] = dest; return sizeof(A); } On compiling this program (with gcc -O2 -S -fno-asynchronous-unwind-tables) ,gcc generates the following assembly code for the store_ele function: store_ele: endbr64 movslq %edi, %rdi movslq %edx, %rdx movslq %esi, %rsi movdqu 8(%rsp), %xmm0 movq %rdi, %rax leaq (%rdx,%rdx,2), %rdx salq $6, %rax subq %rdi, %rax salq $4, %rax leaq (%rax,%rdx,8), %rax leaq (%rsi,%rsi,4), %rdx leaq (%rsi,%rdx,4), %rdx leaq…
10/** 2 IN3 &in mm 4 */ 5 6 public class StackTrace 7 { 80 9 10 11 12 13 14 150 16 17 18 190 20 21 22 23 24 25 260 27 28 29 300 31 32 33 34 35 3456N This program demonstrates the stack trace that is produced when an exception is thrown. 36 public static void main(String[] args) { System.out.println("Calling myMethod..."); System.out.println("Method main is done."); } /** */ } /** myMethod(); public static void myMethod() { System.out.println("Calling produceError..."); System.out.println("myMethod is done."); */ MyMethod 37 } 38 produceError(); produceError public static void produceError() { String str = "abc"; // The following statement will cause an error. System.out.println(str.charAt(3)); System.out.println("peoduceError is done."); Problems @Javadoc Declaration Console X
using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace LibraryManagment { class Program {// private static int userInput;// need varaible to capture user input = int public static string Title { get; private set; } public static bool IsChecked { get; private set; } //Implement a menu system that allows users to add books, check out books, //and check in books using the console. Use Console.ReadLine() ///to capture user input and Console.WriteLine() for output. static void Main(string[] args) {// provides a cosole interaction for a user while (IsChecked) { Console.WriteLine("\nMenu\n" + "1)Add book\n" + "2)Check Out Book\n" + "3)Check In Book\n" + "4)Exit\n"); Console.Write("Choose your…
OCaml Code: The goal of this project is to understand and build an interpreter for a small, OCaml-like, stackbased bytecode language. Make sure that the code compiles correctly and provide the code with the screenshot of the output. Make sure to have the following methods below: -Push integers, strings, and names on the stack -Push booleans -Pushing an error literal or unit literal will push :error: or :unit:onto the stack, respectively -Command pop removes the top value from the stack -The command add refers to integer addition. Since this is a binary operator, it consumes the toptwo values in the stack, calculates the sum and pushes the result back to the stack - Command sub refers to integer subtraction -Command mul refers to integer multiplication -Command div refers to integer division -Command rem refers to the remainder of integer division -Command neg is to calculate the negation of an integer -Command swap interchanges the top two elements in the stack, meaning that the…
Write a program that takes as input an arithmetic expression. The program outputs whether the expression contains matching grouping symbols (brackets and parentheses). For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols. However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols. You must use a stack and/or queue. USE THE FOLLOWING DATA FILE //Header file: stackADT.h #ifndef H_StackADT#define H_StackADT template <class Type>class stackADT{public:virtual void initializeStack() = 0;//Method to initialize the stack to an empty state.//Postcondition: Stack is emptyvirtual bool isEmptyStack() const = 0;//Function to determine whether the stack is empty.//Postcondition: Returns true if the stack is empty,// otherwise returns false.virtual bool isFullStack() const = 0;//Function to determine whether the stack is full.//Postcondition: Returns true if the stack is full,// otherwise returns…
Computer Science For the basic ADT Queue operations, list all cases when a QueueException will be thrown. Each item listed should be no more than 10 words and ONLY in the form "exception name : cause of exception". Remember to use correct terminology or the answer will not be accepted
In C++,