Assignment II - UNIT III & UNIT IV

UNIT III & UNIT IV

Part A

1.   Define Data Structures

2.      Define ADT.

3.      What is Data Structure and list its types

4.      Define a node.

5.      List the advantages of Linked List over array

6.      List the types of linked list.

7.      List out the applications of a linked list

8.      Write a procedure to insert at beginning  in a Singly Linked List

9.      What is header?

10.  Write a routine to find an element in Singly Linked list.

11.  What are the advantages and disadvantages of doubly linked list over Singly Linked list?

12.   Write the structure declaration for defining a node in Polynomial representation.

13.  Write a procedure for Polynomial differentiation.

Void polyDiff ()

{

Poly *ptr1,*newnode;

ptr1=list1;

while (ptr1 !=0 )

{

newnode=malloc(sizeof(struct poly));

newnode->coeff=(ptr1->coeff)*(ptr1->power);

newnode->power=ptr1->power -1;

list3=create(list3,newnode);

ptr1=ptr1->next;

}

}

14.  List the application of List ADT

15.  List the advantage and disadvantage of circular Linked list

16.   How to traverse a Linked List

17.  Give the structure declaration of a node in doubly linked list

18.  Write the routine for reverse in doubly Linked List.

19.  Write a routine to traverse in doubly Linked list.

20. What does the following function do for a givem Linked List

void fun2(struct node* head) {   if(head== NULL)     return;   printf("%d  ", head->data);   if(head->next != NULL )     fun2(head->next->next);   printf("%d  ", head->data);   }

21.  Define Stack.

22.  What are the operations performed on stack and write its exception condition

23.  List the applications of stack.

24.  Write the steps for converting infix to postfix.

25.  Convert the infix expression (A+B) * (C/D) – E to its equivalent postfix expression.

26.  How do push and pop elements in linked list.

27.  Write a routine to return the top element of the stack.

28.  What is stack overflow condition?

29.  Define Queue data structure and give some application for it.

30.  When we can declare a queue as FULL?

Part –B

 1.      What are the various Linked list  & its operations? Explain with example.

2.      Explain the Insertion & Deletion routine in singly Linked list.

3.      Explain the Insertion & Deletion routine in Doubly Linked list.

4.      Explain the following for Singly Linked List with example

      a)      Search routine.

      b)      Traverse routine.

      c)      Display routine.

5.      Explain the following for Doubly Linked List with example

      a)      Search routine.

      b)      Reverse routine.

      c)      Display routine.

6.      Explain with example the operations of circular linked list.

7.      Write the routine to implement create, display, Merge & subtraction of two polynomial.

8.      Explain the array implementation of Stack ADT.

9.      Explain the Linked implementation of Stack ADT.

10.  Write the program for converting an Infix expression into Postfix expression.

11.  Explain how stack is applied for evaluating an Postfix expression.

12.  Implement the queue ADT using Array with neat illustration.

13.  Implement the queue ADT using Linked list.