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. Separation of the properties of a data type from its implementation






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






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






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






5. Any container with linear ordering






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






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






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






9. To convert from a pointer to the data that is pointed to






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






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






12. The process of collecting garbage for recycling






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






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






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






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






17. Describes a though experiment or view of an entity






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






19. Composed of individually named data fields






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






21. The next element in a linked list






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. To look through a data structure until a goal object is found






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






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






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






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






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






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






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






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






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






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






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






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






36. To hide similar items with the same name






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






38. To combine two ordered linear structures into one






39. 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?"






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






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






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






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






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






45. A case where a program calls itself






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






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






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






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






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