Final Exam: Python Apprentice

WHAT YOU WILL LEARN

• 

  Describe a linked list, and its contents and structure
  

  define the classes and functions required to implement a binary search tree
  

  define classes as abstract
  

  describe how a sorted list of elements can be searched efficiently using a binary search
  

  recall the metrics on which algorithms and operations on data are evaluated
  

  describe the steps involved in performing an insertion sort and compare it to the bubble sort
  

  recognize what trees and binary trees are and recall the properties of a binary search tree
  

  implement an adjacency set representation for a graph
  

  define a class to represent a graph in the form of an adjacency matrix
  

  identify what makes a data structure and some of the purposes they serve
  

  control how you handle exceptions that your code may raise
  

  represent objects using customized strings
  

  invoke base class methods from subclasses
  

  distinguish between the r+ and a+ modes to read from and write to a file
  

  work with utility methods on classes
  

  identify the various properties of sorting algorithms that must be considered when selecting the right one for your data
  

  set up the jupyter notebook ide to run and develop python 2 code by installing a kernel for it
  

  describe how classes can be used as blueprints to create objects
  

  implement the bubble sort algorithm in python
  

  create functions to perform common bst operations such as lookup and finding the minimum and maximum values
  

  recognize the differences between the read(), readline(), and readlines() functions when working with files in python
  

  run your code from the python shell and recognize how to execute single-line and multi-line commands
  

  assign attributes to objects of classes
  

  write the partition and quicksort functions to implement a quicksort
  

  identify operations that run in constant time regardless of input
  

  use the open function in python to open a file for reading
  

  implement a custom stack class that includes functions for the common stack operations
  

  define multiple base classes for a single subclass
  

  recall how state and behavior can be encapsulated in a single unit
  

  recall the different ways in which to traverse a bst and describe the method to perform a breadth-first traversal
• 

  create a classes using python
  

  perform floor division, modulo, and power-of operations
  

  use the 2to3 conversion tool to identify the lines in your python 2 scripts that need to be altered for python 3 compatibility
  

  pass arguments to initialize the state of a class object
  

  perform addition operations on custom objects
  

  summarize how insert and lookup operations occur in a bst
  

  write the code to implement a selection sort
  

  recognize how the performance of operations and algorithms is expressed in terms of the size of the input
  

  describe the operations involved when sorting a list of values using the selection sort algorithm
  

  use pre-built python modules to perform common operations by importing them into your source code
  

  use class hierarchies
  

  describe the differences between the read(), readline(), and readlines() functions when working with files in python
  

  outline the workings of the shell sort and recall the performance metrics of this divide and conquer algorithm
  

  use a try and except block to handle a python exception
  

  define multiple inheritance levels in classes
  

  recall how class variables are different from instance variables
  

  summarize the pre-order and in-order depth-first traversal techniques for a bst
  

  implement the native queue class of python and perform the standard queue operations on it
  

  recognize the features available in popular python libraries such as numpy, random, and datetime
  

  describe how the performance of operations and algorithms is expressed in terms of the size of the input
  

  use the native queue class of python and perform the standard queue operations on it
  

  recognize how exceptions are defined in a hierarchy and how related exceptions can be caught and handled
  

  define a linked list class and implement functions to insert a node at the head or the tail of the linked list
  

  code a function to implement the insertion sort algorithm
  

  recall the default base class for all python classes
  

  code a function to perform a breadth-first traversal of a graph
  

  work with class hierarchies
  

  initialize class variables using the init special method
  

  use pip to install a module in your environment and import it into your python applications
  

  perform subtraction operations on custom objects