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 case where a program calls itself






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






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






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






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






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






7. A list of pairs - where each pair has a key and a value associated with the key






8. A collection of values






9. A pattern that describes a set of similar programs






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






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






12. A node of a tree that has children






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 function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






42. To combine two ordered linear structures into one






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






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






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






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






47. Any container with linear ordering






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






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






50. Describes a though experiment or view of an entity