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. To hide similar items with the same name






2. In a search tree - a program that changes a state into a child state e.g a move in a game






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






4. To combine two ordered linear structures into one






5. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






25. A case where tow data structures share some elements






26. Two variables that reference the same object






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






28. A pointer to data






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






30. Any container with linear ordering






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






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






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






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






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






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






37. Composed of individually named data fields






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






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






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






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






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






43. Describes a function that modifies its arguments






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






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






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






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






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






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






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