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 case where tow data structures share some elements






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






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






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






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






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






7. Describes a though experiment or view of an entity






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






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






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






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






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






13. First-child/next-sibling






14. To hide similar items with the same name






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






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






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






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






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






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






21. The process of collecting garbage for recycling






22. Depth first search






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






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






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






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






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






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






29. A pointer to the next element in a linked list






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






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






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






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






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






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






36. A process that removes unwanted elements from a collection






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






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






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






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






41. A pattern that describes a set of similar programs






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






43. To combine two ordered linear structures into one






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






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






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






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






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






49. Any container with linear ordering






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