Massachusetts Institute of Technology
Department of Electrical Engineering and Computer Science
6.087: Practical Programming in C
IAP 2010
Problem Set 6
Part 2: Function pointers, hash table
Out: Thursday, January 21, 2010. Due: Friday, January 22, 2010.
Problem 6.1
In this problem, we will use and create function that utilize function pointers. The file ’call
back.c’ contains an array of records consisting of a fictitious class of celebrities. Each record consists
of the firstname, lastname and age of the student. Write code to do the following:
• Sort the records based on first name. To achieve this, you will be using the qsort() function
provided by the standard library: void qsort(void∗ arr,int num,int size,int (∗fp)(void∗ pa,void∗pb)).
The function takes a pointer to the start of the array ’arr’, the number of elements ’num’ and
size of each element. In addition it takes a function pointer ’fp’ that takes two arguments.
The function fp is used to compare two elements within the array. Similar to strcmp(), it
is required to return a negative quantity,zero or a positive quantity dependeing on whether
element pointed to by ’pa’ is ”less” than, equal to or ”greater” the element pointed to by
’pb’. You are required to write the appropriate callback function.
• Now sort the records based on last name. Write the appropriate callback function.
• The function void apply (...) iterates through the elements of the array calling a function for
each element of the array. Write a function isolder() that prints the record if the age of
the student is greater 20 and does nothing otherwise.
Problem 6.2
A useful data structure for doing lookups is a hash table. In this problem, you will be imple
menting a hash table with chaining to store the frequency of words in a file. The hash table is
implemented as an array of linked lists. The hash function specifies the index of the linked list to
follow for a given word. The word can be found by following this linked list. Optionally, the word
can be appended to this linked list. You will require the code file ’hash.c’ and data file ’book.txt’
for this problem. You are required to do the following
• The function lookup() returns a pointer to the record having the required string. If not
found it returns NULL or optionally creates a new record at the correct location. Please
complete the rest of the code.
• Complete the function cleartable() to reclaim memory. Make sure each call to malloc()
is matched with a free()
1
Department of Electrical Engineering and Computer Science
6.087: Practical Programming in C
IAP 2010
Problem Set 6
Part 2: Function pointers, hash table
Out: Thursday, January 21, 2010. Due: Friday, January 22, 2010.
Problem 6.1
In this problem, we will use and create function that utilize function pointers. The file ’call
back.c’ contains an array of records consisting of a fictitious class of celebrities. Each record consists
of the firstname, lastname and age of the student. Write code to do the following:
• Sort the records based on first name. To achieve this, you will be using the qsort() function
provided by the standard library: void qsort(void∗ arr,int num,int size,int (∗fp)(void∗ pa,void∗pb)).
The function takes a pointer to the start of the array ’arr’, the number of elements ’num’ and
size of each element. In addition it takes a function pointer ’fp’ that takes two arguments.
The function fp is used to compare two elements within the array. Similar to strcmp(), it
is required to return a negative quantity,zero or a positive quantity dependeing on whether
element pointed to by ’pa’ is ”less” than, equal to or ”greater” the element pointed to by
’pb’. You are required to write the appropriate callback function.
• Now sort the records based on last name. Write the appropriate callback function.
• The function void apply (...) iterates through the elements of the array calling a function for
each element of the array. Write a function isolder() that prints the record if the age of
the student is greater 20 and does nothing otherwise.
Problem 6.2
A useful data structure for doing lookups is a hash table. In this problem, you will be imple
menting a hash table with chaining to store the frequency of words in a file. The hash table is
implemented as an array of linked lists. The hash function specifies the index of the linked list to
follow for a given word. The word can be found by following this linked list. Optionally, the word
can be appended to this linked list. You will require the code file ’hash.c’ and data file ’book.txt’
for this problem. You are required to do the following
• The function lookup() returns a pointer to the record having the required string. If not
found it returns NULL or optionally creates a new record at the correct location. Please
complete the rest of the code.
• Complete the function cleartable() to reclaim memory. Make sure each call to malloc()
is matched with a free()
1
