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






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






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






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






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






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






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






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






9. Depth first search






10. A node of a tree that has children






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






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






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






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






15. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






26. Two variables that reference the same object






27. To hide similar items with the same name






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






29. A tree node containing a contents value but with no children






30. A process that removes unwanted elements from a collection






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






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






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






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 or device in which all accesses have the same cost - O(1)






36. To combine two ordered linear structures into one






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






38. Any container with linear ordering






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






40. A variable containing the address of other data






41. A case where a program calls itself






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






43. Describes a though experiment or view of an entity






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






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






46. Composed of individually named data fields






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






48. A case where tow data structures share some elements






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






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