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. Describes a function that modifies its arguments






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






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






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






5. To hide similar items with the same name






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






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






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






9. Describes a though experiment or view of an entity






10. The next element in a linked list






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






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






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






14. Separation of the properties of a data type from its implementation






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






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






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






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






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






20. All nodes below a give node in a tree






21. A pointer to data






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






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






24. The process of collecting garbage for recycling






25. A process that removes unwanted elements from a collection






26. First-child/next-sibling






27. Composed of individually named data fields






28. To combine two ordered linear structures into one






29. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






37. A case where tow data structures share some elements






38. Any container with linear ordering






39. To look through a data structure until a goal object is found






40. A variable containing the address of other data






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






42. A case where a program calls itself






43. Two variables that reference the same object






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






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






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






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






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






49. A node of a tree that has children






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