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. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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. Separation of the properties of a data type from its implementation






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






14. Describes a function that modifies its arguments






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






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






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






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






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






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






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






22. A pattern that describes a set of similar programs






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






24. The process of collecting garbage for recycling






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






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






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






28. A node of a tree that has children






29. A collection of objects that are inserted and removed according to the LIFO principle






30. Depth first search






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






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






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






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






35. A variable containing the address of other data






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






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






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






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






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






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






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






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






44. Any container with linear ordering






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






46. The next element in a linked list






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






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






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






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