CS2004 Flash cards

Question	Answer
What is LIFO ? Give an example.	LIFO stands for Last In First Out. It is a method of data handling where the last element is processed first instead of the order it was inserted. Example - stacks.
What is FIFO ? Give an Example.	FIFO stands for First In First Out. It is a method of data handling where the elements are processed in the order it was inserted e.g. first element is processed first. Example - queues.
What is complete graph ?	Usually an undirected graph with edge between each pair and vertices.
Calculate Big-T and Big-O for this pseudocode. Image: Bubble Sort (binary/octet-stream)	TBC
What is Dijkstra’s Algorithm ?	It is an algorithm for finding the shortest path between nodes in a graph.
Write a pseudocode for Dijkstra algorithm.	Image: Dijkstra+Algorithm (binary/octet-stream)
What is a graph ?	A graph is a set of vertices and edges such that every edge is attached at each end to a vertex.
What is an Eulerian path ?	An Eulerian path is a path that includes every edge of graph exactly once.
What is Eulerian circuit ?	An Eulerian circuit is an Eulerian path for which first and last vertex coincide.
What is a semi-Eulerian ?	It is a connected graph that has Eulerian path but no Eulerian circuit.

Resource summary

	Created by Crimson Haze over 2 years ago