Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Describe the impact of threaded binary tree on the tree traversal process.
Describe the method of binding the minimum spanning tree for a connected graph using prims algorithm.
Write down the techniques for traversals in graph. Explain them in detail.
Describe Subset-sum Problem and explain the possible solution strategies using backtracking.
What is Warshalls algorithm? Give suitable example. Describe “Graph coloring” problem with suitable example.
Describe Knapsack Problem in detail with suitable example. Describe in detail merge sort. Demonstrate the algorithm with a suitable numeric example. Provide complete analysis of the same.
Describe divide and conquer algorithms. What do you mean by Merge Sort.
What do you understand by “Amortized efficiency”? Explain in what way we can measure the algorithm’s efficiency?
What do you understand by “Best case-Efficiency” of an algorithm? Explain it with suitable example. What do you understand by “Worst case-Efficiency” of the algorithm? Explain
Write down the Kruskal’s algorithm to find out a minimum spanning tree of the Graph.
Assume that f(n) and g(n) be asymptotically non negative functions. By using the fundamental definition of Θ-notation, prove that the max (f (n), g (n)) = Θ (f (n) +g (n))
Create an arithmetic expression tree for the expression (((a/b) + c) - (d*e)) and give the pre-order and post order traversals.
Apply the Quick sort algorithm for the given array of elements and sort the elements (Take the element 28 from the list as pivot element). As well describe the complexity of the algorithm for worst
A saddle point in a 2-dimensional array is the value that is minimum in the row and maximum in the column. Derive an algorithm to find out the saddle point of a matrix. Illustrate the order of algor
In brief explain and distinguish between the first-fit and best-fit memory allocation strategy.
Write down an algorithm to search a key in a B-tree. Illustrate the worst case of searching in a B-tree? List all the possible conditions which can take place while inserting a key in a B-tree?
Write down a program which makes a linked list comprising of nodes of the given struct type and searches the record of a student whose roll number is given by user.
Use a stack to assess the given postfix arithmetic expression. Show the changing status of stack in a tabular form:
Write down the demerits of linear representation of the binary tree.
Write down different spatial partitioning representation methods. Briefly describe Octree.
Derive an equation for foreshortening factor for trimetric projection. Derive an equation for foreshortening factor for diametric projection.
Describe Cyrus beck line clipping algorithm in detail. Derive an equation to calculate parameter t.
If you are using C language to execute the heterogeneous linked list, what pointer type will you use?
Derive the ADT to execute insertion and deletion in the singly linked list. Describe cursor implementation of linked lists. Write down the necessary operations.
What do you mean by depth and height of a tree? What are the significant factors to be considered in designing the hash function?