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. A given collection of values along with a collection of operations for use on those values






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






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






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






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






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






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






9. A variable containing the address of other data






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






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






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






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






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






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






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






17. A case where a program calls itself






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






19. To hide similar items with the same name






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. The area of program text over which a variable can be referenced






22. A process that removes unwanted elements from a collection






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






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






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






26. Any container with linear ordering






27. Describes a though experiment or view of an entity






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






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






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






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






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






33. Composed of individually named data fields






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






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






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






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






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






39. Describes a function that modifies its arguments






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






41. A node of a tree that has children






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






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






44. A collection of values






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






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






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






48. Depth first search






49. The next element in a linked list






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