Recent Questions

Filter:AllOpenResolvedClosedUnanswered
How many bits are needed to specify the single permutation by min-wise independent family?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
36 views1 answers0 votes
Is MinHash used as a tool for association rule learning.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
26 views1 answers0 votes
Did Google conduct a large evaluation for comparing the performance by two technique MinHash and SimHash.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
32 views1 answers0 votes
What is direct addressing?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
25 views1 answers0 votes
When is it appropriate to use direct addressing?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
27 views1 answers0 votes
What is the search complexity in direct addressing?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
24 views1 answers0 votes
What is the time complexity to insert an element into the direct address table?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
28 views1 answers0 votes
What is the advantage of using a dynamic set in direct addressing?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
25 views1 answers0 votes
What is the time complexity to delete an element from the direct address table?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
25 views1 answers0 votes
How is a bit vector better compared to a normal array for implementing the hash table?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
25 views1 answers0 votes
Which of the following statements for a simple graph is correct?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
28 views1 answers0 votes
In the given graph identify the cut vertices.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
25 views1 answers0 votes
For the given graph(G), which of the following statements is true?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
22 views1 answers0 votes
What is the number of edges present in a complete graph having n vertices?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
19 views1 answers0 votes
The given Graph is regular.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
17 views1 answers0 votes
In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
18 views1 answers0 votes
A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
18 views1 answers0 votes
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
19 views1 answers0 votes
Which of the following properties does a simple graph not hold?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
23 views1 answers0 votes
What is the maximum number of edges in a bipartite graph having 10 vertices?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
18 views1 answers0 votes
Which of the following is true?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
20 views1 answers0 votes
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?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
20 views1 answers0 votes
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
20 views1 answers0 votes
A graph with all vertices having equal degree is known as a __________
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
23 views1 answers0 votes
Which of the following ways can be used to represent a graph?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
20 views1 answers0 votes
The number of elements in the adjacency matrix of a graph having 7 vertices is __________
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
23 views1 answers0 votes
What would be the number of zeros in the adjacency matrix of the given graph?
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
21 views1 answers0 votes
Adjacency matrix of all graphs are symmetric.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
19 views1 answers0 votes
The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
18 views1 answers0 votes
For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.
AnsweredEditor">411b59d4f1b350c058deef204347460a?s=48&r=gEditor asked 3 weeks ago • 
19 views1 answers0 votes
123…761