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. To convert from a pointer to the data that is pointed to






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






3. A problem whose solution requires a linear amount of time or space if the problem is size n






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






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






6. A pointer to data






7. The process of collecting garbage for recycling






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






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






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






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






12. Composed of individually named data fields






13. Describes a though experiment or view of an entity






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






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






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






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






18. In a tree - a node pointed to by a parent node






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






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






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






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






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






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






25. First-child/next-sibling






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






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






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






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






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






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






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






33. To combine two ordered linear structures into one






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






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






36. Depth first search






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






38. A case where tow data structures share some elements






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






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






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






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






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






44. Describes a function that modifies its arguments






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






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






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






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






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






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