Write a C program that will first create the necessary pipes and generate the below process tree. P2 P1 P3 P4 The program works as follows: • Process P3 displays "P3" and asks the user to enter a positive integer (side) representing the length of a side of a square. Then, P3 will read this value from the user and send it to P1. • Afterwards, Process P1 receives the length sent by P3 and sends the length back to Process P2. Then, Process P1 will wait until the child processes terminate. • Process P2 receives the length sent by P1 and calculates the area of a square which is equal to (side) and the area of a cube which is equal to (6 x side-) and then it sends the area of the square and the area of the cube to P4. • Process P4 receives the area of the square and the area of the cube sent by process P2, and displays "P4" and the area of the square and the area of the cube. Note that all the values exchanged between processes should be sent and received using PIPE(S). After you finish, copy the code and paste it in the Google Classroom Test Form. Sample Run: P3: Enter the length of the side of a square: 2 P4: The area of the square is 4, and the area of the cube is 24

Write a C program that will first create the necessary pipes and generate the below process tree. P2 P1 P3 P4 The program works as follows: • Process P3 displays "P3" and asks the user to enter a positive integer (side) representing the length of a side of a square. Then, P3 will read this value from the user and send it to P1. • Afterwards, Process P1 receives the length sent by P3 and sends the length back to Process P2. Then, Process P1 will wait until the child processes terminate. • Process P2 receives the length sent by P1 and calculates the area of a square which is equal to (side) and the area of a cube which is equal to (6 x side-) and then it sends the area of the square and the area of the cube to P4. • Process P4 receives the area of the square and the area of the cube sent by process P2, and displays "P4" and the area of the square and the area of the cube. Note that all the values exchanged between processes should be sent and received using PIPE(S). After you finish, copy the code and paste it in the Google Classroom Test Form. Sample Run: P3: Enter the length of the side of a square: 2 P4: The area of the square is 4, and the area of the cube is 24

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

