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 linked list in which each elements has both forward and backward pointers






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






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






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






5. First-child/next-sibling






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






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






8. A pointer to data






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






10. A process that removes unwanted elements from a collection






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






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






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






14. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






15. A pattern that describes a set of similar programs






16. A case where tow data structures share some elements






17. Describes a though experiment or view of an entity






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






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






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






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






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






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






24. A given collection of values along with a collection of operations for use on those values






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






26. A case where a program calls itself






27. To hide similar items with the same name






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






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






30. Any container with linear ordering






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






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






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






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






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






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






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






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






39. The next element in a linked list






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






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






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






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






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






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






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






47. To combine two ordered linear structures into one






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






49. The process of collecting garbage for recycling






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