JOBSEEKERS
Login
Sign Up
Jobseeker
Employer
Staffing Firm
Direct Client
CSS interview questions part 31
CSS interview questions part 31
Back
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Hashing is the problem of finding an appropriate mapping of keys into addresses.
A. heading becomes green
B. heading becomes dark-green
C. error occors
D. nothings happen
Show Correct Answer
Correct Answer is :
nothings happen
2. In a hash table of size 10, where is element 7 placed?
A. Use an external style sheet, either by importing it or by linking to it
B. Directly embed a document-wide style in the head element of the document
C. Set an inline style rule using the style attribute directly on an element
D. All of the mentioned
Show Correct Answer
Correct Answer is :
All of the mentioned
3. What should be the load factor for separate chaining hashing?
A.
B.
C.
D.
Show Correct Answer
Correct Answer is :
4. Which of the following operations are done in a hash table?
A. For use with all devices
B. For use with handheld devices
C. For use with computer screens
D. For use with television-type devices
Show Correct Answer
Correct Answer is :
For use with computer screens
5. Which of the following is identical to that of a separate chaining hash node?
A. TRUE
B. FALSE
C.
D.
Show Correct Answer
Correct Answer is :
FALSE
6. Which of the following is the hashing function for separate chaining?
A. TRUE
B. FALSE
C.
D.
Show Correct Answer
Correct Answer is :
FALSE
7. What is the correct notation for a load factor?
A. TRUE
B. FALSE
C.
D.
Show Correct Answer
Correct Answer is :
TRUE
8. In hash tables, how many traversal of links does a successful search require?
A. transition
B. transition-duration
C. transform-duration
D. transition-property
Show Correct Answer
Correct Answer is :
transition-duration
9. Which of the following is a disadvantage of using separate chaining using linked lists?
A. transform-delay
B. transition-delay
C. transform-duration
D. none of the mentioned
Show Correct Answer
Correct Answer is :
transition-delay
10. What is the worst case search time of a hashing using separate chaining algorithm?
A. translate(x,y)
B. translate2d(x,y)
C. translate3d(x,y)
D. all of the mentioned
Show Correct Answer
Correct Answer is :
translate(x,y)
11. From the given table, find ‘?’. Given: hash(x)= x mod 10
A. translate(x)
B. translateZ(x)
C. translateY(x)
D. translateX(x)
Show Correct Answer
Correct Answer is :
translateX(x)
12. Which of the following problems occur due to linear probing?
A. circle(x,y,z)
B. scale3d(x,y,z)
C. rotate3d(x,y,z,angle)
D. rotate(angle)
Show Correct Answer
Correct Answer is :
scale3d(x,y,z)
13. How many probes are required on average for insertion and successful search?
A. perspective3d(n)
B. perspective(n,n,n)
C. perspective(n)
D. none of the mentioned
Show Correct Answer
Correct Answer is :
perspective(n,n,n)
14. What is the load factor for an open addressing technique?
A. skewX(angle)
B. skewY(angle)
C. skew(x-angle,y-angle)
D. none of the mentioned
Show Correct Answer
Correct Answer is :
skew(x-angle,y-angle)
15. Which of the following is not a collision resolution strategy for open addressing?
A. matrix3d(n,n,n,n,n,n,n,n,n,n,n,n,n,n,n,n)
B. matrix(n,n,n,n,n,n,n,n,n,n,n,n,n,n,n,n)
C. matrix2d(n,n,n,n,n,n,n,n,n,n,n,n,n,n,n,n)
D. all of the mentioned
Show Correct Answer
Correct Answer is :
matrix3d(n,n,n,n,n,n,n,n,n,n,n,n,n,n,n,n)
16. In linear probing, the cost of an unsuccessful search can be used to compute the average cost of a successful search.
A. rotate-Z(angle)
B. rotate-Z-axis(angle)
C. rotateZ(angle)
D. all of the mentioned
Show Correct Answer
Correct Answer is :
rotateZ(angle)
17. Which of the following is the correct function definition for linear probing?
A. rotate3d(x,y,z,angle)
B. rotated(x,y,z,angle)
C. rotate-all(x,y,z,angle)
D. rotate(x,y,z,angle)
Show Correct Answer
Correct Answer is :
rotate3d(x,y,z,angle)
18. ___________ is not a theoretical problem but actually occurs in real implementations of probing.
A. E[attr^=value]
B. E[attr$=value]
C. E[attr*=value]
D. none of the mentioned
Show Correct Answer
Correct Answer is :
E[attr$=value]
19. What is the hash function used in linear probing?
A. E[attr^=value]
B. E[attr$=value]
C. E[attr*=value]
D. none of the mentioned
Show Correct Answer
Correct Answer is :
E[attr$=value]
20. Hashing can be used in online spelling checkers.
A. E ~ F
B. ::after
C. :checked
D. none of the mentioned
Show Correct Answer
Correct Answer is :
:checked
Similar Interview Questions
Search for latest jobs
Find Jobs