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






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






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






4. Two variables that reference the same object






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






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






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






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






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






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






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






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






13. A case where tow data structures share some elements






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






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






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






17. Composed of individually named data fields






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






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






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






21. Depth first search






22. A node of a tree that has children






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






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






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






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






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






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






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






30. A linked list in which each elements has both forward and backward pointers






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






32. The next element in a linked list






33. To hide similar items with the same name






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






35. To combine two ordered linear structures into one






36. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






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






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






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






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






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






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