Big Idea 3 Extra Questions

A Boolean data type is one that

• will hold numbers, that include integers, floats, and doubles

• will hold characters including special characters

• holds only two values which are true and false

• holds characters, letters, and numbers

Answer explanation

When you look at most programming languages, variables are assigned data points by using an assignment statement. A Boolean is a special data type that will only hold two values, true or false. The other forms of data types are int, double, string, etc.

An important property of an algorithm is

• It is a step-by-step process

• it has abstraction built in

• it is important to calculate efficiency

• it is written using pseudocode

Answer explanation

An algorithm is a detailed step-by-step process that is used to solve problems. While answer choice B and C might be true, they are not part of the definition of an algorithm. An algorithm can be written in pseudocode, English, or any other programming language.

Which of the following are true about simulations?

• a simulation allows investigation of a real-world phenomenon without the constraints of the real world

• a simulation is an abstraction of a real-world object or phenomena

• the process of developing a simulation involves simplifying the functionality

• All of the answers above

Answer explanation

All of the answers are valid about simulations. Answer B is the formal definition of a simulation. Answers A and C are some advantages of simulations.

Using the Exam Reference Sheet, the index value of a list starts at

• 1

• the length of the list

• n

• 0

Answer explanation

When using most programming languages that deal with arrays, the first element in an array starts with 0. On the Exam Reference Sheet, the index value starts with 1 and it is important to pay attention to this.

When designing algorithms, it is important to remember

• all algorithms are efficient

• it is possible to calculate the amount of memory an algorithm will use

• there is more than one algorithmic solution to a problem

• all algorithms have to be expressed in a specific format

Answer explanation

Different algorithms for the same problem have different levels of efficiency, this includes ones that are so inefficient they become impractical to use s this makes us eliminate answer A. It may be possible to calculate the memory the algorithm will use for variable storage, memory used for executing the instructions can vary in different executions so this will eliminate answer B. Algorithms are informal descriptions of a program, so they don't have to follow a set format, so this will eliminate answer D. Any problems can be solved in multiple ways.