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. The area of program text over which a variable can be referenced






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






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






4. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






14. A case where a program calls itself






15. A process that removes unwanted elements from a collection






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






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






18. A pattern that describes a set of similar programs






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






20. A collection of values






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






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






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






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






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






26. Describes a though experiment or view of an entity






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






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






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






30. The next element in a linked list






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






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






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






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






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






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






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






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






39. Any container with linear ordering






40. Two variables that reference the same object






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






42. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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