Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing prob- ability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and sym- metric walks on the hypercube from the viewpoint of absorbing proba- bility and time. Our results may be suggestive in constructing efficient quantum algorithms for combinatorial problems such as SAT.