Flashcards
Data Structure
Cards in this deck (15)
- 1QueueADT, First in first out
- 2Priority queuesome items are allowed to jump the queueu
- 3Static data structureFixed in size
- 4Dynamic data strucrureCan grow and shrink
- 5StacksADT, First in last out
- 6Call stackIt provides the mechanism for passing parameters ans return addresses to subroututine
- 7Stack frameIt contains all the parameteres, the address and the local variables
- 8Hash tableIt can find any record in the dataset almost instantly, no matter how larger the dataset is
- 9CollisionIt occurs when an algorithm generates the same address for different primary keys
- 10Dealing with collisionUse skip factor
- 11Mid-square methodSquare the key, take the middle two and mod the total slot
- 12Folding methodDivide the item into equal-size pieces
Add the pieces together
Perform the mod step to get the address - 13Hashing alphanumeric dataBy taking the ASCII code of it
Add them together
Mod to find address - 14DictionaryADT, Each pair has a key and value
- 15Dictionary and hashingThe key:value pairs are not held in any particular sequence
Information
- Description
- absolutely nothing Assassination Flashcards on Data Structure, created by aaa aaa on 03/05/2019.
- Created by
- aaa aaa
- Views
- 1
- Rating