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 top node of a tree - from which all other nodes can be reached






2. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






3. Any container with linear ordering






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






5. To combine two ordered linear structures into one






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






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






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






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






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






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






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






13. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






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






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






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






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






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






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






22. The process of collecting garbage for recycling






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






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






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






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






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






28. A node of a tree that has children






29. A linked list in which each elements has both forward and backward pointers






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






31. Two variables that reference the same object






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






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






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






35. All nodes below a give node in a tree






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






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






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






39. A collection of values






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






41. A variable containing the address of other data






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






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






44. First-child/next-sibling






45. A pattern that describes a set of similar programs






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






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






48. Composed of individually named data fields






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






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