This was the busiest day so far for us at HPC. We started the morning session with a discussion on Hamiltonian cycles. We came to know that it is still a mysterious part in Discrete Mathematics, proving theories of which would fetch millions of dollars. Hm..Interesting. Only brute force can resolve whether a graph has a Hamiltonian cycle. This brought us to polynomial(p) time algorithms and non-deterministic polynomial(np) time algorithms. It was a point worth noting that np time algorithms can have polynomial time verifiers.
Then, we discussed about encryption of information and later came to discuss about Alan Turing, the father of Computer Science (er... I had mistaken his name with that of a British hacker (Gary McKinnon).Oops!). We came to know about the Turing machine and the Enigma machine. Later we proceeded to RSA algorithm, which is used to encode information that are transferred over the internet. As a part of the talk on encryption, we were given information about public keys and private keys. While both public and private keys are p class algorithms, decrypting without the private keys requires an np class algorithm, in other words brute force.
We went on to get informed about alphabet set and language of machines and designed a few machines. Deterministic finite state machines and non-deterministic finite state machines were discussed as a part of it. As we were designing machines for various conditions, we came across conditions for which we couldn't design machines with our limited knowledge. Hence, we came to the concept of Push Down machines.
Later, we were told the importance of using books from reputed authors for references. We were suggested to go through the works of Donald A Knuth of the Standford University. After that we proceeded on to discuss about how to use Octave.
During the afternoon session, we attended a talk given by Mr. Naveen Sivadasan from IIT Hyderabad on Data Stream Algorithms. Though most of it were quite tough for me, I could grab a point or two. The day finished with the blogging session and I am looking forward for the next day's class.
Then, we discussed about encryption of information and later came to discuss about Alan Turing, the father of Computer Science (er... I had mistaken his name with that of a British hacker (Gary McKinnon).Oops!). We came to know about the Turing machine and the Enigma machine. Later we proceeded to RSA algorithm, which is used to encode information that are transferred over the internet. As a part of the talk on encryption, we were given information about public keys and private keys. While both public and private keys are p class algorithms, decrypting without the private keys requires an np class algorithm, in other words brute force.
We went on to get informed about alphabet set and language of machines and designed a few machines. Deterministic finite state machines and non-deterministic finite state machines were discussed as a part of it. As we were designing machines for various conditions, we came across conditions for which we couldn't design machines with our limited knowledge. Hence, we came to the concept of Push Down machines.
Later, we were told the importance of using books from reputed authors for references. We were suggested to go through the works of Donald A Knuth of the Standford University. After that we proceeded on to discuss about how to use Octave.
During the afternoon session, we attended a talk given by Mr. Naveen Sivadasan from IIT Hyderabad on Data Stream Algorithms. Though most of it were quite tough for me, I could grab a point or two. The day finished with the blogging session and I am looking forward for the next day's class.
No comments:
Post a Comment