WEEK 5: LINKED LIST

Question 1

3 types of linked list

Answer 1

singly linked list, doubly linked list, circular linked list

Question 2

2 limitations of arrays which make inserting an item inside an array difficult

Answer 2

• size has to be known at compliation
• data in the array are separated in the computers memory by the same distance

Question 3

this can be used to get around the limitations of arrays by linking data independently from where it is stored in the computer’s memory

Answer 3

linked list

Question 4

to create a linked list, each piece of data in the set of data simply has to also store the _______ of the next piece of data in the set

Answer 4

address

Question 5

this is a collection of nodes storing data and links to other nodes

Answer 5

linked list / linked structure

Question 6

nodes can be located anywhere in the memory, and passing from one node of the linked structure to another is accomplished by __________________________

Answer 6

storing the address of other nodes in the linked structure

Question 7

a data structure that makes it easy to rearrange data without having to mode cata in memory

Answer 7

linked list

Question 8

in the real world, this plays a critical role in applications that help companies and governments manage data dynamically

Answer 8

linked list

Question 9

this enables a program to move through the list in one direction, which is usually from the front of the list moving to the end of it

Answer 9

singly linked list

Question 10

this enables a program to move through a list in both directions

Answer 10

doubly linked list

Question 11

true or false: programmers choose arrays over linked lists because arrays can grow and shrink in size during runtime

Answer 11

false

Question 12

process for changing the size of an array

Answer 12

an operating system changes the size of an array by finding another location large enough to hold elemends of the array anf new array elements, then the existing elements of the array are copied onto the new location

Question 13

process of changing the size of a linked list

Answer 13

the operating system changes references to the previous item and the next item on the list

Question 14

each entry in a linked list

Answer 14

node

Question 15

parts of a node in a singly linked list

Answer 15

data, pointer to the next node

Question 16

parts of a node in a doubly linked list

Answer 16

data, pointer to the next node, pointer to the previous node

Question 17

main difference between normal linked list and circularly linked list

Answer 17

normal linked list - last node pointer is addressed to NULL

circularly linked list - last node pointer is addressed to first node

Question 18

how to create a linked list

Answer 18

• initialize a structure using struct keyword and delcare variables for data and pointers
• initialize head to point to the first node of the linked list

Question 19

steps to insert a new node to a linked list

Answer 19

1. allocate memory for the new node
2. point new node to its successor
3. point the new node’s predecessor to the new node