CEG's Linux User Group

  • Increase font size
  • Default font size
  • Decrease font size
Home Labs CIRCULAR QUEUE IMPLEMENTATION USING LINKED LIST - TEST CASE AND COMPATIBILITY
CIRCULAR QUEUE IMPLEMENTATION USING LINKED LIST

CIRCULAR QUEUE IMPLEMENTATION USING LINKED LIST - TEST CASE AND COMPATIBILITY

E-mail Print
User Rating: / 7
PoorBest 
Article Index
CIRCULAR QUEUE IMPLEMENTATION USING LINKED LIST
SOURCE CODE
DOCUMENTATION
TEST CASE AND COMPATIBILITY
All Pages

 

TEST CASE:

 

The choices are

1.Insert

2.Delete

3.Front

4.Frontdelete

5.Exit

Enter your choice:1

Enter the element:5

The contents of the queue are:

5


Enter your choice:1

Enter the element:7

The contents of the queue are:

5 7

 

Enter your choice:1

Enter the element:8

The contents of the queue are:

5 7 8

 

Enter your choice:2

Element deleted

The contents of the queue are:

7 8

 

Enter your choice:3

Front value is 7

The contents of the queue are:

7 8


Enter your choice:4

Deleted element is 7

The contents of the queue are:

8

Enter your choice:5

 

COMPATIBILITY:

Compatible with all computers which are capable of running gcc-4.3.3-5. The program has been tested with the above version of gcc as of june 12.

 

 



Last Updated on Saturday, 13 June 2009 08:21  
Please register or login to add your comments to this article.