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. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






4. Describes a function that modifies its arguments






5. A case where a program calls itself






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






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






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






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






10. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






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






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






25. Composed of individually named data fields






26. Describes a though experiment or view of an entity






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






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






29. To combine two ordered linear structures into one






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






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






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






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






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






36. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






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






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






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






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






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