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. Given two sets -the union is the set of elements that are members of either set






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






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






4. The process of collecting garbage for recycling






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






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






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






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






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






10. Depth first search






11. A pointer to data






12. To combine two ordered linear structures into one






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






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






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






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






17. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






18. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






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






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






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






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






24. Describes a function that modifies its arguments






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






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






27. A case where tow data structures share some elements






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






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






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






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






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






33. First-child/next-sibling






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






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






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






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






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






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






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






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






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






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






44. A pattern that describes a set of similar programs






45. A collection of values






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






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






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






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






50. A runtime error that occurs when an operation such as method call is attempted on a null pointer