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 ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






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






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






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






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






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






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






9. Any container with linear ordering






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






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






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






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






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






15. A process that removes unwanted elements from a collection






16. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






26. To hide similar items with the same name






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






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






29. The process of collecting garbage for recycling






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






31. Two variables that reference the same object






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






33. The next element in a linked list






34. A case where tow data structures share some elements






35. All nodes below a give node in a tree






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






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






38. Describes a though experiment or view of an entity






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






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






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






42. First-child/next-sibling






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






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






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






46. A node of a tree that has children






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






48. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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