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. Composed of multiple sequential elements stored in contiguous bytes of memory






2. Depth first search






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






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






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






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






7. Describes a function that modifies its arguments






8. Composed of individually named data fields






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






10. Two variables that reference the same object






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






12. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






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






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






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






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. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






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






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






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






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






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






35. A variable containing the address of other data






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






37. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






47. A collection of values






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






49. Any container with linear ordering






50. The process of collecting garbage for recycling