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. Two variables that reference the same object






2. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






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






13. A case where a program calls itself






14. To combine two ordered linear structures into one






15. A process that removes unwanted elements from a collection






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






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






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






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






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






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






22. A collection of values






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






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






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






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






27. A pattern that describes a set of similar programs






28. A pointer to data






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






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






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






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






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






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






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






36. A node of a tree that has children






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






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






39. The next element in a linked list






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






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






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






43. Any container with linear ordering






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






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






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






47. A runtime error that occurs when an operation such as method call is attempted on a null pointer






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






49. To hide similar items with the same name






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