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 pointer to data






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






3. To combine two ordered linear structures into one






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






5. A process that removes unwanted elements from a collection






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






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






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






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






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






11. Describes a function that modifies its arguments






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






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






14. First-child/next-sibling






15. The process of collecting garbage for recycling






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






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






18. Describes a though experiment or view of an entity






19. A case where a program calls itself






20. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






30. Any container with linear ordering






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






32. A case where tow data structures share some elements






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






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






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






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






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






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






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






40. Composed of individually named data fields






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






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






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






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






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






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






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






48. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






49. Depth first search






50. A pattern that describes a set of similar programs