Define the following terms with the help of an example i) Data Structure ii) Abstract Data Types iii) Algorithm iv) Flowchart

Define Time and Space complexity and Explain the Asymptotic notations used for time complexity?

State different algorithmic strategies and describe any two greedy algorithm strategies with example?

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

Define the term data structure? Give complete classification of data structure with an example?

Explain following algorithm strategies with example i) Tower of Hanoi ii) Binary search

Represent following polynomial using Array i) 4x2 + 5xy2 + 2y3–15 ii) x5y4 + 6x4y3 + 3x2y + 27

State advantages and disadvantages of sequential organization of Data structure?

Explain row major and column major representation of array in computer memory with example? Each element of an array A[10][12] requires 4 bytes of storage Base address of data is 1000. Determine the location of A[5][5] when array is stored as i) Row major ii) Column major

Explain with help of an example how to convert 2D presentation of matrix to sparse representation and write pseudo code for it?

Describe the addition of two sparse matrices with the help of an example and write pseudo code for it?

State the different types of operations that can be performed on one dimensional array? Write pseudo code for inserting 5 elements in array and deleting one element from 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.

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

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.

Given numbers 49, 47, 37, 29, 26, 10, 65, 78, 21, 49. Sort stepwise using radix sort. When it is appropriate to use radix sort? Write time Complexity.

Write pseudocode/Function for Binary Search algorithm. Explain with suitable example.

Write short note on i) Binary Search ii) Index sequential search iii) Linear Search

Explain Quick sort technique with suitable solved example. Comment on time complexity.

Write pseudo code/function using Doubly Linked List of Employees (Emp-number, name and age stored in every node) for: i) Search given Emp_no and update the age ii) Add given Emp_no after specified number in the list

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

How polynomial can be represented using Singly Linked List? Write pseudocode to perform addition of two polynomials using singly linked lists into third list.

Draw and explain structure of Circular Doubly Linked List. What are advantages of Circular Linked List over Singly Linked List? Write pseudocode/function for insertion of a node in Circular doubly linked lists.

What are the rules to convert infix expression to postfix expression using stack. Convert expression (E* (F– (G + H * I)) ^ (J * K + L)) stepwise using above rules. Where ^ is - exponential operator

Write short notes on i) Backtracking ii) Tree Recursion iii) Tail recursion.

What are polish notations? What is the need to convert infix expression into postfix form? Explain postfix evaluation with suitable example.

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

Write short notes on: i) Comparison of Linear queue and Circular queue ii) Priority queue

What is Doubly Ended Queue? Which two data structures are combined in it? Explain input restricted and output restricted queue with operations.

Write short note on: i) Circular Queue using Singly Linked List ii) Descending priority queue and it’s applications

Draw and explain implementation of Doubly ended Queue using Doubly Linked List. Explain Add, Remove operations.

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.

Explain with example the following terms related to sorting methods: i) Stability ii) Number of Passes/Iterations iii) Sort order

Sort given array by using quick sort method 25, 23, 18, 19, 21, 17, 28, 20, 16 14. Show step by step execution.

Write the algorithm to search an element in array A using binary search technique. Write the complexity of the algorithm for best case worst case and average case.

Compare linear search, binary search and sentinel search methods by considering its performance measures.

Sort given array by using shell sort method 50, 23, 18, 9, 01, 70, 21,20, 6,40,03. Show step by step execution.

Write pseudocode for Selection sort method. Is this sort stable or unstable?

What are advantages of making doubly linked list making circular? Write pseudo code for following function using Doubly Circular Linked List of integer number i) Perform addition of odd numbers in Doubly linked list and insert at start ii) Delete all even numbers from list

Write and explain node structure of Generalized linked list. Represent given Generalized linked list graphically. (A, B, C, (D, (E, (F), I)), J)

Write node structure for polynomial implementation using circular linked list. Write pseudocode to perform addition of two polynomials using circular linked list. Write complexity of it.

Write and explain node structure of generalized linked list for representing multiple variable polynomials. Represent given polynomial graphically using Generalized linked list. 7x5 y2 z3+13x3 y4+30x9z8

What is the necessity of expression conversion? Write pseudocode to convert given infix expression to prefix using stack.

Explain with example four different types of recursion.

Convert given infix expression into postfix expression using stack. Show step by step conversion and evaluation. Evaluate postfix expression using given values. Infix Expression: (A+B^C^D*F/H) Values for A=4, B=2, C=3, D=2, F=2, H=8 ^-exponential operator

What is backtracking algorithmic strategy? Explain the use of stack in backtracking strategy with any one application.

What are the advantages of Circular Queue over normal queue? Write insert and delete functions for Circular Queue using static memory allocation.

Explain the Queue implementation using Singly Linked List. Draw diagram with three elements in queue, showing front and rear. scheduling problem using Queue. Write pseudocode for insert and delete operations of above Queue.

Explain with example primitive operations of Double ended Queue.

What are the types of priority queue? Explain any one type of priority queue in detail with example. Mention the time complexity for insert and delete operations on it.

Write a pseudo code for binary search apply you algorithm on the following no.s stored in an array to search no:23 & 100. 9,17,23,40,45,52,58,80,85,95,100

Explain the selection sort with algorithm sort the following no.s using selection sort & show the content of array after every pass. 27, 76, 17, 9, 45, 58, 90, 79, 100.

Explain quick sort algorithm with suitable example. What is time complexity of quick sort algorithm.

Write a short note on sentinel search & Index sequential search with suitable example.

Write a pseudo code to insert new node in to singly link list.

Explain the representation of polynomial using GLL.

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

What is dynamic data structure. Explain with circular linked list with it’s basic operation.

Write a pseudo code for basic operation of stack.

What are the variants of recursion. Explain with example.

Write algorithm for posfix expression evalution. Explain with suitable example.

Explain the linked implementation of stack with suitable example.

Write pseudo code to implement circular queue using array. Explain it’s basic operation.

Explain array implementation of priority queue with all basic operation.

Explain linked implementation of queue with suitable example.

Write pseudo code for insertion operation of input restricted & output restricted double ended queue.

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.

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.