We determine the linear complexity of binary sequences derived from the polynomial quotient modulo p defined by $F(u)\equiv \frac{f(u)-f_p(u)}{p} ~(\bmod~ p), \qquad 0 \le F(u) \le p-1,~u\ge 0,$ where f_p(u)≡f(u) (mod p), for general polynomials $f(x)\in \mathbb{Z}[x]$. The linear complexity equals to one of the following values {p²-p,p²-p+1,p²-1,p²} if 2 is a primitive root modulo p², depending on p≡1 or 3 modulo 4 and the number of solutions of f'(u)≡0 (mod) p, where f'(x) is the derivative of f(x). Furthermore, we extend the constructions to d-ary sequences for prime d|(p-1) and d being a primitive root modulo p².