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 tree node containing a contents value but with no children






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






3. A pointer to data






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






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






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






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






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






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






10. A case where tow data structures share some elements






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






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






13. Describes a function that modifies its arguments






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






15. Describes a though experiment or view of an entity






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






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






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






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






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






21. Composed of a collection of data values; implemented with a data structure






22. A collection of values






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






24. A process that removes unwanted elements from a collection






25. A variable containing the address of other data






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






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






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






29. A case where a program calls itself






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






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






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






33. Depth first search






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






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






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






37. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






38. The process of collecting garbage for recycling






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






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






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






42. First-child/next-sibling






43. All nodes below a give node in a tree






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






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






46. Composed of individually named data fields






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






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






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






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