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 pointer to the next element in a linked list






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






3. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






14. To hide similar items with the same name






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






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






17. A pattern that describes a set of similar programs






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






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






20. A pointer to data






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






22. The process of collecting garbage for recycling






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






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






25. A case where tow data structures share some elements






26. A variable containing the address of other data






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






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






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






30. Describes a function that modifies its arguments






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. A node of a tree that has children






34. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






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






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






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






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






49. First-child/next-sibling






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