Unit 1 lesson 2

Question 1

Abstract data type

Answer 1

A blueprint for organizing and working with data that defines what operations can be performed on the data without specifying how they are implemented.

Question 2

Array

Answer 2

A collection of items stored in a contiguous memory block, each identified by an index number, allowing for efficient access to elements based on their position.

Question 3

Composite variable

Answer 3

A variable that can hold multiple pieces of data, often grouped together under a single name.

Question 4

Container

Answer 4

A data structure that holds a collection of elements, providing methods to add, remove, and access items within it.

Question 5

Data structure

Answer 5

A way of organizing and storing data in a computer’s memory designed to facilitate the efficient retrieval, insertion, and deletion of data.

Question 6

Linked list

Answer 6

A sequence of elements where each element points to the next one, forming a chain.

Question 7

Linked structure

Answer 7

Any structure composed of elements connected by links or pointers, enabling dynamic relationships among data elements.

Question 8

List

Answer 8

A collection of items arranged in a linear sequence, allowing for easy access to and the insertion and deletion of elements.

Question 9

Queue

Answer 9

A data structure that follows a first-in, first-out (FIFO) order where elements are added to the back and removed from the front.

Question 10

Record

Answer 10

A data structure that groups related pieces of information under a single name, typically consisting of multiple fields or attributes.

Question 11

Stack

Answer 11

A data structure that follows a last-in, first-out (LIFO) order where elements are added and removed from the same end, known as the top.