Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
q. by making use of stacks write an algorithm to determine whether the infix expression has balanced parenthesis or not.
q. develop a representation for a list where insertions and deletions can be done at either end. such a structure is known as a deque double ended
q. let x x1 x2 x3....xn and y y1 y2 y3....xm be the two linked lists respectively. write down an algorithm to merge the lists together to get the
q. what is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on
q. write down an algorithm for finding a key from a sorted list using the binary search technique or method.
q. write down the recursive function to count the number of the nodes in the binary tree. ans.recursive function to count no. of nodes in
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.
i have weekly test and online homework. how much is it to solve one question and do you help with online
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