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 section of the runtime stack holding the values of all variables for one invocation






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






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






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






5. A node of a tree that has children






6. A pattern that describes a set of similar programs






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






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






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






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






11. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






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






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. The number of links between the root of a tree and the leaves






25. A variable containing the address of other data






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






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






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






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






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






31. All nodes below a give node in a tree






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






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






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






35. The next element in a linked list






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






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






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






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






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






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






42. Describes a function that modifies its arguments






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






44. A case where tow data structures share some elements






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






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






47. A runtime error that occurs when an operation such as method call is attempted on a null pointer






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






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






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