data structure and algorithm, C/C++ Programming

Assignment Help:

implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. For this you need to produce complete design specification for stack as well as arrays. Also write Pseudocode explaining the valid operations that can be carried out on the stack and arrays.

Related Discussions:- data structure and algorithm

Compute the canny edges, If we take the input image and smooth it with a Ga...

If we take the input image and smooth it with a Gaussian of a significant size before computing the Canny edges does the number of edges change, and do the locations of these edges

.., write a c++ code to implement use of a constructor

write a c++ code to implement use of a constructor

Need programmer to program a flex pcb, Project Description: I want a per...

Project Description: I want a person who will be able to program a flex PCB for my device as i meet the person i will be able to describe all my needs Skills required are C P

Describe difference between malloc()/free() & new/delete?, for object, mall...

for object, malloc allocates memory in heap however doesn't invoke object's constructor to initialize the object. new allocates memory & also invokes constructor to initialize the

I need script for auto seating poker, Project Description: Not just like...

Project Description: Not just like that though. I want a similar program that can scan through poker lobbys (pokerstars, full tilt, ongame and ipoker) and seat me to the left of

C program to print fibonacci series upto n using recursion, C program to Pr...

C program to Print Fibonacci series upto n using recursion: int fibo(long int); void main() { long int a=0,n; printf ("how many term

Friend function, how yo use the friend function?

how yo use the friend function?

Write a program to calculate the average of ten numbers, Write a program to...

Write a program to calculate the average of ten numbers #include stdio.h /* Only this header is needed since only IO are used */ void main() { char

Create program to newtons method for cube roots, Newton's method for cube r...

Newton's method for cube roots is based on the fact that if y is an approximation to the cube root of x, then a better approximation is given by the value: (x/y 2 +2y)/3 (a)

Advanced input - output routines, Although we can handle most I/O routines ...

Although we can handle most I/O routines with getc and putc , there are file versions of fgets, fputs, fprintf and fscanf . The syntax is fgets(stringname,n,filename); Th

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages