Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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?
Implement a singly linked list in ASCENDING sorted order. (You should not use any of Java built-in Collection classes). The data value in the node is a Song object. The sorting is based on the lengt
Explain the trend that views software as a service instead of a product. What effect has this trend had on software acquisition options?
a) Find the average complexity of an enqueue operation. b) Find the average complexity of the dequeue (remove) operation.
The key benefit of the Feistel Cipher is: The same algorithm can be used for encryption and decryption, there are always 16 rounds, there can be more then 16 rounds, the algorithm is very difficult to
Using a rail fence cipher with a depth of 3 encrypt the following message: The party is at Fenway in October. The Diffie Hellman algorithm is used for what? Public key encryption, Symmetric encryption
Write an algorithm to implement a circular doubly linked list Explain the advantages of Arrays and Pointers? What is the basis for selection of Arrays or Pointers as data structure in a program.
Write and run following programmes in C-language and calculate its total time complexity. Generate a Fibonaci series of 10 numbers. Determine the largest number in an array.
Explain a binary search algorithm and apply it to the following array of numbers to search for K=45. 5 20 30 35 40 &n
Write the algorithm for an implementation of the Doubly Linked Lists. Implement multiple queues in the single dimensional array. Write algorithms for different queue operations for them.
Show the search tree generated by Hill-Climbing search for each of the two heuristics (a) and (b) applied to the following 8-puzzle problem.
Find the minimum weighted path length P for six weights 4, 15, 25, 5, 8, 16. Draw the huffman tree also for the given weights. Find the huffman code for each weight.