Following is the source code for the Tribonacci Function in C Programming

int f (int n)
{  if (n<3)
       return 1;
    if (n>=3)
        return f(n-1) + f(n-2) + f(n-3);
}
main()
{  int n;
    printf ("Enter a number: ");
    scanf ("%d", &n);
    printf ("%d\n", f(n));
}

The following source code will print out the length of a string in C Programming

#include <stdio.h>
main()
{  char s[81];
printf("Enter string: ");
scanf("%s", s);
printf("length = %d\n", len(s));
}
int len(char s[])
{  if(*s)
        return 1+len(++s);
return 0;
}

Following is the three different type of source code for writing to and reading from a file using C programming

1)
#include <stdio.h>
int main()
{
   char c;
   FILE *fpntr;
   fpntr = fopen("textFile","r");
   while(fscanf(fpntr,"%c", &c)==1)
        putchar(c);
   fclose(fpntr);
}

Following is the source code for checking if three numbers are the sides of a right triangle using C programming.

Following is the source code for binary recursive search:

#include <stdio.h>
#define N 20

Following is the source code for Linear Recursive Search:

#include <stdio.h>
#define N 20

Following is the source code to create a simple linked list:

struct node_struct
{  int data;
   struct node_struct *next;
}*list,*curr;

Following is the source code to create a Linked List Kernel (car, cdr, cons, empty list, printlist, readlist etc.)

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>

int checking = 0;                   
typedef int boolean;
typedef char data;

Following is the Source Code to Create Linked List Functions and Procedures (Delete All, Delete First, Delete Last)

(1)
list del_all (list L, data alpha)
{
 if (null(L))
  return nullist();
 else if (car(L) = = alpha)
  return del_all(cdr(L), alpha);
 else
  return cons(car(L), del_all(cdr(L), alpha));
}

Following is the Source Code to Create Linked List Functions and Procedures (Copy, Rotate, Delete Last Element and Subtract)

(1)
list copy (list L)
{
 list J;
 if (null(L))
  J = nullist();
 else
  J = cons(car(L), copy (cdr(L)));
 return  J;
}