Here is a collection of links that are allowed to be used during the exam: Access to OpenStax eText Access to Pearson eText Access to OpenStax University Physics eText in Spanish A digital copy of the Formula Sheet is provided below.

What is the output of the following program? #include #include typedef struct Node { int value; struct Node* next; } Node; Node* Node_construct(int v) { Node* n = malloc(sizeof(Node)); n->value = v; n->next = NULL; return n; } Node* List_insert(Node* h, int v) { Node* p = Node_construct(v); if (h == NULL) return p; Node* q = h; while (q->next != NULL) { q = q->next; } q->next = p; return h; } void print_list(Node* h) { while (h != NULL) { printf(“%d “, h->value); h = h->next; } printf(“\n”); } int main() { Node* head = NULL; head = List_insert(head, 10); head = List_insert(head, 20); head = List_insert(head, 30); print_list(head); return 0; }

What is the output of the following program? #include #include typedef struct Node { int value; struct Node* next; } Node; Node* Node_construct(int v) { Node* n = malloc(sizeof(Node)); n->value = v; n->next = NULL; return n; } Node* List_insert(Node* h, int v) { Node* p = Node_construct(v); p->next = h; return p; } void print_list(Node* h) { while (h != NULL) { printf(“%d “, h->value); h = h->next; } printf(“\n”); } int main() { Node* head = NULL; head = List_insert(head, 10); head = List_insert(head, 20); head = List_insert(head, 30); print_list(head); return 0; }

The following program generates a binary search tree, then removes a node from the tree, and outputs the in-order traversal sequence. What is the output of the following code? #include #include typedef struct Node { int key; struct Node *left, *right; } Node; Node* newNode(int item) { Node* temp = (Node*)malloc(sizeof(Node)); temp->key = item; temp->left = temp->right = NULL; return temp; } Node* insert(Node* root, int key) { if (root == NULL) return newNode(key); if (key < root->key) root->left = insert(root->left, key); else if (key > root->key) root->right = insert(root->right, key); return root; } Node* minValueNode(Node* node) { Node* current = node; while (current && current->left != NULL) current = current->left; return current; } Node* deleteNode(Node* root, int key) { if (root == NULL) return root; if (key < root->key) root->left = deleteNode(root->left, key); else if (key > root->key) root->right = deleteNode(root->right, key); else { // Node found if (root->left == NULL) { Node* temp = root->right; free(root); return temp; } else if (root->right == NULL) { Node* temp = root->left; free(root); return temp; } Node* temp = minValueNode(root->right); root->key = temp->key; // Copy successor’s content to this node root->right = deleteNode(root->right, temp->key); // Delete successor } return root; } void inorder(Node* root) { if (root != NULL) { inorder(root->left); printf(“%d “, root->key); inorder(root->right); } } int main() { Node* root = NULL; int values); root = deleteNode(root, 50); inorder(root); return 0; }

The following program is implementing a merge sort algorithm to sort an array. The code compiles, but the array is not correctly sorted. Identify the line in the code containing the error. (Enter the number of the line only)

The Asch conformity study illustrated

What is the best way for management to handle the discovery of unethical conduct?

From the textbook, when faced with unethical behavior at work, employees have three options:

Sally Corporation offers to buy out Arco Corp. by paying $67 per share. Billy Corporation, who also wants to buy Arco offers to pay $70 per share. When the bidding process is finally over, Sally Corporation has offered $84 per share and Billy Corporation has offered to pay $90 per share. Arco agrees to sell to Sally Corporation on grounds that, all things considered, the takeover by Sally Corporation would be better for the business.  Billy Corporation claims that Arco should have sold the company to it since it was the highest bidder. Is Billy Corporation correct?

View the questions in the exam file. Final Exam Calculator Allowed Brody.pdf Write your work and answer on paper. Box your final answer. Once done, upload to the upload work assignment in canvas.