I suggest you learn both algorithms on a conceptual level first if you have not already. It will help you as you are implementing them. Wikipedia is a good source for the basic knowledge of how a graph gets traversed with each algorithm.
Additionally, the Design and Analysis of Algorithms Part I on Coursera that I showed you earlier has video lectures on both BFS and DFS as well as pseudocode implementations of each. Both algorithms are pretty intuitive, so don’t expect to not understand it or something.
However, you need to know what a Stack and a Queue are. Stacks are used in DFS while Queues are used in BFS. It’s imperative that you know both of those before attempting to implement them (especially for BFS).
As far as problems on CodeChef that are only DFS/BFS, I don’t know any since I don’t participate in the practice section too often. However, I do know that the problem CHEFHACK on the January Challenge did require DFS (but it was a flood-fill implementation, so I suggest you hold off on this problem until you are a bit more solid on the implementations of each).
TopCoder has a nice tutorial on DFS and BFS. It also gives you three practice problems. Unfortunately, they’re also fairly advanced for a beginner.
The only place I know of with DFS/BFS problems for beginners is the USACO Training Gateway. If you have an account there, I can point out which ones you should do.
What i do is find questions tagged with some concept. http://discuss.codechef.com/tags/dfs/
sort them in decreasing order of no of views, and other parameters of your choice. start solving, because the questions having more views are tend to be easier or interesting most of the time. so here is the list of increasing order of difficulty!!!