Linear Search (Two dimensional)

Linear Search (2-D)

Sequentially searching for an item in a 2-D list

Multiple Select

In this lesson I am going to learn to ... ?

• Apply a linear search to a 2-D list on paper

• Complete a linear search algorithm flowchart

• Code a linear search for an item in a 2-D list

• Compare linear searches of 1-D and 2-D lists

Multiple Choice

A database record contains .....

• all the data on a single person or thing

• one piece of data on a person or thing

• all the data on multiple persons or things

Multiple Choice

A database is ______

• An organised collection of records

• A table of data

• A single field of data

Multiple Select

Choose all the tasks normally available in a database ...

• Sort records

• Search records

• Update records

• Delete records

• Add new records

Multiple Choice

Which is the best description of a linear search algorithm?

• Starts looking for the item at beginning of list until either finds it or reaches end of list

• Looks through all items in list looking for the search item

• Looks in random locations of the list for the search item

Multiple Choice

How would you access the record for "Forest"?

• studentData[5]

• studentData[5][1]

• studentData[6]

• studentData[6][2]

Multiple Choice

What is the index position of "Cooper"?

• studentData[2][1]

• studentData[1][2]

• studentData[3][2]

• studentData[2][4]

Multiple Choice

Whose record is at studentData[2]?

• Cooper

• Bennett

• Davies

• Forest

Fill in the Blanks

What data is at index position studentData[4][3]?

Multiple Select

What are the differences between this 2-D linear search and the 1-D linear search?

• Looks in list[index][1] rather than list[index]

• Returns sublist rather than index position if found

• Returns empty list rather than -1 if not found

• index is incremented by 4 instead of by 1

• Searches all records regardless of if found

Multiple Select

What are the three main types of test data that should be used to test an algorithm?

• expected data

• boundary data

• exceptional data

• numeric data

• string data

Fill in the Blanks

Identify the name of a subprogram

Fill in the Blanks

Identify the line number of a subprogram call

Fill in the Blanks

Identify a line number where repetition starts

Fill in the Blanks

Identify a line number with a call to a built-in subprogram

Fill in the Blanks

Identify a line number with a call to a user-defined subprogram

Fill in the Blanks

Identify a line number with a Boolean condition

Fill in the Blanks

Identify a line number where a data structure is indexed

Fill in the Blanks

Identify a line number containing a string method

Fill in the Blanks

Identify a line number containing a selection statement

Fill in the Blanks

Identify a line number where a global variable is initialised

Fill in the Blanks

Identify a line number where a local variable is initialised

Fill in the Blanks

Identify a line number containing an inequality operator

Multiple Select

In this lesson I have learned to ...

• Understand the structure of a database record

• Perform a linear search on a 2-D data structure

Open Ended

Thinking Hard

Transform your work from this lesson into a set of step by step instructions.

(press Shift+Enter to take a new line ...)

Poll

How much of this lesson have you understood?

• None of it

• Some of it

• Most of it

• All of it