int BeginQuizFirstTry (NODEPTR *headListPtr1,
		       NODEPTR *headListPtr2,
		       int numberOfTotalQuestions)
{
   /*  Display a message indicating that the quiz has
       begun for the user.                             */
   printf ("Here are your questions. Good luck !!!\n\n");
   
   
   
   NODEPTR curr = *headListPtr1;
   NODEPTR temp;
   char questionAnswer [NUMBEROFANSWERCHARACTERS];
   char quizCorrectAnswer [NUMBEROFANSWERCHARACTERS];
   int questionCounter = 0;
   int correctAnswerCounter = 0;
   QUIZ deletedQuestion;
   
   while (curr != NULL)
   {
      questionCounter++;
      
      printf ("   %d. ", questionCounter);
      DisplayQuestion (curr);
      
      scanf ("%s", questionAnswer);
      
      strcat (questionAnswer, "\n");
      
      if (CheckAnswer (curr, questionAnswer,
		       &correctAnswerCounter) != 1)
      {
	 strcpy (deletedQuestion.question, curr -> data.question);
	 strcpy (deletedQuestion.answer, curr -> data.answer);
	 
	 temp = CreateNode ();
	 SetData (temp, deletedQuestion);
	 Insert (headListPtr2, temp);
	 
	 strcpy (quizCorrectAnswer, curr -> data.question);
	 
	 if (curr != NULL)
	 {
	    curr = curr -> next;
	 }
	 
	 TestDelete (headListPtr1, quizCorrectAnswer);
      }
      else
      {
	 /*  Set the node pointer referencing the current node
	     (the current question in the quiz) to point to the
	     next node in the list, or the next question in the
	     quiz.                                               */
	 curr = curr -> next;
      }
   }
   
   printf ("\n\n%d", correctAnswerCounter);
   
   return 1;
}

int TestDelete (NODEPTR *headPtr, char *target)
{
   NODEPTR temp, prev, curr;
   
   if (IsEmpty (*headPtr))
   {
      printf ("Empty List\n\n");
      return (-1);
   }
   else if (strcmp ((*headPtr) -> data.question, target) == 0)
   {
      temp = *headPtr;
      *headPtr = (*headPtr) -> next;
      
      free (temp);
      
      return 1;
   }
   else
   {
      prev = *headPtr;
      curr = (*headPtr) -> next;
      
      while (curr != NULL && strcmp (curr -> data.question, target))
      {
	 prev = curr;
	 curr = curr -> next;
      }
      
      if (curr != NULL)
      {
	 temp = curr;
	 prev -> next = curr -> next;
	 
	 free (temp);
	 
	 return 1;
      }
      else
      {
	 printf ("%s not found\n\n", target);
	 
	 return (-1);
      }
   }
}