What is meant by strongly connected in a graph?
No Answer is Posted For this Question
Be the First to Post Answer
What is sorting an array?
How many types of searching are there in data structure?
1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15
How can avl tree be useful in all the operations as compared to binary search tree?
What do you mean by priority queue?
Is list same as array?
Explain singly linked list in short.
What do you mean by garbage collection?
What do you mean by balance factor of a node in avl tree?
What is bubble sort algorithm?
What is worst case complexity algorithm?
What are control structures?