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. An item (or description of items) being sough in a search






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






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






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






6. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






17. A process that removes unwanted elements from a collection






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






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






20. Depth first search






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






22. To hide similar items with the same name






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






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






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






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






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






28. A node of a tree that has children






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






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






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






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






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






34. First in first out: describes ordering of a queue






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






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






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






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






39. A pattern that describes a set of similar programs






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






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






42. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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