 Home  Sign up!  Projects  Seminars  Research Notes  Today's Lecture  About 
Superna SharmaEmail cygnus8@rediffmail.com
 Profile: I'm a sophomore student at AIT which is affiliated to Tarleton State University, Texas. Till now I've done advanced cources in MySQL, Visual C++ which includes windows programming, PHP and ASP.
Other than this my interests include playing outdoor games mainly Basketball. I also enjoy listening to Rock music. Prof. Ashay Dharwadker's Courses (2): Course  Semester  Grade   Information Systems  Fall 2003  View   Database Systems  Fall 2003  View  

Project ID: 42 Course: Database Systems Topic: Time Table
 Description: I am making this project with my partner Atika Shirkot. Initially
we had started creating the database of the National Basketball Association.
However, as we went along we changed our mind and finally shifted to creating
the database of the time table for the college.
As of now the progress that we have made in this project is that we
have created six tables, each having the primary key and each link table
having a primary key as well as the foreign key. The six tables that we
have made are as follows : Course, University, Day, Timings, C_U_D, C_U_T.
The last two tables are the link tables and consist of both primary key
as well as foreign key.
Now to give you the idea of the fields that are incorporated in the
various tables, let us take each table seperately.

1st table: Course Fields are C_Code, C_Name, Credits, Lecturer.
The primary key used in this table is C_Code.

2nd table: University Fields are U_id, U_Name. The primary key
is U_id.

3rd table: Day Fields are D_id, Day. The primary key is D_id.

4th table: Timings Fields are T_id, T_Start, T_End. The primary
key is T_id.

5th table: C_U_D Fields are C_Code, U_id, D_id. The primary keys
are C_Code, U_id, D_id. The foreign key is C_Code. The foreign key is U_id.
The foreign key is D_id. These foreign keys are in respect to the particular
tables.
Similarly we made the 6th table and found out its primary keys and foreign
keys. The queries used have been mentioned by Atika Shirkot (my partner) in her project description. Kindly refer to her project description for MySQL queries used. 
Seminar ID: 38 Course: Information Systems Topic: Towers of Hanoi
 Description: This seminar on "Towers of Hanoi" was given by me along with Atika Shirkot as my partner.Towers of Hanoi is basically a game which has a legend associated with it i.e." How can the hermits shift 64 discs from one peg (source) to the third peg (destination) and the day it is done the earth would come to an end." There are three pegs and the discs have to be moved from the first to the last one which is the destination keeping in mind the two rules that are: 1. not to keep the larger disc on the smaller one and 2.move a disc at a time. We showed how this can be done and the method used was "Recursion" the formula derived in general for n discs is 2^n1 . For example, the animation below shows the case n=3:
Along with this we showed them that this method is the optimal and proved it through Induction.We had also made an algorithm and program for this.We even showed that how much time the hermits would take to complete this and the process is still going on.This seminar on "Towers of Hanoi" was given by Atika along with me as my partner.Towers of Hanoi is basically a game which has a legend associated with it i.e." How can the hermits somewhere in Hoanoi can shift 64 discs from one peg (source) to the third peg (destination) ." There are three pegs and the discs have to be moved from the first to the last one which is the destination keeping in mind the two rules that are: 1. not to keep the larger disc on the smaller one and move a disc at a time." We showed how this can be done and the method used was "Recursion" the formula derived in general for n discs is 2^n1 . Along with this we showed them that this method is the optimal and proved it through Induction.We had also made an algorithm and program for this.We even showed that how much time the hermits would take to complete this and the process is still going on.I believe that the it was appreciated by the people and we hope to keep up their expections in our next seminar also that is linked to it "Complexity"This seminar on "Towers of Hanoi" was given by Atika along with me .Towers of Hanoi is basically a game which has a legend associated with it i.e." How can wthe hermits somewhere in Hoanoi can shift 64 discs from one peg (source) to the third peg (destination) ." There are three pegs and the discs have to be moved from the first to the last one which is the destination keeping in mind the two rules that are: 1. not to keep the larger disc on the smaller one and move a disc at a time." We showed how this can be done and the method used was "Recursion" the formula derived in general for n discs is 2^n1 . Along with this we showed them that this method is the optimal and proved it through Induction.We had also made an algorithm and program for this.We even showed that how much time the hermits would take to complete this and the process is still going on.We enjoyed working on this. I believe that it was appreciated by the people and we hope to keep up to their expections in our next seminar which also that is linked to it, on "Complexity".

Seminar ID: 39 Course: Information Systems Topic: Complexity
 Description: This was the second seminar presented by me along with my partner
Atika Shirkot. As mentioned in the earlier seminar description, "Complexity"
is linked to the concept of "Towers of Hanoi".
During the course of this seminar, we first explained what an algorithm
is and how the implementation of an algorithm is done through reccursion
and iteration.
Basically we find out that in reccursion the function goes on calling
itself till we reach the desired result, whereas in iteration, the problem
is solved through loops.
We also explained the simplicity of the term Complexity. Complexity
though sounding very complex is a very simple concept. Say for example
 we take the general formula we derived in Towers of Hanoi to find the
time taken to move the 'n' number of disks from source to destination peg
:
T_{n} = 2^{n}  1
We take the 'time compexity' of the above formula to be only 2^{n}.
To give a general solution we can therefore, say that time complexity of
any problem would be the term in the formula having the highest degree
or power.
Hence, in reference to our earlier seminar we could say that complexity
of the Towers of Hanoi problem is 2^{n}. 
Research Note ID: 44 Course: Database Systems Topic: The Third Manifesto
 Description: The Third Manifesto has been suggested by E.F Codd himself. It is the foundation for future Database Systems. The Third Manifesto is a proposal for the future direction of data and database management systems. It consists of a formal definition of an abstract model of data, which has begun to be considered as a blueprint for the design of a DBMS. Among other things, it provides a rocksolid foundation for integrating relational and object technologies.
The proposed foundation represents an evolutionary step, not a revolutionary one; it builds on Codd's relational model of data. It also incorporates a comprehensive specification for a method of defining data types, including a comprehensive model of type inheritance, thus, it also builds on research in the field of object orientation. With a strong footing in both areas of the object/relational divide, the Manifesto is offered as a firm foundation for the DBMSs of the future. 

Last updated on Friday, 21st November 2003, 02:24:04 PM.
Prof. Ashay Dharwadker

