Page

1

of

4

Computer Science Foundation Exam

May 19, 2018

Section I A

DATA STRUCTURES

SOLUTION

NO books, notes, or calculators may be used,

and you must work entirely on your own.

Name:

___________________________________________

UCFID:

___________________________________________

NID:

Question #

Max Pts

Category

Score

1

5

DSN

2

10

DSN

3

10

ALG

TOTAL

25

----

Problems will be graded based on the completeness of the solution steps and not

graded based on the answer alone.

Summer 2018

Data Structures Exam, Part A

Page

2

of

4

1)

(5 pts) DSN (Dynamic Memory Management in C)

Suppose we have an array of structures containing information about our group for a group project.

Each

index should contain a group member’s name and phone number.

The structure is shown below: names

are stored as dynamically allocated strings and phone numbers are stored as integers.

When the semester

is over, we will delete this array.

Write a function called deleteGroup that will take in this array and delete

all the information, freeing all the memory space that the array previously took up.

Your function should

take 2 parameters: a pointer to the beginning of the array and an integer indicating the number of group

members.

It should return a null pointer representing the now empty array.

typedef struct GroupMember {

char *name;

int phoneNumber;

} GroupMember;

GroupMember* deleteGroup (GroupMember

*group, int numMembers) {

int i;

for(i=0; i<numMembers; i++)

//1 pt

free(group[i].name);

//2 pts

free(group);

//1 pt

return NULL;

//1 pt

}

Summer 2018

Data Structures Exam, Part A

Page

3

of

4

2)

(10 pts) ALG (Linked Lists)

Suppose we have a linked list implemented with the structure below.

Write a function that will take in a

pointer to the head of list and inserts a node storing -1 after each even value in the list. If the list is empty

or there are no even values in the list, no modifications should be made to the list. (For example, if the

initial list had 2, 6, 7, 1, 3, and 8, the resulting list would have 2, -1, 6, -1, 7, 1, 8, -1.)

typedef struct node {

int data;

struct node* next;

} node;

void markEven(node *head) {

node* tmp = head;

while (tmp != NULL) {

// 2 pts iter whole list

while (tmp != NULL && tmp->data%2 != 0) //3pts find next even

tmp = tmp->next;

if (tmp != NULL) {

// 1 pt no null error

node* newnode = malloc(sizeof(node));

newnode->data = -1;

// 2 pts make new node

newnode->next = tmp->next;

// 2 pts patch it into

tmp->next = newnode;

// list

tmp = newnode;

}

}

}