1. Matching sub lists
Given a list containing only 0 and 1, to find out whether each occurrence of [0, 1] is followed (not necessarily immediately) by an occurrence of [1, 0, 0].
2. Minimum cost path of a graph Given the non-directed graph:
1| 2, 4
2| 3
3| 4, 6
5| 6
Task is to find out the least cost path from node 1 to node 6.
3. Formatting a Prolog Code Given a prolog code in an external file, to show it with proper formatting.