Answer Posted / Shivendra Pal Singh
ConcurrentHashMap in Java is designed to be thread-safe, allowing multiple threads to perform operations simultaneously without causing conflicts. It achieves this by using locks and segments for internal synchronization, ensuring that no two threads access the same bucket at the same time. This makes ConcurrentHashMap a fail-fast iterator (meaning it will throw ConcurrentModificationException if its structure is modified during iteration).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write a program for Sorting an Array. Which sorting will you prefer?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
