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. A collection of values






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






3. A case where tow data structures share some elements






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






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






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






7. Describes a function that modifies its arguments






8. Two variables that reference the same object






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






10. The next element in a linked list






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






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






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






14. Composed of individually named data fields






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






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






17. To hide similar items with the same name






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






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






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






21. A variable containing the address of other data






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






23. A linked list in which each elements has both forward and backward pointers






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






25. A pointer to data






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






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






28. A runtime error that occurs when an operation such as method call is attempted on a null pointer






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






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






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






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






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






34. Depth first search






35. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






36. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






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






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






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






40. A node of a tree that has children






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






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






43. Any container with linear ordering






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






45. The process of collecting garbage for recycling






46. All nodes below a give node in a tree






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






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






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






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