---

CS255 Homework Assignment 6 - Linked lists in C (read Section 28 of the syllabus: click here)

---

• Preparation

  • To do this project, you must obtain a copy of the prepared files with EGTAPI

    Use project code hw6

    You will have create a hw6 folder containing these program files:

    Makefile Makefile for homework 5 list.h Header file containing the struct definition for Node and function headers in hw6.c hw6.c C Project file for hw6 where you write 4 functions test1.c Test program for the insertAt() function test2.c Test program for the deleteAt() function test3.c Test program for Node de-allocation

  ---

  ---

  ---

• Study material

  • We have discussed insertion (at front and at end) and deletion (at front and at end) in a linked list.

  • This homework is to reinforce your understanding of list manipulation.

    The list data structure used in this assignment is the same as the one discussed in class.

  • If necessary, review Section 28 of the Syllabus: click here

  ---

  ---

• Part 1 of the assignment
  • Part 1: (40 pts)

    Write the function struct Node *insertAt(struct Node *h, int x, int pos ) that inserts x into the linked list h at the position pos The insertAt( ) function must return the new first list element (= node) of the linked list. The pos parameter is to be interpreted as follows: insertAt(h, x, 0): inserts x as the first element in the list insertAt(h, x, 1): inserts x as the 2nd element in the list = insert after the first element insertAt(h, x, 2): inserts x as the 3rd element in the list = insert after the 2nd element and so on... If there are n elements in the list, and pos > n, then the insertAt( ) will fail and the function must return the original list

  • How to compile and test your insertAt() function:

    Use test1.c to test your insertAt( ) function. To compile the test1 program to test your insertAt( ) function, type this command: make test1 To run the test1 program, type this command: test1

  ---

  ---

• Part 2 of the assignment
  • Part 2: (40 pts)

    Write the function struct Node *removeAt(struct Node *h, int pos ) that removes the list element (= node) at position pos from the linked list h The removeAt( ) function must return the new first list element (= node) of the linked list. The pos parameter is to be interpreted as follows: removeAt(h, 0): removes the first element from the list h removeAt(h, 1): removes the 2nd element from the list h removeAt(h, 2): removes the 3rd element in the list h and so on... If there are n elements in the list, and pos > n-1, then the removeAt( ) will fail and the function must return the original list If h is an empty list, removeAt( ) must return the empty list

  • How to compile and test your removeAt() function:

    Use test2.c to test your removeAt( ) function. To compile the test2 program to test your removeAt( ) function, type this command: make test2 To run the test2 program, type this command: test2

  ---

  ---

• Part 3 of the assignment
  • Part 3: (20 pts)

    Part 3 of the assignment tests whether your have correctly de-allocated the list elements

  • How to perform the de-allocation test:

    Use test3.c to perform the de-allocation test. To compile the test3 program to test whether you have de-allocated the garbage in your code correctly: make test3 To run the test3 program, type this command: sh run-test3

  ---

  ---

  ---

  ---

• Debugging help
  • Crashes:

    A C program can crash without giving you any hint on which statement causes the crash If your C program crashes, you must use a debugger to locate the crash site (= the statement that causes the crash)

    I have discussed how to use the gdb debugger in class and you can find my gdb slides here: click here

  ---

  ---

• Turn in

  Use EGTAPI to turn in your hw6.c program file with assignment code hw6

  ---

  ---

  ---

  ---

• Extension request
  • Use EGTAPI to request an extension with the assignment code hw6

    You must make the extenion request before the deadline of the homework

    Your request will be successful if you have not exceeded the maximum number of "free" (no-questions-asked) requests allowed