problem 1) prepare a program to implement a static stack and show the push and pop operations on the stack.
problem 2) prepare a program to implement a static queue and show the insert and delete operations on the queue.
problem 3) prepare a program to implement a static circular Queue.
problem 4) prepare a program to implement a static dequeue (using arrays).
problem 5) prepare a program to implement n stacks in single 1D array. prepare functions for “push” and “pop” operations on i-th stack.
problem 6) prepare a program to implement n queues in single 1D array. prepare functions for “add” and “delete” operations on i-th queue
problem 7) Represent a stack and a queue in a single 1D array. prepare functions for “push”, “pop” operations on stack and “add”, “delete” operations on the queue.
problem 8) prepare a program to read a text file and display it on the screen. In case number of lines exceeds 22, file should be displayed one screen at a time.
problem 9) prepare a program to print a text file on the printer.
problem 10) prepare a program that displays the size of file in bytes.
problem 11) prepare an interactive menu driven program to create a text file and then display the file. Create another text file by reversing each string of the newly created text file.
problem 12) prepare a program that reads a text file and creates another text file that is identical except that every sequence of consecutive blank space is replaced by a single space.