Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Describe the method of representing the disjoint sets in the memory. Find the Minimum spanning Tree by applying Prim’s Algorithm on undirected graph.
Write B-Tree insert non-full algorithm and also find the total CPU time for executing the same. Write and describe with the help of one example a decrease key algorithm in Binomial Heap. Determine t
Describe how you would implement the queue data structure in its simplest form. Describe your answer fully with the essential sample code.
This assignment deals with creating data structure for large numbers (nonnegative). You have to read from an input file, say, "input", data.
Consider the tree illustrated below. What will be the results when traversing the tree in Preorder, Inorder and Postorder?
Prove that fractional knapsack problem has the greedy-choice property.
Demonstrate the operation of Heap sort on array A = [5, 13, 2, 25, 7, 17, 20, 8, 4]. What is the running time of heap sort on an array A of length n that is already sorted in increasing order? What
You need an algorithm which will receive two integer items from a terminal operator, and display to the screen their sum, difference, product and quotient.
Describe index sequential search with example. Write a non recursive algorithm for binary search and analyze its complexity. Write pseudo C code for bubble sort and calculate its time complexity.
Write an algorithm for Simple Hill Climbing and describe its working with an illustration.
Define the term data structure. Describe various kinds of data structures with illustrations.
Write down Kruskal algorithm. Apply Kruskal algorithm to find out minimum spanning tree of the given graph.
Describe Linear and Non-Linear data structures with appropriate examples.
Describe the difference between single linked list and double linked list. Describe about different operations performed on double linked list.
Compare and contrast hash tables with random access tables, when used as the dictionary data structure. Compare and contrast a binary search tree with the sorted array when used as the dictionary data
Implement the expression true as a binary tree, which does the following: Build the expression tree from a given String containing a fully-parenthesized arithmetic expression, for example "(((3.2 *
Give the efficient algorithm for the following problem:Given airports a and b, and time t, determine the sequence of flights which allows one to arrive at the earliest possible time in b when depart
Write comparison between Floyd’s and Dijkstra’s algorithms. Write a program to create Binary Search Tree.
Describe five types of information systems, and give an example of each.
What are Huffman codes in binary trees?
Briefly describe linear queue? Write algorithms to insert and delete an item to a linear queue.
Insert 2 3 6 1 7 78 54 23 0 55 one by one into an initially empty Binary Search tree.
Find out the time complexity of Insertion Sort, Selection Sort, Bubble Sort, Heap Sort, Merge Sort and Quick sort on sorted input, reversely sorted input and input of identical elements.
Write a C ++ program by using stack ADT which reads an infix expression, converts the expression to postfix form and computes the postfix expression.
What do you mean by the term priority queue? How do you implement a priority queue by using Heap?