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 classification of objects into a tree structure that groups related objects






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






3. A variable containing the address of other data






4. All nodes below a give node in a tree






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






6. A collection of values






7. Any container with linear ordering






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






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






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






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






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






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






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






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






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






17. A case where a program calls itself






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






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






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






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






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






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






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






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






26. To hide similar items with the same name






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






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






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






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






31. Composed of individually named data fields






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






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






34. Describes a though experiment or view of an entity






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






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






37. The process of collecting garbage for recycling






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






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






40. First-child/next-sibling






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






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






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






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






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






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






47. A process that removes unwanted elements from a collection






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






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






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