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






2. Two variables that reference the same object






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






4. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






13. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






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






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






26. To combine two ordered linear structures into one






27. A pattern that describes a set of similar programs






28. Composed of individually named data fields






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






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






31. A pointer to data






32. Describes a function that modifies its arguments






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






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






35. Any container with linear ordering






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






37. An elements of a linked list - tree - or graph - often represented by a data structure






38. The next element in a linked list






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






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






41. A collection of values






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






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






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






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






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






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






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






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






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