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. Values are in the most basic form and cannot be decomposed into smaller parts






2. The process of collecting garbage for recycling






3. A process that removes unwanted elements from a collection






4. Describes a function that makes a new data structure but does not modify its arguments






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






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






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






8. Depth first search






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






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






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






12. To combine two ordered linear structures into one






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






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






15. To hide similar items with the same name






16. A case where tow data structures share some elements






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






18. A condition of the input data where the data will be handled by call(s) to the same program






19. Any container with linear ordering






20. Describes a though experiment or view of an entity






21. Composed of individually named data fields






22. A node of a tree that has children






23. A pattern that describes a set of similar programs






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






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






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






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






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






29. The next element in a linked list






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






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






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






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






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






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






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






37. Describes a function that modifies its arguments






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






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






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






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






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






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






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






45. A case where a program calls itself






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






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






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






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






50. First-child/next-sibling