For a Singly Linked list, write a pseudocode to delete: i) First element ii) Last element

What is an ADT? Explain ADT operations for singly Linked List.

Explain frequency count method with the help of suitable example.

Discuss the- concept of circular linked list and doubly linked list with the structure of node and sample linked list.

An array arr[10][5] is stored in the memory with each element requiring 2 bytes of storage. If the first element arr[0][0] is stored at the location 1250, calculate the address of arr[5][6] when the array is stored using row major technique.

Calculate time complexity of following codes: i) int a = 0,b = 0 for (i = 0; i <N; i++) { a = a + rand ( ); } for (j = 0;j < M; j++) { b = b + rand ( ) ; } ii) a = 0 i = n While (i >0) { a = a+i; i = i/2; }

Explain quick sort & sort the given list using quick sort: 15, 08, 20, -4, 16, 02, 01, 12, 21, -2 Analyse time complexity of quick sort.

Apply binary search on {10,20,30,35,40,45,50}’ to-search the position of the element 40. Comment on it’s time complexity.

Differentiate between binary search and Fibonacci search.

Sort the following numbers using insertion sort: 55, 85, 45, 11, 34, 05, 89, 99, 67, 55 Comment on efficiency, stability, in-place characteristics of insertion sort.

Suppose we have the array: (1, 2, 3,4, 5, 6,7). We have to find the element X = 6 using Fibonacci search. Explain all steps.

Explain the stable and unstable sort with the help of suitable example.

Write sudo code for inserting an element in doubly linked list.

Discuss various asymptotic notations used to analyze algorithms.

Enlist differences between Data & Data object.

Explain with the help of examples how row-major & column-major address calculations are performed for multi-dimensional arrays.

Write sudo code delete a specified element from a singly circular list.

Discuss various sorting-algorithm characteristics.

Establish comparative analysis of merge sort & Quick sort algorithms.

Write sudo code & dry-run for binary search algorithm.

Discuss the importance of sort-stability with respect to sorting algorithms.

Discuss the time complexity of following sorting algorithm. i) Shell sort. ii) Merge sort. iii) Quick sort.

Write sudo code & dryrun for fibonacci search.

Imagine we have two empty stacks of integers, S1 and S2. Draw a picture of each stack after the following operations: i) S1. Push (3); ii) S1. Push (5); iii) S1. Push (7); iv) S1. Push (9); v) S1. Push (11); vi) S1. Push (13); vii) while (! Emptystack (S1)) { X=S1. Pop (); X=S1. Pop (); S2. Push (X); }

Clearly indicate the content of stack during conversion of given infix expression to prefix. A^B*C-D+E/F/(G+H)

Write a C++ pseudocode algorithm for the following operation of simple queue using linked representation. i) enqueue () ii) dequeue () iii) print_Queue()

If the values of A, B, C and D are 2, 3, 4 and 5 respectively. Calculate the value of the following prefix expression and clearly indicate the content of stack. (Consider ‘-’ as a minus sign) i) + - * A B C D ii) - * A + B C D

Consider the following circular queue of characters of size 6. “-” denotes an empty queue location. Initial queue configuration is Front = 1, Rear = 3 and having letters as shown below. A. F is added to the queue B. Two letters are deleted C. K, L, M are added to the queue D. Two letters are deleted E. R is added to the queue F. Two letters are deleted G. S is added to the queue H. Two letters are deleted Show the queue content of queue with Front and Rear as the above options take place.

What is double ended queue? Mention Types of double ended queue. Explain enqueue and dequeue operations of double ended queue.

Create a binary tree from given preorder and inorder traversal. Show all intermediate steps. Preorder : G B Q A C K F P D E R H Inorder : Q B K C F A G P E D H R

Write the C++ pseudocode algorithm for creating expression tree from postfix expression.

Construct an inorder threaded binary search tree for the following set of elements. 100, 50, 200, 300, 20, 150, 70, 180, 120, 30 Show all steps.

Write C++ pseudocode algorithm for preorder traversal of threaded binary tree.

