Sort given array by using bubble sort method: 64, 34, 25, 12, 22, 11, 90. Show step by step execution for all the passes highlighting “swap” and “No Swap” situations. How many passes are required to sort an array of N elements using bubble sort?

Write an algorithm to search an element in array A using binary search technique. Show stepwise search of Key 10 in 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11. Is there any pre-processing of data required before starting binary search or what is its precursor requirement?

Enlist different searching methods. Write short note on i) Fibonacci Search ii) Index Sequential Search

Sort given array by using selection sort method 50, 23, 03, 18, 9, 01, 70, 21, 20, 6, 40, 04. Show step by step execution of all passes. What is the best and worst case time complexity of selection sort?

Write pseudo code for following function using Doubly Linked List of integer numbers i) Insert given value as last value in the list. Draw diagram of operation. ii) Delete first node from the list. Draw diagram of operation. iii) Delete last node from the list. Draw diagram of operation.

Write and explain node structure of i) Generalized linked list. ii) Circularly Singly Linked List. Draw and explain insertion of value in Circularly Singly Linked List with example.

Write pseudocode to perform merging of two sorted singly linked lists of integers into third list. Write complexity of it.

Write and explain node structure of Generalized linked list for representing multiple variable polynomial. Represent given polynomial graphically using Generalized Linked List: 5x7 + 7xy6 + 11xz.

Write rules to convert given infix expression to postfix expression using stack. Convert expression (A* B – (C + D * E) ˆ (F * G / H)) stepwise using above rules. Where ˆ is - exponential operator.

Explain with example three different types of recursion.

What is infix, prefix and postfix expression? Give example of each. Explain evaluation of postfix expression with suitable example expression and assume values for variables used to solve it.

Write pseudo-C/C++ code to implement stack using array with overflow and underflow conditions.

What are advantages of Circular Queue over Linear Queue using static memory allocation? Write pseudocode to add and remove element from Circular Queue along with Queue Full and Empty condition.

Draw and explain implementation of Linear Queue using Singly Linked List. Explain Add, Remove, Queue Full and Queue Empty operations.

What is Doubly Ended Queue? Draw Diagram with labelling four basic operations at appropriate places. Which two data structures are combined in it and how?

Draw and explain Priority Queue? State any real life application.

Write pseudocode for Linear Queue Implementation using array.

Write pseudo ‘Python’ algorithm (recursive) for binary search. Apply your algorithm on the following numbers stored in array from A[0] to A[10] 9, 17, 23,38,45,50,57,76,90,100 to search numbers 10 & 100.

Explain the quick sort algorithm. Show the contents of array after every itertion of your algorithm start from following status of array.- 27, 76, 17, 9, 57, 90, 45, 100, 79.

Explain in brief the different searching techniques. What is the time complexity of each of them?

Write an algorithm of selection sort and sort the following numbers using selection sort and show the contents of an array after every pass:- 81, 5, 27, –6, 61, 93, 4, 8, 104, 15

What is linked list? Write a pseudo C++ code to sort the elements.

What is doubly linked list? Explain the process of deletion of an element from doubly linked list with example.

Explain Generalized Linked List with example.

Write Pseudo C++ code for addition of two polynomials using singly linked list.

Write an algorithm for postfix evaluation with suitable example.

What is concept of recursion? Explain the use of stack in recursion with example.

What is need to convert the infix expression into postfix; convert the following expression into postfix expression (a+b) * d + e/(f + a*d) + c.

What is backtracking algorithm design strategy? How stack is useful in backtracking

Write pseudo C++ code to represent dequeue and perform the following operations on dequeue: i) Create ii) Insert iii) Delete iv) Display

What is circular queue? Explain the advantages of circular queue area linear queue.

Define queue as an ADT. Write pseudo C++ code to represent queue.

Explain Array implementation of priority queue with all basic operations.

Sort the following numbers step by step using insertion sort : 55, 85, 45, 11, 34, 5, 89, 99, 67. Comment on time complexity of Insertion sort

Explain in brief any three searching techniques. What is the time complexity of these techniques?

Explain Fibonacci Search algorithm with suitable example. What is it’s time complexity?

Given numbers 29, 57, 47, 39, 36, 20, 55, 28, 31, 39. Sort stepwise using radix sort. When it is appropriate to use radix sort? Write time Complexity.

Write pseudo code for following function using Singly Linked List of students (roll_number and name stored in every node) i) Search given roll no and delete that record. Draw diagram of operation. ii) Add given number after specified number in the list. Draw diagram of operation.

