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 problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






2. A pointer to data






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






4. A process that removes unwanted elements from a collection






5. First-child/next-sibling






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






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






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






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






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






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






12. The process of collecting garbage for recycling






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






14. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






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






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






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






20. To hide similar items with the same name






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






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






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






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






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






26. A collection of values






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






28. Depth first search






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






30. A case where a program calls itself






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






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






33. A node of a tree that has children






34. Describes a though experiment or view of an entity






35. The next element in a linked list






36. Any container with linear ordering






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






38. Describes a function that modifies its arguments






39. A pattern that describes a set of similar programs






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






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






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






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






44. Composed of individually named data fields






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






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






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






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






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






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