Ad:

C++ Discussion Thread
Unsolved
Views: 9274

Oct 11th, 2007

queue program

Expand Post »

hi please help me....can you give me a code for queue program???
the flow look like this:
KEY FUNCTION
E Enqueue
D Dequeue
H Hide implementation
S Show implementation
R Bubble sort

*note 10 numbers to be inputed.

Similar Threads

printing elements in a queue in C++
HELP-search extender, shopping assistant, search assistant in Viruses, Spyware and other Nasties
queue program question in C++
rundll32.exe problems in Windows NT / 2000 / XP
bridge.dll run error HJT log inside in Viruses, Spyware and other Nasties

boyhenyo

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Oct 2007

Permalink

Oct 11th, 2007

Re: queue program

Click to Expand / Collapse Quote originally posted by boyhenyo ...

hi please help me....can you give me a code for queue program???

No.

Dave Sinkula

Team Colleague

Reputation Points: 2780

Solved Threads: 312

long time no c

Offline

4,790 posts
since Apr 2004

Permalink

Oct 11th, 2007

Re: queue program

> hi please help me....can you give me a code for queue program???

Lol. Very funny.

jaepi

Reputation Points: 32

Solved Threads: 4

Practically a Master Poster

Offline

647 posts
since Jul 2006

Permalink

Oct 11th, 2007

Re: queue program

I can give you the pseudcode ^,...,^. You'd better implement...

Enqueue:

Quote ...

1 if (queue full)
1 return false
2 allocate (newPtr)
3 newPtr -> data = data
4 newPtr -> next = null
5 if (queue.count = 0)
Insert into null queue
1 queue.front = newPtr
6 else
Insert into queue with data
1 queue.rear -> next = newPtr
7 queue.rear = newPtr
8 queue.count = queue.count + 1
9 return true
End enqueue

Dequeue:

Quote ...

if (queue empty)
1 return false
2 dataOut = queue.front -> data
3 dltPtr = queue.front
4 if (queue.count = 1)
Delete data in queue with
only one item
1 queue.rear = null
5 queue.front = queue.front -> next
6 queue.count = queue.count - 1
7 recycle (dltPtr)
8 return true
End dequeue

vincent551987vn

Reputation Points: 10

Solved Threads: 1

Newbie Poster

Offline

14 posts
since Oct 2007

Permalink

Oct 11th, 2007

Re: queue program

>can you give me a code for queue program???
I can do one better. I'll give you code for a queue and a stack program:

C++ Syntax (Toggle Plain Text)
#ifndef JDEQUE_H
#define JDEQUE_H
 
/* Increment or decrement an index with wraparound */
#define _wrap_decr(i,n)      ( (i) = ( (i) == 0 ? n - 1 : (i) - 1 ) )
#define _wrap_incr(i,n)      ( (i) = ( (i) == n - 1 ? 0 : (i) + 1 ) )
 
#define _deque_ready(d)      ( (d)._base != 0 )
 
#define _deque_full(d)       ( (d)._fill == (d)._size )
#define _deque_empty(d)      ( (d)._fill == 0 )
 
/* Generic push and pop. Calling code defines the index and update logic */
#define _deque_push(d,x,i,f) ( ++(d)._fill, (d)._base[(i)] = (x), f ( (i), (d)._size ) )
#define _deque_pop(d,i,f)    ( --(d)._fill, (d)._base[f ( (i), (d)._size )] )
 
/* Concrete push/pop front and push/pop back */
#define _deque_pushf(d,x)    ( _deque_push ( (d), (x), (d)._front, _wrap_decr ) )
#define _deque_pushb(d,x)    ( _deque_push ( (d), (x), (d)._back, _wrap_incr ) )
#define _deque_popf(d)       ( _deque_pop ( (d), (d)._front, _wrap_incr ) )
#define _deque_popb(d)       ( _deque_pop ( (d), (d)._back, _wrap_decr ) )
 
#define _deque_init(d,buf,n) do { \
  (d)._base = (buf);              \
  (d)._size = (n);                \
  (d)._fill = 0;                  \
  (d)._front = 0;                 \
  (d)._back = 1;                  \
} while ( 0 )
 
struct _deque {
  char     *_base;
  unsigned  _size;
  unsigned  _fill;
  unsigned  _front;
  unsigned  _back;
};
 
#endif
#ifndef JDEQUE_H
#define JDEQUE_H

