Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note: Need of algorithms. 5. Explain Divide & Convener approach for Merge short? 6. What is pseudo code convection explain using insertion sort? 7. Write pseudo code for Insertion Sort? 8. Write pseudo code for Merge sort? 9. Write steps for insertion sort? 10. Explain Merge sort with suitable example? 11. Write steps to sort the following data using merge sort ( 77, 32, 45, 99, 83, 22, 107, 54, 11,69, 81, 40, 38) 12. Write steps to sort the following data using Insertion sort ( 77, 32, 45, 99, 83, 22, 107, 54, 11, 69, 81, 40, 38) 13. Write short node: Designing Algorithm by Divide & convener approach. 14. Write short node: Designing Algorithm by Incremental approach. 15. Write algorithm for merge sort. 16. Describe how asymptotic notation gives characteristic of Algorithms efficiency 17. Explain best case, average case and worst case in analysis of algorithms? 18. Write short note: Running time of algorithm. 19. What are Asymptotic Notation and how they are useful in algorithms analysis? 20. What is use of algorithm analysis? How it is carried out? Define Big Oh notation? 21. Differentiate: Big Oh and Oh notation. 22. Differentiate: Big Oh and notation. 23. Differentiate: Small Oh and notation. 24. Explain Asymptotic tight bound in detail? 25. Describe relations between asymptotic functions? Sandip Patel (ldrp) Page 1
Unit II (Introduction to Data Structures) 26. What is data structure? Explain types of data structure in detail? 27. Explain String Manipulation with suitable example? 28. Write & explain any pattern matching algorithm for string. 29. Distinguish storage representation of string with suitable example? 30. What is text handling? Explain any five text handling command with suitable examples? 31. Write short note: KWIC Indexing. 32. Explain &Write rules for KWIC Indexing? 33. Explain the storage structure of KWIC Indexing with suitable example? Sandip Patel (ldrp) Page 2
Unit III (Linear Data Structures) 34. Describe the storage structure of array? 35. Differentiate: Array & Structure. 36. Explain importance of structure & array of structure? 37. Write algorithm: Operation on stack. 38. Describe the application of stack with suitable example. 39. Write algorithm/ program for Infix to postfix conversion. 40. Evaluate the following postfix operation: 3, 5, +, 4,, 6, / 41. Write short note: Applications of Queue. 42. Differentiate: Simple Queue Vs Circular Queue. 43. Write conditions to check circular queue is full or not? 44. Write algorithm to display in circular queue? 45. Write algorithm/ program to insert and delete and element from simple queue (Array Implementation)? 46. Write algorithm/ program to insert and delete and element from Circular queue (Array Implementation)? 47. Write algorithm to swap element on deletion in simple queue? 48. Differentiate: Simple Queue Vs Priority Queue. 49. Implement priority queue program using Array? 50. Explain how priority queue can implement using Cursor Implementation? 51. Write algorithm to implement priority queue using cursor implementation? 52. Explain Priority Queue with example? 53. Write algorithm/ program for following operation in Singly Linked linear List or Doubly Linked Linear List. a. FIFO Implementation b. LIFO Implementation c. Sum of data in elements d. Delete a node from Intermediate Location e. Count the element in list. f. Merge two linked list g. Union of two linked list h. Intersect of two linked list. i. Sorting linked list j. Reverse list 54. Write algorithm to swap two adjacent nodes in Linked linear list (By Address)? 55. Explain Application of linked list? Write an algorithm/ program to perform sum of two polynomials using linked list? 56. Explain circular linked list with suitable example? 57. Write algorithm for multiplication of two polynomials? 58. Write short note: Multidimensional Array? 59. What are triangular array explain with suitable example? 60. Write advantages of circular queue as compared to simple queue using Sandip Patel (ldrp) Page 3
example? Unit IV (Nonlinear Data Structure) 61. What is non linear data structure and how it differs from linear data structure describe with suitable example? 62. What are Graphs? How they can be represented? 63. Distinguish the following terms a. Vertex b. Edges c. Arcs d. Loops e. Isolated Node 64. What do you mean by simple graph? Explain with suitable example? 65. Write Rules for Multi Graph? 66. Differentiate: Connected Graph & Unconnected Graph 67. Explain the following terms: a. Weighted Graph b. Null Graph c. Paths d. Cycle 68. What is path also explain various terms in concern to path? 69. Explain Directed graph? What are Indegree, Outdegree and Degree of node in detail? 70. Write short note: Trees. 71. What are general trees? How binary tree are more applicable then general tree? 72. Explain the following terms in context to Tree. a. Leaves b. Parent c. Sibling d. Root e. Height f. Width g. Level 74. What is Binary Search Tree? How they differ from General Trees and also explain various traversal techniques of Binary Search Tree? 75. Create a Binary Search tree for the following data and do Inorder, Preorder & Postorder traversal of the tree. (40, 60, 25, 50, 30, 70, 35, 10, 55, 65, 12). Sandip Patel (ldrp) Page 4
76. Create a Binary Search Tree from the following data: ABCDEFG and do converse Inorder, converse preorder and converse Postorder traversal? 77. Describe forms of representation of Binary Search Tree with suitable examples? 78. Write and interactive algorithm/ program to traverse a Binary Search Tree in a. Inorder b. Preorder c. Postorder 79. Write and Recursive algorithm/ program to traverse a Binary Search Tree in a. Inorder b. Preorder c. Postorder 80. Write an algorithm/ program to create a Binary Search tree? Sandip Patel (ldrp) Page 5