**** Computer Architecture **** 5 Subtract - 12 from 27 by using 8-bit signed magnitude, one's complement, two's complement arithmetic, respectively. ( 2 pts 3=6 pts) 6 Add 12 to -27 by using 8-bit signed magnitude, one's complement, two's complement arithmetic, respectively. ( 2 pts 3=6 pts) 7 Perform the following multiplications by using Booth's algorithm, assuming 8-bit two's complement integers: (4 pts) 1) 12 x27 8 Multiply the value 64 (expressed by 8-bit signed two's complement representation) by 2. (2 pts) 9 Divide the value -64 (expressed by 8-bit signed two's complement representation) by 4 . ( 2 pts) 10 Express the following binary fraction in normalized floating-point form using the simple model with excess-15 bias: (2 pts) 1) 34.0625.

1. /* M | 0 1 2 3 4 5 6 7
--------------------------
0 | 0 0 0 1 0 0 0 0
1 | 0 1 1 1 0 0 1 0
2 | 0 1 0 1 0 0 1 0
3 | 0 1 0 1 1 1 1 0
4 | 0 1 0 0 0 0 1 1
5 | 0 1 1 0 1 1 1 0
6 | 0 0 0 0 1 0 0 0
7 | 0 0 0 0 1 0 0 0
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE;
typedef struct LINKED_STACK_NODE_s {
LINKED_STACK_NODE next;
void *data;
} LINKED_STACK_NODE_t[1];
typedef struct LINKED_STACK_s {
LINKED_STACK_NODE head;
} LINKED_STACK_t[1], *LINKED_STACK;
typedef struct{
int R;
int C;
}POS_t[1], *POS;
int linked_stack_is_empty(LINKED_STACK stack) {
return stack->head == NULL;
}
LINKED_STACK linked_stack_init() {
LINKED_STACK stack = malloc(sizeof(LINKED_STACK_t));
stack->head = NULL;
return stack;
}
void linked_stack_push(LINKED_STACK stack, void *data) {
LINKED_STACK_NODE new = malloc(sizeof(LINKED_STACK_NODE_t));
if (new != NULL) {
new->data = data;
new->next = stack->head;
stack->head = new;
} else {
printf("Memory allocation error!n");
exit(0);

2. }
}
void *linked_stack_pop(LINKED_STACK stack) {
LINKED_STACK_NODE temp;
void *result = NULL;
if (stack->head != NULL) {
temp = stack->head;
stack->head = temp->next;
result = temp->data;
free(temp);
} else {
printf("Stack is emptyn");
exit(0);
}
return result;
}
void linked_stack_free(LINKED_STACK stack) {
while (stack->head != NULL) {
linked_stack_pop(stack);
}
free(stack);
}
void linked_stack_print2(LINKED_STACK s, int M[8][8]){
LINKED_STACK_NODE node = s->head;
while(node != NULL){
POS pos = (POS)node->data;
printf("(%d,%d)=%d ", pos->R, pos->C, M[pos->R][pos->C]);
node = node->next;
}
printf("n");
}
void solve_maze(){
int M[8][8] = {
/****** 0 1 2 3 4 5 6 7 */
/* 0 */ { 0, 0, 0, 1, 0, 0, 0, 0 },
/* 1 */ { 0, 1, 1, 1, 0, 0, 1, 0 },
/* 2 */ { 0, 1, 0, 1, 0, 0, 1, 0 },
/* 3 */ { 0, 1, 0, 1, 1, 1, 1, 0 },
/* 4 */ { 0, 1, 0, 0, 0, 0, 1, 1 },
/* 5 */ { 0, 1, 1, 0, 1, 1, 1, 0 },
/* 6 */ { 0, 0, 0, 0, 1, 0, 0, 0 },
};

3. int I, J, R = 0, C = 3;
// Write your code here!
}
int main(){
solve_maze();
return 0;
}