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. To combine two ordered linear structures into one






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






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






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






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






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






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






9. A case where a program calls itself






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






11. Depth first search






12. A pointer to data






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






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






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






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






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






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






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






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






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






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






23. Composed of multiple sequential elements stored in contiguous bytes of memory






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






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






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






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






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






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






30. Any container with linear ordering






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






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






33. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






44. The process of collecting garbage for recycling






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






46. Describes a function that modifies its arguments






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






48. Describes a though experiment or view of an entity






49. A case where tow data structures share some elements






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