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. A collection of values






2. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






3. A case where tow data structures share some elements






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






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






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






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






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






9. A description of the state of a process such as a board game






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






11. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






28. A node of a tree that has children






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






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






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






32. To hide similar items with the same name






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






34. A pointer to data






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






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






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






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






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






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






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






42. A sequence of records - where each record contains a link to the next one






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






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






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






46. All nodes below a give node in a tree






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






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






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






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