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 function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






3. A collection of values






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






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






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






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






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






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






10. The process of collecting garbage for recycling






11. Composed of individually named data fields






12. All nodes below a give node in a tree






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






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






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






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






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






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






19. A pointer to data






20. A pattern that describes a set of similar programs






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






22. To hide similar items with the same name






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






24. In a tree - the union of a node's parent and the parent's ancestors






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






26. A variable containing the address of other data






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






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






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






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






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






32. A node of a tree that has children






33. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






35. A case where tow data structures share some elements






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






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






38. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






48. First-child/next-sibling






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






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