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. Container for storing a collection of data in unique key/value pairs






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






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






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






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






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






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






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






9. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






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






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






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






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






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






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






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






19. A case where a program calls itself






20. A pattern that describes a set of similar programs






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






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






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






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






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






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






27. Composed of individually named data fields






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






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






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






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






32. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






44. Describes a function that modifies its arguments






45. Depth first search






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






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






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






49. A pointer to data






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