Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q. convert the following given infix expression to postfix form using the stack function x y z p q r s follow general precedence rule and
ans.an algorithm for the quick sort is as followsvoid quicksort int a int lower int upper int i if upper gt lower i split a lower upper
q. the system allocates the memory for any of the multidimensional array from a big single dimensional array. describe two mapping schemes that help
q. write down any four applications or implementation of the stack.
q. write down an algorithm to insert a node in between any two nodes in a linked list ans.insertion of a the node after
write an algorithm to count number of nodes in the circular linked list.
evaluate the frequency counts for all statements in the following given program segment.for i1 i le n i for j 1 j le i jfor k 1 k le j ky ans.s1
ansinsertion into the b-tree1. first search is made for the place where the new record must be positioned. as soon as the keys are inserted they
q. prove the hypothesis that a tree having m nodes has exactly m-1 branches. ansa tree having m number of nodes has exactly m-1
q. describe the basic concept of binary search technique? is it more efficient than the sequential search? ansthe binary search
q. compare and contrast various sorting techniques or methods with respect to the memory space and the computing time.
q. show the various passes of bubble sort on the unsorted given list 11 15 2 13 6 ansthe given data is as follows-pass
q. enumerate number of operations possible on ordered lists and arrays. write procedures to insert and delete an element in to array.
q. execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input q a bc d uarr e f g
ansa procedure to reverse the singly linked listreversestruct node ststruct node p q rp stq nullwhilep nullr qq pp p
q. define the terms data type and abstract data type. comment upon the significance of both these. answe determine the total amount of memory to
q. what do you understand by the term hashing? how do the collisions occur during hashing? explain the different techniques or methods for
q. devise a representation for a given list where insertions and deletions can be made at both the ends. such a structure is called deque which means
q. define the sparse metrics and also explain the representation of a 4x4 matrix using linked list. ansa matrix in which number
q. write down a programme in c to create a single linked list also write the functions to do the
q. write down an algorithm to merge the two sorted arrays into the third array. do not perform the sort function in the third array.
q. explain what are the stacks? how can we use the stacks to check whether an expression is correctly parentheses or not. for example is well
q. explain dijkstras algorithm for finding the shortest path in the graph given to us. ansthe dijkstras algorithm this is a problem which is
q. explain the term hashing? explain any five well known hash functions. anshashing method
q. write down the algorithm to insert an element to a max-heap which is represented sequentially.