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 function that makes a new data structure but does not modify its arguments






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






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






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






5. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






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






16. To hide similar items with the same name






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






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






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






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






21. A pointer to data






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






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






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






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






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






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






28. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






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






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






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






32. A process that removes unwanted elements from a collection






33. A linked list in which the last element points back to the first element






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






35. To combine two ordered linear structures into one






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






37. All nodes below a give node in a tree






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






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






40. First-child/next-sibling






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






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






43. A case where a program calls itself






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






45. Depth first search






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






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






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






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






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