Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Explain why is a linked list termed as a dynamic data structure? Illustrate the merits of using linked lists over arrays?
Describe first fit and best fit approaches of the memory management. Write down an algorithm for best fit approach.
Write down an algorithm for the quick sort. Compare its complexities for worst case, average case and the best case. Sort the given by using quick sort:
Illustrate the meaning of complete threaded binary tree? Explain how null pointers are replaced in it?
Transform the following infix expression into its equivalent postfix and prefix expression: (A+B^D)/ (E-F) +G. Determine the postfix expression for the following given expression: P : 6,2,3,+,-,3,8,2
Discuss the method of Quick sort by explaining the sorting of following given example:A = {9, 93, 16, 34, 42, 58}. Write down the program for explaining the insertion sort.
Describe the data type and draw the hierarchy of data types.
What do you mean by adjacency list representation of a graph? Describe with the help of an illustration. As well write its merits over the adjacency matrix representations of graph.
Describe the fundamental principle of dynamic programming by using a simple illustration.
Calculate the average case complexity of the linear search algorithm.
Write down a function in C program which traverses a threaded binary tree in preorder.
Sort the given data by using merge sort. Describe the time complexity of the algorithm if the data size is n.
Doubly linked lists are enhanced as far as traversing the elements is concerned. Explain why we don’t then always utilize them.
Assume that the given character array is to be sorted through the heap sort algorithms.
Describe strongly connected components of the graph with illustration.
Define the term maxheap and minheap? How will you symbolize a max-heap as an array? Write down an algorithm to insert the element to a max-heap.
Assume that the terms are stored in the order shown in the problem statement in linear arrays COEF, XEXP, YEXP, and ZEXP with the HEAD node first.
Determine the worst-case efficiency, best-case efficiency and the average-case efficiency of sequential search algorithm. Describe them by using asymptotic notations.
Illustrate the execution of the dynamic programming algorithm for the longest common subsequences on the given illustration:
Describe Divide and Conquer strategy. Why recursion is most suitable for divide and conquers?
How would you identify a loop in a linked list? Write down a C program to detect the loop in a linked list.
Illustrate the meaning of threaded binary tree? How null pointers are substituted in it?
Illustrate out the different characteristics of algorithm. Write down the algorithm of insertion sort and describe with an example.
In brief describe the dynamic programming method by using Floyd’s algorithm for the problem of all-pairs shortest path as an illustration.
Write down an algorithm for constructing the Binary Search tree. While constructing the tree take care that duplicate values are not added. Trace the algorithm on the given data.