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. Last in first out: describes the order of a stack






2. To combine two ordered linear structures into one






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






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






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






6. All nodes below a give node in a tree






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






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






9. A pointer to data






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






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






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






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






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






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






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






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






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






19. First-child/next-sibling






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






21. A case where a program calls itself






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






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






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






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






26. Describes a function that modifies its arguments






27. The next element in a linked list






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






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






30. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






31. A case where tow data structures share some elements






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






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






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






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






36. In a search tree - a program that changes a state into a child state e.g a move in a game






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






38. Describes a though experiment or view of an entity






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






40. Any container with linear ordering






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






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






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






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






45. To hide similar items with the same name






46. A pattern that describes a set of similar programs






47. A variable containing the address of other data






48. An elements of a linked list - tree - or graph - often represented by a data structure






49. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






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