Data Structures Analysis Of Algorithms (KCA-205) - AKTU Question Paper 2022-23

Describe the Big Oh notation

Differentiate between array and linked list

Let J an K be integers and suppose Q(J,K) is recursively defined as Find Q(4,7)

Consider the following linear queue capable of accommodating maximum five elements. Front = 2 Rear = 4 Queue _ L, M, N, _ Compute following operations (i)Add O (ii) Add P (iii) Delete two letters (iv) Add Q, R

What do you mean by non-comparison sort? List two non-comparison sort algorithms

Apply selection sort algorithm on given data to sort in ascending order

Discuss the concept of inorder "successor" and inorder “predecessor” in Binary Search Tree

Give static and dynamic memory representation of binary tree (i) How dynamic programming approach is better from recursive programming approach (j) What is the role of a negative cycle, while you are computing the shortest path in the graph

Discuss how two-dimensional array can be stored in the memory and compute the following. An array Arr[50][100] is stored in the m emory along the row major with each element occupying 4 bytes of memory. Estimate the address of the location Arr[20][50], if the base address 1000

Write down algorithm to evaluate postfix expression and also evaluate given postfix expression using the algorithm

Discuss various methods to represent graph in the m emory, Also write down algorithm to do DFS in the graph. Apply that algorithm on given graph to compute DFS Tree

What is AVL tree? What is balancing factor? Explain balancing method of AVL tree with all possible cases with suitable example

How Strassen’s matrix multiplication provide better time complexity over classical matrix multiplication algorithm. Apply the Strassen's algorithm method on the following matrix 1 5 7 3 and 8 2

Give an algorithm or C function to perform following operations on single linear linked list (i) Insert a node after a given node (ii) Delete a node from end

What do you understand by hashing? What are the dif ferent hashing techniques? Discuss different techniques to resolve collision once it is occurred during hashing

Write a ‘C’ program to implement two stacks in a si ngle array. One stack will grow from one end of the array and second stack will grow from the other end of the array. User need to implement following functions (i) Push in specific stack (ii) Pop from Specific stack (iii) Handing overflow and underflow cases

Write down Quick Sort Algorithm and apply it on following data to sort it

Write down recursive algorithm to insert a node in binary search tree. And apply that algorithm to construct BST with given data

Demonstrate the traversal of the following tree in Pre write recursive algorithms of three traversals

Write down algorithm of Floyd Also apply it on following graph

Discuss the applications of longest common subsequence( LCS). <1.0,0,1,0,1,0,1> and < 0,1,0,1,1,0,1,1,0> part of the following : 10x1=10 Write down recursive algorithm to insert a node in binary search tree. And apply that algorithm to construct BST with given data. the traversal of the following tree in Pre -Order, Post-Order and In write recursive algorithms of three traversals. part of the following : 10x1=10 Write down algorithm of Floyd -Warshall to compute all pair shortest path with in the graph. Also apply it on following graph Discuss the applications of longest common subsequence( LCS). Determine the LCS of <1.0,0,1,0,1,0,1> and < 0,1,0,1,1,0,1,1,0> Write down recursive algorithm to insert a node in binary search tree. And apply that Order and In -Order. Also shortest path with in the graph. Determine the LCS of