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 search tree - a program that changes a state into a child state e.g a move in a game






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






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






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






5. A node of a tree that has children






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






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






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






9. A case where a program calls itself






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






11. A pointer to data






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






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






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






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






16. Describes a function that modifies its arguments






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






18. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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






22. A variable containing the address of other data






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






24. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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






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






27. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






30. Depth first search






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






32. A collection of values






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






34. To combine two ordered linear structures into one






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






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






37. A pattern that describes a set of similar programs






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






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






40. The next element in a linked list






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






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






43. To hide similar items with the same name






44. The process of collecting garbage for recycling






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






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






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






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






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






50. Two variables that reference the same object