CS 101: Basics of Computer Science
Assignment # 8 Chapters 8&9
160 points
1. Solve the following problems. Show all your work and steps for each of the problems Fill in or type in your answers.
2. Next scan the pages of your assignment in problem number order right side up.
3. Verify that the scanned pages are readable.
4. Submit your Assignment#8 file to me using Blackboard “Assignment #8” submission link area.
1. [10 points] Define Abstract data type.
2. [10 points] Draw a picture of a stack and show a push operation then a pop operation.
3. [10 points] Draw a picture of a QUEUE and show an insertion and a removal.
4. [20 points] Draw a picture of list where the following items were inserted in this order
D, E,A,V,S,B . SHOW ALL STEPS OF BUILDING THE LIST
5. [10 points] Define a tree and when it is used.
6. [20 points] Build a Binary Search tree for the following k,f,v,a,d,h,eq,m,p.
7. [10 points] Explain the difference between breadth-first and depth-first searches.
8. [10 points] What is a subprogram and why is it used
9. [10 points] Explain the difference between a parameter and an argument.
10. [10 points] Explain the difference between a value and a reference parameter.
11. [10 points] Define an object and a class.
12. [20 points] What are the steps in an object-oriented design methodology? Explain what is involved in each step. Detail matters.
13. [10 points] Compare and contrast a compiler and interpreter.