Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
We do not share your email address with others. It is only used to allow you to reset your password. For details read our Privacy Policy and Terms of Service.


Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

Remove ads
Don't know
Know
remaining cards
Save
0:01
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
Retries:
restart all cards




share
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

OCPJP710.4

Cert Obj Identify potential threading problems.

[10.4.1] Certification Objective 10.4 Identify potential threading problems.
[10.4.2] One static variable - 2 run methods using it as a for loop variable It is certainly possible that the program may run for ever. Since both the threads may get the CPU time intermittently, k may never come down to 0 or may never reach the max. integer.
[10.4.3] One static variable not declared volatile (Since k is not declared volatile, updates made by one thread may not be visible to another thread at all. ) It is, therefore, possible that decrementor thread ends after 10 iterations and the incrementor thread keeps going until it overflows and goes back to 0.
[10.4.4] Setting thread priorities (In this case, the program is trying to manipulate the scheduling of thread using priorities which is a bad idea. Simply because operating systems behave differently about priorities.) For ex. Win32 uses Time Slicing i.e. it gives time to all the thread in proportion of their priorities but many unix systems do not let low priority threads run at all if a higher priority thread is running. So the output cannot be determined.
[10.4.5] What will be the output when this program is compiled and run from the command line? Can be a trick question if there is no main method
[10.4.6] Deadlock describes a situation where two or more threads are blocked forever, waiting for each other. Threads T1 and T2 need a File and a Printer. T1 acquires the lock for File and is about to acquire the lock for Printer but before it could acquire it, T2 gets Printer lock and tries to acquire the lock for the file (which is already held by T1).
[10.4.7]Starvation describes a situation where a thread is unable to gain regular access to shared resources and is unable to make progress. This happens when shared resources are made unavailable for long periods by "greedy" threads. For example, suppose an object provides a synchronized method that often takes a long time to return. If one thread invokes this method frequently, other threads that also need frequent synchronized access to the same object will often be blocked.
[10.4.8]Livelock: A thread often acts in response to the action of another thread. If other thread's action is also a response to action of another thread, livelock may result. Livelocked threads are not blocked simply too busy responding to each other. Both threads releasing and acquiring the locks in tandem but none of them getting both the locks at the same time. So neither of the threads is blocked but neither of the threads is able to do any real work. All they are doing is notifying each other.
Created by: MVK2013