1. Implementation of the Stack ADT using Singly Linked List and the Time Complexity Analysis of the Push and Pop Operations In this project, you will implement the Stack ADT as a singly linked list. As discussed in class, the push, pop and top operations for a Stack can be accomplished using the insertx(0, data), delete (0) and read(O) functions for a singly linked list respectively, where the 'O' in the function calls corresponds to the insertIndex, deleteIndex and readindex. In such an implementation, the asymptotic time complexity is o(1) for all the three operations. Also, the implementation for the push, pop and top operations in the Stack class should not have any loops; but, conditional statements (like 'if) could be included. a. Write the code for the Stack class (that is adapted from the code given to you for the List class) implementing the push, pop and peek operations in constant time, i.e., 0(1) time. (b - 10 pts) 2. a. Write a program to input 10 integer numbers into an array named fmax and determine the maximum value entered. Your program should contain only one loop and the maximum should be determined as array element values are being input. (Hint: Set the maximum equal to the first array element, which should be input before the loop used to input the remaining array values.)[10 marks] b. Perform an asymptotic complexity analysis for the two algorithms below. [10 marks each) 3. Using the graph below, 8 9 a. Draw an adjacency list and matrix.[10 MARKS] b. Perform a depth first search using THE LAST VALUE OF YOUR INDEX NUMBER AS THE SOURCE as your source and draw the resulting depth first search tree [10 MARKS] 1. Implementation of the Stack ADT using Singly Linked List and the Time Complexity Analysis of the Push and Pop Operations In this project, you will implement the Stack ADT as a singly linked list. As discussed in class, the push, pop and top operations for a Stack can be accomplished using the insertx(0, data), delete (0) and read(O) functions for a singly linked list respectively, where the 'O' in the function calls corresponds to the insertIndex, deleteIndex and readindex. In such an implementation, the asymptotic time complexity is o(1) for all the three operations. Also, the implementation for the push, pop and top operations in the Stack class should not have any loops; but, conditional statements (like 'if) could be included. a. Write the code for the Stack class (that is adapted from the code given to you for the List class) implementing the push, pop and peek operations in constant time, i.e., 0(1) time. (b - 10 pts) 2. a. Write a program to input 10 integer numbers into an array named fmax and determine the maximum value entered. Your program should contain only one loop and the maximum should be determined as array element values are being input. (Hint: Set the maximum equal to the first array element, which should be input before the loop used to input the remaining array values.)[10 marks] b. Perform an asymptotic complexity analysis for the two algorithms below. [10 marks each) 3. Using the graph below, 8 9 a. Draw an adjacency list and matrix.[10 MARKS] b. Perform a depth first search using THE LAST VALUE OF YOUR INDEX NUMBER AS THE SOURCE as your source and draw the resulting depth first search tree [10 MARKS]
