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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






2. Depth first search






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






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






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






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






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






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






9. A case where tow data structures share some elements






10. A collection of values






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






12. All nodes below a give node in a tree






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






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






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






16. A pattern that describes a set of similar programs






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






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






19. The process of collecting garbage for recycling






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






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






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






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






24. Any container with linear ordering






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






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






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






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






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






30. To hide similar items with the same name






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






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






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






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






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






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






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






38. Two variables that reference the same object






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






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






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






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






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






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






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






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






47. Describes a though experiment or view of an entity






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






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






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