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. Given two sets - the intersection is the set of elements that are members of both sets






2. A node of a tree that has children






3. A process that removes unwanted elements from a collection






4. All nodes below a give node in a tree






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






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






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






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






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






10. A variable containing the address of other data






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






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






13. Depth first search






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






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






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






17. The process of collecting garbage for recycling






18. Describes a though experiment or view of an entity






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






20. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






36. To hide similar items with the same name






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






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






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






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






41. A case where tow data structures share some elements






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






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






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






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






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






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






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






49. First-child/next-sibling






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