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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






3. A variable containing the address of other data






4. A node of a tree that has children






5. To hide similar items with the same name






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






7. A collection of objects that are inserted and removed according to the LIFO principle






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






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






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






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






12. First-child/next-sibling






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






14. A collection of values






15. A case where tow data structures share some elements






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






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






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






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






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






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






22. A case where a program calls itself






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






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






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






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






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






28. Two variables that reference the same object






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






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






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






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






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






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






35. Any container with linear ordering






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






37. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






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






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






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






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