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. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






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






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






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






5. A node of a tree that has children






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






7. A pattern that describes a set of similar programs






8. Depth first search






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






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






11. The next element in a linked list






12. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






29. A case where tow data structures share some elements






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






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






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






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






34. A variable containing the address of other data






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






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






37. Describes a though experiment or view of an entity






38. Any container with linear ordering






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






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






41. Describes a data structure or device in which all accesses have the same cost - O(1)






42. A pointer to data






43. Composed of individually named data fields






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






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






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






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






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






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






50. First-child/next-sibling