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






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






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






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






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






6. A case where a program calls itself






7. The process of collecting garbage for recycling






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






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






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






11. Describes a though experiment or view of an entity






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






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






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






15. To combine two ordered linear structures into one






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






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






18. A node of a tree that has children






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






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






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






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






23. All nodes below a give node in a tree






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






25. Any container with linear ordering






26. The next element in a linked list






27. A pointer to data






28. 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?"






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






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






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






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






33. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






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






45. A process that removes unwanted elements from a collection






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






47. Two variables that reference the same object






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






49. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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