C Pointer Coding Katas

General

Prerequisites

• Valgrind is installed (https://github.com/ivosh/valgrind)

Usage

Clone the Repository and start by creating a branch for your current Kata Execution using git checkout -b kata/<user>/<iteration>.

• <user> is your github user
• <iteration> is an increasing integer tracking kata executions

This helps to keep things orderly.

Please use the provided run.sh shell script to run your programs. i.e.: ./run.sh ex_01

This will compile your file to and run it with valgrind to detect any memory leaks. The Goal is to complete all Katas in a way that has no memory leaks.

Each solution should live in its own .c file. For this reason stub files are provided. You can verify your setup by running ./run.sh ex_01. If there are no errors, you should be good to go!

Happy Coding!

Katas

1. Write a function to print a variable and its address void my_print(int* a)
2. Write a function which increments an integer using pointers void increment(int* a)
3. Write a function to add two numbers using only pointers int add(int* a, int* b)
4. Write a function to add two numbers using only pointers using an output parameter void add(int* a, int* b, int* output)
5. Print a String "character by character" by advancing its pointer to the next character using another function void advance_pointer(???)
6. Write a function to concatenate two strings. Assume that they end properly in '\0'. char* my_concat(char* a, char* b)
7. Write a function to concatenate two strings using an output parameter. Assume that they end properly in '\0'. void my_concat(char* a, char* b, char* output)
8. Write a function to open a file. FILE* my_open(char* path)
9. Write a function to close a file int my_close(FILE* file)
10. Using the Following single-linked list template write a function each to:

   struct node {
    int data;
    struct node *next;
   };

a) create the linked list
b) populate the linked list (add an element)
c) traverse the linked list (print all elements)
d) remove an element from the linked list by position (i.e. the 4th element)
e) remove an element from the linked list by value (i.e. the element with value 6)
f) get length of linked list
g) reverse the linked list
h) release the linked list
i) swap two elements in the list

9. Repeat exercise 3, but using a double linked list:

   struct node {
    int data;
    struct node *next;
    struct node *prev;
   };

10. Using the Following binary-tree template write a function each to:

   struct node {
    int data;
    struct node *left;
    struct node *right;
   };

a) create the tree
b) populate the tree (add an element)
c) traverse the tree in order (print all elements, elements should be printed in asc order (sorted))
e) remove an element from the linked list by value (i.e. the element with value 6)
f) get number of elements in the tree
g) reverse the tree
h) release the tree