辅导CS3012 Translate Assembly Language辅导data structure编程

#include lt;stdio.hgt;
#include lt;stdlib.hgt;

#define QUEUESIZE   8
#define MODMASK     0x7
#define FALSE       0
#define TRUE        1

/* Function Prototypes */
void enqueue(int value);
int dequeue();
int queueFull();
int queueEmpty();
void display();

/* Global Variables */
int queue[QUEUESIZE];
int head = -1;
int tail = -1;

int main()
#123;
  int operation, value;
    
  do #123;
    system("clear");
    printf("### Queue Operations ###\n\n");
    printf("Press 1 - Enqueue, 2 - Dequeue, 3 - Display, 4 - Exit\n");
    printf("Your option? ");
    scanf("%d", amp;operation);

    switch (operation) #123;
    case 1:
      printf("\nEnter the positive integer value to be enqueued: ");
      scanf("%d", amp;value);
      enqueue(value);
      break;
    case 2:
      value = dequeue();
      if (value != -1)
	printf("\nDequeued value is %d\n", value);
      break;
    case 3:
      display();
      break;
    case 4:
      printf("\nTerminating program\n");
      exit(0);
    default:
      printf("\nInvalid option! Try again.\n");
      break;
    #125;
    printf("\nPress the return key to continue . . . ");
    getchar();
    getchar();
  #125; while (operation != 4);
    
  return 0;
#125;

void enqueue(int value)
#123;
  if (queueFull()) #123;
    printf("\nQueue overflow! Cannot enqueue into a full queue.\n");
    return;
  #125;
  
  if (queueEmpty()) #123;
    head = tail = 0;
  #125; else #123;
    tail = ++tail amp; MODMASK;
  #125;
  queue[tail] = value;
#125;

int dequeue()
#123;
  register int value;
    
  if (queueEmpty()) #123;
    printf("\nQueue underflow! Cannot dequeue from an empty queue.\n");
    return (-1);
  #125;
  
  value = queue[head];
  if (head == tail) #123;
    head = tail = -1;
  #125; else #123;
    head = ++head amp; MODMASK;
  #125;
  return value;
#125;

int queueFull()
#123;
  if (((tail + 1) amp; MODMASK) == head)
    return TRUE;
  else
    return FALSE;
#125;

int queueEmpty()
#123;
  if (head == -1)
    return TRUE;
  else
    return FALSE;
#125;

void display()
#123;
  register int i, j, count;
    
  if (queueEmpty()) #123;
    printf("\nEmpty queue\n");
    return;
  #125;

  count = tail - head + 1;
  if (count lt;= 0)
    count += QUEUESIZE;
  
  printf("\nCurrent queue contents:\n");
  i = head;
  for (j = 0; j lt; count; j++) #123;
    printf("  %d", queue[i]);
    if (i == head) #123;
      printf(" lt;-- head of queue");
    #125;
    if (i == tail) #123;
      printf(" lt;-- tail of queue");
    #125;
    printf("\n");
    i = ++i amp; MODMASK;
  #125;
#125;

char *month[] = #123;"January", "February", "March", "April", "May",
                 "June", "July", "August", "September", "October",
                 "November", "December"#125;;
char *season[] = #123;“Winter”, “Spring”, “Summer”, “Fall”#125;;