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 tree search - to move back from the node currently being examined to its parent






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






3. First-child/next-sibling






4. The number of links between the root of a tree and the leaves






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






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






7. A variable containing the address of other data






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






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






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






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






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






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






14. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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






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






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






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






27. storage that is no longer pointed to by any variable and therefore can no longer be accessed






28. Describes a though experiment or view of an entity






29. The process of collecting garbage for recycling






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






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






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






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






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






35. Depth first search






36. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






45. The next element in a linked list






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






47. A case where a program calls itself






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






49. All nodes below a give node in a tree






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