Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Write down the difference between Postfix and Prefix notation.
Distinguish between descriptive and predictive tasks. What do you mean by outliers. Explain it in detail.
What kind of language do you favor for writing the complex data structures?
What are the procedure for binary tree representation? Write down the advantages of binary search over sequential search?
Describe in detail the various insertions in a singly linked lists. Describe the Huffman algorithm with an example. Describe address calculation sort with procedure and example.
By showing all your workings, draw the spanning tree for following graph based on Breadth-First-Search algorithm. Choose e as the root node.
In this assignment, use a queue for storing data for Fifo accounting, and stack for Lifo accounting. You must use the array based implementation for your stack based implementation and a linked list
Write down three non-member functions for inorder, preorder and postorder traversals of binary search tree. Demonstrate the result of all the three traversals.
Draw the Gantt chart and calculate average waiting time, average turnaround time for Preemptive Priority scheduling algorithm. Show that with the general definition of semaphores with busy waiting, t
Write a recursive function to solve Tower of Hanoi problem with problem statement. Write a function to insert a node between two consecutive nodes with information fields x and y respectively in a si
Describe different techniques used to resolve hash collision. Describe the array of adjacency list representation of an undirected graph with the example.
Write the c function to create an ordered linked list. Write the recursive function to compute GCD of two numbers.
Write a function to create a tree for a postfix expression. Trace the same stepwise for the expression (A+ ((B-C)*D) ^E^F) by first giving the equivalent postfix expression.
Write a function to implement heap sort. Write the function to convert the infix expression to postfix expression using a stack.
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.