We give an effective bound of the joint spectral radius $ρ(Σ)$ for a finite set $Σ$ of nonnegative matrices: For every $n$, \[ \sqrt[n]{\left(\frac{V}{UD}\right)^{D} \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\inΣ}(A_1\dots A_n)_{i,j}} \le ρ(Σ) \le \sqrt[n]{D \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\inΣ}(A_1\dots A_n)_{i,j}}, \] where $D\times D$ is the dimension of the matrices, $U,V$ are respectively the largest entry and the smallest entry over all the positive entries of the matrices in $Σ$, and $C$ is taken over all strongly connected components in the dependency graph. The dependency graph is a directed graph where the vertices are the dimensions and there is an edge from $i$ to $j$ if and only if $A_{i,j}\ne 0$ for some matrix $A\inΣ$. Furthermore, a bound on the norm is also given: If $ρ(Σ)>0$ then there exist a nonnegative integer $r$ and two positive numbers $α,β$ so that for every $n$, \[ αn^r{ρ(Σ)}^n \le \max_{A_1,\dots,A_n\inΣ} \|A_1\dots A_n\| \le βn^r{ρ(Σ)}^n. \] Corollaries of the approach include a simple proof for the joint spectral theorem for finite sets of nonnegative matrices and the convergence rate of some sequences. The method in use is mostly based on Fekete's lemma, for both submultiplicative and supermultiplicative sequences.