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






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






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






4. To combine two ordered linear structures into one






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






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






7. Depth first search






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






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






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






11. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






20. A collection of values






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






22. The process of collecting garbage for recycling






23. Describes a though experiment or view of an entity






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






25. Composed of individually named data fields






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






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






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






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






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






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






32. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






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






43. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






44. Two variables that reference the same object






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






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






47. All nodes below a give node in a tree






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






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






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