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 simple case that can be solved easily - without recursion






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






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






4. Describes a though experiment or view of an entity






5. A case where a program calls itself






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






7. The process of collecting garbage for recycling






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






9. A process that removes unwanted elements from a collection






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






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






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






13. A pattern that describes a set of similar programs






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






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






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






17. A collection of values






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






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






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






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






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






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






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






25. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






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






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






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






29. A pointer to data






30. A runtime error that occurs when an operation such as method call is attempted on a null pointer






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






32. First-child/next-sibling






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






34. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






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






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






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






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






39. All nodes below a give node in a tree






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






41. Two variables that reference the same object






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






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






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






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






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






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






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






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






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