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. Separation of the properties of a data type from its implementation






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






3. Two variables that reference the same object






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






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






6. Describes a function that modifies its arguments






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






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






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






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






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






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






13. To hide similar items with the same name






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






15. All nodes below a give node in a tree






16. A case where a program calls itself






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






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






19. A pointer to data






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






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






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






23. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






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






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






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






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






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






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






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






33. The next element in a linked list






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






35. A node of a tree that has children






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






37. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






39. First-child/next-sibling






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






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






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






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






44. The process of collecting garbage for recycling






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






46. A description of operations on a data type that could have multiple possible implementations






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






48. Any container with linear ordering






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






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