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 sequence of records - where each record contains a link to the next one






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






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






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






5. Describes a function that modifies its arguments






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






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






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






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






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






11. The next element in a linked list






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






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






14. To hide similar items with the same name






15. A case where tow data structures share some elements






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






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






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






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






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






21. Any container with linear ordering






22. Describes a though experiment or view of an entity






23. A process that removes unwanted elements from a collection






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






25. All nodes below a give node in a tree






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






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






28. Two variables that reference the same object






29. A variable containing the address of other data






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






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






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






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






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






35. First-child/next-sibling






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






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






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






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






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






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






42. The process of collecting garbage for recycling






43. A pointer to data






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






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






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






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






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






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






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