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. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






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






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






4. A collection of values






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






6. Any container with linear ordering






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






8. A pattern that describes a set of similar programs






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






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






11. Two variables that reference the same object






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






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






14. A linked list in which the last element points back to the first element






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






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






17. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






26. Describes a though experiment or view of an entity






27. The next element in a linked list






28. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






39. The process of collecting garbage for recycling






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






41. A process that removes unwanted elements from a collection






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






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






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






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






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






47. To combine two ordered linear structures into one






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






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






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