Consider: A program needs to hold data of the same type that can be accessed at random, but the programmer doesn't know how many pieces of data will be needed. Which data structure(s) should the programmer use?
Added by Travis H.
Step 1
Step 1: Since the programmer doesn't know how many pieces of data will be needed, a dynamic data structure that can grow or shrink in size is required. Show more…
Show all steps
Your feedback will help us improve your experience
Michelle Z. and 77 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
A list of $n$ items is arranged in random order; to find a requested item, they are searched sequentially until the desired item is found. What is the expected number of items that must be searched through, assuming that each item is equally likely to be the one requested? (Questions of this nature arise in the design of computer algorithms.)
A data scientist is writing a Machine Learning algorithm using a large data set. What is produced when the data scientist compiles the code?
Haricharan G.
Calculate the random access memory (RAM) in megabytes necessary to store a multidimensional array that is $20 \times 40 \times 120$ This array is double precision, and each value requires a 64 -bit word. Recall that a 64 -bit word $=8$ bytes and 1 kilobyte $=2^{10}$ bytes. Assume that the index starts at 1
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD