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. The number of links between the root of a tree and the leaves






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






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






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






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






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






7. All nodes below a give node in a tree






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






9. Describes a function that modifies its arguments






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






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






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






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






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






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






16. Describes a though experiment or view of an entity






17. To combine two ordered linear structures into one






18. Two variables that reference the same object






19. A node of a tree that has children






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






21. Any container with linear ordering






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






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






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






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






26. A pointer to data






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






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






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






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






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






32. Depth first search






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






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






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






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






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






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






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






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






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






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






43. A collection of values






44. First-child/next-sibling






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






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






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






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






49. The process of collecting garbage for recycling






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