McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2026
→
Computer Science Engineering (CSE)
→
DataBase Management System (DBMS)
→
Breadth First Search is used in
Q.
Breadth First Search is used in
A.
binary trees
B.
stacks
C.
graphs
D.
all of the mentioned
Answer» C. graphs
2.5k
0
Do you find this helpful?
5
View all MCQs in
DataBase Management System (DBMS)
Discussion
No comments yet
Login to comment
Related MCQs
In a clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
An consists of a search-key value and pointers to one or more records with that value as their search-key value.
A search key containing more than one attribute is referred to as a search key.
An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.
A search key containing more than one attribute is referred to as a _________ search key.
The is essentially used to search for patterns in target string.
The is essentially used to search for patterns in target string.
The ..................... is essentially used to search for patterns in target string.
Indices whose search key specifies an order different from the sequential order of the file are called indices.