Shows how to delete the front node of a linked list, including throwing and catching exceptions. Uses a non-object oriented approach in which the front of the linked list is sent as parameter to the deleting method, and returned from it. Part of a series of lessons in data structures and algorithms by Sesh Venugopal. http://www.cs.rutgers.edu/~venugopa