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. Given two sets -the union is the set of elements that are members of either set






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






3. A pointer to data






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






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






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






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






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






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






10. An extra record at the start or end of a data structure such as a linked list - to simplify processing






11. To hide similar items with the same name






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






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






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






15. 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?"






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






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






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






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






20. A pattern that describes a set of similar programs






21. To combine two ordered linear structures into one






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






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






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






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






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






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






28. A process that removes unwanted elements from a collection






29. Any container with linear ordering






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






31. A collection of values






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






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






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






35. Describes a though experiment or view of an entity






36. All nodes below a give node in a tree






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






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






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






40. First-child/next-sibling






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






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






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






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






45. Composed of individually named data fields






46. The next element in a linked list






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






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






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






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