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. Depth first search






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






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






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






5. The next element in a linked list






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






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






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






9. To hide similar items with the same name






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






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






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






13. Describes a though experiment or view of an entity






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






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






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






17. A pointer to data






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






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






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






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






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






23. A contiguous block of memory containing elements of the same type - accessed by numeric index






24. Any container with linear ordering






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






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






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






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






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






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






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






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






33. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






50. A process that removes unwanted elements from a collection