Review of singlely linked list C
Stylistic/Function


Your list holds values of type int yet you named the node type very specific in relation to file descriptors which will be a bit weird if you make a list of lets say prime numbers you want to operate on. Consider renaming your node type to something more generic rather than file (especially sincere there is a FILE type in &lt;stdio.h&gt;)
Your insert method actually doesn't insert an element, it appends it to the end so it should be named append.
delete doesn't work when the node you want to delete is head. I know you handle that case separately in get_choice but it's still bad that the caller has to know that fact. It also clutters the code with lots of special handling.
dump is a bit weird: It skips the first one, then prints all following nodes in order and then prints the first one. So while it prints out all nodes I'd say it's still unexpected from a usage point of view.
None of your methods can deal with the fact if NULL is being passed in. 
If you typedef your structs then you can save some typing work.


Structural/Design


Your list does not have a nice API to use. You can see that in get_choice which is cluttered with handling of many special cases.
Some methods like insert (size/length would be a different candidate) are inefficient as you have to iterate the entire list first. You could avoid that by keeping a separate tail pointer.


I suggest you create a list object which holds head, tail and possibly length of the list and all your methods should operate on an object of that list type rather than nodes. Something along these lines:

typedef struct node_
{
    int value;
    struct node *next;
} node;

typedef struct list_
{
    struct node *head;
    struct node *tail;
    int length;
} list;


And then define some methods to operate on:

// creates a new empty list
list *new_list()
{
}

// deletes the list and all the nodes
void delete_list(list *l)
{
}

// appends new value to the list
void append(list *l, int value)
{
}

// insert a value at a given position
void insert(list *l, int value, int position)
{
}

// deletes the first node with the given value from the list
// return 1 if node found and deleted, 0 otherwise
int delete_item(list *l, int value)
{
}

// returns the first node with the given value or NULL if not found
node *find(list *l, int value)
{
}

// prints the content of the list
void print_list(list *l)
{
}


Your get_choice method would then look like this:

int get_choice(void) {
    int choice;
    int val;
    list *myList = new_list();
    while ( true ) {
        printf ("\n[Choices - Insert=1, Delete=2, Locate=3, Dump=4, Exit=5]\n");
        printf ("\nEnter selection: ");
        scanf("%d", &amp;choice);
        switch (choice) {
            case (1): 
                printf ("Enter value: ");
                scanf ("%d", &amp;val);
                append(myList, val);
                break;
            case (2):
                if (myList-&gt;length &gt; 0) { 
                    printf ("Enter value: ");
                    scanf ("%d", &amp;val); 
                    if (!delete_item(myList, val))
                    {               
                        printf ("Value %d not in list\n", val);
                    }
                }
                else {
                    printf ("List is empty!\n");
                }
                break;
            case (3): 
                if (myList-&gt;length &gt; 0) {
                    printf ("Enter value: ");
                    scanf ("%d", &amp;val); 
                    if (find(myList, val) == NULL) {
                        printf ("Value %d not in list\n", val);
                    }
                }
                else {
                    printf ("List is empty!\n");
                }
                break;
            case (4): 
                if (myList-&gt;length &gt; 0) { 
                    print_list(myList);
                }
                else {
                    printf ("Nothing to dump!\n");
                }
                break;
            case (5): 
            return 0;
        }
    }
}