Question

1. Write an implementation of List ADT using array. Create the list with 6 values and do the following operation and display the results: (1) Check whether the list is empty (2) Check whether the list is full (3) Insert the value 10 in the position of 4. (4) Remove the element at position 3. (5) Search the element 15 in the list.​

Answer 1

Answer:

Implement a stack using single linked list concept. all the single linked list operations perform based on Stack operations LIFO(last in first out) and with the help of that knowledge we are going to implement a stack using single linked list. using single linked lists so how to implement here it is linked list means what we are storing the information in the form of nodes and we need to follow the stack rules and we need to implement using single linked list nodes so what are the rules we need to follow in the implementation of a stack a simple rule that is last in first out and all the operations we should perform so with the help of a top variable only with the help of top variables are how to insert the elements let’s see  

Explanation:

Answer 2

Answer:Angle R = Angle X because that angle is between the two sides.SSS (SIDE SIDE SIDE)SAS (SIDE ANGLE SIDE)ASA (ANGLE SIDE ANGLE)AAS (ANGLE ANGLE ...