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. First in first out: describes ordering of a queue






2. A collection of values






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






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






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






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






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






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






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






10. The process of collecting garbage for recycling






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






12. A variable containing the address of other data






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






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






15. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






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






19. The next element in a linked list






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






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






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






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






24. A case where a program calls itself






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






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






27. Any container with linear ordering






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






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






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






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






32. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






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






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






47. Given two sets - the intersection is the set of elements that are members of both sets






48. Describes a function that modifies its arguments






49. Two variables that reference the same object






50. To combine two ordered linear structures into one