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. In object oriented programming - a description of a set of similar objects






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






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






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






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






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






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






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






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






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






11. A pointer to data






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






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






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






15. Describes a though experiment or view of an entity






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






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






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






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






20. Any container with linear ordering






21. All nodes below a give node in a tree






22. A collection of values






23. A case where a program calls itself






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






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






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






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






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






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






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






31. A process that removes unwanted elements from a collection






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






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






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






35. A pattern that describes a set of similar programs






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






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






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






39. A node of a tree that has children






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






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






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






43. Composed of individually named data fields






44. Describes a function that modifies its arguments






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






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






47. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






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