Write an algorithm for the addition of two matrices.

Explain the following functions in with examples

malloc()

calloc()

Write an algorithm to add two polynominals when they are represented using linked lists.

Differentiate between sequential search and binary search. Write their algorithms and analyze the techniques for complexity.

Define and 'Binary Tree'. Explain the differences between them.

Give a brief description of operations that can be performed on a stack.

Discuss the advantages, if any, of a two-way list over a one-way list when deleting a node whose location is given.

Convert the following infix expression to postfix expression:

A E

Insert the following keys in order to construct an AVL tree:

What is a Minimum Cost Spanning Tree? Convert the given graph G with weighted edges to a minimal spanning tree:

<img src='./qimages/7790-3b.jpg'>

Write an algorithm for implementation of. various operations on a circular queue.

Consider the following circular queue (max capacity

where front 2 and rear 4. Describe the queue as the following operations take place

Add add E

Delete two elements

Add H

Delete one element

Delete two more elements

5. Write short notes on the following:

Adjacency Matrix

Sorting

Indexed Sequential File Organization

Sparse Matrices