Logo educatepk.com
MCQs & Books free for all subjects and educational help  
Subscribe email alerts:
MCQs Online
MCQs on Data structures and Algorithms
Books
MCQs on Data structures and Algorithms

Data structures and Algorithms MCQs and Quiz



Q No.1 of 10

Which of the following data structure is not linear data structure?


Option 1

Linked lists


Option 2

Arrays


Option 3

None of these


Option 4

Both of these


Q No.2 of 10

Finding the location of the element with a given value is:


Option 1

Sort


Option 2

Traversal


Option 3

Search


Option 4

None of above


Q No.3 of 10

To represent hierarchical relationship between elements, which data structure is suitable?


Option 1

Priority


Option 2

Deque


Option 3

Tree


Option 4

All of these


Q No.4 of 10

The in order traversal of tree will yield a sorted listing of elements of tree in


Option 1

Binary trees


Option 2

Heaps


Option 3

Binary search trees


Option 4

None of these


Q No.5 of 10

If every node u in G is adjacent to every other node v in G, A graph is said to be


Option 1

finite


Option 2

isolated


Option 3

complete


Option 4

strongly connected


Q No.6 of 10

Which of the following data structure is non-linear type?


Option 1

Strings


Option 2

Lists


Option 3

Stacks


Option 4

None of these


Q No.7 of 10

Which data structure allows deleting data elements from front and inserting at rear?


Option 1

Queues


Option 2

Stacks


Option 3

Deques


Option 4

Binary search tree


Q No.8 of 10

In a graph if e=(u, v) means


Option 1

e begins at u and ends at v


Option 2

u is processor and v is successor


Option 3

All of these


Option 4

None of these


Q No.9 of 10

If every node u in G is adjacent to every other node v in G, A graph is said to be


Option 1

finite


Option 2

isolated


Option 3

complete


Option 4

strongly connected


Q No.10 of 10

The complexity of Binary search algorithm is 


Option 1

O(n)


Option 2

O(log n)


Option 3

O(n2)


Option 4

O(n log n)



Correct Answers