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. Depth first search






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






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






4. Composed of individually named data fields






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






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






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






8. Any container with linear ordering






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






10. First-child/next-sibling






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






12. Describes a function that modifies its arguments






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






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






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






16. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






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






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






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






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






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






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






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






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






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. An item (or description of items) being sough in a search






30. A pattern that describes a set of similar programs






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






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






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






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






35. All nodes below a give node in a tree






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






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






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






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






40. A case where tow data structures share some elements






41. A node of a tree that has children






42. A process that removes unwanted elements from a collection






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






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






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






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






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






48. To hide similar items with the same name






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






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