Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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?
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.