Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Illustrate the steps for converting the infix expression into the postfix expression
for the given expression (a + b)∗ (c + d)/(e + f ) ↑ g .
Ans:
The infix expression can be converted to postfix expression as follows: (a+b)*(c+d)/(e+f)^g
=(ab+)*(cd+)/(ef+)^g
=(ab+)*(cd+)/(ef+g^)
=(ab+cd+*)/(ef+g^)
=(ab+cd+*ef+g^/)
The postfix expression is given as:-
(ab+cd+*ef+g^/)
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. Ans: void m
Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.
Triangular Matrices Tiangular Matrices is of 2 types: a) Lower triangular b) Upper triangular
Tree is dynamic data structures. Trees can expand & contract as the program executes and are implemented via pointers. A tree deallocates memory whereas an element is deleted.
Explain what are circular queues? Write down routines required for inserting and deleting elements from a circular queue implemented using arrays. Circular queue:
Ask question #Minimum 1cepted#
N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)
algorithm for insertion in a queue using pointers
A Stack has an ordered list of elements & an array is also utilized to store ordered list of elements. Therefore, it would be very simple to manage a stack by using an array. Thoug
Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd