What is an array? Explain declaration, initialization and iteration of one dimensional and two dimensional arrays with example. Write a program to read and write a 1D array. Write... What is an array? Explain declaration, initialization and iteration of one dimensional and two dimensional arrays with example. Write a program to read and write a 1D array. Write a program to read and write a 2D array. Write a program to store 10 elements in array given by user and to find maximum out of those 10 elements. Explain Sparse matrix with example. OR What is Sparse matrix? Write efficient vector representation of following Sparse matrix. What is Stack? What is top of stack? Why stack is called LIFO list? Define stack. Write algorithms for PUSH, POP and PEEP operations of stack. OR Write algorithms for Push and Pop operations on a stack. Consider the stack S of characters, where S is allocated 8 memory cells. S: A, C, D, F, K, _, _ Describe the stack as the following operations take place. Pop0, Pop(), Push(P), Pop(), Push(R), Push(S), Pop(). Convert the given infix to postfix string: A + B * C - D. Convert following infix expressions into postfix (reverse polish) format showing stack status after every step in tabular form. Convert following infix expression to the corresponding Reverse Polish expression using Stack. Evaluate the following postfix expression in tabular form showing stack after every step. Convert Infix Expression A + B * C - D / E / F / (G + H) into Postfix expression using stack. Convert the following infix expression into postfix expression using stack. Evaluate the Postfix Expression 2 3 + - 3 8 2 / + 2 3 + using Stack. Evaluate the postfix expression in tabular forms: 82 / 6 7 + Evaluate following infix expressions to the postfix expressions. Shows stack trace. Convert the following expression into postfix form. Evaluate the following postfix expression using a stack. Show each step. Evaluate the following postfix expression using a stack. Show the steps. Convert the following expression into prefix form. Evaluate the following prefix expression using a stack. Show the steps. Evaluate the prefix expression in tabular forms: */ - 8 2 3 4. Explain Tower Of Hanoi with example. Enlist and explain any 3 applications of stack in computer science. Evaluate the postfix expression in tabular forms: 2 3 * - 8 / 4 + Evaluate the prefix expression in tabular forms: 7 / 1 + 4 - 6 3. Write an algorithm for infix to postfix conversion. Write an algorithm to evaluate postfix expression. Explain the working of the algorithm using appropriate example. Read more