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 node of a tree that has children






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






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






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






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






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






7. Two variables that reference the same object






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






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






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






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






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






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






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






15. A condition of the input data where the data will be handled by call(s) to the same program






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






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






18. The next element in a linked list






19. First-child/next-sibling






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






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






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






23. A process that removes unwanted elements from a collection






24. A pattern that describes a set of similar programs






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






26. Describes a function that modifies its arguments






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






28. The process of collecting garbage for recycling






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






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






31. Container for storing a collection of data in unique key/value pairs






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






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






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






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






36. A case where a program calls itself






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






38. To hide similar items with the same name






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






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






41. A case where tow data structures share some elements






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






43. A variable containing the address of other data






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






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






46. All nodes below a give node in a tree






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






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






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






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