Data Structures and Abstract Data Types

Question 1

Data Structures

Answer 1

A data structure is a format used to store, organise and manage data in a way that allows efficient access and modifications for the needs of program

Question 2

Arrays

Answer 2

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

Question 3

Multi-Dimensional Arrays

Answer 3

An array where each data is located using multiple indices

Question 4

Single Dimensional Arrays

Answer 4

An array where each data item can be located using a single index

Question 5

Binary File

Answer 5

An organised collections of records where data is stored in binary

Question 6

Fields

Answer 6

A single item of data

Question 7

Records

Answer 7

A data structure that stores multiple fields, organised based on attributes, within a single line of a file

Question 8

Text File

Answer 8

An organised collections of records where data is stored in human readable characters

Question 9

Dictionaries

Answer 9

A data structure consisting of set of keys that are mapped to their corresponding values

Question 10

Graph

Answer 10

A data structure consisting of a set of vertices/nodes connected by a set of edges/arcs

Question 11

Hash Tables

Answer 11

A data structure where a hashing algorithm creates a mapping between keys and values. The data item can then be directly accessed by recalculations, without any search

Question 12

Queues

Answer 12

A first-in-first-out (FIFO) data structure. The first item is added/pushed on to the queue is the first to be removed/popped off

Question 13

Stacks

Answer 13

a last-in-first-out (LIFO) data structure. The last item added/pushed will be the first to be removed/popped off

Question 14

Static Stucture

Answer 14

A data structure that is allocated a fixed amount of memory space, which does not change throughout the execution of the program.

Question 15

Trees

Answer 15

A data structure that uses a set of linked nodes to form a hierarchical structure starting at a root node, Each node is a child/sub node of a parent node

Question 16

Vectors

Answer 16

A data structure representing a quantity with both magnitude and direction. IT can be represented as a list, function or geometric point

Question 17

Peek/Top

Answer 17

An operation that allows the user to view the top element of the stack without modifying it

Question 18

Pop

Answer 18

An operation that removes the most recently added element that was not yet removed from the stack

Question 19

Push

Answer 19

An operation that adds an element to the top of the stack

Question 20

—2.4