ADT

Question 1

what is an ADT?

Answer 1

An abstract data type is a logical description of how data
is viewed and the operations that can be performed on it,
but how this is done is not necessarily known to the user.

Question 2

Describe the stack data structure

Answer 2

A stack is a Last In, First Out (LIFO) data structure. This
means that with a stack the last item in is the first item to
leave the stack.

Stack data structure is used in calculations and to hold
return addresses. Using the BACK and UNDO buttons
on web browser or word processing package are actions
done using stacks ADT.

Question 3

List and describe some operations done on a stack

Answer 3

push(item) – adds a new item to the top of the stack

pop() – removes and returns the top item from the stack

peek() – returns the top item from the stack but does not
remove it

isEmpty() – tests to see whether the stack is empty, and
returns a Boolean value

isFull() – tests to see whether the stack is full, and returns
a Boolean value

size() - Return the number of elements in the stack

Question 4

Detail the steps to remove a node from a singly liked list

Answer 4

1. Identify the Node to Remove.

The first step is to locate the specific node you want to remove from the linked list. This typically involves
traversing the list using a temporary pointer. You should have some criteria for identifying the node to be
removed, such as a matching value.

2. Update the Previous Node’s “next” Pointer.

Once the node to be removed is found, you need to update the “next” pointer of the previous node (the node
before the one you’re removing). This step is critical because it effectively bypasses the node you’re removing.

3. Free the Node to Remove
   Now that you’ve updated the “next” pointer of the previous node, the node to be removed is effectively
   disconnected from the list. At this point, it’s safe to free the memory allocated for this node to avoid memory
   leaks.

Question 5

Detail the steps to add a node in singly linked list

Answer 5

To add a new node at the front of the singly linked list, follow these steps:
 Create a new node with the desired data.
 Make the new node point to the current head of the list.
 Update the head to point to the new node.

To add a new node to the end of the singly linked list, follow these steps:
 Create a new node with the desired data.
 Traverse the list to find the last node (the one with a NULL next pointer).
 Update the next pointer of the last node to point to the new node.

Question 6

How to add a new node after another node

Answer 6

To add a new node after a specific node in the singly linked list, follow these steps:
 Create a new node with the desired data.

 Traverse the list to find the node after which you want to insert.
 Update the next pointer of the new node to point to the node after which you want to insert.
 Update the next pointer of the previous node to point to the new node.

Question 7

Provide a detailed description of a linked list

Answer 7

A linked list is a linear data structure that stores data in various memory locations known as nodes. A linked list contains a head pointer that points to the first node of the linked list. Each node contains data and a pointer to the next node and the last node in the sequence points to null

Question 8

State the Two conditions that must exist for the successful execution of the INSERT and DELETE operations as they relate to stacks and queues

Answer 8

1. The stack or queue cant be empty if you want to remove data
2. The stack or queue cant be full if you want to add data