Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q. write down an algorithm to sort a given list by making use of quick sort method. describe the behaviour of quick sort when input given to us is
delete a specific node from double linked list as followsdeletedblinfo forw back start availloc1. delete nodeset forw back loc forwlocamp
q. write down an algorithm to add an element in the end of the circular linked list. ans.algorithm to add the element at the end of
q. write an algorithm that counts number of nodes in a linked
write down any four applications of the queues.
algorithm to insert a node p at the end of a linked list is explained belowstep1 check for spaceif new1 null output overflowand
q. suggest a method of implementing two stacks in one array such that as long as space is there in an array you should be capable to add an element
q. write down an algorithm to convert an infix expression into the postfix expression. ans.algorithm to convert infix expression to
q. take an array a20 10 of your own. suppose 4 words per memory cell and the base address of array a is 100. find the address of a11 5 supposed row
q. write down an algorithm to evaluate an expression given to you in postfix notation. show the execution of your algorithm for the following given
what do you understand by term structured programming? explain the structured programming as well.
binary search algorithm is given as follows1. if low gt high2. return -13. mid low high24. if x a mid5.
q. using array to execute the queue structure write down an algorithmprogram toi insert an element in the queue.ii delete an element from the queue.
q. explain the hash tables hash function and hashing techniques properly? ans.hash table is explained as followsa hash
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.