Data Structures Final Review

81 Questions | Total Attempts: 56

SettingsSettingsSettings
Please wait...
Data Structures Final Review

Questions and Answers
  • 1. 
    Stack is an Abstract Class
    • A. 

      True

    • B. 

      False

  • 2. 
    Stack is an Abstract Data Type
    • A. 

      True

    • B. 

      False

  • 3. 
    Pez Dispenser Anaolgy
    • A. 

      Queue

    • B. 

      Stack

    • C. 

      Array

  • 4. 
    LIFO structire stands for...
    • A. 

      Last In Furthest Out

    • B. 

      Least In First Out

    • C. 

      Last In First Out

  • 5. 
    A queue is and ADT in which elemets are added and removed from one end only; first-in-first-out (FIFO) structure.
    • A. 

      True

    • B. 

      False

  • 6. 
    The running time of RETREIVE call on a linked list is O(1) = constant
    • A. 

      True

    • B. 

      False

  • 7. 
    Insert, Append, Delete, and Next are all valid list operations.
    • A. 

      True

    • B. 

      False

  • 8. 
    An enque is the opposite of a deque
    • A. 

      True

    • B. 

      False

  • 9. 
    A node at level X is also said to be a depth of X
    • A. 

      True

    • B. 

      False

  • 10. 
    Postfix notation may not contain negative numbers
    • A. 

      True

    • B. 

      False

  • 11. 
    An ordered tree in which each vertex has 0, 1, or 2 children
  • 12. 
    The name of the second child of a vertex on a binary tree
  • 13. 
    A node connected via edges to a higher node
  • 14. 
    The unique vertex in a rooted tree
  • 15. 
    A node connected via edges to a lower node
  • 16. 
    If "X" is a descendent of "Y", then "Y" is a __________ of "X".
  • 17. 
    A child (grandchild, great-grand-child, etc...) of a specific vertext.
  • 18. 
    The length of the path from the root to the vertext of interst
  • 19. 
    Any non-leaf vertext
  • 20. 
    All the descendents of a vertex
  • 21. 
    • A. 

      A

    • B. 

      B

    • C. 

      Neither

  • 22. 
    The length of the longest path from a vertex to a leaf that is a descendent of the vertex
    • A. 

      Height

    • B. 

      Depth

  • 23. 
    All parents have the same depth, but not necessarily the same height
    • A. 

      True - parents

    • B. 

      False - siblings

  • 24. 
    Property of all trees
    • A. 

      #Edges = #Nodes - 1

    • B. 

      #Nodes = #Edges - 1

  • 25. 
    An ordered tree in which each vertex has either no children, one child, or two children
    • A. 

      Sub Tree

    • B. 

      Ordered Tree

    • C. 

      Binary Tree