Basic Data Structure Algorithms (KOE-045) - AKTU Question Paper 2022-23

Discuss space and time complexity of an algorithm?

Write the syntax to check whether a given circular queue is full or empty?

Draw a binary Tree for the expression: A * B - (C + D) * (P /Q)

What is the advantage of linked list over an array ?

Define transitive closure

Write an algorithm of bubble sort and its time com plexity also

Write down the various applications of linked list

Write an algorithm for Breadth First Search (BFS) traversal of a graph. (i) Differentiate between internal sorting and externa l sorting. (j) Discuss about data structure which is used to perf orm recursion?

Assume the declaration of multi-dimensional arrays A and B to be, A (-2:2, 2:22) and B (1:8, -5:5, -10:5) (i) Find the length of each dimension and number of elements in A and B. (ii) Find the address of element B (2, 2, 3), assuming B ase address of B =400 and there are W=4 words per memory location

Define Stack? Write a C program for array implemen tation ofa stack

Write an algorithm for Insertion Sort. Use Inserti on sort algorithm, sort the following elements

Write the Dijkstra algorithm for shortest path in a graph and also discuss with the help of suitable example

Construct a Huffman tree for given characters A, B , C, D, E, F, G, H and I having frequencies 15, 6, 7, 12, 25, 4, 6, 1 and 15 respectively. What will be the code of AHEAD in binary?

How to represent the polynomial using linked li st Write a C program to add two polynomials using linked list

Discuss singly linked list? Write an algorithm to insert a node after agiven node in singly linked list

Write an algorithm for converting infix Trace your algorithm for infix expression Q into it sequivalent postfix expression P

W rite short note on the following: (i) Priority Queue (ii) Circular Queue

Define Hashing. Explain midsquare and digit folding method hash function with the help of an example

Write an algorithm for Quick Sort sequence: 18, 25, 45, 34, 36, 51, 43

Discuss span ning tree cost spanning tree. Use Kruskal tree in the following graph

Write down the Floyd Warshall algorithm to solve th e all pair shortest path. Use the Floyd Warshall algorithm to find shortest path among all the vertices in the given graph

Explain B-tree. Write down the properties of it. Cons following sequence of inputs: Assume that the order of the B

Write short note on the (i) Internal and External Sorting (ii) B+ tree part of the following : Write an algorithm for converting infix expression into postfixexpression. Trace your algorithm for infix expression Q into it sequivalent postfix rite short note on the following: Priority Queue Circular Queue part of the following : Explain midsquare and digit folding method to compute the with the help of an example. Write an algorithm for Quick Sort . Use Quick sort algorithm, sort the sequence: 18, 25, 45, 34, 36, 51, 43, 24. part of the following : ning tree . Write down the Kruskal algorithm to obtainminimu cost spanning tree. Use Kruskal algorithm to find the minimumcost tree in the following graph: Write down the Floyd Warshall algorithm to solve th e all pair shortest path. Use the Floyd Warshall algorithm to find shortest path among all the vertices in part of the following : Write down the properties of it. Cons truct a B sequence of inputs: Assume that the order of the B -tree is 3. Write short note on the following: Internal and External Sorting B+ tree expression into postfixexpression. Trace your algorithm for infix expression Q into it sequivalent postfix to compute the sort algorithm, sort the following algorithm to obtainminimu m algorithm to find the minimumcost spanning Write down the Floyd Warshall algorithm to solve th e all pair shortest path. Use the Floyd Warshall algorithm to find shortest path among all the vertices in truct a B -tree on the