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. Write an algorithm INSERT which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place in the list.
Ans:
/* structure containing the data part and link part */
struct node
{
int data ;
struct node *link ;
} ;
/* Following the inserts node to an ascending order linked list
*/
void INSERT ( struct node **q, int num )
struct node *r, *temp = *q ;
r = malloc ( sizeof ( struct node ) ) ;
r -> data = num ;
/* if list is empty or if new node is to be inserted before the first node */
if ( *q == NULL || ( *q ) -> data > num )
*q = r ;
( *q ) -> link = temp ;
}
else
/* traverse the entire linked list to search or found the position to insert the
new node */
while ( temp != NULL )
if ( temp -> data <= num && ( temp -> link -> data > num ||
temp -> link == NULL ))
r -> link = temp -> link ;
temp -> link = r ;
return ;
temp = temp -> link ; /* go to the next node */ }
How do you find the complexity of an algorithm? Complexity of an algorithm is the measure of analysis of algorithm. Analyzing an algorithm means predicting the resources that
If a node in a BST has two children, then its inorder predecessor has No right child
Conversion of Forest into Tree A binary tree may be used to show an entire forest, since the next pointer in the root of a tree can be used to point to the next tree of the for
representation of linear array
Q. Explain the term hashing? Explain any five well known hash functions. Ans: Hashing method provides us the direct access of record from the f
what is tree
A spanning tree of any graph is only a subgraph that keeps all the vertices and is a tree (having no cycle). A graph might have many spanning trees. Figure: A Graph
#questWrite an algorithm for multiplication of two sparse matrices using Linked Lists.ion..
Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr
ST AC K is explained as follows : A stack is one of the most usually used data structure. A stack is also called a Last-In-First-Out (LIFO) system, is a linear list in
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