Monash University > CSSE > CSE1303 > Part A > Tutorials > Tutorial A3

CSE1303 Computer Science
Summer Semester, 2003
Part A
Tutorial A3 : Lists, ADTs, and Dynamic Memory

This tute covers material from lectures A05 to A06.

There may not be time in the tutorial to cover all of these questions. Attempt at least the ones marked with an asterisk before the tutorial; these are the ones that will be focussed on during the class. If you have specific questions about unmarked questions, you can ask the tutor about them during the tutorial. If you want further revision questions, suggestions of questions from the textbooks are provided at the end of the tutorial sheet.

---

Note: The purpose of tutorials is not simply to give you the answers to these questions! (Solutions will be released in about a week online, so if all you want is the answers, there are easier ways.)

---

* Exercise 1

Write a C declaration for a list of 20 items of type float , which can be used in an array implementation of a linked list.

* Exercise 2

Given:

struct ItemRec
{
  int  number;
  char name[80];
};

typedef struct ItemRec Item;

Item* myItems;

Write a C statement so that myItems points to a dynamically created array of 10 structures of type Item.

* Exercise 3

1. Write a C function char* strdup(const char* s) which makes a copy of the string s and returns a pointer to where the copy is stored, and NULL if there is not enough memory.

2. Where should you free the memory you have allocated for the new string in the function char* strdup(const char* s) and why?

* Exercise 4

The program following this question, counts characters, words, and lines from the standard input. Rewrite the program so that the only variables are pointers, and make sure any memory allocated during the program is deallocated.

/* This program is based on a program in
*  "The C Programming Language",
*   by Brian W.  Kerninghann and Dennis M. Richie.
*/
 
#include <stdio.h>
 
#define IN  1  /* inside a word */
#define OUT 0  /* outside a word */
 
/* Count lines, words, and characters in the input */
void main()
{
   int  c;
   int  state;
   long nl;
   long nw;
   long nc;
 
   state = OUT;
   nl = nw = nc = 0;
 
   c = getchar();
   while (c != EOF)
   {
      nc++;
      if (c == '\n')
      {
         nl++;
      }
      if (c == ' ' || c == '\n' || c == '\t')
      {
         state = OUT;
      }
      else if (state == OUT)
      {
         state = IN;
         nw++;
      }
      c = getchar();
   }
   printf("%ld %ld %ld\n", nl, nw, nc);
}

Exercise 5. (Will not be on the exam)

Identify Abstract Data Types in a computer game.

Exercise 6

Modify the declaration of a stack and the function initializeStack given in lectures so that the stack can store any number of items of type float, and the maximum number of items it does store is determined when the stack is initialized.

ADDITIONAL EXERCISES

Kruse et al.
    Exercises 4.5: E1 a, b, i, j, n, E2, E4, E5
    Review Questions Chapter 4: 5, 8, 20
    Exercises 5.2: E1, E2

Deitel & Deitel (2e)
    Self Review Exercises: 12.1 a, b, g

[ Top | Home ]

Last modified: Tuesday 02 December 2003 22:29:33