Syllabuses

Write an algorithm to implement depth-first search. How is depth-first search different from Breadth-first search? Also, write any two application of complete graph.

Define the term carry in two-dimensional arrays represented in memory? Explain how address of an element is calculated.

Answer any two of the following: a) Write an algorithms to find the largest of given n numbers. Derive its time complexity using asymptotic notations. b) What is Generalized linked list? c) Define internal and external sorting. d) Explain adjacency matrices graph representation.

Define the term Recursion? Give a recursive algorithm to find nth term of a Fibonacci series?

Write an algorithm for postfix to infix conversion. Consider the following arithmetic expression P: 12, 7, 3, /, ., 2, /, +, 5, *, +, Translate P into infix expression using stack operations.

What is B-tree? Construct a B-tree of order 3 for the following set of input data: 69, 43, 25, 40, 16, 100, 124, 7, 15, 8

Write short notes on: i) Minimum Cost Spanning Tree ii) Sparse Huffman Coding and its implementation iii) Define Huffman codes.

Explain the following: i) Sparse matrices ii) AVL tree

Write an algorithm to implement depth-first search. How is depth-first search different from Breadth-first search? Also, write any two applications of complete graph.

Define the term Carry in two-dimensional arrays represented in memory? Explain how address of an element is calculated.