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. Use of a function or method without knowing how it's accomplished






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






3. Describes a function that modifies its arguments






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






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






6. A case where a program calls itself






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






8. A variable containing the address of other data






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






10. A stack containing a stack frame of variable value for each active invocation of procedure






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






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






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






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






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






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






17. A pattern that describes a set of similar programs






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






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






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






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






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






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






24. A case where tow data structures share some elements






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






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






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






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






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






30. A collection of values






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






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






33. To combine two ordered linear structures into one






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






35. Composed of individually named data fields






36. Two variables that reference the same object






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






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. The process of collecting garbage for recycling






40. First-child/next-sibling






41. A process that removes unwanted elements from a collection






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






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






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






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






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






47. To hide similar items with the same name






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






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






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