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 runtime error that occurs when an operation such as method call is attempted on a null pointer






2. Composed of individually named data fields






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






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






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






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






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






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






9. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






19. The next element in a linked list






20. A process that removes unwanted elements from a collection






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






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






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. Composed of multiple sequential elements stored in contiguous bytes of memory






25. To combine two ordered linear structures into one






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






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






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






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






30. A collection of values






31. First-child/next-sibling






32. Depth first search






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






34. A sequence of records - where each record contains a link to the next one






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






36. A node of a tree that has children






37. A pattern that describes a set of similar programs






38. To hide similar items with the same name






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






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






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






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






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






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






45. A case where tow data structures share some elements






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






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






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






49. Two variables that reference the same object






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