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. In a search tree - a program that changes a state into a child state e.g a move in a game






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






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






4. Depth first search






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






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






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






8. Any container with linear ordering






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






10. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






18. A pointer to data






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






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






21. A condition of the input data where the data will be handled by call(s) to the same program






22. Describes a though experiment or view of an entity






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






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






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






26. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






36. The process of collecting garbage for recycling






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






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






39. A variable containing the address of other data






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






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






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






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






44. Describes a function that modifies its arguments






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






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






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






48. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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