To obtain a JTable field's name, the correct statement to use is: C. JTable getColumnName(Columnindex + 1)To notify a JTable that the table has changed, one of the following statements achieves:
A. To create a static thread-pool & a pool manager, a programmer would write: B. Executors.newFixedThreadPool(10)How to programmatically enable thread "B" to suspend its execution and wait for thread "A" assuming that "B" has executed "A"?B. B.wait()To release the monitor-lock of an object "A", the following statement should be invoked by the thread that acquired it: D. A unlock()In order to obtain the result of a task-processing by a thread, a programmer would need to employ:
B. CallableIf a thread attempts to access a "synchronized" method and access to the method cannot be obtained, the thread is: D. BlockedThe statement that would schedule the task "long Factorial(int x)" by thread is: D. ExecutorService execute(A)To obtain a remote web client's logical address, HttpServletRequest getRemoteAddr() should be used. Answer: C. HttpServletRequest getRemoteAddr)
To know more about monitor-lock visit:
https://brainly.com/question/32420716
#SPJ11
What are the best data structures to create the following items? And why?
1. Designing a Card Game with 52 cards.
2. Online shopping cart (Amazon, eBay, Walmart, Cosco, Safeway....)
3. Online waiting list (De Anza College class waiting list, ...)
4. Purchasing online Tickets (Flight tickets, concert tickets, ...) (=> Fixed-size <=)
For designing a card game with 52 cards, the best data structure is a stack, For an online shopping cart, the best data structure is a list, For an online waiting list, the best data structure is a queue, For purchasing online tickets with a fixed size, the best data structure is an array.
1.
The stack data structure is used here.
A stack is a data structure that operates on the principle of Last In First Out (LIFO). In a card game, the deck of cards is shuffled, and then each player takes turns drawing a card from the top of the deck. In order to simulate this, we can use a stack where each card is pushed onto the top of the stack and each player pops a card from the top of the stack.2.
Here list data structure is used.
A list is a dynamic collection of elements that maintains their order and allows for the addition or removal of elements as needed.In an online shopping cart, items are added to the cart and then the user can choose to remove them or proceed to checkout. A list can easily handle these operations.3.
Here queue data structure is used.
A queue is a data structure that operates based on the principle of First In First Out (FIFO). In an online waiting list, users are added to the list in the order that they joined, and are served in that order as well. A queue is the ideal data structure for this.4.
Here array data structure is used.
An array is a data structure that stores elements of the same type in a sequence, occupying adjacent memory locations.Since the number of tickets is fixed, an array can be used to store information about each ticket, such as the ticket type, price, and availability.To learn more about data structure: https://brainly.com/question/29585513
#SPJ11