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. The process of collecting garbage for recycling






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






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






4. Describes a function that modifies its arguments






5. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






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






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






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






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






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






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






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






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






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






18. Any container with linear ordering






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






20. To combine two ordered linear structures into one






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






22. Depth first search






23. All nodes below a give node in a tree






24. A node of a tree that has children






25. Composed of individually named data fields






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






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






28. A case where a program calls itself






29. To hide similar items with the same name






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






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






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






33. Two variables that reference the same object






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






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






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






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






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






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






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






41. First-child/next-sibling






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






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






44. A variable containing the address of other data






45. A process that removes unwanted elements from a collection






46. A case where tow data structures share some elements






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






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






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






50. The next element in a linked list