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 queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






4. Describes a function that modifies its arguments






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






6. All nodes below a give node in a tree






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






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






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






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






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






12. Depth first search






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






14. Any container with linear ordering






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






16. A collection of values






17. A pointer to data






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






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 section of the runtime stack holding the values of all variables for one invocation






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






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






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






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






25. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






36. A case where tow data structures share some elements






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






38. A process that removes unwanted elements from a collection






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






40. First-child/next-sibling






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






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






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






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






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






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






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






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






49. A case where a program calls itself






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