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. To convert from a pointer to the data that is pointed to






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






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






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






5. The next element in a linked list






6. Depth first search






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






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






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






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






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






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






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






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






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






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






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






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






19. All nodes below a give node in a tree






20. Any container with linear ordering






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






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






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






24. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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






34. Composed of individually named data fields






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






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






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. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






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






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






43. A section of the runtime stack holding the values of all variables for one invocation






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






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






46. First-child/next-sibling






47. A case where a program calls itself






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






49. The process of collecting garbage for recycling






50. A collection of values