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 data structure that can be identified at runtime as being a member of a class






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






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






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






5. The next element in a linked list






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






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






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






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






10. First-child/next-sibling






11. Depth first search






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






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






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






15. All nodes below a give node in a tree






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






17. Describes a though experiment or view of an entity






18. The area of program text over which a variable can be referenced






19. A process that removes unwanted elements from a collection






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






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






22. A case where a program calls itself






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






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






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






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






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






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






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






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






31. To hide similar items with the same name






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






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






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






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






36. A pattern that describes a set of similar programs






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






38. A pointer to data






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






40. A case where tow data structures share some elements






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






42. A collection of values






43. To combine two ordered linear structures into one






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






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






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






47. Describes a function that modifies its arguments






48. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






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