@page { margin: 2cm }
p { margin-bottom: 0.25cm; line-height: 115% }

1 Bug in
#include<stdio.h>

error: expected ‘=’,
‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘<’
token

include<stdio.h>

missing #

2 Bug in
#include<stdio.h>

hello.c:1:9: fatal
error: stdio.: No such file or directory

#include<stdio.>

^~~~~~~~

missing h

1 bug=removed :

error: expected ‘;’
before ‘return’

return 0;

2 bug= removed ”

missing terminating
“ character

3 bug= missing
terminating > character

#include<stdio.h

removed = >

4 bug=expected ‘=’,
‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘<’
token

include<stdio.h>

removed = #

5 bug= expected ‘=’,
‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘)’
token

int main)

removed = (

6 bug=expected
declaration specifiers or ‘...’ before ‘{’ token

{

removed = )

7 bug=missing
terminating > character

#include stdio.h>

removed = <

8 bug= fatal error:
stdio: No such file or directory

#include<stdio>

^~~~~~~

removed = return

9 bug=expected ‘{’
at end of input

removed = {

10 bug=expected ‘;’
before ‘return’

return 0;

removed = ;

11 bug=expected ‘;’
before ‘}’ token

}

removed = ”

12 bug= expected
‘=’, ‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before
‘{’ token

{

removed = ()

13 bug= stdi.h: No
such file or directory

#include<stdi.h>

removed = stdio

14 bug =invalid
preprocessing directive #inclue; did you mean #include?

#inclue<stdio.h>

removed = include

15 bug = expected
identifier or ‘(’ before ‘<’ token

<stdio.h>

removed=#include

16 bug = expected
identifier or ‘(’ before ‘)’ token

()

removed = int main

17 bug =expected
identifier or ‘(’ before ‘)’ token

()

removed=printf ;

18 bug =expected ‘;’
before numeric constant

rn 0;

removed=return

19bug= stdio.: No
such file or directory

#include<stdio.

Removed =h>

20bug=expected ‘;’
before ‘}’ token

}

removed=\d)

Autor: Sajan Kumar Jha

Description : This project best explains the working of data handling
in queue structure.Since we know that queue is a data structure which
follows the FIFO algorithm.Here we have used a struct which has the
following data member:

                                        typedef struct
                                        {
                                            int * queue; //pointer which points the array of length equals to size
                                            int fi; //front index
                                            int ri; //rear index
                                            int size; //define the length of queue
                                         }

so as we know that queue follows FIFO scheme,thus the algorithm to perform enqueue is given as:

            (Condition for enQueue)
                          
                            if ri(rear index) is >= (size - 1) then Queue is full
                            else ri++;
                            and store value at index ri as *(queue + ri) = val;

Now the algorithm for deQueue is as follows:

            (Condition for deQueue)
                          
                            if (fi(front index) == ri(rear index))
                            then {
                                    queue is empty;
                                    fi = ri = -1;
                                    return 0;
                                    }
                            fi++;
                            and read value from queue at index fi;
                            check once again if (fi == ri) then fi = ri = -1;