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 formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






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






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






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






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






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






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






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






10. To combine two ordered linear structures into one






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






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






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






14. To look through a data structure until a goal object is found






15. First-child/next-sibling






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






17. A case where tow data structures share some elements






18. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






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






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






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






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






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






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






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






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






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






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






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






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






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






33. Describes a though experiment or view of an entity






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






35. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






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






37. The process of collecting garbage for recycling






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






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






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






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






42. Two variables that reference the same object






43. A pattern that describes a set of similar programs






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






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






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






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






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






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






50. A case where a program calls itself