Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
typical programming languages such as pascal c or java give primitive data kinds such as integers boolean reals values and strings they give
for multi-national business it system free and open source software foss is recommended over a proprietary system. the reasons for this
q. write down an algorithm to test whether a binary tree is a binary search tree. ans.the algorithm to check whether
q. assume that we have separated n elements in to m sorted lists. explain how to generate a single sorted list of all n elements in time o n log m
q. implement a stack making use of the linked list. show the push and pop operations both.ans.stack implemantation using linked list
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