a function that take as input two linked lists of character and determines if the first is a sub list of the second.
for example if the first list 'e'-->'l'-->'l'and the second is
'h'-->'e'-->'l'-->'l'-->'o' the function returns true

We got what your question is but sorry to say you wont get any help here until you work on it first. Try coding it stage by stage.Let it be primitive itself don't worry.Code it and then come back to us for help.We will be very happy to help.

Here's a good starting point on linked lists.
As csurfer mentioned: try something yourself and post your efforts here to receive more help.