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. First-child/next-sibling






2. Composed of individually named data fields






3. Any container with linear ordering






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






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






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






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






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






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






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






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






12. To combine two ordered linear structures into one






13. Depth first search






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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. Two variables that reference the same object






30. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






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






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






44. Describes a though experiment or view of an entity






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






46. A classification of objects into a tree structure that groups related objects






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






48. A collection of values






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






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