Question

Using the program segment and sample txt file below, write a program that contains a linked list of students. The program should allow the user to:

1. initialize list of students

2. add additional student to front of list

3. add additional student to rear of list

4. delete student

5. sort students alphabetically

6. sort students by idNum

7. show number of students in list

8. print students

9. quit program

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

The program should be divided into the following segments

1. mainDriver.c. (contains main()function)
2. sll_list.h (given below. header file for this singly linked-list program)
3. sll_list.c (implementation file for singly linked-list program)
4. students.txt (given below, contains students for initializing linked-list)

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Function prototypes:

list_t *newList( ); // creates a new list; returns a pointer to the new list

student_t *addStudent( FILE *inFile, int whichInput );
// called by addToFront() and addToRear() functions
// creates and initializes new student node from input file pointer sent in (either file pointer specified on command-line or stdin that has been reset)
// whichInput is intended to be a flag will which determine if the user prompts are to be printed or not
// returns a pointer to the student that was just created

int printMenu( );
// prints the menu to the user; returns the menu choice

void initializeList( list_t *list, FILE *inFile );
// calls addToFront() sending input file pointer (file specified at the command-line)
// note – first value in input file is number of students in file – the first value read in from file so you know how many times the loop needs to go

void addToFront( list_t *list, int whichInput, FILE *inFile );
// creates new student by calling addStudent() then adds returned student to front of list

void addToRear( list_t *list, int whichInput, FILE *inFile );
// creates new student by calling addStudent() then adds returned student to end of list

void deleteStudent( list_t *list, int idNum );
// deletes the student with the cuid sent in as idNum

void sortListByLN( list_t *list );
// sorts the list alpahabetically by last name

void sortListByNum( list_t *list );
// sorts the list by cuid

int size( list_t *list );
// returns the size of the list

int isEmpty( list_t *list );
// returns 1 if the list is empty and 0 if it is not empty

void printStudents ( list_t *list );
// prints the students in the list

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
// ssl_list.h //

#ifndef SLL_LIST_H
#define SLL_LIST_H

typedef struct {
   char month[4];
   int day, year;
} dateOfBirth;

typedef struct student {
int age;
float gpa;
int Num;
dateOfBirth dob;
char lastName[20];
char firstName[15];
struct student *next;
} student_t;

typedef struct list {
student_t *head;
student_t *tail;
int size;
} list_t;

list_t *newList( );
student_t *addStudent( FILE *inFile, int whichInput );
int printMenu( );
void initializeList( list_t *list, FILE *inFile );
void addToFront( list_t *list, int whichInput, FILE *inFile );
void addToRear( list_t *list, int whichInput, FILE *inFile );
void deleteStudent( list_t *list, int Num );
void sortListByLN( list_t *list );
void sortListByNum( list_t *list );
int size( list_t *list );
int isEmpty( list_t *list );
void printStudents ( list_t *list );

#endif /* SLL_LIST_H */

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXx

students.txt

5
19 3.2 123456789 Jan 31 1999 Smith David
20 3.0 456789123 Mar 7 1998 Jackson Susan
18 2.9 789123456 May 14 2000 Miller Scott
19 3.4 987654321 Sep 12 1999 Wilson Marie
20 3.7 654321987 Jun 21 1998 Johnson Curtis

Answer 1

answer:

Solution(s):

The below code represents the implementation of all the functions that are applied on the students list...

#include<stdio.h>
typedef struct {
char month[4];
int day, year;
} dateOfBirth;

typedef struct student {
int age;
float gpa;
int idNum;
dateOfBirth dob;
char lastName[20];
char firstName[15];
struct student *next;
} student_t;

