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. An order of processing a tree in which the parent node is processed after its children






2. The process of collecting garbage for recycling






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






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






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






6. All nodes below a give node in a tree






7. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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






17. A variable containing the address of other data






18. A pointer to data






19. A pattern that describes a set of similar programs






20. A collection of values






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






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






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






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






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






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






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






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






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






30. Depth first search






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






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






33. First-child/next-sibling






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






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






36. A case where tow data structures share some elements






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






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






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






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






41. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






43. Composed of individually named data fields






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






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






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






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






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






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






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