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 case where a program calls itself






3. A process that removes unwanted elements from a collection






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






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






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






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






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






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






10. First-child/next-sibling






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






12. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






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






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






17. To combine two ordered linear structures into one






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






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






20. Composed of multiple sequential elements stored in contiguous bytes of memory






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






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






23. Describes a function that modifies its arguments






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






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






26. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






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






40. To hide similar items with the same name






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






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






43. The next element in a linked list






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






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






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






47. A pattern that describes a set of similar programs






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






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






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