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. Describes a data structure or device in which all accesses have the same cost - O(1)






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






3. Describes a function that modifies its arguments






4. First-child/next-sibling






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






6. Depth first search






7. To combine two ordered linear structures into one






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






9. All nodes below a give node in a tree






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






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






12. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






22. Any container with linear ordering






23. A problem whose solution requires a linear amount of time or space if the problem is size n






24. A pattern that describes a set of similar programs






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






26. A node of a tree that has children






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






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






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






30. A variable containing the address of other data






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






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






33. A case where tow data structures share some elements






34. A process that removes unwanted elements from a collection






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






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






37. The process of collecting garbage for recycling






38. A pointer to data






39. A case where a program calls itself






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






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






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






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






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






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






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






47. A collection of values






48. The next element in a linked list






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






50. To hide similar items with the same name