Set - I Set - I

C.S.I. Bishop Solomon Doraisawmy College of Arts & Science Pre Semester Examination NOV 2024
Pre Semester Examination NOV 2024 Part – (II) (Major)
Part – (II) (Major)
Subject Name: Fundamental of Algorithms Subject Name: Fundamental of Algorithms
Subject Code: 22SCCCS5/22SCCCA5 Class: III B.Sc CS & BCA Subject Code: 22SCCCS5/22SCCCA5 Class: III B.Sc CS & BCA
Duration: 3 hours Max. Marks: 75 Duration: 3 hours Max. Marks: 75
Section A 10 x 1 = 10 Section A 10 x 1 = 10
I. Choose the correct Answer I. Choose the correct Answer
1. A graph in which all vertices have equal degree is known as ____ 1. A graph in which all vertices have equal degree is known as ____
a) Complete graph b) Regular graph a) Complete graph b) Regular graph
c) Multi graph d) Simple graph c) Multi graph d) Simple graph
2. Finding the location of a given item in a collection of items is called.. 2. Finding the location of a given item in a collection of items is called..
a) Discovering b) Finding c) Searching d) Mining a) Discovering b) Finding c) Searching d) Mining
3. The time complexity of quicksort is …….. 3. The time complexity of quicksort is ……..
a) O(n) b) O(logn) c) O(n2) d) O(nlogn) a) O(n) b) O(logn) c) O(n2) d) O(nlogn)
4. Quick sort is also known as …….. 4. Quick sort is also known as ……..
a) Merge sort b) Tree sort c) Shell sort d) Partition and exchange sort a) Merge sort b) Tree sort c) Shell sort d) Partition and exchange sort
5. Which of the following is non-liner data structure? 5. Which of the following is non-liner data structure?
a) Stacks b) List c) Strings d) Trees a) Stacks b) List c) Strings d) Trees

II. Fill in the blanks II. Fill in the blanks

6. Stack is a data structure that follows _________ order. 6. Stack is a data structure that follows _________ order.
7. _______ traversal, the root node is visited last. 7. _______ traversal, the root node is visited last.
8. _________ means organization of data. 8. _________ means organization of data.
9. Merge sort________ technique to implement sorting? 9. Merge sort________ technique to implement sorting?
10. Consider a complete graph G with 4 vertices. The graph G has ____ 10. Consider a complete graph G with 4 vertices. The graph G has ____
spanning trees. spanning trees.

III. Answer the Questions Briefly 5x2 = 10 III. Answer the Questions Briefly 5x2 = 10
11. Define Algorithm. 11. Define Algorithm.
12. Note on Graph. 12. Note on Graph.
13. Define Priority Queue. 13. Define Priority Queue.
14. Write down Heaps. 14. Write down Heaps.
15. Define general method in backtracking. 15. Define general method in backtracking.
C.S.I. Bishop Solomon Doraisawmy College of Arts & Science Section B 5 x 5 = 25
 Set - I Set - I
IV. Answer all the questions IV. Answer all the questions
16. a) Write Brief note Complexity. 16. a) Write Brief note Complexity.
(Or) (Or)
b) Discuss about Randomized algorithm. b) Discuss about Randomized algorithm.
17. a) Explain about Threaded Binary Tree. 17. a) Explain about Threaded Binary Tree.
(Or) (Or)
b) Write brief note on Topological sort. b) Write brief note on Topological sort.
18. a) Brief note on Binary search . 18. a) Brief note on Binary search .
(Or) (Or)
b) Write note on Heap sort. b) Write note on Heap sort.
19. a) Discuss about Knapsack problem. 19. a) Discuss about Knapsack problem.
(Or) (Or)
b) Briefly explain Finding maximum and minimum. b) Briefly explain Finding maximum and minimum.
20. a) Explain about Sum of subset. 20. a) Explain about Sum of subset.
(Or) (Or)
b) Discuss about Graph Coloring. b) Discuss about Graph Coloring.

Section C 3 x 10 = 30 Section C 3 x 10 = 30
V. Answer Any Three of the following V. Answer Any Three of the following
21. Discuss the concept of Asymptotic notation. 21. Discuss the concept of Asymptotic notation.
22. Explain about Spanning tree. 22. Explain about Spanning tree.
23. Explain about Optimal Merge pattern and optimal Storage on tape. 23. Explain about Optimal Merge pattern and optimal Storage on tape.
24. Explain the following: 24. Explain the following:
(i) Merge sort. (i) Merge sort.
(ii) Quick sort. (ii) Quick sort.
25. Describe the concept of 8-Queen problem. 25. Describe the concept of 8-Queen problem.

Section B 5 x 5 = 25