Copyright

Data, Storage & Algorithms Chapter Exam

Exam Instructions:

Choose your answers to the questions and click 'Next' to see the next set of questions. You can skip questions if you would like and come back to them later with the yellow "Go To First Skipped Question" button. When you have completed the practice exam, a green submit button will appear. Click it to see your results. Good luck!

Page 1

Question 1 1. Which common big-O means process every item once, and some twice?

Question 2 2. Which of the following is NOT an area that needs to be considered when testing an algorithm?

Question 3 3. Which of the following algorithm test areas is concerned with process?

Question 4 4. A connected graph where each node has zero, one, or more children is called a _____.

Question 5 5. How is a stack different from a list?

Page 2

Question 6 6. Which of the following is FALSE for a queue?

Question 7 7. Which of the following concepts is closely related to Search algorithms?

Question 8 8. Which of the following represents the simplest algorithm to search an unsorted list of items in order to determine whether a particular item occurs in the list or not?

Question 9 9. What is an algorithm?

Question 10 10. The Cloud expression stands for:

Page 3

Question 11 11. Which one is a good example of Cloud Storage?

Question 12 12. Computer storage is used for:

Question 13 13. ASCII lets your computer _____.

Question 14 14. A binary digit is represented by _____.

Question 15 15. There are _____ bits in a byte.

Page 4

Question 16 16. Computers represent data in a finite manner. What does this mean?

Question 17 17. What is the difference between analog and digital data?

Question 18 18. What is the difference between data and information?

Question 19 19. A _____ is a procedure associated with a class that describes an action an object is able to perform.

Question 20 20. How do functions differ from methods?

Page 5

Question 21 21. Sally is continuing work on her Object-Oriented Program and is writing code for a car, truck, and bus. These items under the class called vehicle are referred to as _____.

Question 22 22. Into which main categories can storage devices be placed?

Question 23 23. Which of the following uses a hard drive we can't see to store data using an Internet connection?

Question 24 24. Which of the following saves data by using a laser?

Question 25 25. An algorithm always leads to a(n):

Page 6

Question 26 26. An algorithm is written down as:

Question 27 27. Instead of a list of steps, algorithms can be written using:

Question 28 28. The measure of how much computing resources and time an algorithm requires is known as _____, and is denoted by _____.

Question 29 29. A one-dimensional array is also called a _____.

Question 30 30. A binary search algorithm begins at the _____ of a list.

Data, Storage & Algorithms Chapter Exam Instructions

Choose your answers to the questions and click 'Next' to see the next set of questions. You can skip questions if you would like and come back to them later with the yellow "Go To First Skipped Question" button. When you have completed the practice exam, a green submit button will appear. Click it to see your results. Good luck!

MTTC Computer Science (050): Practice & Study Guide  /  Computer Science Courses
Support