Data Structures and Algorithms-I MCQs

Page No. 30

What is a time complexity for inserting an alphabet in the tree using hash maps?


aO (log n!)

✖


bO (n!)

✖


cO (n2)

✖


dO (1)

✓


View Answer O (1)

For what size of nodes, the worst case of usage of space in suffix tree seen?


an Nodes

✖


b2n Nodes

✖


c2n nodes

✓


dn! nodes

✖


View Answer 2n nodes

Can suffix tree be used in bioinformatics problems and solutions.


aTrue

✓


bFalse

✖


cNone of the given options

✖


deither true either false

✖


View Answer True

Can suffix tree be used in string problems occurring in a text editor.


aTrue

✓


bFalse

✖


cNone of the given options

✖


deither true either false

✖


View Answer True

What is a time complexity for finding the total length of all string on all edges of a tree?


aƟ (n)

✖


bƟ (n!)

✖


cƟ (1)

✖


dO (n2)

✓


View Answer O (n2)

Which of the following data clustering algorithm uses suffix tree in search engines?


aWeiner’s algorithm

✖


bFarach’s algorithm

✖


cLempel – Ziv – Welch’s algorithm

✖


dSuffix Tree Clustering

✓



Which of the following algorithm of data compression uses a suffix tree?


aWeiner’s algorithm

✖


bFarach’s algorithm

✖


cLempel – Ziv – Welch’s algorithm

✓


dAlexander Morse’s algorithm

✖



What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?


aLinear Time

✓


bExponential Time

✖


cLogarithmic Time

✖


dCubic Time

✖


View Answer Linear Time

What is a time complexity for finding all the tandem repeats?


aƟ (n)

✓


bƟ (n!)

✖


cƟ (1)

✖


dO (n log n + z)

✖


View Answer Ɵ (n)

What is a time complexity for finding all the maximal palindrome in a string?


aƟ (n)

✓


bƟ (n!)

✖


cƟ (1)

✖


dO (log n!)

✖


View Answer Ɵ (n)

Goto Page No.

Page 30 of 53

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