CSS interview questions part 25
CSS interview questions part 25
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. What is the total time spent for N-1 merges in a dynamic equivalence problem?
Correct Answer is : specificity = 0,0,0,0
2. What is the condition for an equivalence relation if two cities are related within a country?
Correct Answer is : specificity = 0,0,0,1
3. What is a dequeue?
Correct Answer is : specificity = 0,0,0,2
4. Select the function which performs insertion at the front end of the dequeue?
Correct Answer is : specificity = 0,0,0,2
5. What is the functionality of the following piece of code? public void function(Object item) { Node temp=new Node(item,trail); if(isEmpty()) { head.setNext(temp); temp.setNext(trail); } else { Node cur=head.getNext(); while(cur.getNext()!=trail) { cur=cur.getNext(); } cur.setNext(temp); } size++; }
Correct Answer is : specificity = 0,0,0,3
6. What are the applications of dequeue?
Correct Answer is : specificity = 0,0,1,3
7. Which of the following can be used to delete an element from the front end of the queue?
Correct Answer is : specificity = 0,0,1,3
8. Which of the following can be used to delete an element from the rear end of the queue?
Correct Answer is : specificity = 0,0,2,1
9. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
Correct Answer is : specificity = 0,1,0,0
10. After performing these set of operations, what does the final list look contain? InsertFront(10); InsertFront(20); InsertRear(30); DeleteFront(); InsertRear(40); InsertRear(10); DeleteRear(); InsertRear(15); display();
Correct Answer is : specificity = 1,0,0,0
11. Double hashing is one of the best methods available for open addressing.
Correct Answer is : numeric
12. What is the hash function used in Double Hashing?
Correct Answer is : outside
13. On what value does the probe sequence depend on?
Correct Answer is :
14. The value of h2(k) can be composite relatively to the hash table size m.
Correct Answer is : normal flow
15. What are the values of h1(k) and h2(k) in the hash function?
Correct Answer is : floating elements
16. What is the running time of double hashing?
Correct Answer is : center
17. Which technique has the greatest number of probe sequences?
Correct Answer is : border
18. At what position the number 72 gets inserted in the following table? Index Key 0 22 1 34 2 3 4 5 56 6 7 18 8 41 9 10
Correct Answer is : fixed
19. Where does the number 14 get inserted in the following table? Index Key 0 1 79 2 3 4 69 5 98 6 7 72 8 9 10 11 50 12 a) 2 b) 9 c) 4 d) 8
Correct Answer is : scroll
20. What is the value of m’ if the value of m is 19?
Correct Answer is : screen
