You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
What is ascending and descending order?
What is nsmutablearray?
What is inplace sorting?
What is the space complexity of selection sort?
Which interfaces are implemented by abstractqueue?
Which collection class is thread safe?
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 expression trees are gets represented in data structure?
What is the default value of Array?
In an AVL tree, at what condition the balancing is to be done?
How many null values are allowed in hashmap?
Are data structures important?