Amutheezan

Amutheezan

Postdoctoral Fellow

Short Semester 6

less than 1 minute read

Published:

Generally, we have a semester of 21 to 23 weeks, but this semester contains only 8 weeks, 6 weeks out of 8 weeks are lectures. Rest 2 weeks are dedicated for revision and exams. I chose around 4 subjects in this semester.

I chose digital photography as a humanities subject. It was filled with lectures with presentations and photo descriptions; practicals of photoshoots during the weekends. It was a quite interesting subject and I was able to understand the basics of photography skills and how to take a photograph :P.

Next I chose Formal Methods in Software Engineering. A subject I loved the most in this semester. It explains about formally specifying systems, especially safety-critical systems, and also does formal analysis (proofing the specification) for the validity of the system.

Then the next choice was Human Computer Interaction; it covers how to define a UI that ensures better user experience. It is also a quite interesting subject.

With these three interesting subjects, I also took research and report writing and professional practice which are compulsory for us.

You May Also Enjoy

Time Complexity of Single-Source Shortest Path Algorithms

5 minute read

Published:

Graph data structures are widely used to represent different aspects of computer science (e.g., road networks). We can denote a graph as \(G = (V, E)\), where \(V\) represents the set of vertices (in the context of a road network, these represent intersections), and \(E\) represents the set of edges (representing road segments). We generally define \(n~(= |V|)\) as the number of vertices and \(m~(= |E|)\) as the number of edges to express the time and space complexity of graph algorithms. One such problem is single-source shortest path (SSSP), which is used to find the shortest path from a single node to all other nodes. For decades, Dijkstra’s algorithm has been the go-to method for solving this problem. The runtime of Dijkstra’s algorithm depends on the priority queue implementation and often has a complexity of \(O(m + n \log n)\). Read more

CPU/GPU/TPU Performance Comparison

7 minute read

Published:

I have implemented a simple comparison of performance on Google Colab CPU, GPU, and TPU as part of an assignment for COSC 6385 course at the University of Houston. Read more

Spectre Vulnerability Simulation

2 minute read

Published:

In this post, I share some details on my extension to a simple simulation for the Spectre attack as part of the assignment for COSC 6385 course at the University of Houston. Read more

Meltdown Vulnerability Simulation

5 minute read

Published:

I have implemented a simple simulation for the Meltdown vulnerability as part of the assignment for COSC 6385 course at the University of Houston. Read more