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. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






13. Depth first search






14. Any container with linear ordering






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






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






17. The next element in a linked list






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






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






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






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






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






23. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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






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






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






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






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






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






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






31. Describes a though experiment or view of an entity






32. To hide similar items with the same name






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






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






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






36. A node of a tree that has children






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






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






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






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






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






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






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






44. Composed of individually named data fields






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






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






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






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






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






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