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!
A connected graph is a graph wherein path exists among every pair of vertices.
A strongly connected graph is a directed graph wherein every pair of distinct vertices is connected along with each other.
A weakly connected graph is a directed graph wherein underlying graph is connected, although not strongly connected.
A complete graph is a graph wherein there exists edge among every pair of vertices.
Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti
Which sorting algorithms does not have a worst case running time of O (n 2 ) ? Merge sort
Let us assume a file of 5 records that means n = 5 And k is a sorted array of keys of those 5 records. Let key = 55, low = 0, high = 4 Iteration 1: mid = (0+4)/2 = 2
The searching technique that takes O (1) time to find a data is Hashing is used to find a data
INSERT FUNCTION /*prototypes of insert & find functions */ list * insert_list(list *); list * find(list *, int); /*definition of anyinsert function */ list * inser
write an algorithm for stack using array performing the operations as insertion ,deletion , display,isempty,isfull.
A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"
Draw trace table and determine output from the following flowchart using following data: Number = 45, -2, 20.5
what is folding method?
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
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