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. An item (or description of items) being sough in a search






2. Describes a though experiment or view of an entity






3. The process of collecting garbage for recycling






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






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






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






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






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






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






10. A case where tow data structures share some elements






11. To hide similar items with the same name






12. Depth first search






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






28. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






36. A variable containing the address of other data






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






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






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






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






41. To combine two ordered linear structures into one






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






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






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






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






46. Describes a function that modifies its arguments






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. To convert from a pointer to the data that is pointed to






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






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