Write and explain use of Generalized linked list for representation of multivariable polynomial with suitable example. Explain node structure.

Write pseudocode to perform addition of two polynomials using doubly linked lists into third list. Write time complexity of it.

Write and explain node structure of Circular Singly Linked List and Doubly Linked list. Write pseudocode for concatenation of two doubly linked lists.

Write rules to convert given infix expression to postflx expression using stack. Convert expression (P * Q – (L + M * N) ^ (X * Y / Z) stepwise using above rules. Where ^ is - exponential operator.

Explain with example three different types of recursion.

Explain procedure to convert infix expression to prefix expression and postfix evaluation with suitable example.

Write pseudo-C/C++ code to implement stack using Singly linked list with overflow and underfiow conditions.

Draw and explain Circular queue using array. Write pseudocode for Add, Remove operations.

What is Doubly Ended Queue? Draw Dragram with labelling four basic operations at appropriate places. Which two data structures are combined in it and how?

Write short note on : i) Comparison of Circular Queue with Linear queue ii) Priority Queue

Draw and explain implementation of Linear Queue using Singly Linked List. Explain Add, Remove, Queue Full and Queue Empty operations.

Define the following terms with suitable example. i) Data Structure ii) Abstract Data Type iii) Algorithm iv) Flowchart

What is frequency count? Why is frequency count important in the analysis of algorithm.

Write an algorithm to compute the sum of the digits of the given number. Justify that your algorithm satisfies all the characteristics of an algorithm.

Give complete classification of data structures with one example of each.

Explain divide & conquer Strategy and Greedy strategy with suitable example.

Draw flowchart to check whether a given number is a perfect square of an integer. What is the time complexity of your algorithm.

What are advantages & disadvantages of sequential organization of data structure?

Explain row major & column major representation of arrays in computer memory.

Write an algorithm to perform polynomial addition state the time complexity of the algorithm.

Write a short note on storage representation of an array.

Write pseudo code to reverse the in numbers in one dimensional array.

Write an algorithm to perform sparse matrix addition & state its time complexity.

What is time complexity? Why asymptotic notations are important? Find time complexity of following code using step count method. int x = 0; for (i = 0; i <N; i++) { for (j = N; j > i; j--) { x = x + i + j; } }

Write pseudocode to find factorial of a number. Draw the flowchart for the same.

Explain what is Linear and non-linear data structure with example.

Write short note on : ADT, Divide and conquer method.

What is meant by time and space complexity? Explain the asymptotic notations used for time complexity?

Explain what is static and dynamic data structure with example.

What is Row Major and Column Major Representation? Explain with example. Write the formula to find any element A[i][j] in row major and column major representations of A.

What is meant by sparse Matrix? Write an algorithm to perform addition of two sparse matrices.

Explain with example how single variable polynomial can be represented using 1-D array? What is advantage and disadvantage of this representation?

What is the difference between simple and fast transpose of sparse matrix? Write an algorithm to find simple transpose of sparse matrix.

Write an algorithm to find addition of two single variable polynomials using array. Polynomial term consists of coefficient and exponent and both are stored as an element in array. Assume terms are arranged in descending order of exponent. State time complexity of the same.

Draw and explain following terms : 2D Array 3D Array

Discuss any six classes of time complexity with sample code.

Differentiate between: i) Static and Dynamic Data structures ii) Persistent and Ephemeral Data Structures

Explain step count method with the help of suitable example.

Analyse time complexity of following codes. Show step count for each statement: i) function is Prime(n){ for (i=2;i<n;++i){ if (n%i= = = 0){ return false; } } return true; } ii) Function f() { ans=0 for (i=n;i>=1;i/=2){ for (j=1; j <=m; j*=2){ans+= (i*j) } print(ans) } }

How asymptotic notations plays important role in defining complexity class? Explain Big-Oh, Big-theta and Big-Omega notation with graphs denoting growth rate.

What is algorithmic strategy? Explain divide & conquer and greedy strategy with example.

How can we find transpose of sparse matrix in linear time? Give pseudocode for his method.

Given an array,arr [1.......10] [1......15] with base value 100 and the size of each element is 1 Byte in memory. Find the address of arr[8] [6] with the help of row-major technique and column major technique.

Compare and contrast row major and column major technique with the help of any matrix.

Write an algorithm to calculate sum of numbers stored in array and illustrate all characteristics of algorithm for the same.

Give a pseudocode for polynomial addition.

What is an ADT? Write ADT operations for array.