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 queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






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






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






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






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






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






9. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






31. A variable containing the address of other data






32. A collection of values






33. A pattern that describes a set of similar programs






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






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






36. To combine two ordered linear structures into one






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






38. A case where a program calls itself






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






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






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






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






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






44. A node of a tree that has children






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






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






47. Two variables that reference the same object






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






49. Describes a though experiment or view of an entity






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