Q1. Doubly linked lists are enhanced as far as traversing the elements is concerned. describe why we don’t then always utilize them?
Q2. Find out the address of the element A[6,4,8,10] in 4-dimensional array.
Q3. prepare down an algorithm to add up an element in ith stack of the multiple stacks.
Q4. Illustrate the maximum number of nodes in a binary tree of depth k?
Q5. describe how will you determine cycle in an AOV (activity on vertex) network?
Q6. By using the binary tree represent the data: X1, I, J, Z, FST, X2, K.
Q7. Illustrate the meaning of strongly connected component in a graph?