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 problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






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






4. A pattern that describes a set of similar programs






5. A variable containing the address of other data






6. A collection of values






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






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






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






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






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






12. Composed of individually named data fields






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






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






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






16. To hide similar items with the same name






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






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






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






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






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






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






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






26. A case where tow data structures share some elements






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






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






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






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






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






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






33. A process that removes unwanted elements from a collection






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






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






36. The process of collecting garbage for recycling






37. Describes a though experiment or view of an entity






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






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






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






41. First-child/next-sibling






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






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






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






45. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






46. All nodes below a give node in a tree






47. To combine two ordered linear structures into one






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






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






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