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. Values are in the most basic form and cannot be decomposed into smaller parts






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






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






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






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






6. A collection of values






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






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






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






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






11. Describes a function that modifies its arguments






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






13. Two variables that reference the same object






14. All nodes below a give node in a tree






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






16. The process of collecting garbage for recycling






17. A variable containing the address of other data






18. Depth first search






19. A pattern that describes a set of similar programs






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






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






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






23. Use of a function or method without knowing how it's accomplished






24. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






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






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






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






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






30. A case where a program calls itself






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






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






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






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






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






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






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






38. A pointer to data






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






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






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






42. Composed of individually named data fields






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






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






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






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






47. A process that removes unwanted elements from a collection






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






49. First-child/next-sibling






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