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. Describes a data structure or device in which all accesses have the same cost - O(1)






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






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






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






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






6. A pointer to the next element in a linked list






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






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






9. To hide similar items with the same name






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






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






12. A process that removes unwanted elements from a collection






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






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






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






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






17. To combine two ordered linear structures into one






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






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






20. A case where tow data structures share some elements






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






22. Any container with linear ordering






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






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






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






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






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






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






29. All nodes below a give node in a tree






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






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






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






33. A contiguous block of memory containing elements of the same type - accessed by numeric index






34. A pointer to data






35. The process of collecting garbage for recycling






36. A case where a program calls itself






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






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






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






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






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






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






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






44. A node of a tree that has children






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






46. A pattern that describes a set of similar programs






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






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






49. The next element in a linked list






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