Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Determine the optimal tour in following travelling salesperson problem using dynamic programming.
Write the algorithm for Push and Pop operations on Stack using Linked List. Describe the addition and deletion operations performed on a circular queue with essential algorithms.
Define the connected components of a Graph. For the graph shown below provide the adjacency list.
Describe firstfit and bestfit approaches of the dynamic memory management.
Apply the Dijkshtra’s algorithm to determine the shortest path between s and t in the given graph.
Write down an algorithm to assess a postfix expression by using the stack.
Illustrate Breadth-first search and Depth-first search algorithm. Illustrate merge sort with illustration. Discuss binary search with illustration.
Write the algorithm to traverse a binary tree in preorder. Give appropriate example.
Explain best-case, worst-case and average-case complexity of the algorithm in detail. What is time-space trade off?
What do you mean by row-major and column-major order?
Describe in detail the Linked representation and Array representation of Binary Tree.
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.