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 classification of objects into a tree structure that groups related objects






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






3. The process of collecting garbage for recycling






4. Describes a function that modifies its arguments






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






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






7. A collection of values






8. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






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






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






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






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






13. A process that removes unwanted elements from a collection






14. Composed of individually named data fields






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






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






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






18. To hide similar items with the same name






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






20. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






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






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






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






35. Any container with linear ordering






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






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






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






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






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






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






42. Depth first search






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






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






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






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






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






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






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






50. A case where a program calls itself