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 collection of values






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






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






4. The next element in a linked list






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






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






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






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






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






10. A case where tow data structures share some elements






11. The process of collecting garbage for recycling






12. A description of the state of a process such as a board game






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






14. Describes a function that modifies its arguments






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






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






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






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






19. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






31. To hide similar items with the same name






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






33. Depth first search






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






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






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






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






38. A pattern that describes a set of similar programs






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






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






41. Composed of individually named data fields






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






43. Two variables that reference the same object






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






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






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






47. A case where a program calls itself






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






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






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