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. Container for storing a collection of data in unique key/value pairs






2. Describes a function that modifies its arguments






3. Composed of individually named data fields






4. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






15. A pattern that describes a set of similar programs






16. First-child/next-sibling






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






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






19. A case where a program calls itself






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






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






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






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






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






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






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






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






28. All nodes below a give node in a tree






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






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






31. Any container with linear ordering






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






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






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






35. Describes a though experiment or view of an entity






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






37. To combine two ordered linear structures into one






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






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






40. A pointer to data






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






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






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






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






45. A collection of values






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






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






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






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






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