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 intersection is the set of elements that are members of both sets






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






3. The next element in a linked list






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






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






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






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






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






9. A variable containing the address of other data






10. Any container with linear ordering






11. A case where a program calls itself






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






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






14. Composed of individually named data fields






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






16. To combine two ordered linear structures into one






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






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






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






20. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






23. A pattern that describes a set of similar programs






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






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






26. First-child/next-sibling






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






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






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






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






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






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






33. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






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






45. All nodes below a give node in a tree






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






47. A pointer to data






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






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






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