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 queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






4. A collection of values






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






6. A node of a tree that has children






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






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






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






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






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






12. A process that removes unwanted elements from a collection






13. A case where a program calls itself






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






15. Composed of individually named data fields






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






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






18. A variable containing the address of other data






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






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






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






22. First-child/next-sibling






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






24. The next element in a linked list






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






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






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






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






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






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






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






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






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






34. Two variables that reference the same object






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






36. To hide similar items with the same name






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






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






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






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






41. Depth first search






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






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






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






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






46. Any container with linear ordering






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






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






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






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