COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Dictionary
|
|
|
List
|
|
|
Queue
|
|
|
Spreadsheet
|
Detailed explanation-1: -• A dictionary is a general-purpose data structure for storing a group of objects. • A dictionary has a set of keys and each key has a single associated value. •
Detailed explanation-2: -Hashing is one simple option for this. We can put all words in a hash table.
Detailed explanation-3: -Like a conventional dictionary, a data dictionary contains a list of entries, and each entry comes as a pair-a key (which identifies the entry) and a value (some data associated with this entry). These entries are referred to as key/value pairs (sometimes the key is referred to as the name of the entry).
Detailed explanation-4: -We can use integer, string, tuples as dictionary keys but cannot use list as a key of it .
Detailed explanation-5: -A dictionary is composed of four parts: Megastructure, Macrostructure, Mesostructure and Microstructure. – the front matter, e.g. contents, instruction; – abbreviations and explanations of grammar, e.g. adj.