Write a program in MPI to calculate the sum of given numbers in parallel: * The program should calculate the sum of numbers from 1 to 1000 in a parallel fashion while executing on all the cluster nodes and providing the result at the end on only one node

Suppose your stack was allocated to be between addresses 0x20002000 and 0x200022FF. Imagine the stack pointer was currently pointing at 0x20002138. How many more words can you push to the stack and not have a problem for the following 4 stack policies:   a)Empty ascending     b)Empty descending     c)Full ascending     d)Full descending

You are going to simulate the operation of an AVL tree on paper. For the purposes of this assignment, assume that new returns addresses in the following order: @1480 @1120 @1096 @1264 @1180 @1192 @1768 @1804 @1228 @1372 @1312 @1276 @1168 @1696 @1084 @1504 @1468 @1216 @1384 @1204 @1648 @1024 @1108 @1396 @1144 @1432 @1252 @1348 @1564 @1072 @1684 @1540 @1672 @1624 @1420 @1588 @1300 @1792 @1060 @1720 @1336 @1612 @1552 @1324 @1636 @1660 @1288 @1708 @1732 @1492 @1780 @1528 @1156 @1444 @1036 @1456 @1240 @1576 @1516 @1756 @1360 @1132 @1408 @1600 @1744 @1048 Also note that if you remove all references to an address (so it is garbage collected), it goes to the back of the queue (so would be after whatever is the last address in the AVL at that time). For delete() of a node with two children, I want you to assume that we replace the data (but not the node itself) with the successor value (and that the successor is removed and garbage collected). There are no duplicates allowed, so if there's a…

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…

1. In a Linked stack implemented using singly linked list with pointer top pointing to top of the stack, which of the following statements, correctly push a node into a non-empty stack? Assume temp is the node to be pushed. temp = top; top->next = temp; %3! top->next = temp; temp = top %3D temp->next = top; top = temp %3D %3D top = temp; temp->next = top 2. You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list? O Insert a new element as a first element Add a new element to the end of the list Delete the first element Delete the last element of the list

Describe how the signal() operation associated with monitors differs from the corresponding operation defined for semaphores. typedef struct node { value_t data; struct node *next; } Node; Node top; // top of stack void push(value_t item) { Node *old_node; Node *new_node; new node = malloc(sizeof (Node)): new_node->data = item; do old node = top; new node->next = old_node; while (compare_and swap(top,old_node,new_node) != old node); } value_t pop() { Node *old node; Node *new_node; do { old node = top; if (old_node == NULL) return NULL; new node = old node->next; } while (compare_and_swap(top,old_node,new_node) != old_node); return old. node->data: } Figure 6.18 Lock-free stack for Exercise 6.15.

Problem 2. In Project 6 you are required to use pthreads condition variables and mutexes to synchronize accesses to shared variables in your priority queue implementation. Ben Bitdiddle wants to try (on his own) to do it using semaphores instead. As in Project 6, the “next" operation returns the highest-priority item in the queue; if the queue is empty, it blocks until the queue becomes non-empty. The “insert" operation places an item in the queue, and if the queue went from empty to non-empty, it signals any waiting threads. Ben's implementation uses a (global) semaphore to count the number of items in the queue, and uses the Bryant and O'Hallaron "P()" and "V()" wrapper functions (see text) to decrement and increment it. He declares a global sem_t list_size and initializes it with sem_init(&list_size,0,0). The global variable list_head points to the first item in the list and is initially NULL. a. In Ben's first attempt, the pq_next() function does this: P(list_size); // block until…