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 collection of values






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






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






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






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






6. A process that removes unwanted elements from a collection






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






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






9. To hide similar items with the same name






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






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






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






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






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






15. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






18. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






20. Describes a though experiment or view of an entity






21. First-child/next-sibling






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






23. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






35. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






46. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






47. Describes a function that modifies its arguments






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






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






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