| Home | Sign up! | Projects | Seminars | Research Notes | Today's Lecture | About |
Member ID: 8

Mayank Bhargava


Profile: I am currently doing my graduation from Ansal institute of technology in computer information system.Related to computers my interest is in Windows programming,programming language(C++). I am learning the French language from Alliance Francaise.

Prof. Ashay Dharwadker's Courses (2):

Information SystemsFall 2003View
Database SystemsFall 2003View

Projects (1)

Project ID: 14
Course: Database Systems
Topic: Periodic table
Description: I'm planning to submit the project on periodic table consisting name of the element, atomic number, atomic mass, common compound as the possible entity. I've searched many websites related to my project which helped me a lot in making a brief outline of my project.

Seminars (1)

Seminar ID: 6
Course: Information Systems
Topic: Queuing theory
Description: The topic of my seminar was Queuing theory. In my seminar I covered Queues and their types. I also mentioned applications of queues. I also made a programme which demonstrates the concept of queues.
I think the response from the audience was very good. Our respected Sir, too liked our seminar.

Research Notes (2)

Research Note ID: 4
Course: Database Systems
Topic: Towers of Hanoi
Description: According to a legend, in the temple of Hanoi, there lies a brass plate on which are mounted three diamond pin. On the first pin, 6 discs of pure gold are placed with the largest disc placed first and the rest on top of it in decreasing order of size. The priest in the temple more the discs from one pin to another based on the following rules: 1) Only one disc at a time should be moved, specifically the topmost disc from any pin. 2) A larger disc should never be placed on a smaller disc. -The priest believe that once the tower has been transferred to another pin, there will be heaven on earth. Therefore they want to complete in least no. of moves. The following general notations denotes a procedure that will move the top n discs from the first pin START to the final pin FINISH through the temporary pin in TEMP. MOVE ( n, START, TEMP, FINISH ) The following procedure provides a recursive solution for n discs. MOVE ( n, START, TEMP, FINISH ) 1) If n=1, then START-> END Return. 2) Call MOVE ( n-1, START, TEMP, FINISH ) 3) START-> END 4) Call MOVE ( n-1, START, TEMP, FINISH ) 5) Return. This solution can be viewed as the divide & conquer algorithm.

Research Note ID: 12
Course: Information Systems
Topic: Queuing theory

Queueing Theory

Queues in computer science are very similar to queues in real life. A queue in real life would be a line up at a fast food counter or bank tellers machine where people are serviced in the order they arrive.
Therefore, we can say that a queue is a sequential list in which items are inserted into the tail end of the queue and taken from the head. The "tail" is referred to as the REAR and the "head" is the FRONT of a queue. Thus in a queue each element is deleted from an end, labled FRONT, and added at the other end, labled REAR. For this reason, queues are often called First In First Out (FIFO) lists.
The most obvious example is the printer queue. In a multi-user environment, the printer is requested for multiple print jobs, each printing job is inserted at the rear of the queue in the order it is sent to the printer and is then printed on First In First Out basis.

Types of Queues

Queues can be categorised into two types:
  • Deques(pronounced either deck or deQueue)
    The term deques stands for a double-ended queue. In such a queue, elements can be added or removed from both the ends of the queue.
    There are two types of deques:
  • Input restricted deques
    In an input-restricted deques, elements can be inserted only from the end of the deques, but can be deleted from both the ends.
  • Output restricted deques
    In an output-restricted deques, elements are inserted from both the ends of the deques, but can be deleted only from one end of the deques.
    • Priority Queue
      Often the items added to a queue have a priority associated with them that determines the order in which each element is processed and deleted. Such a kind of queue is called a priority queue.
    In priority queues:
    1. An element with a higher priority is processed first.
    2. If two elements share the same priority, then the element that came in first is processed first. Programs with higher priority are processed first. Programs with the same priority form a separate standard queue.

    For more reference visit :

    Reference: http://www.ms.ic.ac.uk/jeb/or/queue.html

  • Last updated on Friday, 7th November 2003, 09:42:26 AM.

    Prof. Ashay Dharwadker