CSCI203 - Week 2 lab exercise 1
Implementing a Stack
This exercise is to be done during your week 2 laboratory class. When you complete the exercise,
show your work to your lab tutor. You should implement your code in one file (e.g. main.c or
main.cpp, and Stack.java etc.) with comments for readability.
To test the Stack in this exercise, you are to write a main program (in C++, Java or Python) that reads
a text file containing a number of words and displays the words on the screen in reverse order using
a stack. A pseudo-code outline for the program is given below:
Begin main
display a prompt for the file name
read in the file name
try to open the file
if the file fails to open
print an error message on the screen and exit
fi
do
read in a word from the file
if the file read fails
terminate (break) the loop
fi
Push the word onto the stack
od
close the file
while the stack is not empty
display the top stack word on the screen followed by a space
pop the top value from the stack
elihw
End main
Implement the stack yourself step by step rather than using external libraries, modules, classes,
structs or with STL. The stack must be implemented using a fixed size array of words and an index
integer for indicating the top of the stack. The stack array and index should be global variables. A
word can be a string or a c-string (i.e. a character array). You can assume no word is more than 20
characters long. The stack functions (i.e. push(), top(), pop(), isEmpty() ) should be
implemented.
When you are finished, test your program using the provided text file named “Ex1.txt” and show
your code and the output to your lab tutor.
