The day started with the discussion on Hammaltonian path which means that the person has to move covering all vertices only once,the edges can be repeated but the vertices shouldn't be repeated.Unlike Euler method there is no specific method to identify a Hammaltonian path.
The session gave an idea about polynomial type(P class-eg : n^2) and non deterministic polynomial type(NP class -eg:log functions ,2^n) algorithms.A small discussion on data encryption,the usage of public and private key was carried on.Encryption using public key and decryption using private key is included under P class algorithm and decryption without private key is included under NP class algorithm.
The session continued with the topic of machine design which takes into account the accepting or rejection of certain combinations.It also threw light on the alphabet set of a machine.It helped us to design machines that will accept the specific input given to us.It was followed by the concept of nondeterministic (multiple choices available in a single string) and deterministic finite state machines.
The idea of push and pop was introduced to us through an example that reveals the limitation of computing.Analysis of different cases were done the concept of Push Down Machines (eg:a machine that will accept 0^n 1^2n) was also discussed.
The last session was on octave-how it is used in matrix numerical computation, about its interpreter,how a variable can be declared and redeclared at any time,matrix operations like addition,multiplication,inverse,transpose were executed.It also had the knowledge about coding to find out the square root of a number using methods of incrementation and bisection.Different keywords like if,while,for were also introduced.
The day concluded with a talk on DATA STREAM ALGORITHMS AND APPLICATIONS by Mr.Naveen,Assistant Professor IIT Hyderabad.Although the entire concept was not clear a vague idea was obtained regarding data stream,the challenges like faster rate and limited memory storage and the approaches to solve the problems of data streamlines.
The session gave an idea about polynomial type(P class-eg : n^2) and non deterministic polynomial type(NP class -eg:log functions ,2^n) algorithms.A small discussion on data encryption,the usage of public and private key was carried on.Encryption using public key and decryption using private key is included under P class algorithm and decryption without private key is included under NP class algorithm.
The session continued with the topic of machine design which takes into account the accepting or rejection of certain combinations.It also threw light on the alphabet set of a machine.It helped us to design machines that will accept the specific input given to us.It was followed by the concept of nondeterministic (multiple choices available in a single string) and deterministic finite state machines.
The idea of push and pop was introduced to us through an example that reveals the limitation of computing.Analysis of different cases were done the concept of Push Down Machines (eg:a machine that will accept 0^n 1^2n) was also discussed.
The last session was on octave-how it is used in matrix numerical computation, about its interpreter,how a variable can be declared and redeclared at any time,matrix operations like addition,multiplication,inverse,transpose were executed.It also had the knowledge about coding to find out the square root of a number using methods of incrementation and bisection.Different keywords like if,while,for were also introduced.
The day concluded with a talk on DATA STREAM ALGORITHMS AND APPLICATIONS by Mr.Naveen,Assistant Professor IIT Hyderabad.Although the entire concept was not clear a vague idea was obtained regarding data stream,the challenges like faster rate and limited memory storage and the approaches to solve the problems of data streamlines.
No comments:
Post a Comment