Raman sir's lecture..

Today,16 sep,2007, we had Raman sir's lecture..I know this is not special event..but today it was special because today is sunday and sir contributed his valuable time in favour of students..We had lots of problems,queries and sir loaded with lots of answers and satisfied everyone's queries..Session started at 10 a.m. and first topic was Array..Single dimensional array and multidimensional array..and how could we view these types of arrays in real world. Two dimensional array is like a list and Three dimensional array is like a cube...then a new query arised How to convert a tree into an array?? and sir suggested a simple solution by using recursion function and mean time when we worked on this problem someone else was in another world of problem and thought Is it necessary that we assign null value in a tree?? Can we assign some other value and when we implement tree in the array then what value will we assign?? and then one more solutiion came from sir's side that we can use Integer.minvalue and Integer.maxvalue...
After this a very good question was waiting and when it saw no one is there..it suddenly came out..and problem was What is Recursion??? When do we us it?? and What is Global variables and Local variables?? and How we used it??? Long session was dedicated to this problem because then every possible use of recusion in data structure is used in that session..and It started from What is recursion??then we disscussed a factorial program..and store the value of each factorial by using global variable and then it cleared How to use recursion and why we need global variables..After solving all these problems.. Now,next target was How to find a node in Binary tree???and we met the target by solving it using recursion function..and then some stack operations were disscussed..How to implement postfix??and solution is by using stack then next question was How to implement Infix and solution is by using Tree...As we know very well "Human Mind Is Full Of Queries"..so,every solution gave birth to new problem and again a question arised How to convert Infix to Postfix???and as frequently problem occured as frequently solutions were also occured..and solution is find postorder in tree and then u find the Postfix of a Infix notation..After that we discussed circular queue and how to implement it without using a counter..after solving this problem,At the end of the morning session before lunch we dicussed Breadth first search..and when lots of queries got answers..we went for lunch to prepare themselves for next session but one thing was there that move in everyone's mind that today is SUNDAY... :) Sir had the solution of this problem also and end the session for today and gave chance to enjoy our weekend.. :)