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 pointer to data






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






3. First-child/next-sibling






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






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






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






7. Any container with linear ordering






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






9. A pattern that describes a set of similar programs






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






11. Depth first search






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






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






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






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






16. A collection of values






17. Separation of the properties of a data type from its implementation






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






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






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






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






22. Constructed of multiple components (simple or complex types)






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






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






25. All nodes below a give node in a tree






26. The process of collecting garbage for recycling






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






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






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






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






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






32. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






45. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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






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






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






49. A case where tow data structures share some elements






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