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 problem whose solution requires a linear amount of time or space if the problem is size n






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






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






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






5. The next element in a linked list






6. A pointer to data






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






8. Describes a function that modifies its arguments






9. To hide similar items with the same name






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






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






12. A description of the state of a process such as a board game






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






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






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






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






17. A pattern that describes a set of similar programs






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






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






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






21. To combine two ordered linear structures into one






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






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






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






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






26. A case where tow data structures share some elements






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






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






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






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






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






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






33. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






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






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






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






38. Composed of individually named data fields






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






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






41. A case where a program calls itself






42. The process of collecting garbage for recycling






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






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






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






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






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






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






49. A collection of values






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