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






2. Any container with linear ordering






3. A pattern that describes a set of similar programs






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






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






6. Two variables that reference the same object






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






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






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






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






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






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






13. First-child/next-sibling






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






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






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






17. 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?"






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






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






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






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






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






23. A collection of values






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






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






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






27. To combine two ordered linear structures into one






28. A case where tow data structures share some elements






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






30. The next element in a linked list






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






32. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






39. Describes a though experiment or view of an entity






40. The process of collecting garbage for recycling






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






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






43. All nodes below a give node in a tree






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






45. To hide similar items with the same name






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






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






48. Depth first search






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






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