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. To combine two ordered linear structures into one






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






3. A process that removes unwanted elements from a collection






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






5. A pattern that describes a set of similar programs






6. All nodes below a give node in a tree






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






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






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






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






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






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






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






14. A pointer to data






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






16. A node of a tree that has children






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






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






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






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






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






22. To hide similar items with the same name






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






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






25. A case where tow data structures share some elements






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






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






28. A case where a program calls itself






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






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






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






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






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






34. A collection of values






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






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






37. Depth first search






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






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






40. A variable containing the address of other data






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






42. Describes a function that modifies its arguments






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






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






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






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






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






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






49. Describes a though experiment or view of an entity






50. Two variables that reference the same object