Learn about the FIFO page replacement in detail.
I'm currently pursuing Ph.D. degree in Computer Engineering from the University of Cyprus. I'm also working at KIOS Research and Innovation Center of Excellence. My research area includes Cyber Security, Algorithms, Machine Learning. In my free time, I love watching cricket and movies.
Here's what I've written (so far):
Explore the branch and bound method in detail.
Discuss the worst-case scenario for time complexity of the Quicksort algorithm.
Analyze the pseudocode of the bubble sort algorithm and its time complexity.
Learn how to find the total number of spanning trees and minimum spanning trees in a graph.
Learn about the Floyd-Warshall algorithm to find all pair shortest distance in a weighted directed graph.
A quick and practical overview of finding articulation points of a graph.
Discuss the Cook-Levin theorem to show SAT is an NP-Complete problem.
Learn about the concept of incident edges and vertices in both directed and undirected graphs.
Learn how to calculate the maximum number of edges in a directed graph.