Important part B question

Part B important question Unit III & Unit |IV

 

1. Explain the following for Singly Linked List with example

a)     Search routine. (5)

b)    Traverse routine. (6)

c)     Display routine. (5)

2. Explain the array implementation of Stack ADT.(16)

3. Explain the Insertion routine in singly Linked list.(16)                                                            

 4.Explain the Deletion routine in Doubly Linked list. 

     5.a) Explain the polynomial implementation & addition with eg. (8)

b) Implement the Enqueue and Dequeue operations of Queue using array (8)    

6. What are the various Linked list & its operations? Explain with eg(16)

7. Explain the following for Doubly Linked List with example

a)     Search routine.(5)

b)    Reverse routine.(6)

c)     Display routine.(5)

8. Explain the Linked implementation of Stack ADT.(16)                                                              

9.  a)Express the procedure for converting an Infix expression into Postfix expression with example. (8)

b) Write down the procedure for evaluating an postfix expression. (8)

10. Implement the queue ADT using Array with neat illustration. (8)

     11.Explain with example the insert at first and insert at end operations of circular linked list. (8)