Draw the expression tree for the given postflx expression. Clearly indicate the content of stack. Write the inorder and preorder traversal of the concern tree. A B C * + E * F +

Explain the following terms with respect to tree. i) Root ii) Leaf node iii) Siblings iv) Degree of a node v) Degree of tree

Find the minimum spanning tree using Prim’s algorithm for the following graph.

Obtain an AVL tree by inserting one data element at a time in the following sequence : 50, 55, 60, 15, 10, 40, 20, 45, 30, 70, 80. Label the rotations appropriately at each stage

Write short note on OBST.

Write an application of Topological sorting with suitable example.

For a given tree, Identify whether it is AVL tree or not? If it is not an AVL tree, convert it into balanced AVL tree . After conversion, insert node 15 in the tree. Delete node 20 from the tree. After insertion and deletion operation, if the tree is imbalanced, make it balanced AVL tree.

Construct Heap to Sort given values in ascending order using MAXheap sort. 5, 3, 17, 10, 84,19, 22. (Note : Make a use of Heapify)

Differentiate between sequential file and direct access file.

Write a pseudo code to perform the following operations on Sequential file : i) Insert record ii) Delete record

What are the characteristics of good hash function? List different techniques to resolve collision in hash table and explain any one with suitable example.

Explain the Index sequential file organization with advantages and disadvantages.

Explain Linear probing with and without replacement with suitable example.

What is File? Differentiate between text file and binary file.

Convert following Infix Expression to Postfix and evaluate using stack (A/B–C+D*E) A = 30 B = 2 C = 5 D = 10 E = 6

What is queue? How they are represented in memory? Write a pseudocode to implement insert & delete operation in a linear queue using array.

What is priority queue? How insertion & deletion operation is performed? Explain with example.

Convert following expression into postfix form. (Show all intermediate steps) ((A + B) - C * (D / E)) + F

Explain the concept of linear queue and circular queue.Give the advantages of circular queue over linear queue. Write C/C++ code to implement enqueue & degueue operation on circular queue.

What is linked stack? Write a C/C++ code to implement insertion & deletion operation on it.

In a given BST write the output of inorder, preorder, postorder, level wise traversals. Also draw mirror image.

Discuss algorithm for recursive and non recursive inorder traversal.

Construct BST from below data lnorder - 17, 32, 44, 48, 50, 62, 78, 88 Postorder - 32, 17, 48, 62, 50, 88, 78, 44

Construct the expression tree from the following prefix expression using stack. /, * , – , 4, 7, 9, 3

State and explain algorithm to display binary tree level wise with the help of sample tree.

Draw and explain how Threaded Binary Tree is efficient than Binary tree.

In the following graph, consider ‘A’ is the source. Apply Kruskal’s algorithm to get minimum spanning tree.

Find the Optimal Binary Search Tree for the : Identifier set {al, a2, a3} = {do, if, while} Where n = 3 and Probabilities of successful search as {pl, p2, p3) = {0.5, 0.1, 0.05) and Probability of unsuccessful search as {q0, q1, q2, q3) = {0.15, 0.1, 0.05, 0.05)

Explain the heap data structure &it’s types with the help of sample heap tree.

Construct AVLtree for following set of keys : A, Z, B, Y, C, X, D, E, V, F, M, R. Show the balance factor of all the nodes & name the’ type of rotation used.

Show the output of Breadth First Search using stack. Use ‘d’ as a starting node

If ‘5’ is the source, find the shortest path from source to all vertices, using Dijkstra’s algorithm. Show answer step by step.

Create the hash table using Linear Probing. Table size : 15 Data : 30, 61, 46, 77, 33, 93, 105, 70, 1 Hash function: data% table size

Explain with example characteristics of good hash function.

Discuss an algorithm to delete a record from the sequential file.

Discuss chaining with replacement technique to handle collision. Mention suitable example.

Compare sequential, Index sequential and direct access file organization.

Give an algorithm to merge two sequential files into third new sequential file.