Untitled

Generating Test Cases from Mobile Application using Depth First Search and Backtracking Techniques

“…Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point of time (by time, here, is referred to the time elapsed till reaching any level of the search tree). Backtracking Algorithm is usually applied to avoid or reduce the possibility of fail pathways in a maze or a puzzle [10]. Other than backtracking while fail in pathway, the backtracking technique may also be applied in the way to start its path from the end to find all possible path way to reach end from start by backtracking from end to start without leaving out any possible pathway [9].…”

“…As each end of the tree will result in one unique test case path; by starting from each end nodes, it will reduce the number of loops, and reduce the deciding time. Backtracking may go through all possible nodes and make sure there is no any possible test cases paths left out [10]. This research aims to know which of Depth First Search technique or Backtracking technique is more suitable for generating test cases.…”