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 the next element in a linked list






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






3. A node of a tree that has children






4. The process of collecting garbage for recycling






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






6. A pointer to data






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






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






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






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






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






12. To hide similar items with the same name






13. First-child/next-sibling






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






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






16. A pattern that describes a set of similar programs






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






18. Any container with linear ordering






19. A case where a program calls itself






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






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






22. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






44. Describes a function that modifies its arguments






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






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






47. The next element in a linked list






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






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






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