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 elements of a linked list - tree - or graph - often represented by a data structure






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






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






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






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






6. A case where a program calls itself






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






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






9. A pattern that describes a set of similar programs






10. A variable containing the address of other data






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






12. Describes a function that modifies its arguments






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






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






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






16. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






22. A pointer to data






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






24. To hide similar items with the same name






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






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






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






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






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






30. Any container with linear ordering






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






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






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






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






35. To combine two ordered linear structures into one






36. A case where tow data structures share some elements






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






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






39. First-child/next-sibling






40. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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