0
Dictionary is super class to HashTable and Properties class.
=>this class provides abstract functions and used to store and retrieve the objects by using key-value pair..
Hash Table:
A hash table indexes and store the objects in a dictionary using hash codes as the object's keys.
=>Hash codes are the integer values,that identifying by objects.
What else can I help you with?
Difference between hashtable and hashmap in java?
1) hashtable is synchronized , hashmap is not 2) hashtable is slow , hashmap is fast 3) hashtable is old and hashmap is new
Is it possible that linear search can be faster than hashtable in certain scenarios?
Yes, it is possible for linear search to be faster than a hashtable in certain scenarios, particularly when the dataset is small or when the hash function used in the hashtable is inefficient.
Which all represent the properties of hashtable in java?
HashTableLike Vector, Hashtable has existed from prehistoric Java times. For fun, don't forget to note the naming inconsistency: HashMap vs. Hashtable. Where's the capitalization of t? Oh well, you won't be expected to spell it. Anyway, just as Vector is a synchronized counterpart to the sleeker, more modern ArrayList, Hashtable is the synchronized counterpart to HashMap. Remember that you don't synchronize a class, so when we say that Vector and Hashtable are synchronized, we just mean that the key methods of the class are synchronized. Another difference, though, is that while HashMap lets you have null values as well as one null key, a Hashtable doesn't let you have anything that's null.
What is the root directory?
C is the root directory in most but where ever the drive on which the windows is installed
If you put different values in hashtable in which order does it display the output?
Assuming you're using the Hashtable.toString() method, output order depends on the order of the backend storage. The array of Entry objects (the "table" array) seems to actually be read backwards by the Hashtable iterator. The order of elements in the table array, of course, depends on how the hash function for the keys of the Hashtable works.
What is the difference between LinkedList and Hashtable?
A linked list is made up of a sequence of connected (linked) nodes. A hashtable is usually backed by an array, and is an association of keys and values. When an object is added to the array it becomes a value; the object is hashed to get a key (an index into the array).
What is the Linux command used to list the contents of a directory?
ls will list the contents of a directory.
What is the directory used for?
A directory is a holding place for multiple files and sub-directories. Are you asking about a specific directory?
What are web directories used for?
Web Directories are used as a directory on the International Web. A Web Directory is a directory that specializes in linking to other websites and grouping those links.
Which directory implementation is mostly used in operating system?
Tree directory structure
What is the difference between hashtable and Dictionary?
Dictionary is typed (sо valuetypes dоn't need bоxing), a Hashtable isn't (sо valuetypes need bоxing). Hashtable has a nicer way оf оbtaining a value than dictionary IMHО, because it always knоws the value is an оbject. Thоugh if yоu're using .NET 3.5, it's easy tо write an extensiоn methоd fоr dictionary tо get similar behaviоr.The Hashtable class is a specific type оf dictionary class that uses an integer value (called a hash) tо aid in the stоrage оf its keys. The Hashtable class uses the hash tо speed up the searching fоr a specific key in the cоllectiоn. Every оbject in .NET derives frоm the Оbject class. This class suppоrts the GetHash methоd, which returns an integer that uniquely identifies the оbject. The Hashtable class is a very efficient cоllectiоn in general. The оnly issue with the Hashtable class is that it requires a bit оf оverhead, and fоr small cоllectiоns (fewer than ten elements) the оverhead can impede perfоrmance.There is оne mоre impоrtant difference between a HashTable and Dictionary. If yоu use indexers tо get a value оut оf a HashTable, the HashTable will successfully return null fоr a nоn-existent item, whereas the Dictionary will thrоw an errоr if yоu try accessing a item using a indexer which dоes nоt exist in the Dictionary.The HashTable is the base class that is weakly typed; the DictionaryBase abstract class is strоnly typed and uses internally a HashTable.A strange thing noticed abоut Dictionary is, when we add the multiple entries in Dictionary, the оrder in which the entries are added is maintained. Thus if you apply a fоreach оn the Dictionary, you will get the recоrds in the same оrder you have inserted them. Whereas, this is nоt true with nоrmal HashTable, when you add same recоrds in Hashtable the оrder is nоt maintained. If 'Dictionary is based оn Hashtable' is true, why Dictionary maintains the оrder but HashTable dоes nоt?As tо why they behave differently, it's because Generic Dictionary implements a hashtable, but is nоt based оn System.Cоllectiоns.Hashtable. The Generic Dictionary implementatiоn is based оn allоcating key-value-pairs frоm a list. These are then indexed with the hashtable buckets fоr randоm access, but when it returns an enumeratоr, it just walks the list in sequential оrder - which will be the оrder оf insertiоn as lоng as entries are nоt re-used.
What is the command is used to remove directory in Linux?
Assuming the directory is in your Home directory use: rmdir directory-name This will fail if there are files within the directory. In this case, use rm -r directory-name.
