Data Structures Algorithms-II MCQs

Page No. 59

Which of the following is called the “ultimate planar convex hull algorithm”?


aChan’s algorithm

✖


bKirkpatrick-Seidel algorithm

✓


cGift wrapping algorithm

✖


dJarvis algorithm

✖



The running time of Chan’s algorithm is obtained from combining two algorithms.


aTrue

✓


bFalse

✖


ceither A. or B.

✖


d None of these

✖


View Answer True

Who formulated Chan’s algorithm?


aTimothy

✓


b Kirkpatrick

✖


cFrank Nielsen

✖


dSeidel

✖


View Answer Timothy

What is the running time of Chan’s algorithm?


aO(log n)

✖


bO(n log n)

✖


cO(n log h)

✓


dO(log h)

✖


View Answer O(n log h)

Chan’s algorithm is used for computing _________


aClosest distance between two points

✖


bConvex hull

✓


cArea of a polygon

✖


dShortest path between two points

✖


View Answer Convex hull

In Depth First Search, how many times a node is visited?


aOnce

✖


bTwice

✖


c Equivalent to number of indegree of the node

✓


dThrice

✖



Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)


a Can be anything

✓


b0

✖


cAt most 1

✖


dInsufficient Information

✖


View Answer Can be anything

When the Depth First Search of a graph is unique?


aWhen the graph is a Binary Tree

✖


bWhen the graph is a Linked List

✓


cWhen the graph is a n-ary Tree

✖


dWhen the graph is a ternary Tree

✖



Which of the following is not an application of Depth First Search?


aFor generating topological sort of a graph

✖


bFor generating Strongly Connected Components of a directed graph

✖


c Detecting cycles in the graph

✖


dPeer to Peer Networks

✓


View Answer Peer to Peer Networks

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?


a Depth First Search

✓


bBreadth First Search

✖


cTrim’s algorithm

✖


d Kruskal’s Algorithm

✖


View Answer Depth First Search

Goto Page No.

Page 59 of 149

Alphabetical MCQs Categories
—

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"
—

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan