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. The amount of space on the runtime stack required for execution of a program






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






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






4. A variable containing the address of other data






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






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






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






8. A pointer to data






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






10. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






18. Any container with linear ordering






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






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






21. Composed of individually named data fields






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






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






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






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






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






27. A collection of values






28. All nodes below a give node in a tree






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






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






31. Depth first search






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






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






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






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






36. A case where a program calls itself






37. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






47. Two variables that reference the same object






48. To combine two ordered linear structures into one






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






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