No, it's not the same structure as a Bloom filter without empty slots. It's the same structure as a Bloom filter with only one hash function. Bloom filters use multiple.
multiple hash functions only exist because they don't use secure hashes (for speed reasons) so there's collisions.
Normally for passwords you would use a secure hash, negating this
No, the math on bloom filters already assumes a random oracle.