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. To combine two ordered linear structures into one






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






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






4. A variable containing the address of other data






5. All nodes below a give node in a tree






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






7. A pattern that describes a set of similar programs






8. Describes a though experiment or view of an entity






9. Describes a function that modifies its arguments






10. A node of a tree that has children






11. A pointer to data






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






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






14. The next element in a linked list






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






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






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






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






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






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






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






22. Depth first search






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






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






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






26. Composed of individually named data fields






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






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






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






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






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






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






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






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






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. A description of the state of a process such as a board game






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






38. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






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






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