Blog

On a P&ID, what does FE represent? (Instrumentation)

What is a possible Adjacency List for the following graph?

Which nodes would need to be examined in order to find the value 12?

What is the height of the tree given the pre-order traversal below? 42, 37, 18, 40, 39, 51, 45, 60, 65

What is a more optimal number for the size of a hashtable?

What is the list look like after the following code segment? Given the following doubly linked-list with pointers to prev and next auto temp = tail;while(temp->data > 6){ temp = temp->prev;}temp->prev->next = temp->next;temp->next->prev = temp->prev;

Which of the following represents a pre-order traversal of the following tree?

Write a templated C++ function called findMax that takes an array of any data type and its size as parameters and returns the maximum element in the array. For example: int arr[] = {3, 7, 2, 9, 5};  cout

Use a table and create an Adjacency Matrix for the following graph.

Which of the following is NOT a valid instantiation of the class? template class Tank{ public: Tank(T data, bool filled = false):data(data), filled(filled){} T getData() { return data; } bool isFilled(){ return filled; } private: T data; bool filled; };