Category Archives: Computer Science

Abstract data types are the interfaces that tells us what are the possible commands or things we can do in a data structure. There are many situations wherein we would employ ADTs. One example would be the “undo-redo” commands we have in most applications we have in our computers. The application would record or theContinue reading “Abstract Data Types”

There are three running times we expect in dealing with data structures: worst-case, amortize and expected. These describe about the time that is used up when we are trying to access data structures with algorithms. Let’s describe what these are. Worst‐case The strongest type of running time guarantee; i.e., if an algorithm has a worst‐caseContinue reading “Worst-case, Amortized & Expected Running Times”

This exercise focuses on the running time of a code. Here, I had two sorting algorithms – a selection sort function I made (user-defined function), and the built in sorted() function in Python. I expect that the built-in function is faster, because it is *built in*, as compared to the function I made that consumesContinue reading “Exercise 1 – Plotting the Running Time”

Challenges are what make life interesting. Overcoming them is what makes them meaningful. – Some motivation quote about “challenges” My first blog for a computer science subject. Weird. I wasn’t expecting this, assuming that we would do more of coding and learning and applying, all those fun stuff. However, I did got into an onlineContinue reading “(CMSC) 1…2…3…, Here We Go!”