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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






4. A pattern that describes a set of similar programs






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






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






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






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






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






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






11. A variable containing the address of other data






12. First-child/next-sibling






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






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






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






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






17. Describes a function that modifies its arguments






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






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






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






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






22. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






26. Describes a though experiment or view of an entity






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






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






29. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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