5. What is a first-in-first-out data structure? Write algorithms to perform the following operations on it – create, insertion, deletion, for testing overflow and empty conditions.

6. What is a graph? What are the two ways of representing a graph? Describe with the help of illustrative examples.

7. What is a circular queue? Write algorithms to implement the insertion and deletion operations.

8. Write an algorithm to find the roots of a quadratic equation.

9. Design an algorithm to check whether a given string is a palindrome or not.

10. Develop an algorithm to generate all the prime numbers between the given 2 limits.

Dear Bhupinder,

In terms of a set of objects, the frist-in-first-out approach consists in that the first object to have been added to the set will be the first to be let out. Such a structure would provide you with at least two basic operations: to add objects in, and to get objects out. And a structure built along this approach would not allow for the possibility of letting you choose which object to retrieve: the objects get out in the order they got in (or were put in, to be more specific). 
A classic illustration and representation of this approach would be that of a tube the size of the objects you put in. You can add the objects only at one end, and get the objects back only at the other end. This way, you see that there is no way to get the objects in between. Of course, the size of the structure is not necessarily as limited as that tube, and depends on the implementation. 

Cracking IIT just got more exciting,It s not just all about getting assistance from IITians, alongside Target Achievement and Rewards play an important role. ASKIITIANS has it all for you, wherein you get assistance only from IITians for your preparation and win by answering queries in the discussion forums. Reward points 5 + 15 for all those who upload their pic and download the ASKIITIANS Toolbar, just a simple  to download the toolbar….

So start the brain storming…. become a leader with Elite Expert League ASKIITIANS

Thanks

Aman Bansal

Askiitian Expert