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






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






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






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






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






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






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






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






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






10. First-child/next-sibling






11. To combine two ordered linear structures into one






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






13. Given two sets - the intersection is the set of elements that are members of both sets






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






15. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






29. Composed of individually named data fields






30. A pointer to data






31. A node of a tree that has children






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






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






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






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






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






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






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






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






40. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






42. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






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






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






46. A collection of values






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






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






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






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