typedef struct list {
student_t *head;
student_t *tail;
int size;
} list_t;
void intialize_students(list_t t)
{
int i;
student_t *k,*p;
for(i=0;i<t.size;i++)
{
k=(student_t *)malloc(sizeof(student_t));
scanf("%d %d %d %s %d %s %s %f",&(k->idNum),&(k->age),&(k->dob->day),&(k->dob->month),&(k->dob->year),&(k->firstName),&(k->lastName),&(k->gpa));
if(t.head==NULL)
t.head=k;
else
{
p=t.head;
while(p->next!=NULL)
{
p=p->next;
}
p->next=k;
k->next=t.tail;
}
}
}
void add_additional_student_front(list_t l)
{
student_t *k;
k=(student_t *)malloc(sizeof(student_t));
scanf("%d %d %d %s %d %s %s %f",&(k->idNum),&(k->age),&(k->dob->day),&(k->dob->month),&(k->dob->year),&(k->firstName),&(k->lastName),&(k->gpa));
k->next=l.head;
l.head=k;
}
void add_additional_student_tail(list_t l)
{
student_t *k;
k=(student_t *)malloc(sizeof(student_t));
scanf("%d %d %d %s %d %s %s %f",&(k->idNum),&(k->age),&(k->dob->day),&(k->dob->month),&(k->dob->year),&(k->firstName),&(k->lastName),&(k->gpa));
k->next=l.tail;
l.tail=k;
}
void delete_sutdent(list_t l,int id)
{
student_t *k,*p;
if(l.head!=NULL)
{
k=l->head;
while(k!=NULL)
{
if(k->idNum==id)
{
p->next=k->next;
free(k);
break;
}
else
{
p=k;
k=k->next;
}
}
}
}
void sort_aplhabet(list_t l)
{
student_t *t,*p;
int i=0;
if(l.head==NULL)
{
}
else{
t = l.head;
p=NULL;
while(t->next != p)
{
if(strcmp(t->firstName,t->next->firstName)>0)
{
swap(t,p);
i==1;
}
t=t->next;
}
p=t;
}
}
void swap(student_t s,student_t p)
{
student_t temp;
temp.age=s->age;
temp.idNum=s->idNum;
temp.gpa=s->gpa;
temp.dob.day=s->dob->day;
temp.dob.month=s->dob->month;
temp.dob.year=s->dob->year;
strcpy(temp.firstName,s->firstname);
strcpy(temp.lastName,s->lastname);
s->age=p->age;
s->dNum=p->idNum;
s->gpa=p->gpa;
s->dob->day=p->dob->day;
s->dob->month=p->dob->month;
s->dob->year=p->dob->year;
strcpy(s->firstName,p->firstname);
strcpy(s->lastName,p->lastname);
p->age=temp.age;
p->idNum=temp.idNum;
p->gpa=temp.gpa;
p->dob->day=temp.dob.day;
p->dob->month=temp.dob.month;
p->dob->year=temp.dob.year;
strcpy(p->firstName,temp.firstname);
strcpy(p->lastName,temp.lastname);
}
void sort_idnum(list_t l)
{
student_t *t,*p;
int i=0;
if(l.head==NULL)
{
}
else{
t = l.head;
p=NULL;
while(t->next != p)
{
if(t->idNum>t->next->idNum)
{
swap(t,p);
i==1;
}
t=t->next;
}
p=t;
}
}
void count_students(list_t l)
{
student_t temp;
int count=0;
if(l.head==NULL)
{
printf("Student list is empty");
}
else
{
student_t *temp=l.head;
count=0;
while(temp!=NULL)
{
count++;
temp=temp->next;
}
printf("student list contains:%d students",count);
}

}
void print_students(list_t l)
{
student_t *temp;
if(l.head==NULL)
{
printf("Student list is empty");
}
else
{
temp=l.head;
printf("id\t last_name\t firstname\t date\t month\t year\t gpa\n");
while(temp!=NULL)
{
printft("%d\t%s\t%s\t%d\t%s\t%s\t%f\n",temp->idNum,temp->lastName,temp->firstName,temp->dob.day,temp->dob.month,temp->dob.year,temp->gpa);
temp=temp->next;
}
}
}
int main()
{
int choice,list_size,id;
do
{
printf("1. initialize list of students\n2. add additional student to front of list\n3. add additional student to rear of list\n4. delete student\n5. sort students alphabetically\n6. sort students by idNum\n7. show number of students in list\n8. print students\n9. quit program\n");
scanf("%d",&choice);
list_t l;
l.head=NULL;
l.tail=NULL;
switch(choice)
{
case 1:// initialize list of students
scanf("%d",list_size);
l.size=list_size;
intialize_students(l);
break;
case 2://add additional student to front of the list:
add_additional_student_front(l);
break;
case 3://add additional student to tail of the list:
add_additional_student_tail(l);
break;
case 4://delete student
scanf("%d",id);
delete_sutdent(l,id);
break;
case 5://sort students aplhabetically
sort_aplhabet(l);
break;
case 6://sort students by id
sort_idnum(l);
break;
case 7: //number of students in the list
count_students(l);
break;
case 8: //printing students in the list
print_students(l);
break;
case 9:
printf("quiting from the program");
break;
}
}while(choice!=9);
return 0;
}