1.4: Data Types, Data Structures and Algorithms

What does the AND logical operator return if all inputs are TRUE?

• FALSE

• 0

• 1

• NULL

Which character set is used to represent alphanumeric characters or symbols as a set of 8 bits?

• Binary

• Denary

• ASCII

• Hexadecimal

What is a Boolean data type capable of storing?

• Any integer value

• Only one of two possible values

• A string of text

• An unlimited range of values

What does the OR logical operator return if any one of the inputs is TRUE?

• 0

• FALSE

• NULL

• 1

What is a Primitive Data Type?

• A complex data structure

• A data type for storing large numbers

• A basic built-in data type provided by a programming language

• A data type that can only be created by the user

What is a String used for in data types?

• A method of storing negative numbers in binary.

• A data structure for storing a finite, ordered set of data of the same data type within a single identifier.

• A data type for storing a sequence of alphanumeric characters or symbols, typically within quotation marks.

• A logical operator which returns TRUE if exactly 1 of the inputs is TRUE.

What does the Two's Complement method involve?

• A bitwise manipulation where a set of bits are all moved by one place in a given direction.

• A method of storing negative numbers in binary by flipping all the bits of the binary representation of the positive number and then adding 1.

• A character set that is a superset of ASCII.

• A method of traversing an entire graph by visiting all the neighbours of the first node.

What is the difference between Directed Graphs and Graphs in general?

• Directed Graphs have a hashing algorithm, while Graphs do not.

• Directed Graphs store data contiguously in memory, while Graphs do not.

• Directed Graphs are where the order of the vertices paired in an edge matter, and the edges are one way.

• There is no difference; they are the same.

Which data structure uses a hashing algorithm to determine where a data item is to be stored?

• Arrays

• Binary Search Tree

• Hash Table

• Linked Lists

How does a Depth First Traversal method work?

• By traversing an entire graph by visiting all the neighbours of the first node before repeating the same with each neighbour.

• By storing an ordered sequence of data where each item is stored with a pointer to the next item.

• By traversing an entire graph by travelling as far as possible along one route before backtracking and trying alternative unexplored routes.

• By calculating a value to determine where a data item is to be stored.