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 though experiment or view of an entity






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






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






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






5. Composed of individually named data fields






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






7. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






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






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






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






13. The next element in a linked list






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






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






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






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






18. A pattern that describes a set of similar programs






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






20. To hide similar items with the same name






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






22. First in first out: describes ordering of a queue






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






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






25. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






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






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






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






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






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






32. A process that removes unwanted elements from a collection






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






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






35. Depth first search






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






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






38. The process of collecting garbage for recycling






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






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






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






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






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






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






45. First-child/next-sibling






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






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






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






49. All nodes below a give node in a tree






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