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 collection of values






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






3. Composed of individually named data fields






4. Any container with linear ordering






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






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






7. A case where a program calls itself






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






9. A pointer to data






10. The process of collecting garbage for recycling






11. Describes a though experiment or view of an entity






12. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






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






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






26. All nodes below a give node in a tree






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






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






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






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






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






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






33. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






43. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






45. A node of a tree that has children






46. A case where tow data structures share some elements






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






48. Given two sets - the intersection is the set of elements that are members of both sets






49. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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