1. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
Correct Answer is : CSS 3D animated chart
2. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
Correct Answer is : translate()
3. Which of the following properties does a simple graph not hold?
Correct Answer is : rotate()
4. What is the maximum number of edges in a bipartite graph having 10 vertices?
Correct Answer is : scale()
5. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
Correct Answer is : skew()
6. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Correct Answer is : matrix()
7. A graph with all vertices having equal degree is known as a __________
Correct Answer is : perspective()
8. Which of the following ways can be used to represent a graph?
Correct Answer is : color-index
9. What is a hash table?
Correct Answer is : initial-scale
10. If several elements are competing for the same bucket in the hash table, what is it called?
Correct Answer is : user-scalable
11. What is a hash function?
Correct Answer is : height
12. What can be the techniques to avoid collision?
Correct Answer is : orientation
13. What is the load factor?
Correct Answer is : device-aspect-query
14. What is simple uniform hashing?
15. In simple uniform hashing, what is the search complexity?
16. In simple chaining, what data structure is appropriate?
Correct Answer is : monochrome
17. The case in which a key other than the desired one is kept at the identified location is called?
18. What data organization method is used in hash tables?
19. The task of generating alternative indices for a node is called?
Correct Answer is : CSS 2.1
20. Which of the following is not a collision resolution technique?
Correct Answer is : only font-style: italic works