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. An item (or description of items) being sough in a search






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






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






4. A case where tow data structures share some elements






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






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






7. All nodes below a give node in a tree






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






9. The process of collecting garbage for recycling






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






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






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






13. In a search tree - a program that changes a state into a child state e.g a move in a game






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






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






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






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






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






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






20. Two variables that reference the same object






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






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






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






24. A variable containing the address of other data






25. The next element in a linked list






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






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






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






29. A case where a program calls itself






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






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






32. Describes a though experiment or view of an entity






33. A node of a tree that has children






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






35. A pointer to data






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






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






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






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






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






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






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






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






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






45. Describes a function that modifies its arguments






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






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






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






49. A pattern that describes a set of similar programs






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