A little mathematical model.
Thebest thing about having a professor who has a terrible short term memory is that he will not remember things that might end up screwing you. For instance, a Lab Exam.
Enter, Dr. K Chandrasekaran. Former HOD of the Department of Computer Science Engineering and Information Technology. He buys shirts from his home-town(I have no clue where it is) that suit his taste and asks his wife for her opinion. He has an obsession for Ideal icecream and it is an inherent part of any example that he provides in the course of his infrequent discussions on the topic.
He also has a very bad short term memory. Which is all very fine for the 59 of us who had our lab exam deferred by four days, simply because he forgot he was supposed to do it today.(KC, you the man!)
Now, the moment he said that 50% of my meagre brain switched off and I was wondering what to do to while away the next forty minutes. For some reason, the time complexity analysis that he was doing, inspired this little paper that I present below.
Analysis and determination of an upper bound on the number of relationships before a successful love relationship
Abstract
The primary aim of this paper is to quantify, in a possibly deterministic manner, the average number of relations that an individual must have before he enters into a successful lasting relationship. The model that we present is a fairly idealistic model that is bound by some constraints. We use the growth function of the model to determine the number of relationships needed. Further, we also try to account for the fact that the alogrithm might end before the upper bound is reached. This is accounted for by using a probablity function that computes the success rate of a given relationship. Finally, we present a sample case study and an implementation of the model using C.
Enter, Dr. K Chandrasekaran. Former HOD of the Department of Computer Science Engineering and Information Technology. He buys shirts from his home-town(I have no clue where it is) that suit his taste and asks his wife for her opinion. He has an obsession for Ideal icecream and it is an inherent part of any example that he provides in the course of his infrequent discussions on the topic.
He also has a very bad short term memory. Which is all very fine for the 59 of us who had our lab exam deferred by four days, simply because he forgot he was supposed to do it today.(KC, you the man!)
Now, the moment he said that 50% of my meagre brain switched off and I was wondering what to do to while away the next forty minutes. For some reason, the time complexity analysis that he was doing, inspired this little paper that I present below.
Analysis and determination of an upper bound on the number of relationships before a successful love relationship
Abstract
The primary aim of this paper is to quantify, in a possibly deterministic manner, the average number of relations that an individual must have before he enters into a successful lasting relationship. The model that we present is a fairly idealistic model that is bound by some constraints. We use the growth function of the model to determine the number of relationships needed. Further, we also try to account for the fact that the alogrithm might end before the upper bound is reached. This is accounted for by using a probablity function that computes the success rate of a given relationship. Finally, we present a sample case study and an implementation of the model using C.