We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
1. Define doubly circular linked list with example.
2. Define following terms: 1) Degree of a tree 2) Binary search tree
3. Write a program for adding a new node at first position in a linked list 4. Convert given expression into binary tree. Also find out inorder, preorder and postorder traversal of a binary tree a. A * B + C / D ^ E % F 5. Write a program to search value in singly linked list. 6. Explain the terms: i) Data field ii) Empty List 7. Compare Static and Dynamic memory allocation (Min. 2 points each) 8. Draw structure of Doubly link list and circular link list 9. Enlist the types of Queues. (Any 4) 10. State any 4 applications of Linear queue 11. State TRUE / FALSE & Justify your answer- Tree is Linear data structure. 12. Implement a program to add new node at last position in a linked list with desired output 13. Implement a program to delete a node from random position in a singly link list 14. Describe the concept of Priority queue with example. 15. Implement a program to implement insert and delete operation on linear queue. 16. Explain the types of Binary tree traversal with example 17. Draw expression tree for given: 6 *5 ^ 3 – 4 * 3 ^ 2 + 4 * 8^ 2 % 7 * 1 - 9 ^ 2 18. Implement a program for In-order traversal of Binary tree. 19. Compare Binary tree with Binary Search tree. (Min. 2 points each) 20. Differentiate between malloc( ) and calloc( ) function. 21. Explain the types of tree in detail. 22. Find out inorder, preorder and postorder traversal of a given binary tree:
23. Define linked list with example.
24. Draw doubly and circular linked list. 25. Define following terms: 1) Degree of a node 2) Binary tree 3) Height of a tree 26. Write a program for deletion of a node from first position in a linked list.