In Java please!! Please create a binary tree OR java graph data structure in order to make a functional questionaire terminal program. The program should proceed to first ask the user if they use Tobacco (Yes/No). If they user specifies yes, then it will ask questions "Tobacco quantity?" and "Tobacco duration?", recording each of the users inputs. The program will then proceed to ask the user if they use Alcohol (Yes/No). If yes, the program will follow up with questions "Alcohol quantity?" and "Alcohol duration?". The next question to be asked is Drugs (Yes/No). If yes, it will ask the "duration of drug use", and also "drug type?". The final two questions have no route, just a simple "Blood type?" and "Rh Factor?". All inputs should be stored in separate strings, ex: String alcohol = "Yes", String alcQuantity = "1 beer a week", etc. The question answers should then be printed after the questionaire had finished. Thank you!
Write a c program for implementing queue using linked lists, for which you should use a structure to create a node with data and the next pointer. The program should be able to insert, delete and display nodes in the queue. The user will be asked to enter his choice either to insert a node (enqueue), delete a node (dequeue), display or to exit from the program. The options for the user should be as the following: 1. Insert a node (Enqueue) 2. Delete a node (Dequeue) 3. Display 4. Exit  For example if user selected option 1 then the following should appear in the output: Enter the value to insert: Node is inserted  If user selected option 2 then the following should appear in the output: Deleted Element is:  If the user selected option 3 then the program should display the elements that are available in the queue The program will keep on running and taking inputs from the user until he selects the 4th option to exit.
unique please Your task for this assignment is to identify a spanning tree in one connected undirected weighted graph using C++. Implement a spanning tree algorithm using C++. A spanning tree is a subset of the edges of a connected undirected weighted graph that connects all the vertices together, without any cycles. The program is interactive. Graph edges with respective weights (i.e., v1 v2 w) are entered at the command line and results are displayed on the console. Each input transaction represents an undirected edge of a connected weighted graph. The edge consists of two unequal non-negative integers in the range 0 to 9 representing graph vertices that the edge connects. Each edge has an assigned weight. The edge weight is a positive integer in the range 1 to 99. The three integers on each input transaction are separated by space. An input transaction containing the string “end-of-file” signals the end of the graph edge input. After the edge information is read, the process…
Define StackQueue as an abstract data type containing the operations of both stack and queue. In StackQueue, the top of StackQueue is the same as the front of the StackQueue. Based on the program below, write down the output. If StackQueue X contains numbers {1, 2, 3, 4)}, where 1 is the front/top, the print format "print(X)" is “(front/top) 1 234 (rear)". StackQueue *A, *B; A = malloc(sizeof(StackQueue)); B = malloc (sizeof(StackQueue)); push(A, 11); push(A, 111); push(A, 1111); push(A, 11111); print(A); // part (a) enqueue (B, topandpop(A)); enqueue (B, top(A)); enqueue (B, dequeue(B)); print(B); // part (b) enqueue (A, dequeue(B) + top(A)); push(A, dequeue (A) + popandtop(B)); print(A); // part (c) What are the output for part (a), part (b) and part (c)?
Write a C program that generates the below process tree. Process P1 asks the user to enter two integers n1 and n2 (assume that the user always enters the value of n1 less than the value of n2). Then, after reading the values of n1 and n2 entered by the user and storing them in variables, process P1 creates three child processes P2, P3, and P4. Process P2 displays “Process P2: ”, and displays its ID and the ID of process P1. Process P3 displays “Process P3: ”, and displays your name, your ID, and your major. Process P4 displays “Process P4: ”, and displays the result of the multiplication of all even numbers between 3 and n2 (including n2 if it is even).
Suppose that we are asked to run the program and when our program reaches to line 23, weare also asked to take a snapshot of our program’s run-time stack. So, please draw full ARIsof the all subprograms which are placed in the stack at line 23.
Write a C++ program to implement circular queue using singly linked list for managing student’s data. Your program should must perform the following specified functions: Enter the record of a new student Delete the record of student Display records of all students Following details should be displayed against each record: Name, Registration Number, Father Name
A palindrome is a string that reads the same forwards as backward. Using only a fixed number of stacks and queues, the stack and queue ADT functions, and a fixed number of int and char variables, write a code to determine if a string is a palindrome. Assume that the string is read from standard input one character at a time. The code should output true or false as appropriate.
Write a program in C/C++ to that receives N number of integer values from a user, stores the inputted values in a binary search tree, and performs some basic operations on the tree. The program displays the elements of the binary search tree in in-order traversal. The program then prompts the user to provide an integer number (target value) to search in the tree. If the target value does not appear in the tree, the program inserts the value in an appropriate place according to the property of node insertion of binary search tree. If the target value appears in the tree, the program deletes the target value from the tree and preserves the property of binary search tree. In both cases, the program displays the modified binary search tree in in- order traversal. Your program must contain the following user-defined functions: - insertNode – this function inserts the user’s input and creates a binary search tree. - inOrder – this function displays the entire tree in in-order traversal. -…
Write a program in C/C++ to that receives N number of integer values from a user, stores the inputted values in a binary search tree, and performs some basic operations on the tree. The program displays the elements of the binary search tree in in-order traversal. The program then prompts the user to provide an integer number (target value) to search in the tree. If the target value does not appear in the tree, the program inserts the value in an appropriate place according to the property of node insertion of binary search tree. If the target value appears in the tree, the program deletes the target value from the tree and preserves the property of binary search tree. In both cases, the program displays the modified binary search tree in in- order traversal. Your output format should be as shown in the test runs. Your program must contain the following user-defined functions: - insertNode – this function inserts the user’s input and creates a binary search tree. - inOrder – this…
Write a code in C language that will create graphs and write them to a file in a particular format. The program should be able to accept a number of vertices, create an cycleusing adjacency list data structure and finally output the graph. Where N is the number of vertices in the graph with V vertices and E edges. P[] = Pointer for each vertex V, 1 <= V <= N denoting the starting point in E[] of the list ofvertices adjacent to vertex V. That is, the vertices adjacent to vertex V are indicated inlocations E[P[V]], E[P[V]+1], ..., E[P[V+1]-1].E[] = list of distinct graph edges (length = 2E)Give the asymptotic running timeRun your code for various values of n and time itCreate a table showing the running times for various values.Create a graph of the running times vs various values. Use a linear scale on theaxis.
Write a program that converts an infix expression into an equivalent postfix expression. The rules to convert an infix expression into an equivalent postfix expression are as follows: Suppose infx represents the infix expression and pfx represents the postfix expression. The rules to convert infx into pfx are as follows: a. Initialize pfx to an empty expression and initialize the stack. b. Get the next symbol, sym, from infx. b.1. If sym is an operand, append sym to pfx. b.2. If symis (, push sym into the stack. b.3. If sym is ), pop and append all the symbols from the stack until the most recent left parenthesis. Pop and discard the left parenthesis. b.4. If sym is an operator: b.4.1. Pop and append all the operators from the stack to pfx that are above the most recent left ( and have precedence greater than or equal to sym. b.4.2. Push sym onto the stack. c. After processing infx, some operators might be left in the stack. Pop and append to pfx everything from the stack. In this…