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. To hide similar items with the same name






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






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






4. To combine two ordered linear structures into one






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






6. First-child/next-sibling






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






8. The process of collecting garbage for recycling






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






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






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






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






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






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






15. A pointer to data






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






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






18. A collection of values






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






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






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






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






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






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






25. Any container with linear ordering






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






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






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






29. A case where tow data structures share some elements






30. Describes a though experiment or view of an entity






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






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






33. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






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






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






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






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






41. All nodes below a give node in a tree






42. A variable containing the address of other data






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






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






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






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






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






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






49. Composed of individually named data fields






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