PROGRAM BACHELOR OF COMPUTER APPLICATION (BCA) SEMESTER II COURSE CODE & NAME DCA1202 – DATA STRUCTURES AND ALGORITHM CREDITS 4 NUMBER OF ASSIGNMENTS & 02 MARKS 30 Marks each
Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 - 450 words. Each question is followed by evaluation scheme.
Q.N Assignment Set – 1 Marks Total Marks
o Questions 1. a. What is a linked list? Discuss the algorithms for insertion and 5+5 10 deletion of values in the beginning of a linked list. b. Define queues and its enqueue and dequeue operations. 2. a. What are Binary trees? How many types of Binary trees are 5+5 10 there, discuss? b. Discuss Dijkstra’s Algorithm for shortest path. 3. Explain Breadth-first search and Depth-first search algorithms in 10 10 graphs.
Q.N Assignment Set – 2 Marks Total Marks
o Questions 4. a. Explain the algorithms of Sequential Searching and Binary 5+5 10 Searching. b. What are the characteristics and Building Blocks of an Algorithm? 5. a. How is the Efficiency of an Algorithm measured? 5+5 10 b. What is Divide and conquer strategy? 6. Discuss the Greedy knapsack Algorithm, with a suitable example. 10 10