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 sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






2. A case where a program calls itself






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






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






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






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






7. In a tree - a node pointed to by a parent node






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






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






10. Composed of individually named data fields






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






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






13. A case where tow data structures share some elements






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






15. To hide similar items with the same name






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






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






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






19. In a tree - the union of a node's parent and the parent's ancestors






20. A variable containing the address of other data






21. Any container with linear ordering






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






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






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






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






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






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






28. The process of collecting garbage for recycling






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






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






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






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






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






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






35. Describes a though experiment or view of an entity






36. A pointer to data






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






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






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






40. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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