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. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






4. Depth first search






5. The next element in a linked list






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






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






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






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






10. To combine two ordered linear structures into one






11. Two variables that reference the same object






12. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






23. A process that removes unwanted elements from a collection






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






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






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






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






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






29. A node of a tree that has children






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






31. A pattern that describes a set of similar programs






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






33. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






42. A variable containing the address of other data






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






44. A pointer to data






45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






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






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






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






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