Fundamentals Of Data Structures

Question 1

What is a data structure

Answer 1

A common format for storing large volumes of related data which is an implementation of an abstract data type

Question 2

What is an array

Answer 2

A set of related data items stored under a single identifier

Question 3

What is a text file

Answer 3

a file that contains human-readable characters

Question 4

What is a binary file

Answer 4

stores data as sequences of 0s and 1s

Question 5

What is a record

Answer 5

one line of a text file

Question 6

What is a field

Answer 6

an item of data

Question 7

What is a queue

Answer 7

a data structure where the first item is added and first to be removed

Question 8

What is stack

Answer 8

a data structure where the first item added is the first item removed

Question 9

What is a static data structure

Answer 9

a method of storing data where the amount of data stored (and the amount of memory used to store it) is fixed

Question 10

What is a dynamic data structure

Answer 10

a method of storing data where the amount of data stored and memory will vary as the program is being run

Question 11

What is a heap

Answer 11

a pool of unused memory that can be allocated to a dynamic data structure

Question 12

Advantages of Static Data Structure

Answer 12

• • fast access to each element

- - structures are a fixed size so they’re more predictable

Question 13

Disadvantage of Static Data Structure

Answer 13

– inneficient as memory is allocated that may not be needed

Question 14

Advantages of a Dynamic Data Structure

Answer 14

• • efficient as the amount of memory varies as needed

- - can use the heap if necessary

Question 15

Disadvantages of a Static Data structure

Answer 15

• • Slower access to each element as memory is allocated at run time
• • memory addresses allocated may be fragmented so slower access

Question 16

What is a stack

Answer 16

A LIFO structure where the last item of data added is the first to leave

Question 17

What is a pointer

Answer 17

a data item that identifies a particular elemnt in the data structure

Question 18

What is recursion

Answer 18

the process of a subroutine calling itself

Question 19

What are the three types of queues

Answer 19

• • Linear Queue
• • Circular Queue
• • Priority Queue

Question 20

What is a linear queue

Answer 20

A FIFO structure organised as a line of data such as a list

Question 21

What is a circular queue

Answer 21

A FIFO data structure implemented as a ring where the front and rear pointers can wrap around the end to the start of the array

Question 22

What is a priority queue

Answer 22

A variation of a FIFO structure where some data may leave out of sequence as it has a higher priority than other data items.

Question 23

What is an undirected graph

Answer 23

A graph where the relationship between vertices is two way

Question 24

What is a directed graph

Answer 24

A grapgh in which the relationship between the vertices is one way

Question 25

What is the difference between an adjacency list and adjacency matrix

Answer 25

• A list requires less memory as it only stores values where necessesary
• matrixes can be identified more quickly

Question 26

What is the three features of a tree

Answer 26

• • Fully connected
• • Undirected
• • No cycles