Test your basic knowledge |

Data Structures

Subject : it-skills
Instructions:
  • Answer 50 questions in 15 minutes.
  • If you are not ready to take this test, you can study here.
  • Match each statement with the correct term.
  • Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






2. A given collection of values along with a collection of operations for use on those values






3. A tree node containing a contents value but with no children






4. In object oriented programming - a description of a set of similar objects






5. First in first out: describes ordering of a queue






6. Composed of a collection of data values; implemented with a data structure






7. An order of processing a tree in which the parent node is processed before its children






8. Describes a function that modifies its arguments






9. Last in first out: describes the order of a stack






10. Given two sets - the intersection is the set of elements that are members of both sets






11. A search in which children of a node are considered before siblings are considered






12. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






13. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






14. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






15. A classification of objects into a tree structure that groups related objects






16. storage that is no longer pointed to by any variable and therefore can no longer be accessed






17. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






18. In a tree - the union of a node's parent and the parent's ancestors






19. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






20. Composed of individually named data fields






21. The top node of a tree - from which all other nodes can be reached






22. Constructed of multiple components (simple or complex types)






23. In a tree search - to move back from the node currently being examined to its parent






24. Container for storing a collection of data in unique key/value pairs






25. The amount of space on the runtime stack required for execution of a program






26. In a tree - a node that points to a given node






27. To convert from a pointer to the data that is pointed to






28. A sequence of records - where each record contains a link to the next one






29. Separation of the properties of a data type from its implementation






30. An order of processing a tree in which the parent node is processed in between its children






31. The area of program text over which a variable can be referenced






32. A process that removes unwanted elements from a collection






33. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






34. A case where tow data structures share some elements






35. A data structure that can be identified at runtime as being a member of a class






36. Given two sets -the union is the set of elements that are members of either set






37. Any container with linear ordering






38. All nodes below a give node in a tree






39. The process of collecting garbage for recycling






40. A list of pairs - where each pair has a key and a value associated with the key






41. A pointer to the next element in a linked list






42. The number of links between the root of a tree and the leaves






43. A description of operations on a data type that could have multiple possible implementations






44. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






45. An item (or description of items) being sough in a search






46. A variable containing the address of other data






47. In a search tree - a program that changes a state into a child state e.g a move in a game






48. An elements of a linked list - tree - or graph - often represented by a data structure






49. A node of a tree that has children






50. A pointer to data