Online Certification Guide » 100% Correct MCQ Answers

The Link Building tool helps users enrich their sites’ backlink profiles. The tool can be integrated with Google Search Console. What will this integration do?

Prioritize your prospects by analyzing the popularity of the keywords your site is ranking for Specify a list of prospects by excluding sources from which you’ve already acquired backlinks Make your assessment of backlink prospects’ ratings more precise Provide users …
Read more →

Which tool can help you find a way to rank higher for target keywords?

On Page SEO Checker My Reports Traffic Analytics Brand Monitoring Position Tracking

Position Tracking allows users to track a website’s search visibility across multiple devices (desktop, phone and tablet) and locations (down to the ZIP Code level) in one project.

True False

Which of the following is an external sorting?

a) Insertion sort b) Merge sort c) Bubble sort d) Tree sort

Kruskal’s algorithm also finds the minimum cost spanning tree of a _____ by adding edges.

a) Weighted graph b) Graph c) Unweighted graph d) Label D will appear here

What algorithmic technique does the kruskal algorithm follows?

a) Divide and conquer technique b) Dynamic programming c) Both a and b d) Greedy technique

Is kruskal algorithm is whether than prim’s algorithm?

a) yes b) no c) both are equal d) cannot determined

We need a data structure that maintains a _______.

a) Spanning tree b) Partition c) Flag d) Label D will appear here

A “safe edge” is an edge of ____ which does not create a cycle.

a) Maximum weight b) No weight c) Constant weight d) Label D will appear here

From the following choose the one which belongs to the algorithm paradigm other than to which others from the following belongs to.

a) Minimum & maximum problem b) Knapsack problem c) Selection problem d) Quick sort

In _______ operations method incident edges is called once for each vertex.

a) Tree b) Stack c) Graph d) Hash

In prims algorithm process is repeated until a ____ is formed.

a) Spanning tree b) Vertex c) Flag d) High

_______ finds a minimum cost spanning tree by selecting edges from the graph.

a) Prim’s algorithm b) Kruskal algorithm c) Jarnik algorithm d) Analysis and algorithm

Prims algorithm start at a source vertex and grow a ______.

a) Two trees b) Single tree c) Multiple tree d) Tree set

Partition splits array in two sub-arrays of size ______.

a) n+3 b) n/3 c) n/2 d) n

Partitioning loops through, _______ elements below/above pivot.

a) Sorting b) Traversing c) Swapping d) Grouping