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. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






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






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






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






6. A variable containing the address of other data






7. A case where tow data structures share some elements






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






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






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






11. A collection of values






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






13. The process of collecting garbage for recycling






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






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






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






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






18. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






29. In a tree - the union of a node's parent and the parent's ancestors






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






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






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






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






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






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






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






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






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






39. Composed of individually named data fields






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






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






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






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






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






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






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






47. A case where a program calls itself






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






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






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