Java synchronized block question...

Question

If I have the following setup
Hashtable h = ...; // there will only be one instance of h in the program's execution
public void A(...) {
    syncronized(h) {
        // read or write from h
public void B(...) {
    syncronized(h) {
        // read or write from h
}I understand that only one of the synchronized blocks can execute at a time, however, does that also mean that each will be seeing the most recent copy of h? For instance, if I write something to h in A(), can I be guaranteed that when I read from h in B() that I will always read h directly from memory and not some cached value on that particular thread?
Thanks!

Answer 1

I was under the impression though that if thread 1 calls A() and adds something to h, then thread 2 calls B() and reads from h that thread 2 might have a different copy of h and not see the change that thread 1 made.
I've been looking around and it seems that as long as you used synchronized as soon as the lock ends any changes to the object will be written to the main memory and also any time a lock starts the object is read from memory and not from that particular thread's cache (which may not contain the recent changes). Which I guess answers my original question, and Yes, each time one of those sync blocks starts they will have the most recent value of h, no matter what thread last modified it.