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






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






3. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






4. A stack containing a stack frame of variable value for each active invocation of procedure






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






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






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






8. The next element in a linked list






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






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






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






12. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






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






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






16. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






19. A variable containing the address of other data






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






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






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






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






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






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






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






27. The process of collecting garbage for recycling






28. All nodes below a give node in a tree






29. 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?"






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






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






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






33. Depth first search






34. Two variables that reference the same object






35. Composed of individually named data fields






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






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






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






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






40. Values are in the most basic form and cannot be decomposed into smaller parts






41. Describes a though experiment or view of an entity






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






43. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






46. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






48. A node of a tree that has children






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






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