CSCI205 Data Structures and Abstraction
F03
1. Discuss Experiences running the Text Editor and ideas for improvement
2. Discuss Stacks: How are stacks encountered in day to day life? What about computer programming?
3. Using a stack to do base-conversion.
4. Implementing a Stack Class
4.1 Discuss the Design and Building of a Stack Class
Assignment:
1. Read and Study Chapter 4 if you didn't do it already.
2. Compile, build and run the Conversion from Base 10 to Base 2 code on page 174.
3. Notice the programming assignment in the assignment sections of Class 3 – you may start on it whenever you feel qualified. (It should be turned in next Wednesday)
0. Pick up LabEx 3
1. Study, Compile, Build and Run the Text Editor Figure 3.13 page 138
2. Assemble and Compile the Stack Class in the Lab
2.1 Explore the data members and operations
2.2 Focus Special Attention on the Function Members
1.2.1 Constructors, i.e. functions that create and initialize the data structure.
1.2.2 Predicates, i.e. Boolean function, ex. Empty()
1.2.3 Accessors, i.e. retrieval without change, ex. Top(), display()
1.2.4 Mutators, i.e. functions that change the data structure, ex. Push(), Pop()
2.3 Work through the test drivers for the various Function Members Leaving Your Completed Test Driver on J: Drive
2.4 Work on Problems 2 and 3 on page 207
Assignment:
1. Do the Quick Quiz 4.2 on page 190. Be prepared for a possible quiz on Friday.
0. Possible Quiz on Sections 4.1 and 4.2
1. Work through Section 4.3 on the board. Is there any relationship between the two applications?
Assignment:
1. Do problems 2 and 3 on page 207 and put working code in the J: Drive (It will be graded next week)
2. Compile, Build and Run the code for Figure 4.12 Converting Infix Expressions to RPN on page 200. Convert the infix expression in problems 15 to 22 on page
205 to RPN expressions. Write them on a sheet of paper to turn in on Monday.