Complete all with java 1. Explain a scenario where the resource pools, and block

Question

Complete all with java

1. Explain a scenario where the resource pools, and blocking threads could be demonstrated from a simple GUI based application.

2. Write code so that you can visualize the resource pools and progress of the various threads form the GUI, when it is run.

3. Explain a scenario where the stack operations (e.g., last in first out) could be demonstrated from a GUI. Keep the GUI simple e.g., button, list etc. to demonstrate the use of stack. S

4. Submit relevant code showing the operations of stack. For example, you may want to populate data in those GUI controls using stack operation for storing information in a GUI control. This is just an example to make you start thinking.

5. Submit results obtained by running/testing the code (could be screen shots).

Explanation / Answer

1Ans:

A resource pool is a logical abstraction for flexible management of resources. Resource pools can be grouped into hierarchies and used to hierarchically partition available CPU and memory resources.

Each standalone host and each DRS cluster has an (invisible) root resource pool that groups the resources of that host or cluster. The root resource pool does not appear because the resources of the host (or cluster) and the root resource pool are always the same.

Users can create child resource pools of the root resource pool or of any user-created child resource pool. Each child resource pool owns some of the parent’s resources and can, in turn, have a hierarchy of child resource pools to represent successively smaller units of computational capability.

Blocking threats:

Vulnerability-based protections detect and block exploit attempts and evasive techniques on both the network and application layers, including port scans, buffer overflows, protocol fragmentation, and obfuscation.

2.Ans:

3.Ans:

A stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. In the pushdown stacks only two operations are allowed: push the item into the stack, and pop the item out of the stack. A stack is a limited access data structure - elements can be added and removed from the stack only at the top. push adds an item to the top of the stack, pop removes the item from the top. A helpful analogy is to think of a stack of books; you can remove only the top book, also you can add a new book on the top.

A stack is a recursive data structure. Here is a structural definition of a Stack:

4.Ans:

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.