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. First in first out: describes ordering of a queue






2. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






5. To hide similar items with the same name






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






7. 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






8. Describes a though experiment or view of an entity






9. All nodes below a give node in a tree






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






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






12. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






13. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






15. A pattern that describes a set of similar programs






16. Any container with linear ordering






17. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






19. A linked list in which the last element points back to the first element






20. In a tree - a node pointed to by a parent node






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






22. A simple case that can be solved easily - without recursion






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






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






25. A process that removes unwanted elements from a collection






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






27. The next element in a linked list






28. To look through a data structure until a goal object is found






29. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






30. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






32. A section of the runtime stack holding the values of all variables for one invocation






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






34. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






35. Use of a function or method without knowing how it's accomplished






36. A description of the state of a process such as a board game






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






38. A problem whose solution requires a linear amount of time or space if the problem is size n






39. Describes a data structure or device in which all accesses have the same cost - O(1)






40. Depth first search






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






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






43. The process of collecting garbage for recycling






44. Composed of multiple sequential elements stored in contiguous bytes of memory






45. Composed of individually named data fields






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






47. Describes a function that modifies its arguments






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






49. 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






50. A problem that is so hard that it cannot be solved unless the problem is small