/* Increment or decrement an index with wraparound */
#define _wrap_decr(i,n)      ( (i) = ( (i) == 0 ? n - 1 : (i) - 1 ) )
#define _wrap_incr(i,n)      ( (i) = ( (i) == n - 1 ? 0 : (i) + 1 ) )

#define _deque_ready(d)      ( (d)._base != 0 )

#define _deque_full(d)       ( (d)._fill == (d)._size )
#define _deque_empty(d)      ( (d)._fill == 0 )

/* Generic push and pop. Calling code defines the index and update logic */
#define _deque_push(d,x,i,f) ( ++(d)._fill, (d)._base[(i)] = (x), f ( (i), (d)._size ) )
#define _deque_pop(d,i,f)    ( --(d)._fill, (d)._base[f ( (i), (d)._size )] )

/* Concrete push/pop front and push/pop back */
#define _deque_pushf(d,x)    ( _deque_push ( (d), (x), (d)._front, _wrap_decr ) )
#define _deque_pushb(d,x)    ( _deque_push ( (d), (x), (d)._back, _wrap_incr ) )
#define _deque_popf(d)       ( _deque_pop ( (d), (d)._front, _wrap_incr ) )
#define _deque_popb(d)       ( _deque_pop ( (d), (d)._back, _wrap_decr ) )

#define _deque_init(d,buf,n) do { \
  (d)._base = (buf);              \
  (d)._size = (n);                \
  (d)._fill = 0;                  \
  (d)._front = 0;                 \
  (d)._back = 1;                  \
} while ( 0 )

struct _deque {
  char     *_base;
  unsigned  _size;
  unsigned  _fill;
  unsigned  _front;
  unsigned  _back;
};

#endif

Of course, you'll have to figure out how to use it.

Narue

Administrator

Reputation Points: 6442

Solved Threads: 1393

Bad Cop

Offline

11,807 posts
since Sep 2004

Permalink

Oct 11th, 2007

Re: queue program

heres my code.
i cant make a declaration for the keys for enqueue, dequeue,hide implementation, show implementation and sorting...

here:

#include <stdio.h>
#include <conio.h>

#define MAX 10

void addq ( int *, int, int *, int * ) ;
int delq ( int *, int *, int * ) ;

void main( )
{
int arr[MAX] ;
int front = -1, rear = -1, i ;

clrscr( ) ;

addq ( arr, 23, &front, &rear ) ;
addq ( arr, 9, &front, &rear ) ;
addq ( arr, 11, &front, &rear ) ;
addq ( arr, -10, &front, &rear ) ;
addq ( arr, 25, &front, &rear ) ;
addq ( arr, 16, &front, &rear ) ;
addq ( arr, 17, &front, &rear ) ;
addq ( arr, 22, &front, &rear ) ;
addq ( arr, 19, &front, &rear ) ;
addq ( arr, 30, &front, &rear ) ;
addq ( arr, 32, &front, &rear ) ;

i = delq ( arr, &front, &rear ) ;
printf ( "\nItem deleted: %d", i ) ;

i = delq ( arr, &front, &rear ) ;
printf ( "\nItem deleted: %d", i ) ;

i = delq ( arr, &front, &rear ) ;
printf ( "\nItem deleted: %d", i ) ;

getch( ) ;
}

/* adds an element to the queue */
void addq ( int *arr, int item, int *pfront, int *prear )
{
if ( *prear == MAX - 1 )
{
printf ( "\nQueue is full." ) ;
return ;
}

( *prear )++ ;
arr[*prear] = item ;

if ( *pfront == -1 )
*pfront = 0 ;
}

/* removes an element from the queue */
int delq ( int *arr, int *pfront, int *prear )
{
int data ;

if ( *pfront == -1 )
{
printf ( "\nQueue is Empty." ) ;
return NULL ;
}

data = arr[*pfront] ;
arr[*pfront] = 0 ;
if ( *pfront == *prear )
*pfront = *prear = -1 ;
else
( *pfront )++ ;

return data ;
}

boyhenyo

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Oct 2007

Permalink

Aug 28th, 2010

Re: queue program

I want a program in queue using classes in cpp

polisure

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Aug 2010

Permalink

Aug 28th, 2010

Re: queue program

program to write an object and read an object from file in cpp
program to copy contents of one file to another file in cpp
program to concatenate two files in cpp.

Last edited by polisure; Aug 28th, 2010 at 5:22 am.

polisure

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Aug 2010

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in C++ Forum Timeline: Polymorphism puzzle

Next Thread in C++ Forum Timeline: Reading from registers

DaniWeb Message

Cancel Changes

User Name
Password