What is the difference between hashmap and arraylist?
- 1 Answers
- 1093 Views
- I also Faced
- E-Mail Answers
Answer Posted / Abhash Mitra
A HashMap is a data structure that implements an associative array or dictionary, storing key-value pairs. An ArrayList, on the other hand, is a dynamic array that can resize itself as elements are added or removed. The main difference lies in their methods of accessing and retrieving data - HashMap uses keys, while ArrayList uses indexes.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
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.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Write a program for Sorting an Array. Which sorting will you prefer?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
