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!
Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted
merge(struct node *p, struct node *q, struct **s)
{
struct node *z;
z = NULL;
if((x= =NULL) && (y = =NULL))
return;
while(x!=NULL && y!=NULL)
if(*s= =NULL)
*s=(struct link *)malloc(sizeof(struct node *z));
z=*s;
}
else
z-->link=(struct link *)malloc(sizeof(struct node *));
z=z-->link;
if(x-->data < y-->data)
z-->data=x-->data;
x=x-->link;
else if(x-->exp > y-->exp)
z-->data=y-->data;
y=y-->link;
else if(x-->data= =y-->data)
while(x!=NULL)
z link = struct link *malloc(sizeof(struct node *));
z=z link;
while(y!=NULL)
z-->link=NULL;
What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t
how to convert 12 hour format into 24 hour format using c program
Define the Internal Path Length The Internal Path Length I of an extended binary tree is explained as the sum of the lengths of the paths taken over all internal nodes- from th
A binary tree of depth "d" is an almost complete binary tree if A) Every leaf in the tree is either at level "d" or at level "d-1" B) For any node "n" in the tree with a
Q. Define a sparse matrix. Explain different types of sparse matrices? Show how a triangular array is stored in memory. Evaluate the method to calculate address of any element ajk
implement multiple stacks in an array and write different algorithms to perform operations on it
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 the given element of the listis as follows
sample infosys campusconnect questions
INSERT FUNCTION /*prototypes of insert & find functions */ list * insert_list(list *); list * find(list *, int); /*definition of anyinsert function */ list * inser
Run time complexity of an algorithm is depend on
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