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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






3. A pattern that describes a set of similar programs






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






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






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






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






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






9. A collection of values






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






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






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






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






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






15. A process that removes unwanted elements from a collection






16. Describes a function that modifies its arguments






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






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






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






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






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






22. Describes a though experiment or view of an entity






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






24. The next element in a linked list






25. A case where tow data structures share some elements






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






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






28. To combine two ordered linear structures into one






29. A variable containing the address of other data






30. All nodes below a give node in a tree






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






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






33. Composed of individually named data fields






34. First-child/next-sibling






35. To hide similar items with the same name






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






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






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






39. A pointer to data






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






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






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






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






44. The process of collecting garbage for recycling






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






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






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






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






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






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