LOADING

Write a ‘C’ program for insertion sort and discuss its efficiency.

Briefly explain various linear and non-linear data structures along with their applications.

Write ‘C’ functions to: (1) insert a node at the end (2) delete a node from the beginning of a doubly linked list.

Write an algorithm to reverse a string of characters using stack.

Compare: (1) Linked-list and Array (2) Circular queue and Simple Queue

Convert (A+B) *C–D^ E^(F*G) infix expression into prefix format showing stack status after every step in tabular form.

Describe: (1) Recursion (2) Priority Queue (3) Tower of Hanoi

Write a ‘C’ functions to: (1) insert a node at beginning in singly linked list (2) insert an element in circular queue.

Write an algorithm to implement insert and delete operations in a simple queue.

With figure, explain the following terms: (1) Depth of a tree (2) Sibling nodes (3)Strictly binary tree (4) Ancestor nodes (5) Graph (6) Minimum spanning tree (7)Degree of a vertex.

Generate a binary search tree for following numbers and perform in-order andpost-order traversals: 50, 40, 80, 20, 0, 30, 10, 90, 60, 70

Explain Right-in-threaded, left- in - threaded and full -in-threaded binary trees.

Write Kruskal’s algorithm for minimum spanning tree and explain with an example.

Describe various collision resolution techniques in hashing.

Write an algorithm for binary search method and discuss its efficiency

Write recursive ‘C’ functions for (1) in-order (2) pre-order and (3) post-ordertraversals of binary search tree.

Explain Sequential, Indexed Sequential and Random file organizations.