What is the difference between hashset and hashtable?
- 1 Answers
- 1068 Views
- I also Faced
- E-Mail Answers
Answer Posted / Sandeep Bajpai
A HashSet is a collection of unique elements, while a Hashtable (or Dictionary) is a data structure that stores key-value pairs. A Hashtable can have duplicate keys if you allow it, but a HashSet cannot.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
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?
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.
Write a program for Sorting an Array. Which sorting will you prefer?
