Data Structures Algorithms-II MCQs

Page No. 146

As the number of frames available increases, the number of page faults decreases.


aTrue

✓


bFalse

✖


cA & B

✖


dNone of these

✖


View Answer True

__________ algorithm associates with each page the time when the page was brought into memory.


aOptimal page replacement

✖


bFIFO

✓


cLRU replacement algorithm

✖


dCounting based replacement

✖


View Answer FIFO

Which of the following is the simplest page replacement algorithm?


aFIFO

✓


bOptimal page replacement

✖


cLRU replacement

✖


dCounting based replacement

✖


View Answer FIFO

________ is a typical online problem from the competitive analysis to determine the optimal solution.


aPage replacement algorithm

✓


bSegmentation

✖


cPaging

✖


dSegmentation with paging

✖



When the topological sort of a graph is unique?


aWhen there exists a hamiltonian path in the graph

✓


bIn the presence of multiple nodes with indegree 0

✖


cIn the presence of single node with indegree 0

✖


dIn the presence of single node with outdegree 0

✖



A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?


aDepth First Search

✖


bBreadth First Search

✖


cTopological Sorting

✓


dDijkstra’s Shortest path algorithm

✖


View Answer Topological Sorting

Topological sort is equivalent to which of the traversals in trees?


aPre-order traversal

✓


bPost-order traversal

✖


cIn-order traversal

✖


dLevel-order traversal

✖


View Answer Pre-order traversal

Topological sort can be implemented by?


aUsing Depth First Search

✖


bUsing Breadth First Search

✖


cUsing Depth and Breadth First Search

✓


dUsing level ordered search

✖



Topological sort of a Directed Acyclic graph is?


aAlways unique

✖


bAlways Not unique

✖


cSometimes unique and sometimes not unique

✓


dAlways unique if graph has even number of vertices

✖



Which of the following is not an application of topological sorting?


aFinding prerequisite of a task

✖


bFinding Deadlock in an Operating System

✖


cFinding Cycle in a graph

✖


dOrdered Statistics

✓


View Answer Ordered Statistics

Goto Page No.

Page 146 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