Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q. can a queue be represented by circular linked list with only one pointer pointing to the tail of the queue? substantiate your answer using an
q. let a binary tree t be in memory. write a procedure to delete all terminal nodes of the tree. ans.function to delete terminal nodes
q. a linear array a is given with lower bound as 1. if address of a25 is 375 and a30 is 390 then find address of a16.
the best algorithm to solve a given problem is one that requires less space inmemory and takes less time to complete its execution. but in practice
an algorithm is a sequence of steps to solve a problem there may be more thanone algorithm to solve a problem. the choice of a particular algorithm
q. let us consider a queue is housed in an array in circular fashion or trend. it is required to add new items to the queue. write down a method enq
q. define a method for keeping two stacks within a single linear array s in such a way that neither stack overflows until entire array is used and a
q. give the algorithm for the selection sort. describe the behaviours of selection sort when the input given is already sorted.
q. write down the algorithm for binary search. which are the conditions under which sequential search of a list is preferred over the binary search?
q. convert the given infix expression into the postfix expression also show the stepsa lowast b d e - fg h k ans.steps showing infix
q. give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.
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