robin

Question 1

What is a list

Answer 1

a linear structure that provides only sequential access to its elements

Question 2

What two special named elements does a list have

Answer 2

A head: points to the first element
A tail: points to the last element

Question 3

How do lists differ from arrays

Answer 3

• They do not have a fixed size
• They can only store elements of the same type (homogenous structure)

Question 4

What ist he advantage of lists over array

Answer 4

Easy insertion and dletion when using dynamic memory allocation

Question 5

What are linked lists

Answer 5

a better alternative to implement lists is dynamic allocation (linked lists)

Question 6

what nodes do linked lists consist of

Answer 6

• A data member (value)
• A link member (ointed to the next node

Question 7

What are the advantages of linked lists

Answer 7

• efficient memeory usage
• no predefined size
• insertions and deletions are cheaper

Question 8

What are the disadvantages of linked lists

Answer 8

• more complex algorithms
• harder to read and debug
• dynamic memeory allocation intruiduces performance overhead

Question 9

define a linked list

Answer 9

a data structure where each element points to the next and previous elements, forming a bi-directional chain

Question 10

in the context of an array based implmenetation of lists what is the purpose of the ‘head’ and ‘tail’ elements

Answer 10

to keep track of the first and last elements of the list

Question 11

where are pointers used

Answer 11

linked lists, not arrays

Question 12

What best describes a stack

Answer 12

Last in first out, where the last element added is the first to be removed

Question 13

What best describes a queue

Answer 13

first in first out

Question 14

what does enqueue mean in a queue

Answer 14

adding an element to the rear (at the end) of the queue