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






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






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






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






5. The process of collecting garbage for recycling






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






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






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






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






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






11. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






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






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






25. A variable containing the address of other data






26. A process that removes unwanted elements from a collection






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






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






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






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






31. A pattern that describes a set of similar programs






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






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






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






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






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






37. The next element in a linked list






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






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






40. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






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






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






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






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






47. Describes a function that modifies its arguments






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






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






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