c++栈作业(国外英文资料).docVIP

c++栈作业(国外英文资料) Experimental card Course name Data structures and algorithms class Computer 20132 Sequence number 05 Experimental name Experiment 5 the basic operation of the stack Experimental purpose (1) understanding the definition of stack. (2) master the basic operation of the stack. Experiment content Tomorrows experiment 1. write a program that converts a non negative decimal integer N to another B based B number. 2. write a program to check whether a program of curly braces, square brackets and parentheses match whether, if you can match all, then return 1, or else return 0. 3., the design of an algorithm, using the basic operation of the stack to return the specified stack bottom element. 4., there are two stack S1, S2 are using sequential stack, and share a storage area [O..Maxsize-1], in order to make full use of space, reduce the possibility of overflow, can use the stack top, facing the growth of storage. Try to design S1, S2 related to the stack and stack operation algorithm. 5. write algorithms to determine whether a character sequence is palindrome. Palindrome is a character sequence based on the middle character. The characters on both sides are identical. For example, 123321 is a palindrome, and 1233-1 is not a palindrome. Requires the program to enter a string from the keyboard, the string length is less than or equal to 80, used to determine the palindrome in the string does not include the end of the string mark. Stack experiment (optional question, except for the selected question) Main function #includeiostream.h #include jinzhi.h Void zhuanhuan (int, a, int, B); Int, main () { Int, figure, radix; Cout please enter the number you want to convert.:; Cinfigure; Cout please enter the hexadecimal number you want to convert.:; Cinradix; Zhuanhuan (date, system); } Void zhuanhuan (int, a, int, c) { Int y; Jinzhiint k; While (n, =0) { Y=n%s; / / remainder modulo operation for n band If (y9) {y=y-10+B} Else Y=y+0; K.push (Y); N=n/s; } Cout ( s ) 10 = (