Scribd
Upload
60 views

Fourth Semester B.Sc. (IT) Examination, May/June 2011 (Directorate of Distance Education) Algorithms

The document outlines 27 practice problems for an algorithms exam, covering a range of algorithm and data structures topics: 1) Quicksort and mergesort simulations and analysis 2) Designing quicksort and binary search algorithms 3) Differentiating static and dynamic allocation 4) Adjacency matrices, queues, incidence matrices, and binary trees 5) Breadth-first search, greatest common divisor, and recursion 6) Complexity analysis, linked lists, and more binary tree concepts 7) Towers of Hanoi, reversing numbers, and checking palindromes

Uploaded by

Kunal Patra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
60 views

Fourth Semester B.Sc. (IT) Examination, May/June 2011 (Directorate of Distance Education) Algorithms

The document outlines 27 practice problems for an algorithms exam, covering a range of algorithm and data structures topics: 1) Quicksort and mergesort simulations and analysis 2) Designing quicksort and binary search algorithms 3) Differentiating static and dynamic allocation 4) Adjacency matrices, queues, incidence matrices, and binary trees 5) Breadth-first search, greatest common divisor, and recursion 6) Complexity analysis, linked lists, and more binary tree concepts 7) Towers of Hanoi, reversing numbers, and checking palindromes

Uploaded by

Kunal Patra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Fourth Semester B.Sc.

(IT) Examination, May/June 2011


(Directorate of Distance Education)
ALGORITHMS



1. For a given data set {98, 16, 75, 26, 10, 50}
a) Simulate quick sort. 8
b) Merge sort.
2. Design and trace-out quicksort algorithm
3.Differentiate between static allocation & dynamic allocation
4. Define adjacency matrix & explain?
5.Define queue & mention the types?
6.Explain Incidence matrix.
7. Explain the following:
(i) Depth of the tree
(ii) Binary tree
8.Design and simulate the working of binary search algorithm
9.Explain BFS with an example.
10. Design an algorithm to find the GCD of two numbers? 7 Marks
11. List out the merits and demerits of the recursion?
12.Compare Binary search with sequential search technique.
13.Design an iterative and recursive algorithm to find the maximum among given set of
V elements.
14.Design and Simulate the working of binary search algorithm
15.Design an algorithm to find whether the given graph is connected or not.
16.Explain Time and Space complexity of an algorithm
17. a) Explain the dimcntional representation of a binary tree. 8
b) What is incidence matrix? Explain.
18. Write short notes on
b) Stack and in application
19. What are the important problem types ? Explain

20.List and explain the geneal operations of linked list.

21.Explain the concept and importance of recursion.


22. Exlain various operations on binary tree. 8

23. Explain expression tree and decision tree.

24. Explain linked representation of a binary tree with its typical node structure.


25. State the towers of Hanoi problem and design and algorithm to solve Towers of Hanoi problem.

26. Design an algorithm to find the reverse of a number.
27. Design an algorithm to check whether a given string is palindrome or not.

You might also like