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 answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






3. Two variables that reference the same object






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






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






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






7. Composed of individually named data fields






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






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






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






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






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






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






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






15. First-child/next-sibling






16. Any container with linear ordering






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






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






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






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






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






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






23. A node of a tree that has children






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






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






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






27. A process that removes unwanted elements from a collection






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






29. The process of collecting garbage for recycling






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






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






32. A pointer to data






33. To combine two ordered linear structures into one






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






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






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






37. To hide similar items with the same name






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






39. A variable containing the address of other data






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






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






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






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






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






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






46. A case where tow data structures share some elements






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






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






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






50. All nodes below a give node in a tree