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. Any container with linear ordering






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






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






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






5. A pointer to data






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






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






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






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






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






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






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






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






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






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






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






17. Describes a function that modifies its arguments






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






19. A node of a tree that has children






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






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






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






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






24. To combine two ordered linear structures into one






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






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






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






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






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






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






31. First-child/next-sibling






32. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






42. To hide similar items with the same name






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






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






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






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






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






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






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






50. Describes a though experiment or view of an entity