Question

Help with these computational thinking questions

Question 11 (1 point)

Which of the following best define the term pseudocode?

Question 11 options:

	The fundamental concept in computer science
	An informal notation for representing algorithms
	A means of saving the result of a computation for future use
	A means of producing different actions depending on a condition

Question 12 (1 point)

When searching within the list

            Lewis, Maurice, Nathan, Oliver, Pat, Quincy, Roger, Stan, Tom

which of the following entries will be found most quickly using the binary search algorithm?

PS: The Simulation of Binary Search helps to visualize the essentials of binary search. Note that even though the simulation searches an integer from a sorted integer list, the steps to search a string from a sorted string list are same.

Question 12 options:

	Lewis
	Pat
	Tom

Question 13 (1 point)

To divide a large problem, such as designing an air traffic control system, into more manageable units, you would use _____________ to perform parts of the larger process.

Question 13 options:

	procedures
	selection structures
	repetition structures
	recursion

Question 14 (1 point)

Which of the following set of instructions defines an algorithm in the formal, strict sense? Hint: what is an essential property of an algorithm?

Question 14 options:

	X = 3; while (X < 5) do (X <- X)
	X = 3; while (X < 5) do X = X + 1
	X = 3; while (X < 5) do X = X - 1

Question 15 (1 point)

Which of the following best define the term stepwise refinment?

Question 15 options:

	A divide and conquer approach to problem solving
	A statement that is true each time a specific point in a repetitive process is reached
	A program segment isolated as a unit
	The technique of applying a program segment within itself

Question 16 (1 point)

Under the assumption that N takes on only integer values, which of the following is the termination condition in the following recursive procedure?

      procedure xxx (N)

      if (N < 5) then (print the value of N)

           else (apply the procedure xxx to the value N - 1)

Question 16 options:

	N < 5
	N > 4
	N > 5

Question 17 (1 point)

Examples of input to a program include (you may select more than one, if it's appropriate)

Question 17 options:

	a file containing data
	text typed by a user on a keyboard
	a mouse click on a GUI control element like a button or drop down list
	electrical signals produced by physical sensors such as those that respond to temperature, particles in the air or mechanical vibration

Question 18 (1 point)

Which of the following are examples of algorithms? (You may select more than one, if it's appropriate.)

Question 18 options:

	The procedure for manually performing long division
	The procedures NetFlix and Amazon use for trying to guess which show you might want to view or which product you might want to buy
	The procedure for calculating the amount of income taxes you owe
	A procedure for examining MRI images to determine whether cancer cells are present

Question 19 (1 point)

Which of the following is a representation?

Question 19 options:

	Algorithm
	Program
	Process

Question 20 (1 point)

A procedure or function is

Question 20 options:

	an alternative to using selection structures
	an obsolete software development technique
	an independent block of actions or statements
	a means for lowering the θ

growth factor of an algorithm

Answer 1

11  An informal notation for representing algorithms

12pat

In binary search firstly the middle element is get compared

13 recusrion

14

X = 3;

while (X < 5) do

X = X + 1

Because rest of execution is infinite

15A divide and conquer approach to problem solving

16 N>5