Data Structure and Algorithms MCQs of 2024 Batch

BCA Third Semester Data Structure and Algorithms MCQs of 2024 Batch

Multiple Choice Questions

i. Which data structure used to implement recursion?

b) Stack

Uni Bytes

ii. What will be the number of edges for a binary tree with n-nodes?

b) n-1 edges

Uni Bytes

iii. Which one of the following is the sequence used by inorder traversal?

b) Left subtree, Root, Right subtree

Uni Bytes

iv. Which one of the following is pointed by the last node of a circular linked list?

a) First node

Uni Bytes

v. In which of the following case, does indirect recursion occur?

c) Two or more functions call each other

Uni Bytes

vi. Which one of the following is unstable sort?

d) Quick sort

Uni Bytes

vii. In which of the following case, the adjacency matrix representation is suitable?

b) Dense graph

Uni Bytes

viii. Which of the following searching algorithm has the time complexity O(logn)?

b) Binary search

Uni Bytes

ix. Which of the following uses Divide and conquer strategy?

a) Merge sort

Uni Bytes

x. What is the meaning of collision in Hashing?

b) Same index

Don’t use our content without permission. 📸⚠️

Thank you for sharing you everyone! If you’d like to share your notes, lab reports, solution, assignments, projects, or any other academic materials, feel free to contact us through social media (Uni Bytes), email us at unibytesofficials@gmail.com.

We regularly provide updates on BCA news, results, exam routines, and other important information. Stay connected with Uni Bytes for all your academic needs

Don’t Forget to Follow Uni Bytes