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. Constructed of multiple components (simple or complex types)






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






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






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






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






7. Two variables that reference the same object






8. The process of collecting garbage for recycling






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






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






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






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






13. A pointer to data






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






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






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






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






18. To combine two ordered linear structures into one






19. A process that removes unwanted elements from a collection






20. To hide similar items with the same name






21. Describes a function that modifies its arguments






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






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






24. The next element in a linked list






25. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






35. Any container with linear ordering






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






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






38. A node of a tree that has children






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






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






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






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






43. A linked list in which the last element points back to the first element






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






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






46. A variable containing the address of other data






47. A case where tow data structures share some elements






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






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






50. First-child/next-sibling