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. An item (or description of items) being sough in a search






2. Describes a function that modifies its arguments






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






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






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






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






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






8. Depth first search






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






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






11. Any container with linear ordering






12. A case where tow data structures share some elements






13. The next element in a linked list






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






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






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






17. A node of a tree that has children






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






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






20. First-child/next-sibling






21. Given two sets - the intersection is the set of elements that are members of both sets






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






23. A pointer to data






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






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






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






27. Composed of individually named data fields






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






29. A pattern that describes a set of similar programs






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






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






32. A case where a program calls itself






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






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






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






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






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






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






39. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






40. The top node of a tree - from which all other nodes can be reached






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






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






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






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






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






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






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






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






49. Two variables that reference the same object






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