Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q. write down the algorithm to insert an element to a max-heap which is represented sequentially.
q. how do we represent a max-heap sequentially? explain by taking a valid example. ansa max heap is also called as a
q. illustrate the steps for converting the infix expression into the postfix expression for the given expression a blowast c de
q. what is the need of using asymptotic notation in the study of algorithm? describe the commonly used asymptotic notations and also give their
simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations
a useful tool which is used for specifying the logical properties of a data type is called the abstract data type or adt. the term abstract data type
q. which are the two standard ways of traversing a graph? explain them with an example of each. ans the two ways of traversing a graph are
q. explain the insertion sort with a proper algorithm. what is the complication of insertion sort in the worst case?
q. write down a non recursive algorithm to traverse a binary tree in order. ansnon - recursive
q. write an algorithm insert which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place
q. calculate that how many key comparisons and assignments an insertion sort makes in its worst case? ansthe worst case
q. write down the algorithm which does depth first search through an un-weighted connected graph. in an un-weighted graph would breadth first search
q. write down an algorithm to insert a node in the beginning of the linked
q. state the difference between a grounded header link list and a circular header link list? ansa header linked list is a linked list which
q. explain the technique to calculate the address of an element in an array. a 25 times 4 matrix array data is stored in memory in row-major
q. explain the complexity of an algorithm? what are the worst case analysis and best case analysis explain with an
q. sort the sequence written below of keys using merge sort.66 77 11 88 99 22 33 44
q. which sorting algorithm can be easily adaptable for singly linked lists? explain your answer as well. ansthe simple
q. the reason bubble sort algorithm is inefficient is that it continues execution even after an array is sorted by performing unnecessary
q. write down the non-recursive algorithm to traverse a tree in preorder.ansthe non- recursive algorithm for preorder traversal is written below
q. the degree of a node is defined as the number of children it has. shear show that in any binary tree the total number of leaves is one more than
q. the two binary trees are said to be similar if they are both empty or if they are both non- empty and left and right sub trees are similar. write
q. perform implementation of a queue using a singly linked list l. the operations inser and delete should take o 1 time.
q. an array a comprises of n unique integers from the range x to yx and y inclusive where ny-x. which means there is only one member that is not in
q. describe the term array. how do we represent two-dimensional arrays in memory? explain how we calculate the address of an element in a two