Write an algorithm that takes an array of characters, with only the characters 1, 2 and only two occurrences of the character 0, and the size of the array that has filled (valid) characters. This algorithm must check that the string that is stored is of the form x0y0x, where x is the inverse of y. (if x= "12221122", y="22112221"). The algorithm must use the Stack functions (create, pop, push, destroy, isempty)
Language: C/C++
Q.1 - Write an
Q.2 - Write an algorithm for the Pune operation, which punishes an element on a stack by pushing it back n positions. Assume that the stack is implemented as a simply chained linear list.
Pune (Pilha *p, int n);
Q.3 - Write an algorithm that punishes the first element of a row represented in a circular
P.S: It cannot perform calls to the Insert and Remove function from the queue, the algorithm must perform the operation only with vector manipulation.
void PuneFuraFila(Fila *f);
Q.4 - Implement a double stack, so called because it keeps two stacks (two tops) sharing the same vector, saving memory. A double stack has, two push's, two pop's, and so on. The double stack must be able to include a new element whenever there is space in the vector (a free cell) Stack * stkCreate (int maxSize); stkPush1( Stack *s, void * item); stkPush2( Stack *s, void *item); void *stkPop1(Stack *s); void *stkPop2 (Stack *s);
Step by step
Solved in 2 steps
