COP 4600 - Discussion 3

Introduction to C Programming-3

Every week at the end of discussion exercises will be given. You will have to submit them at the beginning of the next discussion on paper.

These may possibly count as bonus credit at the end of the semester, so try to do them.

1. Exercise 1: Linked Lists (Update: Solution here)>
   

   Using the "node" struct defined earlier, define a set of methods which would allow you to modify and work with a linked list of int type. Create these methods:

   • bool addEntry(struct *firstNode, nt number); // Should dynamically allocate memory at the end of the list and add an integer. firstNode = first node of the linked list.
     
                                                                                     Returns 1 if sucessfully added, 0 if not.
     		

   • int size(struct *firstNode);    // Returns the size of the linked list. "node" should be the first node in the list. 
     		

   • struct node *findNode(struct *firstNode, int match);    // Returns a pointer to the node containing "match". "node" should be the first node in the list. 
     
     																				   Returns a null pointer if no match is found.